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

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

Submission status: Accepted

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

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:
import sys
input=sys.stdin.readline
s=input().rstrip()
if s=='Sunny':
    print('Cloudy')
elif s=='Cloudy':
    print('Rainy')
elif s=='Rainy':
    print('Sunny')

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:
s = input()
# 出力
if s == 'Sunny':
    print('Cloudy')
elif s == 'Cloudy':
    print('Rainy')
else:
    print('Sunny')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(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 = 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")
else:
  print("Sunny")

Submission status: Accepted

Solution code:
import collections


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

Submission status: Accepted

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

Submission status: Accepted

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

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:

S = input()

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

print (dic[S])

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
import math
import re

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

print(a[input()])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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



main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

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

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
#input = sys.stdin.readline
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().strip()
l = ['Sunny', 'Cloudy', 'Rainy']
i = l.index(s)
print(l[(i + 1) % 3])

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

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

Submission status: Accepted

Solution code:
arr = ["Sunny","Cloudy","Rainy"]

s = input()

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()
  l=['Sunny','Cloudy','Rainy']

  if s==l[0]:
    return l[1]
  elif s==l[1]:
    return l[2]
  else:
    return l[0]

# main()
print(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:
def getlist():
	return list(map(int, input().split()))

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

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

Submission status: Accepted

Solution code:
X = ["Sunny", "Cloudy", "Rainy"]
s = input()
for i in range(3):
    if s == X[i]: print(X[i-2])

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 sys

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    t = ["Sunny", "Cloudy", "Rainy", "Sunny"]
    S = ST()
    i = t.index(S)
    print(t[i+1])
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:
Ss = input()

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

Submission status: Accepted

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

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[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')
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:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import heapq
#import itertools
#import math
#import numpy as np
#import sys

S = input()
#A = list(map(int, input().split()))
#S = [input() for _ in range(H)]
#T = [list(map(int,input().split())) for _ in range(N)]
if S == 'Sunny' :
    print('Cloudy')
elif S == 'Cloudy' :
    print('Rainy')
elif S == '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 == '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:
a = ["Sunny","Cloudy","Rainy","Sunny"]
b = input()
print(a[a.index(b)+1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d = {"Sunny": "Cloudy", "Cloudy": "Rainy", "Rainy": "Sunny", }
    s = str(input().rstrip('\n'))
    print(d[s])


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)
a = ["Sunny","Cloudy","Rainy"]
n = input()
b = a.index(n)
b+=1
b%=3
print(a[b])

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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(S: str):
    a =  ['Sunny', 'Cloudy', 'Rainy']
    t = a.index(S)
    ret = a[(t + 1) % 3]
    print(ret)
    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=input()
if(s=="Sunny"):
    print("Cloudy")
elif(s=="Rainy"):
    print("Sunny")
else:
    print("Rainy")

Submission status: Accepted

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

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()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True
#debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)

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

solve()

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:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

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

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:
import sys
sys.setrecursionlimit(1000000)
from math import factorial, ceil, floor
from bisect import bisect_right as bsr
from operator import itemgetter as ig
from collections import defaultdict as dd
from collections import deque, Counter as cnt

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)
def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]
def nlist(n, v):
    if not n: return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]

# エントリーポイント
def main():
    S = input(str)
    if S == "Sunny":
        print("Cloudy")
    elif S == "Cloudy":
        print("Rainy")
    else:
        print("Sunny")
    return

if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

sol()

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

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=["Sunny","Cloudy","Rainy"]
S=input()
for i in range(3):
    if S==X[i]:
        print(X[(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:
s = input()
if s == "Sunny":
    ans = "Cloudy"
elif s == "Cloudy":
    ans = "Rainy"
else:
    ans = "Sunny"
print(ans)

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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"]
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[0]=="S":
	print("Cloudy")
elif s[0]=="C":
	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:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))

#################

S = str(input())

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc141/tasks/abc141_a
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

s = ['Sunny', 'Cloudy', 'Rainy']
a = s[(s.index(input()) + 1) % 3]
print(a)

Submission status: Accepted

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

Submission status: Runtime Error

Solution code:
s=input()


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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()

def z_algorythm(s):
    n = len(s)
    LCP = [0]*n
    c = 0
    for i in range(1, n):
        if i + LCP[i-c] < c + LCP[c]:
            LCP[i] = LCP[i-c]
        else:
            j = max(0, c+LCP[c]-i)
            while i+j < n and s[j] == s[i+j]:
                j += 1
                LCP[i] = j
                c = i
    LCP[0] = n
    return LCP

ans = 0
for i in range(n):
    LCP = z_algorythm(s[i:])
    for j, len in enumerate(LCP):
        tmp = min(len, j)
        ans = max(ans, tmp)
print(ans)

Submission status: Runtime Error

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

print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
l = [[] for i in range(n+1)]
l[0] = ['0',0]
ans = 0
for i in range(1,n+1):
    l[i] = [s[i-1:],i]
l.sort()
for i in range(n):
    for j in range(i+1,n):
        m = min(len(l[i][0]),len(l[j][0]))
        x = l[i][0]
        y = l[j][0]
        z = 0
        while z < m:
            if x[z] != y[z]:
                break
            z += 1
        if z > l[i][1] - l[j][1]:
            z = l[i][1] - l[j][1]
        ans = max(z,ans)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# Sunny -> Cloudy -> Rainy -> Sunny ...
# 標準入力NはSunny Cloudy Rainyのいずれか

N = input()

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())

ans = [K]*N

for i in range(Q):
  A = int(input())
  
  
  for j in range(N):
    if j != (A-1):
      if ans[j] > 0:
        ans[j] -= 1
  

for i in range(N):
  if ans[i] <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
l=[int(input().split()) for i in range(q)]

for i in range(1,n+1):
  ans=k
  for que in l:
    if que!=i:
      ans-=1
  if ans<=0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
S = input()

if S == 'Sunny':
    print('cloudy')

elif S == 'cloudy':
    print('Rainy')

elif:
    print('Sunny')

Submission status: Runtime Error

Solution code:
S = input()

if S == 'Sunny':
    answer =('cloudy')

elif S == 'cloudy':
    answer =('Rainy')

elif S == 'Rainy':
    answer =('Sunny')

print=answer

Submission status: Runtime Error

Solution code:
today_weather = int()
 
if today_weather = ‘Sunny’:
    tomorrow_weather = "Cloudy"
 
elif today_weather = ‘Cloudy’:
    tomorrow_weather = "Rainy"
 
elif today_weather = ‘Rainy’:
    tomorrow_weather = "Suuny"
 
print(tomorrow_weather)

Submission status: Runtime Error

Solution code:
today_weather = int()

if today_weather = ‘Sunny’:
    tomorrow_weather = ‘Cloudy’

elif today_weather = ‘Cloudy’:
    tomorrow_weather = ‘Rainy’

elif today_weather = ‘Rainy’:
    tomorrow_weather = ‘Suuny’

print(tomorrow_weather)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
weather = input()

if weather == 'Sunny':
    print 'Cloudy'

if weather == 'Cloudy':
    print 'Rainy'
    
if weather == 'Rainy':
    print 'Sunny'

Submission status: Runtime Error

Solution code:
weather = input()

if (weather == 'Sunny'):
    print 'Cloudy'

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

Submission status: Runtime Error

Solution code:
weather = input()

if (weather == 'Cloudy'):
    print 'Rainy'

if (weather == 'Cloudy'):
    print 'Rainy'
    
if (weather == 'Cloudy'):
    print 'Rainy'

Submission status: Runtime Error

Solution code:
weather = imput()

if (weather == 'Sunny')
    print 'Cloudy'
if (weather == 'Cloudy')
    print 'Rainy'
if (weather == 'Rainy')
    print 'Sunny'

Submission status: Runtime Error

Solution code:
S

Submission status: Runtime Error

Solution code:
N,K,Q = map(int,input().split())
Answer_List = {}
for i in range(Q):
    CA = int(input())
    if CA in Answer_List:
        Answer_List[CA] += 1 
    else:
        Answer_List[CA] = 1
 
Lose_Status = K - Q
if Lose_Status > 0:
    for j in range(N):
        print("Yes")
else:
    Standard = abs(Lose_Status) + 1
    for j in range(N):
        if j + 1 in Answer_List:
            if Answer_List[j + 1] >= Standard:
                print("Yes")
            else:
                print("No")
        else:
                print("No")