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: Runtime Error

Solution code:
X = list(map(int, input().split()))
A = []
B=[]
for _ in range(X[2]):
    A.append(int(input()))
for i in range(0,X[0]):
    count=0
    for j in range(0,X[2]):
        if j<X[2]-1 and A[j]!=i+1:
            count=count+1
        elif j==X[2]-1:
            if A[j]!=i+1:
                count=count+1
                if count < X[1]:
                    B.append("Yes")
                else:
                    B.append("No")
            else:
                if count < X[1]:
                    B.append("Yes")
                else:
                    B.append("No")
            
print(B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
class RollingHash:
    def __init__(self,S,base,M):
        self.N=len(S)
        self.M=M
        self.H=[0]*(self.N+1)
        self.B=[0]*(self.N+1)
        self.B[0]=1
        for i in range(self.N):
            self.B[i+1]=self.B[i]*base%M
            self.H[i+1]=(self.H[i]*base+(ord(S[i])-96))%M
    def get(self,l,r):
        return (self.H[r]-self.H[l]*self.B[r-l]+self.M)%self.M
    def getall(self,L):
        arr=[]
        for i in range(L,self.N+1):
            arr.append(self.get(i-L,i))
        return arr

def Hash(S,base,M):
    H=0
    for c in S:
        H=(H*base+ord(c)-96)%M
    return H
    
def isbad(L):
    arr=RH.getall(L)
    s=set()
    for i in range(L,N-L+1):
        s.add(arr[i-L])
        if arr[i] in s:
            return False
    return True
    
import random
N=int(input())
S=input()
MOD=2**61-1
base=random.randrange(100,MOD)
RH=RollingHash(S,base,MOD)
l,r=-1,N+1
while(r-l>1):
    mid=(l+r)//2
    if isbad(mid):
        r=mid
    else:
        l=mid
print(l)

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

def main():

    S = input()

    if S == 'Sunny':
        ans = 'Cloudy'

    elif S == 'Cloudy':
        ams = 'Rainy'

    else:
        ans = 'Sunny'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
#dp[i][j]:S[i-x:i]==S[j-x:j]となる最大のx
import numpy as np

def solve(NS):
    N = NS[0]
    S = NS[1:]
    dp=np.zeros((N+1,N+1),dtype=int)
    for i in range(N - 1):
        for j in range(i + 1, N):
            dp[i][j] = min(j - i, dp[i - 1][j - 1] + 1) if S[i] == S[j] else 0
    return dp.max()

def main():
    NS = np.array([int(input())] + [ord(_) for _ in input()])
    print(solve(NS))

def cc_export():
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('solve', 'i8(i8[:])')(solve)
    cc.compile()

if __name__ == '__main__':
    import sys
    if sys.argv[-1] == 'ONLINE_JUDGE':
        cc_export()
        exit(0)
    from my_module import solve
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

Solution code:
S = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()
b = input()
c=0
for i in range(3):
      if (a[i]==b[i]):
            c+=1
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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:
s=input()
wether=['Sunny', 'Cloudy', 'Rainy','Sunny']
for i in wether:
  if s==i:
    print(wether[i+1])
    break

Submission status: Runtime Error

Solution code:
s = input()

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

result = list.index(s)%3

print(list[result + 1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count)

    
    
main()

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

n, k, q = map(int, input().split())
a_li = [int(input()) for i in range(q)]

pt_li = [] #所持点数のリストを作る
for i in range(n):
    pt_li.append(k)

for t in range(q):
    for u in range(n):
        pt_li[u] -= 1
    pt_li[a_li[t]-1] += 1

print(pt_li)

for s in range(n):
     if pt_li[s] <= 0:
         print("No")
     else:
         print("Yes")

Submission status: Runtime Error

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

n, k, q = map(int, input().split())
a_li = [int(input()) for i in range(q)]

pt_li = [] 
for i in range(n):
    pt_li.append(k)

for t in range(q):
    for u in range(n):
        pt_li[u] -= 1
    pt_li[a_li[t]-1] += 1

for s in range(n):
     if pt_li[s] <= 0:
         print("No")
     else:
         print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

  return

if __name__ == "__main__":
  resolve()

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long

string S;
 
signed main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cin >> S;
    if (S=="Sunny") cout << "Cloudy" << endl;
    else if (S=="Cloudy") cout << "Rainy" << endl;
    else cout << "Sunny" << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
l1 = list(map(int,input().split()))

for i in range(m):
  l1 = sorted(l1)
  l1[-1] //= 2
print(sum(l1))

Submission status: Runtime Error

Solution code:
N, M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(M):
  max_item = A.index(max(A))
  A[max_item] //= 2
print(sum(A))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()

Sunny, Cloudy, Rainy

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

Submission status: Runtime Error

Solution code:
list = ["Sunny","Cloudy","Rainy"]
s = str(input())
a = list.index(s)
if a == 2:
    a == -1
print(list[a+1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = {"Sunny":"Cloudy", "Cloudy":"Cloudy", "Cloudy":"Sunny"}
k = input()

print(S[k])

Submission status: Runtime Error

Solution code:
s = str(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K, Q = [int(s) for s in input().split()]
A = [0] * N
for i in range(N):
    A[int(input()) - 1] += 1

for a in A:
    print('Yes' if (K - Q + a) > 0 else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
B = list(map(int,input().split()))
ans = 0

for i in range(N):
    if i == 0:
        ans += B[0]
    elif i == N-1:
        ans += B[-1]
    else:
        ans += min(B[i-1],B[i])
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

S = input()

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

Submission status: Runtime Error

Solution code:

S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import heapq

N, M = map(int, input().split())
A = list(map(lambda x: int(x)*(-1), input().split()))
heapq.heapify(A)

for _ in range(M):
    tmp = heapq.heappop(A)
    heapq.heappush(A, tmp/2)

A = map(lambda x: int(x)*(-1), A)

print(sum(A))

Submission status: Runtime Error

Solution code:
from collections import Counter
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
ans = ['No'] * n
c = Counter(a)
for i in range(1, n+1):
    if c[i] > q - k:
        ans[i] = 'Yes'
for k in ans:
    print(k)

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=int(input())
print(n**3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=[0]*m
for _ in range(m):
    if b[-1:]<a[-1:]:
        temp=a.pop()
    else:
        temp=b.pop()
    temp=temp//2
    b[0]=temp
    b.sort()

print(sum(a)+sum(b))

Submission status: Runtime Error

Solution code:
def resolve():
    n,k,q=map(int, input().split())
    l=[int(input()) for i in range(q)]
    a=[k-q for i in range(n)]
    for i in l:
        a[i-1]+=1
    for i in range(n):
        if a[i]<=0:
            print('No')
        else:
            print('Yes')
resolve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K, Q = (int(x) for x in input().split())
A = [int(input()) for i in range(Q)]
ans = [K-Q for i in range(N)]

for a in A:
    ans[a-1] += 1

for b in ans:
    if b > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(len(list)):
    theday = list[i]
    if x == theday:
        answer = list[i + 1]
print(answer)

Submission status: Runtime Error

Solution code:
S=input()
print(s.replace("Sunny"."Cloudy").replace("Rainy"."Sunny").replace("Cloudy"."Rainy"))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(input())

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

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())
L = []
for i in range(Q):
  L.append(int(input()))
for i in range(N):
 print("Yes" if K - Q + L.count(i+1) > 0 else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s=("sunny","cloudy","rainy")
print(s[(s.index(input())+1)%3])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
ww = ["Sunny", "Cloudy", "Rainy"]
for w in ww:
  if s == w[i]:
    if i == 2: j = 0
    else: j = i + 1
    print(w[j])
    break

Submission status: Runtime Error

Solution code:
from sys import stdin
A = stdin.readline().rstrip()

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

for i in round(len(weather) - 1):
    if A == weather[i]:
        t = i
        break
    else:
        i += 1


print(weather[t+1])

Submission status: Runtime Error

Solution code:
S=input()

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

print(wather[S])

Submission status: Runtime Error

Solution code:
mod = 10 ** 9 + 7
from collections import deque
import heapq


def iip(listed):
    ret = [int(i) for i in input().split()]
    if len(ret) == 1 and not listed:
        return ret[0]
    return ret


def main():
    r = solve()
    print(r)


def solve():
    N = iip(False)
    S = input()
    S = [i for i in S]
    #print(S)

    ln = len(S)

    mn = 0
    mx = ln
    while mx - mn > 1:
        l = (mx+mn) // 2
        #print(mx, mn)
        #print(l)

        is_same = False
        for left in range(0, ln):
            right = left + l
            if right > ln:
                break
            same_num = 0

            for i in range(right, ln):
                #print(l, left, right, i, same_num, S[i], S[left+same_num])
                if is_same:
                    break
                if S[i] == S[left+same_num]:
                    same_num += 1
                    if same_num == l:
                        is_same = True
                        break
                else:
                    same_num = 0

        if is_same:
            mn = l
        else:
            mx = l

    #print(mn, mx)
    return mn


#####################################################ライブラリ集ここから

def split_print_space(s):
    print(" ".join([str(i) for i in s]))


def split_print_enter(s):
    print("\n".join([str(i) for i in s]))


def koenai_saidai_x_index(sorted_list, n):
    l = 0
    r = len(sorted_list)
    if len(sorted_list) == 0:
        return False
    if sorted_list[0] > n:
        return False

    while r - l > 1:
        x = (l + r) // 2
        if sorted_list[x] == n:
            return x
        elif sorted_list[x] > n:
            r = x
        else:
            l = x
    return l


def searchsorted(sorted_list, n, side):
    if side not in ["right", "left"]:
        raise Exception("sideはrightかleftで指定してください")

    l = 0
    r = len(sorted_list)

    if n > sorted_list[-1]:
        # print(sorted_list)
        return len(sorted_list)
    if n < sorted_list[0]:
        return 0

    while r - l > 1:
        x = (l + r) // 2
        if sorted_list[x] > n:
            r = x
        elif sorted_list[x] < n:
            l = x
        else:
            if side == "left":
                r = x
            elif side == "right":
                l = x

    if side == "left":
        if sorted_list[l] == n:
            return r - 1
        else:
            return r

    if side == "right":
        if sorted_list[l] == n:
            return l + 1
        else:
            return l


def soinsuu_bunkai(n):
    ret = []
    for i in range(2, int(n ** 0.5) + 1):
        while n % i == 0:
            n //= i
            ret.append(i)
        if i > n:
            break
    if n != 1:
        ret.append(n)
    return ret


def conbination(n, r, mod, test=False):
    if n <= 0:
        return 0
    if r == 0:
        return 1
    if r < 0:
        return 0
    if r == 1:
        return n
    ret = 1
    for i in range(n - r + 1, n + 1):
        ret *= i
        ret = ret % mod

    bunbo = 1
    for i in range(1, r + 1):
        bunbo *= i
        bunbo = bunbo % mod

    ret = (ret * inv(bunbo, mod)) % mod
    if test:
        # print(f"{n}C{r} = {ret}")
        pass
    return ret


def inv(n, mod):
    return power(n, mod - 2)


def power(n, p):
    if p == 0:
        return 1
    if p % 2 == 0:
        return (power(n, p // 2) ** 2) % mod
    if p % 2 == 1:
        return (n * power(n, p - 1)) % mod


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
mod = 10 ** 9 + 7
from collections import deque
import heapq


def iip(listed):
    ret = [int(i) for i in input().split()]
    if len(ret) == 1 and not listed:
        return ret[0]
    return ret


def main():
    r = solve()
    print(r)


def solve():
    N = iip(False)
    S = input()
    S = [i for i in S]
    #print(S)

    ln = len(S)
    ans = 0
    for left in range(0, ln):
        for right in range(left+1, ln):
            is_same = False
            l = right - left
            if l <= ans:
                break
            if l > ln/2:
                break

            same_num = 0

            for i in range(right, ln):
                #print(l, left, right, i, same_num, S[i], S[left+same_num])
                if S[i] == S[left+same_num]:
                    same_num += 1
                    if same_num == l:
                        is_same = True
                        break
                else:
                    same_num = 0

            if is_same:
                ans = max(ans, l)
            else:
                left = right-1

    return ans


#####################################################ライブラリ集ここから

def split_print_space(s):
    print(" ".join([str(i) for i in s]))


def split_print_enter(s):
    print("\n".join([str(i) for i in s]))


def koenai_saidai_x_index(sorted_list, n):
    l = 0
    r = len(sorted_list)
    if len(sorted_list) == 0:
        return False
    if sorted_list[0] > n:
        return False

    while r - l > 1:
        x = (l + r) // 2
        if sorted_list[x] == n:
            return x
        elif sorted_list[x] > n:
            r = x
        else:
            l = x
    return l


def searchsorted(sorted_list, n, side):
    if side not in ["right", "left"]:
        raise Exception("sideはrightかleftで指定してください")

    l = 0
    r = len(sorted_list)

    if n > sorted_list[-1]:
        # print(sorted_list)
        return len(sorted_list)
    if n < sorted_list[0]:
        return 0

    while r - l > 1:
        x = (l + r) // 2
        if sorted_list[x] > n:
            r = x
        elif sorted_list[x] < n:
            l = x
        else:
            if side == "left":
                r = x
            elif side == "right":
                l = x

    if side == "left":
        if sorted_list[l] == n:
            return r - 1
        else:
            return r

    if side == "right":
        if sorted_list[l] == n:
            return l + 1
        else:
            return l


def soinsuu_bunkai(n):
    ret = []
    for i in range(2, int(n ** 0.5) + 1):
        while n % i == 0:
            n //= i
            ret.append(i)
        if i > n:
            break
    if n != 1:
        ret.append(n)
    return ret


def conbination(n, r, mod, test=False):
    if n <= 0:
        return 0
    if r == 0:
        return 1
    if r < 0:
        return 0
    if r == 1:
        return n
    ret = 1
    for i in range(n - r + 1, n + 1):
        ret *= i
        ret = ret % mod

    bunbo = 1
    for i in range(1, r + 1):
        bunbo *= i
        bunbo = bunbo % mod

    ret = (ret * inv(bunbo, mod)) % mod
    if test:
        # print(f"{n}C{r} = {ret}")
        pass
    return ret


def inv(n, mod):
    return power(n, mod - 2)


def power(n, p):
    if p == 0:
        return 1
    if p % 2 == 0:
        return (power(n, p // 2) ** 2) % mod
    if p % 2 == 1:
        return (n * power(n, p - 1)) % mod


if __name__ == "__main__":
    main()

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:
#include <bits/stdc++.h>
#define rep(i, N) for (int i=0; i<(int)N; i++)
#define rep1(i, N) for (int i=1; i<(int)N; i++)

using namespace std;

string s;

int main() {
  cin >> s;
  string t;
  
  if (s == "Sunny") t = "Cloudy";
  if (s == "Cloudy") t = "Rainy";
  if (s == "Rainy") t = "Sunny";
  
  cout << t;
}

Submission status: Runtime Error

Solution code:
A = ['Sunny','Cloudy',''Rainy']
S = int(input())
print(A[S%3])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v in enumerate(weather):
    if v == s:
        print(weather[i + 1 % 3])

Submission status: Runtime Error

Solution code:
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v enumerate(weather):
    if v == s:
        print(weather[i + 1 % 3])

Submission status: Runtime Error

Solution code:
a = input()
s = "Sunny"
c = "Cloudy"
r = "Rainy"

if a == s:
		print(c)
else a == c:
		print(r)
		
else:
		print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
const main = input =>{
    result = '';
    switch (input) {
        case 'Sunny':
            result = 'Cloudy';
            break;
        case 'Cloudy':
            result = 'Rainy';
            break;
        case 'Rainy':
            result = 'Sunny';
            break;
    }
    console.log(result);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));

Submission status: Runtime Error

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

if l.index(w) = 2:
    print("Sunny")

else:
    print(l[l.index(w) + 1])

Submission status: Runtime Error

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

a = weather[s]
if a == 2:
    print("Sunny")
else:
    print(weather[a+1])

Submission status: Runtime Error

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

a = weather[s]
print(weather[a+1])

Submission status: Runtime Error

Solution code:
import random
from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
n = int(input())
s = input().rstrip()
mod = (1<<61)-1
base = 1000+random.randint(0,100)
power = [1]
for i in range(1,n):
  power.append((power[-1]*base)%mod)
hvalue = [0]
for i in range(n):
  hvalue.append((hvalue[-1]+(ord(s[i])*power[i]))%mod)
def rollinghash(l,r):
  return ((hvalue[r]-hvalue[l])*power[n-r])%mod
def pun(i):
  dc = defaultdict(int)
  if i>n//2:
    return False
  for j in range(n-i+1):
    x = rollinghash(j,i+j)
    if dc[x]:
      rg =dc[x]
      if rg<=j:
        return True
      else:
        dc[x] = i+j
  return False
l=0
r=n//2+1
while l+1<r:
  mi=(l+r)//2
  if pun(mi):
    l=mi
  else:
    r=mi
print(l)

Submission status: Runtime Error

Solution code:
import random
from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
n = int(input())
s = input().rstrip()
mod = (1<<61)-1
base = 1000+random.randint(0,100)
power = [1]
for i in range(1,n):
  power.append((power[-1]*base)%mod)
hvalue = [0]
for i in range(n):
  hvalue.append((hvalue[-1]+(ord(s[i])*power[i]))%mod)
def rollinghash(l,r):
  return ((hvalue[r]-hvalue[l])*power[n-r])%mod
def pun(i):
  dc = defaultdict(int)
  if i>n//2:
    return False
  for j in range(n-i+1):
    x = rollinghash(j,i+j)
    if dc[x]:
      rg =dc[x]
      if rg<=j:
        return True
      else:
        dc[x] = i+j
  return False
l=0
r=n//2+1
while l+1<r:
  mi=(l+r)//2
  if pun(mi):
    l=mi
  else:
    r=mi
print(l)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

input = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()
    w = {'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Sunny'}
    print(w[s])

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
s = input()

tenki = ["Sunny", "Cloudy", "Rainy"]
i = tenki.index(s)
i = (i%3)+1
print(tenki[i])

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:
# coding: utf-8
a = input()
if a = "Sunny":
  print("Cloudy")
elif a = "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(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())
a=[k-q]*n
for i in range(q):
    point=int(input())
    a[point-1] += 1
for i in range(len(l)):
    if l[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
S = input()

odd = list(S[::2])
even = list(S[1::2])
xx = "No"

for i in range(len(odd)):
  check = 0
  if odd[i] == "L" or "U" or "D":
    check += 1
  
if check == len(odd):
  x = "Y"
  
for i in range(len(even)):
  check2 = 0
  if even[i] == "R" or "U" or "D":
    check2 += 1
 
if check2 == len(even):
  x2 = "Y"
  
  
if x and x2 == "Y":
  xx = "Yes"
  
  
print(xx)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = 0
for i in range(n):
  for j in range(i, n):
    if s[i:j+1] in s[j+1:]:
      ans = max(ans, j-i+1)
    else:
      break
print(ans)