Problem:


Score: 100 points

Problem Statement

The weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...

Given is a string S representing the weather in the town today. Predict the weather tomorrow.

Constraints

S is Sunny, Cloudy, or Rainy.

Input

Input is given from Standard Input in the following format:

S

Output

Print a string representing the expected weather tomorrow, in the same format in which input is given.

Sample Input 1

Sunny

Sample Output 1

Cloudy

In Takahashi's town, a sunny day is followed by a cloudy day.

Sample Input 2

Rainy

Sample Output 2

Sunny



Sample input:
Sunny


Sample output:
Cloudy

Submission status: Accepted

Solution code:
s = input()


weather = {"Sunny":"Cloudy", "Cloudy":"Rainy", "Rainy":"Sunny"}
print(weather[s])

Submission status: Accepted

Solution code:
s=str(input())
if s=="Sunny":
  print("Cloudy")
elif s=="Cloudy":
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
a = input()
if a == 'Sunny':
    print('Cloudy')
elif a == 'Cloudy':
    print('Rainy')
elif a == 'Rainy':
    print('Sunny')
else:
    a

Submission status: Accepted

Solution code:
S = input()
ls = ["Sunny", "Cloudy", "Rainy"]
i = (ls.index(S))
print(ls[(i+1)%3])

Submission status: Accepted

Solution code:
a = ["Rainy","Cloudy","Sunny"]
b = input()
print(a[a.index(b)-1])

Submission status: Accepted

Solution code:
s=input()
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
s = input()
if "Sunny" == s:
    print("Cloudy")
elif "Cloudy" == s:
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
n=str(input())
if n=="Sunny":
    print("Cloudy")
elif n=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
s = input()

if s =="Sunny":
  print("Cloudy")
elif s =="Cloudy":
    print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
s = input()

if s[0] == 'S':
    print('Cloudy')
elif s[0] == 'C':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
s = input()
if s == 'Sunny':
    print('Cloudy')
elif  s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
S=input()
L=["Sunny","Cloudy","Rainy"]
if L.index(S)+1 == 3:
  print("Sunny")
else:
  print(L[L.index(S)+1])

Submission status: Accepted

Solution code:
n = input().rstrip()
if n=="Sunny": 
  print("Cloudy")
elif n=="Cloudy":
  print("Rainy")
elif n=="Rainy":
  print("Sunny")

Submission status: Accepted

Solution code:
weather = ['Sunny', 'Cloudy', 'Rainy']
print(weather[(weather.index(input())+1)%3])

Submission status: Accepted

Solution code:
# ABC141A

s = input()
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
next_w = {
    'Sunny': 'Cloudy',
    'Cloudy': 'Rainy',
    'Rainy': 'Sunny',
}

print(next_w[input()])

Submission status: Accepted

Solution code:
x = input()
A = ["Sunny","Cloudy","Rainy"]
N = (A.index(x) + 1) % 3
print(A[N])

Submission status: Accepted

Solution code:
s = input()
lis = ['Sunny', 'Cloudy', 'Rainy']
if s == lis[0]:
    print(lis[1])
if s == lis[1]:
    print(lis[2])
if s == lis[2]:
    print(lis[0])

Submission status: Accepted

Solution code:
s = input()
a = (['Sunny','Cloudy','Rainy']*2)
ans = a[a.index(s) +1]
print(ans)

Submission status: Accepted

Solution code:
import sys

n = []
n.append('Sunny')
n.append('Cloudy')
n.append('Rainy')

s = input()

for i, num in enumerate(n):
  if(num == s):
    print(n[(i + 1) % 3])
    sys.exit()

Submission status: Accepted

Solution code:
def ABC_141_A():
    S = input()
    if S == 'Sunny':
        print('Cloudy')
    elif S == 'Cloudy':
        print('Rainy')
    else:
        print('Sunny')


if __name__ == '__main__':

    ABC_141_A()

Submission status: Accepted

Solution code:
S=input()
l=['Sunny','Cloudy','Rainy']
print(l[l.index(S)+1] if S!= 'Rainy' else 'Sunny')

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit

# getarr = lambda _f: list(map(_f, input().split()))

s = input()
a = ['Sunny', 'Cloudy', 'Rainy']

for i in range(3):
    if s == a[i]:
        print(a[(i + 1) % 3])

Submission status: Accepted

Solution code:
weathers = ['Sunny', 'Cloudy', 'Rainy']

S = input()

index = (weathers.index(S) + 1) % 3

print(weathers[index])

Submission status: Accepted

Solution code:
t = ["Sunny", "Cloudy", "Rainy"]
print(t[(1+t.index(input()))%3])

Submission status: Accepted

Solution code:
s = input()
if s[0]=="S": print("Cloudy")
elif s[0]=="C": print("Rainy")
else: print("Sunny")

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


s = S()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
def main():
    s = input()
    ans = solve(s)
    print(ans)


def solve(s):
    if s == 'Sunny':
        return 'Cloudy'
    elif s == 'Cloudy':
        return 'Rainy'
    elif s == 'Rainy':
        return 'Sunny'
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = ['Sunny','Cloudy','Rainy','Sunny']
print(s[s.index(input())+1])

Submission status: Accepted

Solution code:
s = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(s.get(input()))

Submission status: Accepted

Solution code:
S = input()
wether = "Sunny,Cloudy,Rainy".split(",")
print(wether[(wether.index(S)+1)%3])

Submission status: Accepted

Solution code:
s="Rainy CloudySunny ";print(s[s.find(input())-6:][:6])

Submission status: Accepted

Solution code:
# A - Weather Prediction

S = str(input())
print('Cloudy' if S == 'Sunny' else 'Rainy' if S == 'Cloudy' else 'Sunny')

Submission status: Accepted

Solution code:
a=input()
w=["Sunny","Cloudy","Rainy","Sunny"]
print(w[int(w.index(a))+1])

Submission status: Accepted

Solution code:
ALL = ['Sunny','Cloudy','Rainy']
S = input()
print(ALL[(ALL.index(S)+1)%3])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code

def resolve():
    S=input()
    W=["Sunny","Cloudy","Rainy"]
    if S==W[0]:print(W[1])
    elif S==W[1]:print(W[2])
    else: print(W[0])
    #%%submit!
resolve()

Submission status: Accepted

Solution code:
t =  ["Sunny", "Cloudy", "Rainy"]
print(t[(1+t.index(input()))%3])

Submission status: Accepted

Solution code:
t = ["Sunny", "Cloudy", "Rainy"]
print(t[(t.index(input())+1)%3])

Submission status: Accepted

Solution code:
def main():
    s = input()
    d = {"Sunny": "Cloudy", "Cloudy": "Rainy", "Rainy": "Sunny"}
    print(d[s])


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
T = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(T[input()])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
def LILI(n): return [LI() for _ in range(n)]
INF = 10 ** 18
MOD = 10 ** 9 + 7

def main(): 
    text = (['Sunny', 'Cloudy'], ['Cloudy', 'Rainy'],['Rainy','Sunny'])
    s = SI()
    for i in text:
        if s == i[0]:
            print(i[1])

main()

Submission status: Accepted

Solution code:

S = input()

weather = ["Sunny", "Cloudy", "Rainy"]
print(weather[(weather.index(S)+1)%3])

Submission status: Accepted

Solution code:
S = input()

weather = ['Sunny' , 'Cloudy' , 'Rainy']

print(weather[(weather.index(S)+1) %3])

Submission status: Accepted

Solution code:
x = input()
list = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']
 
for i in range(len(list) - 1):
    theday = list[i]
    if x == theday:
        answer = list[i + 1]
print(answer)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# N = int(input())
S = input()
# A, B = map(int, input().split())
# A = list(map(int, input().split()))

tenki = ["Sunny", "Cloudy", "Rainy", "Sunny"]
print(tenki[tenki.index(S) + 1])

Submission status: Accepted

Solution code:
S = input()
cyc = ['Sunny', 'Cloudy', 'Rainy']
print(cyc[(cyc.index(S) + 1) % 3])

Submission status: Accepted

Solution code:
s = input()
print('Sunny' if s == 'Rainy' else 'Cloudy' if s == 'Sunny' else 'Rainy')

Submission status: Accepted

Solution code:
N = ['Sunny', 'Cloudy', 'Rainy']
print(N[(N.index(input())+1)%3])

Submission status: Accepted

Solution code:
S = input()

l = ['Sunny', 'Cloudy', 'Rainy']

index = l.index(S)

print(l[(index + 1) % 3])

Submission status: Accepted

Solution code:
s = str(input())

if s=='Sunny':
    print('Cloudy')
elif s=='Cloudy':
    print('Rainy')
elif s=='Rainy':
    print('Sunny')

Submission status: Accepted

Solution code:
s=input()
week=["Sunny","Cloudy","Rainy","Sunny",""]
for i in range(0,5):
    if week[i] == s:
        print(week[i+1])

Submission status: Accepted

Solution code:
s = str(input())
if s == 'Sunny':
  print('Cloudy')
if s == 'Cloudy':
  print('Rainy')
if s == 'Rainy':
  print('Sunny')

Submission status: Accepted

Solution code:
S=input()
if S=="Sunny":
    print("Cloudy")
elif S=="Cloudy":
    print("Rainy")
elif S=="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:

s=input()
if s=="Sunny":
    print("Cloudy")
if s=="Cloudy":
    print("Rainy")
if s=="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
s = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(s[input()])

Submission status: Accepted

Solution code:
S = input()
L = ["Sunny", "Cloudy", "Rainy", "Sunny"]

for i in range(3):
  if S == L[i]:
    print(L[i+1])

Submission status: Accepted

Solution code:
S = input()
if S[0] == 'S':
    print('Cloudy')
if S[0] == 'C':
    print('Rainy')
if S[0] == 'R':
    print('Sunny')

Submission status: Accepted

Solution code:
S = input()
if S == "Sunny":
	print("Cloudy")
elif S == "Cloudy":
	print("Rainy")
else:
	print("Sunny")

Submission status: Accepted

Solution code:
s=input()
if s=="Sunny":
    print("Cloudy")
elif s=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
s = input()
w = ['Sunny', 'Cloudy', 'Rainy']

i = w.index(s)
if i < 2:
    print(w[i+1])
else:
    print(w[0])

Submission status: Accepted

Solution code:
s = input()
arr = ['Sunny', 'Cloudy', 'Rainy']

for i in range(len(arr)):
    if(s == arr[i] and i != 2):
        print(arr[i+1])
    elif(s == arr[i] and i == 2):
        print(arr[0])

Submission status: Accepted

Solution code:
S = input()
W = ["Sunny", "Cloudy", "Rainy"]
for i in range(3):
  if S == "Rainy" :
    print("Sunny")
    quit()
  if W[i] == S:
    print(W[i+1])

Submission status: Accepted

Solution code:
s = input()
if s == 'Sunny':
    print('Cloudy')
elif s ==  'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
s=input()
l=['Sunny','Cloudy','Rainy']
ans=['Cloudy','Rainy','Sunny']
a=l.index(s)
print(ans[a])

Submission status: Accepted

Solution code:
w=["Sunny","Cloudy","Rainy"]
print(w[(w.index(input())+1)%3])

Submission status: Accepted

Solution code:
w=["Sunny","Cloudy","Rainy"]
n=input()

print(w[(w.index(n)+1)%3])

Submission status: Accepted

Solution code:
s = input()
if(s == 'Sunny'):
  print('Cloudy')
elif(s == 'Cloudy'):
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
lista=["Sunny","Cloudy","Rainy"]
print(lista[(lista.index(input())+1)%3])

Submission status: Accepted

Solution code:
l=['Sunny','Cloudy','Rainy']
print(l[(l.index(input())+1)%3])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    S = input()
    L = ['Sunny', 'Cloudy', 'Rainy']
    if S == 'Rainy':
        print('Sunny')
    else:
        print(L[L.index(S) + 1])

main()

Submission status: Accepted

Solution code:

s=input()
if s=="Sunny":
    print("Cloudy")
elif s=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
today = input()

if   today == "Sunny" :print("Cloudy")
elif today == "Cloudy":print("Rainy")
else                  :print("Sunny")

Submission status: Accepted

Solution code:
weather = ['Sunny','Cloudy','Rainy']
s = input()
Index = weather.index(s)
print(weather[Index+1] if Index <=1 else 'Sunny')

Submission status: Accepted

Solution code:
a = input()
if a =="Sunny":
    print("Cloudy")
elif a =="Cloudy":
    print("Rainy")
elif a =="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
s=input()
w=["Sunny","Cloudy","Rainy","Sunny"]
print(w[w.index(s)+1])

Submission status: Accepted

Solution code:
s = input()
l = ('Sunny','Cloudy','Rainy')
print(l[0] if s == l[2] else l[1] if s == l[0] else l[2])

Submission status: Accepted

Solution code:
w=str(input())
print("Sunny" if w=="Rainy" else "Cloudy" if w=="Sunny" else "Rainy")

Submission status: Accepted

Solution code:
S = input()
if S == "Sunny":
  print('Cloudy')
elif S == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
s = input()
dict = {'Sunny': 'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(dict[s])

Submission status: Accepted

Solution code:
import math
S=input()
if(S=="Sunny") :
    print("Cloudy")
if(S=="Cloudy"):
    print("Rainy")
if(S=="Rainy"):
    print("Sunny")

Submission status: Accepted

Solution code:
s=input()
if s=="Sunny":
    print("Cloudy")
elif s=="Cloudy":
    print("Rainy")
elif s==("Rainy"):
    print("Sunny")

Submission status: Accepted

Solution code:
S = input()

if S == "Sunny":
  print("Cloudy")
if S == "Cloudy":
  print("Rainy")
if S == "Rainy":
  print("Sunny")

Submission status: Accepted

Solution code:
s = input()

if s == 'Sunny':
	print('Cloudy')
elif s == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Submission status: Accepted

Solution code:
def main():
    s = input()
    d = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
    
    print(d.get(s))

main()

Submission status: Accepted

Solution code:
s=input()
if s=="Sunny":
  print("Cloudy")
if s=="Cloudy":
  print("Rainy")
if s=="Rainy":
  print("Sunny")

Submission status: Accepted

Solution code:
s = input()
print('Sunny' if s == 'Rainy' else 'Cloudy' if s == 'Sunny' else 'Rainy')

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
t = ['Sunny', 'Cloudy', 'Rainy' ,'Sunny']
s = input()
for i in range(len(t)):
    if s == t[i]:
        print(t[i+1])
        sys.exit()

Submission status: Accepted

Solution code:
S=str(input())

if S=="Sunny":
    print("Cloudy")
if S=="Cloudy":
    print("Rainy")
if S=="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
s=input()
 
list=["Sunny","Cloudy","Rainy"]
print(list[(list.index(s)+1)%3])

Submission status: Accepted

Solution code:
S=input()
W=['Sunny','Cloudy','Rainy']
print(W[W.index(S)+1] if W.index(S)!=2 else 'Sunny')

Submission status: Accepted

Solution code:
now=input()
if now=='Sunny': print('Cloudy')
elif now=='Cloudy': print('Rainy')
else: print('Sunny')

Submission status: Accepted

Solution code:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
elif s == "Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
def main():
    S = input()
    if S == "Sunny":
        print("Cloudy")
    elif S == "Cloudy":
        print("Rainy")
    elif S == "Rainy":
        print("Sunny")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
a = sys.stdin.readline().rstrip()
if a == 'Sunny':
  print('Cloudy')
elif a == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
S = input().strip('\n')
d = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(d[S])

Submission status: Accepted

Solution code:
S=input()
if S=='Sunny':
  print('Cloudy')
elif S=='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
s = input()

weather = {'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}

print(weather[s])

Submission status: Accepted

Solution code:
#copy

l = ["Sunny", "Cloudy", "Rainy", "Sunny"]
s = input()
print(l[l.index(s) + 1])

Submission status: Accepted

Solution code:
W=['Sunny','Cloudy','Rainy']
S=input()
for i in range(3):
    if S==W[i]:
        print(W[(i+1)%3])
    else:
        None

Submission status: Accepted

Solution code:
s=input()
if s=='Sunny':
  print('Cloudy')
elif s=='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
s = list(input())
if s[0] == 'S':
    print('Cloudy')
if s[0] == 'C':
    print('Rainy')
if s[0] == 'R':
    print('Sunny')

Submission status: Accepted

Solution code:
s = input()

weather = {'Sunny':0, 'Cloudy':1, 'Rainy':2}
anser = ['Cloudy', 'Rainy', 'Sunny']

print(anser[weather[s]])

Submission status: Accepted

Solution code:

A = ["Sunny", "Cloudy", "Rainy"]

s = input()

print(A[(A.index(s) + 1) % len(A)])

Submission status: Accepted

Solution code:
S = str(input())

if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

Solution code:
S = input()
list = ["Sunny", "Cloudy", "Rainy"]*2
print(list[list.index(S)+1])

Submission status: Accepted

Solution code:
S = input()
a = 'Sunny'
b = 'Cloudy'
c = 'Rainy'

if S == a:
    print(b)
elif S == b:
    print(c)
else:
    print(a)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    di = {"Sunny": "Cloudy",
        "Cloudy": "Rainy",
        "Rainy": "Sunny"}
    print(di[input()])

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S=input()
if S=="Sunny":
    print("Cloudy")
if S=="Cloudy":
    print("Rainy")
if S=="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Rainy":
    print("Sunny")
else:
    print("Rainy")

Submission status: Accepted

Solution code:
S = input()
List = ["Sunny", "Cloudy", "Rainy"]
if List.index(S) == 2:
  print(List[0])
else:
  T = List.index(S)+1
  print(List[T])

Submission status: Accepted

Solution code:
di = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
x = input()
print(di[x])

Submission status: Accepted

Solution code:
def resolve():
    s=input()
    if s=='Sunny':
        print('Cloudy')
    elif s=='Cloudy':
        print('Rainy')
    else:
        print('Sunny')
resolve()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    s = input().rstrip()
    if s=='Sunny':
        print('Cloudy')
    if s=='Cloudy':
        print('Rainy')
    if s=='Rainy':
        print('Sunny')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
w = ['Sunny', 'Cloudy', 'Rainy']

if s == w[0]:
    print(w[1])
elif s == w[1]:
    print(w[2])
else:
    print(w[0])

Submission status: Accepted

Solution code:
tw = {
    "Sunny": "Cloudy",
    "Cloudy": "Rainy",
    "Rainy": "Sunny",
}
s = input()
print(tw[s])

Submission status: Accepted

Solution code:
s = input()
if s == "Sunny":
    print("Cloudy")

elif s == "Cloudy":
    print("Rainy")

else:
    print("Sunny")

Submission status: Accepted

Solution code:
S = input()
w = ["Sunny", "Cloudy", "Rainy", "Sunny"]
for i in range(3):
  if S == w[i]:
    print(w[i+1])

Submission status: Accepted

Solution code:
S = input()

W = ["Sunny", "Cloudy", "Rainy", "Sunny"]

for i in range(3):
  if S == W[i]:
    print(W[i + 1])

Submission status: Accepted

Solution code:
import os

def main():
	s = input()
	if s == "Sunny":
		print("Cloudy")
	elif s == "Cloudy":
		print("Rainy")
	else:
		print("Sunny")

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


def solve(S: str):
    if S=='Sunny':
        print('Cloudy')
    elif S=='Cloudy':
        print('Rainy')
    else:
        print('Sunny')
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l=["Sunny", "Cloudy", "Rainy"]
s=input()
if s==l[0]:
    print(l[1])
elif s==l[1]:
    print(l[2])
elif s==l[2]:
    print(l[0])

Submission status: Accepted

Solution code:
s = input()
tenki = ['Sunny', 'Cloudy', 'Rainy']
if s == tenki[0]:
    print(tenki[1])
elif s == tenki[1]:
    print(tenki[2])
elif s == tenki[2]:
    print(tenki[0])

Submission status: Accepted

Solution code:
# 初期入力
S = input()
su ="Sunny"
cl ="Cloudy"
ra ="Rainy"
#
if S ==su:
    print(cl)
elif S == cl:
    print(ra)
elif S == ra:
    print(su)

Submission status: Accepted

Solution code:
nw = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(nw[input()])

Submission status: Accepted

Solution code:
s=input()
l=["Sunny","Cloudy","Rainy"]

print(l[(l.index(s)+1)%3])

Submission status: Accepted

Solution code:
t = ["Sunny", "Cloudy", "Rainy"]
s = input()
if s==t[0]:
    print(t[1])
if s==t[1]:
    print(t[2])
if s==t[2]:
    print(t[0])

Submission status: Accepted

Solution code:
weather = ["Sunny", "Cloudy", "Rainy"]
s = input()
num = weather.index(s)

if num == 2:
    print(weather[0])
else:
    print(weather[num+1])

Submission status: Accepted

Solution code:
import itertools
##print(ord("A"))
#n = int(input())
#n,k = map(int,input().split())
#h = list(map(int,input().split()))	
s = input()
weat = ["Sunny", "Cloudy", "Rainy","Sunny"]
for i in range(3):
    if s == weat[i]:
        break

print(weat[i+1])

Submission status: Accepted

Solution code:
S=input()
if S=="Sunny":
  print("Cloudy")
elif S=="Cloudy":
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
#--Weather Prediction
weather = ["Sunny", "Cloudy", "Rainy", "Sunny"]

S = input()
match = int(weather.index(S))

print(weather[match+1])

Submission status: Accepted

Solution code:
a = str(input())

if a == 'Sunny':
    print("Cloudy")
elif a == 'Cloudy':
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
a = str(input())

if a == "Sunny":
    print("Cloudy")
elif a == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
a = input()

if a == "Sunny":
    print("Cloudy")
elif a == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
s=str(input())

if s[0]=="S":
  print("Cloudy")
elif s[0]=="C":
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
s = str(input())

w = ['Sunny','Cloudy','Rainy']

print(w[( w.index(s)+1) %3] )

Submission status: Accepted

Solution code:
S = input()
if S == 'Sunny':
  print('Cloudy')
elif S == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Accepted

Solution code:
x=input()
listp={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}
print(listp[x])

Submission status: Accepted

Solution code:
s= input()
list = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']

for i in range(3):
	if s==list[i]:
		print(list[i+1])
		break

Submission status: Accepted

Solution code:
s=input()

if s=="Sunny":
  print("Cloudy")
if s=="Cloudy":
  print("Rainy")
if s=="Rainy":
  print("Sunny")

Submission status: Accepted

Solution code:
S = input()
print('Cloudy' if S == 'Sunny' else 'Rainy' if S == 'Cloudy' else 'Sunny')

Submission status: Accepted

Solution code:
a = input()
l = ["Sunny", "Cloudy", "Rainy"]
for i in range(3):
    if a == l[i]:
        print(l[(i+1)%3])

Submission status: Accepted

Solution code:
s = input()
List = ["Sunny","Cloudy","Rainy"]
#print(List[0])
print(List[(List.index(s)+1) % 3])

Submission status: Accepted

Solution code:
S = input()
whether = ['Sunny', 'Cloudy', 'Rainy']
i = whether.index(S)
if i == 2:
    print(whether[0])
else:
    print(whether[i+1])

Submission status: Accepted

Solution code:
def main():
    s = input()
    l = ["Sunny", "Cloudy", "Rainy"]
    idx = l.index(s)
    if idx == 2:
        print("Sunny")
        exit(0)
    print(l[idx+1])

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
Weather=["Sunny", "Cloudy", "Rainy"]
Today=input()
for i in range(3):
  if Today== Weather[i]:
     if i==0 or i==1:
       print(Weather[i+1])
     else:
       print(Weather[0])

Submission status: Accepted

Solution code:
Weather=["Sunny", "Cloudy", "Rainy","Sunny"]
Today=input()
for i in range(3):
  if Today== Weather[i]:
    print(Weather[i+1])

Submission status: Accepted

Solution code:
s = input()

if s == 'Sunny':
	print('Cloudy')
elif s == 'Cloudy':
	print('Rainy')
else:
	print('Sunny')

Submission status: Accepted

Solution code:
s = input()
if s == "Sunny": print("Cloudy")
elif s == "Cloudy": print("Rainy")
else: print("Sunny")

Submission status: Accepted

Solution code:
s=input()
if s=='Sunny':
  print('Cloudy')
if s=='Cloudy':
  print('Rainy')
if s=='Rainy':
  print('Sunny')

Submission status: Accepted

Solution code:
S = input()

d = {'Sunny':1,'Cloudy':2,'Rainy':0}
l = ['Sunny','Cloudy','Rainy']

print(l[d[S]])

Submission status: Accepted

Solution code:
s = input()

if s == 'Sunny':
    print("Cloudy")
elif s == 'Cloudy':
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
def weather(s):
    if s == "Sunny": return "Cloudy"
    if s == "Cloudy": return "Rainy"
    if s == "Rainy": return "Sunny"

s = input()
print(weather(s))

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    s=input()
    if s=="Sunny":
        print("Cloudy")
    elif s=="Cloudy":
        print("Rainy")
    else:
        print("Sunny")

Submission status: Accepted

Solution code:
s = input()
memo = {"Sunny": "Cloudy", "Cloudy": "Rainy", "Rainy": "Sunny"}
print(memo[s])

Submission status: Accepted

Solution code:
s = ['Sunny','Cloudy','Rainy','Sunny']
S = str(input())
for i in range(3):
    if S == s[i]:
        print(s[i+1])

Submission status: Accepted

Solution code:
a = str(input())

if a == 'Sunny':
  print('Cloudy')
elif a == 'Rainy':
  print('Sunny')
else: 
  print('Rainy')

Submission status: Accepted

Solution code:
d={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}
s=input()
print(d[s])

Submission status: Accepted

Solution code:
s = input()
dic = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(dic[s])

Submission status: Accepted

Solution code:
S = input()
w = ["Sunny","Cloudy", "Rainy"]
cnt = 0

for i in range (len(w)):
  if S == w[i]:
    if i < 2:
      print(w[i+1])
      exit()
    else:
      print(w[0])

Submission status: Accepted

Solution code:
S = input()
i = 0

W = ["Sunny", "Cloudy", "Rainy"]

while i < 3:
  if W[i] == S:
    if i < 2:
      print(W[i+1])
    else:
      print(W[0])
  i += 1

Submission status: Accepted

Solution code:
s = input()
if (s == "Sunny"):
    print("Cloudy")
elif (s == "Cloudy"):
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
s = input()
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:print("Sunny")

Submission status: Accepted

Solution code:
s=input()
a=['Sunny','Cloudy','Rainy','Sunny']

for i in range(3):
  if s==a[i]:
    print(a[i+1])

Submission status: Accepted

Solution code:
l = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']
s = input()
flg = False
for i in l:
  if flg == True:
    print(i)
    exit()
  if s == i:
    flg = True

Submission status: Accepted

Solution code:
a = input()

if a == "Sunny":
  print("Cloudy")
elif a == "Cloudy":
  print("Rainy")
elif a == "Rainy":
  print("Sunny")

Submission status: Accepted

Solution code:
s = str(input())
if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
s=input()
if s=='Sunny':
    print('Cloudy')
elif s=='Rainy':
    print('Sunny')
else:
    print('Rainy')

Submission status: Accepted

Solution code:

s = input()

if s == 'Sunny':
    print("Cloudy")
    
if s == 'Cloudy':
    print("Rainy")
    
if s == 'Rainy':
    print("Sunny")

Submission status: Accepted

Solution code:
s = input()
weather = ['Sunny', 'Cloudy', 'Rainy']
i = (weather.index(s) + 1) % 3
print(weather[i])

Submission status: Accepted

Solution code:
S = input()
d = {'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(d[S])