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:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]


    next = {'Sunny':'Cloudy',
            'Cloudy':'Rainy',
            'Rainy':'Sunny'}
    print(next[input()])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
a=''
if N[0] =='S':
  a='Cloudy'
elif N[0] =='C':
  a='Rainy'
else:
  a='Sunny'

print(a)

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 = ["Sunny", "Cloudy", "Rainy"]
S = str(input())

if weather.index(S) == len(weather) - 1:
    print(weather[0])
else:
    print(weather[weather.index(S) + 1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = ['Sunny', 'Cloudy', 'Rainy']
print(A[A.index(input())-2])

Submission status: Accepted

Solution code:
a = 'Sunny'
b = 'Cloudy'
c = 'Rainy'

S = input()

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

Submission status: Accepted

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

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:
a=["Sunny", "Cloudy", "Rainy"]

S=input()

def func1(lst, value):
    return [i for i, x in enumerate(lst) if x == value]
  
idx=func1(a,S)[0]

if idx==2:
  ans=0
else:
  ans=idx+1

print(a[ans])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
# import collections

# import bisect
# import math
import numpy as np
# from fractions import gcd

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    # n, m = ip.IL()
    # a = np.array(ip.IL())
    # for _ in range(m):
    #     a[np.argmax(a)] //= 2
    # print(np.sum(a))
    s = input()
    if s == "Sunny":
        print("Cloudy")
    elif s == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input().strip()
    weathers = ['Sunny', 'Cloudy', 'Rainy']
    t = weathers.index(S)
    print(weathers[(t + 1) % 3])

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

# coding: utf-8

# In[1]:


SUNNY, CLOUDY, RAINY = 'Sunny', 'Cloudy', 'Rainy' 


# In[2]:


weather = input()


# In[4]:


if weather == SUNNY:
    print(CLOUDY)
elif weather == CLOUDY:
    print(RAINY)
elif weather == RAINY:
    print(SUNNY)

Submission status: Accepted

Solution code:
rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

A, B, C = 'Sunny', 'Cloudy', 'Rainy'
def solve(S):
    if S == A: return B
    if S == B: return C
    return A
    

print solve(rr())

Submission status: Accepted

Solution code:
w = str(input())

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

ans = 0
for i in range(3):
    if w == dct[i]:
        ans = i + 1
        
if ans == 3:
    ans = 0
    
print(dct[ans])

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:
#static info
array = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']

#input
weather = str(input())

#def
def predict_wether(weather):
    for k,s in enumerate(array):
        if weather == s:
            output = array[k+1]
            break

    return output

#main
print(predict_wether(weather))

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:


S = input()

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

idx = pattern.index(S)
print(pattern[idx+1] if idx != len(pattern) - 1 else pattern[0])

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:
w = input()
if w == "Sunny":
  print("Cloudy")
elif w == "Cloudy":
  print("Rainy")
elif w == "Rainy":
  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:


def acinput():
    return list(map(int, input().split(" ")))


S=input()
d=["Sunny","Cloudy","Rainy","Sunny"]

print(d[d.index(S)+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
weather_l = ['Sunny', 'Cloudy', 'Rainy']
for i, weather in enumerate(weather_l):
    next_i = 0
    if S == weather:
        if i == 2:
            next_i = 0
        else:
            next_i = i + 1
        print(weather_l[next_i])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ans=""
if s=='Sunny':  ans="Cloudy"
if s=='Cloudy': ans="Rainy"
if s=='Rainy':  ans="Sunny"

print(ans)

Submission status: Accepted

Solution code:
A = input()
s = 'Sunny'
c = 'Cloudy'
r = 'Rainy'

if A == s:
    print('Cloudy')

elif A == c:
    print('Rainy')

else:
    print('Sunny')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

S = input()

# print(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

s = "Sunny"
c = "Cloudy"
r = "Rainy"

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

Submission status: Accepted

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

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:
s1 = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tenki = input()
tenki_list = ["Sunny", "Cloudy", "Rainy"]

for i, weather in enumerate(tenki_list):
    if tenki == weather:
        if i == 2:
            print(tenki_list[0])
        else:
            print(tenki_list[i + 1])

Submission status: Accepted

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

Submission status: Accepted

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

if next >= len(weather):
  print(weather[0])
else:
  print(weather[next])

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:
x=input()
if x=="Sunny":
    print("Cloudy")
elif x=="Cloudy":
    print("Rainy")
elif x=="Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
S = input()
wether = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']

for i, w in enumerate(wether):
    if w == S:
        print(wether[i+1])
        break

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:
# -*- coding:utf8 -*-

s = input()

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

Submission status: Accepted

Solution code:
S = input()
weathers = ['Sunny', 'Cloudy', 'Rainy']

ind = weathers.index(S)
print(weathers[(ind+1)%3])

Submission status: Accepted

Solution code:
import sys

def read():
	return sys.stdin.readline().rstrip()

S = read()

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

for i, w in enumerate(weathers):
  if S == w:
    print(weathers[i + 1])
    break

Submission status: Accepted

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

d = ['Sunny', 'Cloudy', 'Rainy']
N = input()
i = d.index(N)
print(d[(i + 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:
weathers = ['Sunny', 'Cloudy', 'Rainy']

S = input()

print(weathers[(weathers.index(S)+1) % len(weathers)])

Submission status: Accepted

Solution code:
S = input()

if S == 'Sunny':
  ans = 'Cloudy'
elif S == 'Cloudy':
  ans = 'Rainy'
else:
  ans = 'Sunny'

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	S = input()
	S = S[:-1]
 
	if S == "Sunny":
		print("Cloudy")
	elif S == "Cloudy":
		print("Rainy")
	else:
		print("Sunny")
	




if __name__ == "__main__":
	main()

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 WeatherPrediction():
	weather = ['Sunny', 'Cloudy', 'Rainy']
	S = input()
	print(weather[(weather.index(S) + 1) % 3])

WeatherPrediction()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

S=input().strip()

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

Submission status: Accepted

Solution code:
while True:
    try:
        string = input()
        if string == 'Sunny':
            print('Cloudy')
        elif string == 'Cloudy':
            print('Rainy')
        elif string == 'Rainy':
            print('Sunny')
    except:
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
ts=time.time()
sys.setrecursionlimit(10**6)
#input=sys.stdin.readline
show_flg=False
show_flg=True

an=0
k=0
s=input()
d=dict()
d['Sunny']='Cloudy'
d['Cloudy']='Rainy'
d['Rainy']='Sunny'
print(d[s])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# input
S = input()

# solve
if S == 'Sunny':
    ans = 'Cloudy'
elif S == 'Cloudy':
    ans = 'Rainy'
else:
    ans = 'Sunny'

# output
print(ans)

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:
# -*- coding:utf-8 -*-
import sys

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


if __name__ == "__main__":
    solve()

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:
def Weather_Prediction_abc141():    
    s = input()

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

Submission status: Accepted

Solution code:
n = input()
if n == "Sunny":
  print("Cloudy")
if n == "Cloudy":
  print("Rainy")
if n == "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:
weathers = [ 'Sunny', 'Cloudy', 'Rainy' ]
now = input()
now_index = weathers.index(now)
next_index = (now_index + 1) % len(weathers)
print(weathers[next_index])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i =input()

if i =='Sunny':
  print('Cloudy')
elif i =='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:
from sys import stdin

readline = stdin.readline


def main():
    s = readline().rstrip()
    weather = ('Sunny', 'Cloudy', 'Rainy')
    print(weather[(weather.index(s)+1)%3])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

x = hoge.index(S)
if(x == 2):
    x = -1

print(hoge[x+1])

Submission status: Accepted

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

today = input()

for i, weather in enumerate(weathers):
    if today == weather:
        print(weathers[(i+1)%3])

Submission status: Accepted

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

index = weather_list.index(s)
if index != 2:
    print(weather_list[index + 1])
elif index == 2:
    print(weather_list[0])

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 = input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = str(input())

A = ['Sunny','Cloudy','Rainy']
i = 0

if S == 'Sunny':
    i = 1
elif S == 'Cloudy':
    i = 2
else:
    i =0

print(A[i])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input()
weather = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']

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

Submission status: Accepted

Solution code:
S = str(input())

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

if S == wether[0]:
    print(wether[1])
elif S == wether[1]:
    print(wether[2])
elif S == wether[2]:
    print(wether[0])

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()
ss = ["Sunny", "Cloudy", "Rainy", "Sunny"]
print(ss[ss.index(s)+1])

Submission status: Accepted

Solution code:
weather = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math

# Sunny, Cloudy, Rainy

s = input().strip()

if s == "Sunny":
    print("Cloudy")
elif s == "Cloudy":
    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()
ls = ["Sunny","Cloudy","Rainy"]
if s==ls[0]:
    print(ls[1])
if s==ls[1]:
    print(ls[2])
if s==ls[2]:
    print(ls[0])

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 = ["Sunny", "Cloudy", "Rainy"]
today = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

if S == test[0]:
    print(test[1])
elif S == test[1]:
    print(test[2])
else:
    print(test[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
 
ni = lambda: str(ns())
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

map = {"Sunny":"Cloudy","Cloudy":"Rainy","Rainy":"Sunny"}

print(map[ni()])

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:
n = input()
weather = {0:"Sunny", 1:"Cloudy", 2:"Rainy"}

           
for k, v in weather.items():
  if v == n:
    nk = k
    break

nk = (nk+1) % 3

print(weather[nk])

Submission status: Accepted

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


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


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:
S = input()
if S[0] == 'S':
    ans = 'Cloudy'
elif S[0] == 'C':
    ans = 'Rainy'
else:
    ans = 'Sunny'
    
print(ans)

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':#Sunny, Cloudy, Rainy, 
  print("Cloudy")
elif s=='Cloudy':
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

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

Submission status: Accepted

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

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:
a=input()
b=['Sunny','Cloudy','Rainy']*2
print(b[b.index(a)+1])

Submission status: Accepted

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

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:
wehter = ['Sunny','Cloudy','Rainy']
s = input()
if s == wehter[0]:
    print(wehter[1])
elif s == wehter[1]:
    print(wehter[2])
else:
    print(wehter[0])

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={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}
print(S[input()])

Submission status: Accepted

Solution code:
S = input()
weathers = ['Sunny', 'Cloudy', 'Rainy']
pos = 0
for i, weather in enumerate(weathers):
    if weather == S:
        pos = i

print(weathers[(pos + 1) % 3])

Submission status: Accepted

Solution code:
s = 'Sunny'
c = "Cloudy"
r = "Rainy"

S = input()
if S == s:
    print(c)
elif S == c:
    print(r)
else:
    print(s)

Submission status: Accepted

Solution code:
weather_list = ['Sunny', 'Cloudy', 'Rainy']
input_value = input()
number = weather_list.index(input_value) + 1
if number <= 2:
    print(weather_list[number])
else:
    print(weather_list[number - 3])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

S = input().strip()
if S == 'Sunny':
    print('Cloudy')
elif S == 'Cloudy':
    print('Rainy')
elif S == 'Rainy':
    print('Sunny')

Submission status: Accepted

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

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 = raw_input()
pred={'Sunny':'Cloudy', 'Cloudy':'Rainy', 'Rainy':'Sunny'}
print(pred[S])

Submission status: Accepted

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

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:
#!/usr/bin/env python3
import sys


def solve(S: str):
    a = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
    print(a[S])


# Generated by 1.1.5 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:
w = ["Sunny", "Cloudy", "Rainy"]
s = input()

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

Submission status: Accepted

Solution code:
#import pysnooper
#import os,re,sys,operator,math,heapq,string
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from copy import deepcopy

setrecursionlimit(10**6)
input=stdin.readline

s=input().rstrip()
print("Sunny" if s=="Rainy" else "Cloudy" if s=="Sunny" else "Rainy")

Submission status: Accepted

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

print(S1[(S1.index(input())+1)%3])

Submission status: Accepted

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