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


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


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

def main():
    """ main """
    S = input().rstrip()
    if S == 'Sunny':
        print('Cloudy')
    elif S == 'Cloudy':
        print('Rainy')
    elif S == 'Rainy':
        print('Sunny')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline

s = input().split()
if s[0]=="Sunny":
    print("Cloudy")
elif s[0]=="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:
t=input()
if(t=="Sunny"):
  print("Cloudy")
elif(t=="Cloudy"):
  print("Rainy")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
S=input()
w=['Sunny','Cloudy','Rainy']
for i in range(3):
    if S==w[i]:
        print(w[i-2])

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S=input()
if S=="Sunny":
    print("Cloudy")
elif S=="Cloudy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Accepted

Solution code:
N=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 = str(input())
if s=="Sunny":
    print("Cloudy")
if s=="Cloudy":
    print("Rainy")
if s=="Rainy":
    print("Sunny")

Submission status: Accepted

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

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:
def calc(s):
    if s == "Sunny":
        return "Cloudy"
    if s == "Cloudy":
        return "Rainy"
    if s == "Rainy":
        return "Sunny"


s = input()
r = calc(s)
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip()
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")
elif s=="Cloudy":
  print ("Rainy")
else:
  print ("Sunny")

Submission status: Accepted

Solution code:
S = input()

sun = "Sunny"
cloud = "Cloudy"
rain = "Rainy"

if S == sun:
    print(cloud)
elif S == cloud:
    print(rain)
else:
    print(sun)

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意

#n = int(input())
#n,k = [int(i) for i in readline().split()]


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

s = input()

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

Submission status: Accepted

Solution code:
input_line = input()

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

Submission status: Accepted

Solution code:
S = input()

s = 'Sunny'
c = 'Cloudy'
r = 'Rainy'

if S == s:
    print(c)
elif S == c:
    print(r)
else:
    print(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:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    W = ['Sunny', 'Cloudy','Rainy']
    for i, w in enumerate(W):
        if w == S:
            return W[(i+1)%len(W)]


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
weater = ["Sunny","Cloudy","Rainy"]
print(weater[weater.index(S)-2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

s=input()

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

weather = ['Sunny', 'Cloudy', 'Rainy']
s = ns()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
W = input()

if W[0] == "S":
    print("Cloudy")
elif W[0] == "C":
    print("Rainy")
else:
    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:
L=lambda:list(map(int,input().split()))
I=lambda:input()
s=I()
d=["Sunny","Cloudy","Rainy","Sunny"]
print(d[d.index(s)+1])

Submission status: Accepted

Solution code:
S = input().strip()

if S == 'Sunny':
    print('Cloudy')
if S == 'Cloudy':
    print('Rainy')
if 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:
tmp = ["Sunny", "Cloudy", "Rainy"]
today = input()

print(tmp[(tmp.index(today)+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:
#A問題
s = "Sunny"
c = "Cloudy"
r = "Rainy"

S = str(input())
if S == s:
    print(c)
if S == c:
    print(r)
if S == r:
    print(s)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    f_a()

Submission status: Accepted

Solution code:
#coding:utf-8

s = input()

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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:
a = str(input())
#b_list = list(map(int,input().split()))
#print(" ".join(map(str,c_list)))
if a == "Sunny":
    print("Cloudy")
elif a == "Cloudy":
    print("Rainy")
else: 
    print("Sunny")

Submission status: Accepted

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


def solve(S: str):
    if S == "Sunny":
        print("Cloudy")
    if S == "Cloudy":
        print("Rainy")
    if S == "Rainy":
        print("Sunny")
    return


# 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:
from sys import stdin


def main():
    S = stdin.readline().rstrip()
    if S == 'Sunny':
        print('Cloudy')
    elif S == 'Cloudy':
        print('Rainy')
    else:
        print('Sunny')


if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

tommorow = (w.index(N) + 1) % 3

print(w[tommorow])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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")

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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:
import sys, random
mod = 1000000007
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline()
def print_array(a): print(" ".join(map(str, a)))
def main():
        w = ['Sunny', 'Cloudy', 'Rainy']
        s = input().strip()
        print(w[(w.index(s) + 1) % 3])
if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
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:

a = input()

if a == 'Sunny':
    print('Cloudy')
elif a == '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()

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

print(ls[S])

Submission status: Accepted

Solution code:
S = input()
s = ["Sunny","Cloudy","Rainy"]
if S == s[0]:
    print(s[1])
elif S == s[1]:
    print(s[2])
else:
    print(s[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:
#A

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# input=sys.stdin.readline
def resolve():
    s=input()
    if s=="Sunny":
        print("Cloudy")
    elif s=="Cloudy":
        print("Rainy")
    else:
        print("Sunny")

resolve()

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


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

Submission status: Accepted

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

def main():
    S = input().strip()
    if S == "Sunny":
        print("Cloudy")
    elif S == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = 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')
elif S == 'Rainy':
    print('Sunny')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys; from collections import deque; readline = sys.stdin.readline;

S = readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools

INF = 10 ** 10


S = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
def solve():
    data = read();
    result = think(data)
    write(result)


def read():
    return read_line()


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    if data == 'Sunny':
        return 'Cloudy'
    if data == 'Cloudy':
        return 'Rainy'
    if data == 'Rainy':
        return 'Sunny'


def write(result):
    print(result)


if __name__ == '__main__':
    # import doctest
    # doctest.testmod()
    # import sys
    # sys.setrecursionlimit(10000)
    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:
from sys import stdin

s = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
s = input()

a,b,c ="Sunny","Cloudy","Rainy"

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

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

Submission status: Accepted

Solution code:
def main():

    S = input()
    if S == "Sunny":
        return "Cloudy"
    if S == "Cloudy":
        return "Rainy"
    if S == "Rainy":
        return "Sunny"

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
import numpy as np
import math
import sys
sys.setrecursionlimit(10000000)

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


if __name__ == '__main__':
    main()

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:
def do():
    S = str(input())
    if S == 'Sunny':
        print('Cloudy')
    elif S == 'Cloudy':
        print('Rainy')
    else:
        print('Sunny')
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b = map(int, input().split())
# s = input()


s = "Sunny"
c = "Cloudy"
r = "Rainy"
d = {
    s: c, c: r, r: s
}

ans = d[input()]
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())

## 数値
 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


S = sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
wt = ['Sunny', 'Cloudy', 'Rainy']
for i in range(3):
    if s == wt[i]:
        print(wt[(i + 1) % 3])
        break

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 == "Rainy":
  print("Sunny")
else:
  print("Rainy")

Submission status: Accepted

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

if sin == s:
    print(c)
elif sin == c:
    print(r)
elif sin == r:
    print(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()
if(S == 'Sunny'): print('Cloudy')
elif(S == 'Cloudy'): print('Rainy')
else: print('Sunny')

Submission status: Accepted

Solution code:
import queue

"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
R={"Sunny":"Cloudy","Cloudy":"Rainy","Rainy":"Sunny"}
N = input()
print(R[N])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(t[S])

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S = str(input())
if S == "Sunny":
    print("Cloudy")
elif S == "Cloudy":
    print("Rainy")
elif S == "Rainy":
    print("Sunny")

Submission status: Accepted

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


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




if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc141/abc141_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    S=i2s()
    d={'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
    print(d[S])
    return

main()

Submission status: Accepted

Solution code:
def p_a():
    S = input()

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


if __name__ == '__main__':
    p_a()

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())


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

Submission status: Accepted

Solution code:
# ABC141a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

s = input()

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

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

Submission status: Accepted

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

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:
t = input()
s = 'Sunny'
c = 'Cloudy'
r = 'Rainy'

if t == s:
    print(c)
elif t == c:
    print(r)
else:
    print(s)

Submission status: Accepted

Solution code:
S = input()

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

print(s)

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

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:
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")