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

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())
a = []
points = []
for i in range(q):
    a.append(int(input()))
for i in range(1,n+1):
    points.append(a.count(i))
tot = sum(points)
tot = -tot
for i in range(n):
    if tot + points[i] + k > 0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
N,K,Q = map(int,input().split(" "))
a=[]
a2={}

for i in range(Q):
  a.append(input())
  
for i in range(N):
  a2[i+1] = a.count(str(i+1))

for i in range(N):
  if a2[i+1] >= Q-K+1:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

S = input()

print(converter[S])

Submission status: Runtime Error

Solution code:
S_Today = input()

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

for s in S:

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
i=0
for tmp in s:
  i+=1
  if i%2==0:
    if tmp in ['L','U','D']:
      continue
    else:
      print('No')
      break
  break
  else:
    if tmp in ['R','U','D']:
      continue
    else:
      print('No')
      break
  break
print('Yes')

Submission status: Runtime Error

Solution code:
str = input()
week_whether = {'Sunny':0, 'Cloudy':1, 'Rainy':2}
weel_labels = {0:'Sunny',1:'Cloudy', 2: 'Rainy'}
print(weel_labels[week_whether[str] + 1])

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:
def getweather(s):
  if s == 'Sunny':
    return 'Cloudy'
  elif s == 'Cloudy':
    return 'Rainy'
  elif s == 'Rainy'
    return 'Sunny'

s = input()
getweather(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

N, M = map(int, input().split())

goods = np.array(list(map(int, input().split())))

for i in range(M):
    max_value = max(goods)
    max_index = np.where(goods == max_value)[0]
    goods[max_index] = goods[max_index]//2
    
sum_value = sum(goods)

print(sum_value)

Submission status: Runtime Error

Solution code:
import sys

Weather = input()

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

Submission status: Runtime Error

Solution code:
N,K,Q=list(map(int,input().split()))
L=[K for _ in range(N)]
a=[int(input()) for _ in range(Q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Runtime Error

Solution code:
/**
 *      purpose : 
 *      author  : kyomukyomupurin
 *      created : 
**/

// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// math, algorithm
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// etc
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstring>
#include <chrono>
#include <ext/random>
#include <ext/rope>
#include <functional>
#include <iomanip>
#include <random>
#include <utility>
// using-directive
using namespace std;
// alias template
using int64 = long long;
using uint64 = unsigned long long;
using vi = std::vector<int>;
using vl = std::vector<int64>;
using pii = std::pair<int, int>;
using pii = std::pair<int, int>;
using pll = std::pair<int64, int64>;
// text macro replacement
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(_) (_).begin(), (_).end()
#define rall(_) (_).rbegin(), (_).rend()
#define print(_) std::cout << (_) << '\n'
#define debug(_) std::cerr << #_ << ": " << (_) << '\n'
// variadic template
template<typename T> inline void chmin(T &a, T b) {if (a > b) a = b; return;}
template<typename T> inline void chmax(T &a, T b) {if (a < b) a = b; return;}
template<typename T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
  os << "{";
  for (size_t i = 0; i < vec.size(); ++i) {
    os << vec[i] << ",}"[i == vec.size() - 1];
  }
  return os;
}
template<typename T, typename U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
  return os << "{" << p.first << " " << p.second << "}";
}
// constant
const int INF = (1<<30) - 1;  // 1.073741823e9
const int64 INF64 = (1LL<<62) - 1;  // 4.611686018427387903e18
const int MOD = 1000000007;

int main(){
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  string s; cin >> s;
  if (s == "Sunny") {
    cout << "Cloudy" << endl;
  } else if (s == "Cloudy") {
    cout << "Rainy" << endl;
  } else {
    cout << "Sunny" << endl;
  }

  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

if s == 'Sunny':
  return 'Cloudy'
elif s == 'Rainy':
  return 'Sunny'
else:
  return 'Rainy'

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if S=="Sunny":
    S="cloudy"
elif S=="cloudy":
    S="Rainy"
elif S=="Rainy":
    S="Sunny"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()
if a='Sunny':
  print('Cloudy')
elif a='Cloudy':
  print('Rainy')
elif a='Rainy':
  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 = input()
 
wea = ["Sunny", "Cloudy", "Rainy"]
 
print("{}".format(wea[wea.index(s) + 1 % 3]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
n = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()


dp = [[0 for i in range(n)] for j in range(n)]
#初期条件
for j in range(1, n):
    if S[0] == S[j]:
        dp[0][j] = 1
    else:
        dp[0][j] = 0

#print(dp)

for i in range(1, n-1):
    for j in range(i+1, n):
        if S[i] ==S[j]:
            dp[i][j] = min(dp[i-1][j-1] +1, n//2)
        else:
            dp[i][j] = 0

maxp = 0
for i in range(1, n-1):
    for j in range(i+1, n):
        if maxp < dp[i][j]:
            maxp = dp[i][j]
#print(dp)
print(maxp)

Submission status: Runtime Error

Solution code:
s=input()
l=(ensoleillé, nuageux, pluvieux)
if s in l:
    for i in len (l):
        if l(i)==s:
            print(l(i+1))
else :
    print ('autre')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    from heapq import heapify, heappush, heappop
    from math import floor
    n, m = list(map(int, input().split(' ')))
    a = list(map(int, input().split(' ')))
    a = [x*(-1) for x in a]
    heapify(a)
    for _ in range(m):
        x = floor(-heappop(a)/2)*(-1)
        heappush(a, x)
     
    print(-sum(a))
main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): #startline-------------------------------------------
    N,M =map(int,input().split())
    A = list(map(int,input().split()))
    heap = []
    for i in range(N):
        heappush(heap,-A[i])
    for i in range(M):
        p = -heappop(heap)//2
        heappush(heap,-p)
    print(-sum(heap))
    
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

N,K,Q = LI()
A = [0 for i in range(Q)]
for i in range(Q):
    A[i] = int(input()) - 1

cnt = {}

for i in range(N):
    cnt[i] = 0

for a in A:
    cnt[a] += 1

for i in range(N):
    if K - Q + cnt[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if S == Sunny:
  print(Cloudy)

if S == Cloudy:
  print(Rainy)

if S == Rainy:
  print(Sunny)

Submission status: Runtime Error

Solution code:
n, m, *a = map(int, open(0).read().split())
new_a = sorted(a, key=lambda x: -x)
sum = 0
for _ in range(m):
    new_a[0] /= 2
    new_a.sort(key=lambda x: -x)
for price in new_a:
    sum += int(price)
print(sum)

Submission status: Runtime Error

Solution code:
l = stdin.readline().rstrip().split()
print(l)

Submission status: Runtime Error

Solution code:
input = input(“天気を入力：”)
items = {'Sunny': 'Cloudy', 'Cloudy':'Rainy', 'Rainy': 'Sunny'}
print( items[input] )

Submission status: Runtime Error

Solution code:
input = input(“天気を入力：”)
items = {'Sunny': 'Cloudy', 'Cloudy': ‘Rainy’, 'Rainy': 'Sunny'}
print( items[input] )

Submission status: Runtime Error

Solution code:
input = input(“天気を入力：”)
items = {'apple': 100, 'banana': 200, 'orange': 400}
print( items[input] )

Submission status: Runtime Error

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

if today == 'Sunny':
  num = 0
elif today == 'Cloudy':
  num = 1
elif today == 'Rainy':
  num = 2

print(S[num + 1])

Submission status: Runtime Error

Solution code:
n=int(input())
S= input()
import math

C=[]
M=0
for i in range(n):
    for j in range(i+1, n):
        if S[i]==S[j]:
            C.append([i,j])
if C!=[]:
    T=[[c[1]-c[0],c[0]] for c in C]
    T.sort()
    k=T[0][0]
    A=[[[],k]]
    i=0
    for t in T :
        if t[0]==k:
            A[i][0].append(t[1])
        else:
            k=t[0]
            A.append([[],k])
            i+=1
            A[i][0].append(t[1])
    for a in A:
        N=len(a[0])
        m=1
        for j in range(N-1):
            if a[0][j+1]-a[0][j]==1:
                m+=1
            elif m>M:
                M=min(m,a[1])
                m=1    
        if m>M:
            M=min(m,a[1])
print(M)

Submission status: Runtime Error

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

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())
S= input()
C=[]
k=0
for i in range(n):
    for j in range(i+1, n):
        if S[i]==S[j]:
            C.append([i,j])
while C != [] :
    k+=1
    t=[]
    for c in C:
        if c[0]+k < c[1] and c[1]+k  in range(len(S)) and S[c[0]+k]==S[c[1]+k]:
            t.append(c)
    C=t        
print(k)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
 
def zal(s):
    i = 1
    j = 0
    _N = len(s)
    Z = [0]*_N
    Z[0] = _N
    res = 0
    while i < _N:
        while i + j < _N and s[j] == s[i+j]:
            j += 1
        Z[i] = j
 
        if Z[i] <= i:
            res = max(res, Z[i])
 
        if j == 0:
            i += 1
            continue
        k = 1
        while i + k < _N and k + Z[k] < j:
            Z[i+k] = Z[k]
 
            if Z[i+k] <= i+k:
                res = max(res, Z[i+k])
 
            k += 1
        i += k
        j -= k
    return res
 
ans = 0
for i in range(N):
    _S = S[i:]
    res = zal(_S)
    ans = max(ans, res)
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
li = ["Sunny","Cloudy","Rainy"]
id = 0

if s == "Sunny":
  id = 1
elif s == "Cloudy:
  id = 2
else:
  id = 0
  
print(li[id])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
list = [int(i) for i in input().split()]
while(m):
  num = list.index(max(list))
  m -= 1
print(sum(list))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q  = map(int, input().split())
score = np.zeros(N)
for i in range(Q):
  num = int(input())
  score[num] += 1

for i in range(N):
  if score[i] > Q-K:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
S = input()
str_list = [*S]
even_str = str_list[0::2]
odd_str = str_list[1::2]
if ("L" in even_str):
  print('No')
elif ("R" in odd_str):
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
import heapq
N, M = [int(_) for _ in input().split()]
H = [-int(_) for _ in input().split()]
heapq.heapify(H)
ans = 0
for _ in range(M):
    a = heapq.heappop(H)
    heapq.heappush(H, a / 2)
print(-sum(int(a) for a in H))

Submission status: Runtime Error

Solution code:
# 一日ごとに晴れ(Sunny)、くもり(Cloudy)、雨(Rainy)

weather_forecast {
	'Sunny': 'Cloudy',
	'Cloudy': 'Rainy',
	'Rainy': 'Sunny'
}

print(weather_forecast[intput()])

Submission status: Runtime Error

Solution code:
#Sunny
#Cloudy
#Rainy

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = str(input())
dp = [[0 for i in range(N+1)] for i in range(N+1)]

for i in reversed(range(N)):
    for j in reversed(range(N)):
        if S[i] == S[j]:
            dp[i][j] = dp[i+1][j+1] + 1
ans = 0
for i in range(N):
    for j in range(N):
        if j > i:
            tmp = min(j-i,dp[i][j])
            ans = max(tmp,ans)
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
dp = [[0]*(N+1) for _ in range(N+1)]
for i in range(N)[::-1]:
    for j in range(N)[::-1]:
        if S[i] == S[j]:
            dp[i][j] = dp[i+1][j+1] + 1

print(max(max(min(dp[a][b], a-b) for a in range(b, N)) for b in range(N)))

Submission status: Runtime Error

Solution code:
today_weather = input('')

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

Submission status: Runtime Error

Solution code:
N=int(input())
S=list(input())

dp=[[0 for _ in range(i)] for i in range(N)]
#dp[i][j]:i文字目とj文字目からの共通文字の最大長さ(i>j)

for i in range(N-1):
  if S[i]==S[N-1]:
    dp[N-1][i]=1

for i in reversed(range(N-1)):
  for j in range(i):
    if S[i]==S[j]:
      dp[i][j]=dp[i+1][j+1]+1
      if j+dp[i][j]-1>=i:
        dp[i][j]=i-j

A=[]
for i in range(N):
  for j in range(i):
    A.append(dp[i][j])

print(max(A))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
 
stringCount = int(input())
targetString = input()
 
maxCount = stringCount // 2
 
for exclusionCount in range(maxCount):
    count = maxCount - exclusionCount
 
    for i in range(maxCount):
        if (i + count * 2) > stringCount:
            break
 
        word = targetString[i:count]
        end = stringCount - len(word)
        if (targetString.count(word, 0, end) > 1):
            print('{}'.format(count))
            sys.exit()
 
print('0')

Submission status: Runtime Error

Solution code:
n, k, q = map(int, input().split())
A = [0]*n
for i in range(n):
  a = int(input())
  A[a-1]+=1
for j in range(n):
  if A[j] > q-k :
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
# coding: utf-8
# Your code here!
l=input()
if(l=="Sunny"):
    ans="Cloudy"
if(l=="Cloudy"):
    ans="Rainny"
if(l=="Rainny"):
    ans="Sunny"
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline

# Input
s = [input() for i in range(2)]

N = int(s[0].split()[0])
M = int(s[0].split()[1])
A = list(map(int, s[1].split()))

A.sort(reverse=True)

# 2で割って小数点切り下げする操作を大きい金額から順次M回繰り返す
for i in range(M):
    A[A.index(max(A))] = max(A) // 2

P = sum(A)

# Output
print(P)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
N_original = N

ans = 0
isleft = True

def f(n):
    for i in range(N_original - n+1):
        temp = S[i:i+n]
        if temp in S[i+n:]:
            return True
    return False

left = 0
right = N
N = N//4
while True:
    if f(N):
        if left == N:
            ans = left
            break
        left = N
    else:
        if right == N:
            ans = right
            break
        right = N
    N = (left + right)//2
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
weather = ["Sunny", "Cloudy", "Rainy", "Sunny"]
s = input()
for c, i in weather:
    if i == s:
        print(weather[c+1])
        break

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(map(str, input().strip()))
seed = 13331
mod = 10 ** 9 + 7
lsd = [1] * 6000
hs = [1] * 6000
hs[0] = ord(s[0]) - ord('a')
for i in range(1, n):
    lsd[i] = lsd[i - 1] * seed % mod
    hs[i] = (hs[i - 1] * seed + ord(s[i]) - ord('a')) % mod


def check(x):
    from collections import defaultdict
    g = defaultdict(int)
    for i in range(n - x + 1):
        if i:
            t = (hs[i + x - 1] - hs[i - 1] * lsd[x]) % mod
        else:
            t = hs[i + x - 1]
        # print(i,t)
        if not g[t]:
            g[t] = i+1
        elif g[t] + x - 1 <= i:
            return True
    return False



l = 0
r = n
while l < r - 1:
    m = (l + r) // 2
    if check(m):
        l = m
    else:
        r = m - 1

if check(r):
    print(r)
else:
    print(l)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
price_list = sorted(list(map(int,input().split())),reverse = True)
for num in range(m):
    price_list[0] = price_list[0]//2
    price_list = sorted(price_list,reverse = True)
sum(price_list)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
weat = ['Sunny', 'Cloudy', 'Rainy', 'Sunny']
for c in weat:
  if c == S:
    print(weat[weat.index(c)+1])
    break

Submission status: Runtime Error

Solution code:
# coding: utf-8

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

Submission status: Runtime Error

Solution code:
# coding: utf-8

weather = input("Today's weather:")
if weather == "Sunny":
    print("Cloudy")
elif wether == "Cloudy":
    print("Rainy")
elif wether == "Rainy":
    print("Sunny")

Submission status: Runtime Error

Solution code:
# coding: utf-8

wether = input("Today's weather:")
if weather == "Sunny":
    print("Cloudy")
elif wether == "Cloudy":
    print("Rainy")
elif wether == "Rainy":
    print("Sunny")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def z_arr(s):

    Z = [0] * len(s)
    Z[0] = len(s)

    rt = 0
    lt = 0

    for k in range(1, len(s)):
        if k > rt:
            n = 0
            while n + k < len(s) and s[n] == s[n + k] and n < k:
                n += 1
            Z[k] = n
            if n > 0:
                lt = k
                rt = k + n - 1
        else:

            p = k - lt
            right_part_len = rt - k + 1

            if Z[p] < right_part_len:
                Z[k] = Z[p]
            else:
                i = rt + 1
                while i < len(s) and s[i] == s[i - k] and i-k+1 < k:
                    i += 1
                Z[k] = i - k

                lt = k
                rt = i - 1
    return Z

N = int(input())
S = input()
answer = 0
for i in range(N-1):
    ZZ = z_arr(S[i:])
    # print(ZZ)
    temp_max = max(ZZ[1:])
    if answer < temp_max:
        answer = temp_max
print(answer)

Submission status: Runtime Error

Solution code:
def z_arr(s):

    Z = [0] * len(s)
    Z[0] = len(s)

    rt = 0
    lt = 0

    for k in range(1, len(s)):
        if k > rt:
            n = 0
            while n + k < len(s) and s[n] == s[n + k] and n < k:
                n += 1
            Z[k] = n
            if n > 0:
                lt = k
                rt = k + n - 1
        else:

            p = k - lt
            right_part_len = rt - k + 1

            if Z[p] < right_part_len:
                Z[k] = Z[p]
            else:
                i = rt + 1
                while i < len(s) and s[i] == s[i - k] and i < k:
                    i += 1
                Z[k] = i - k

                lt = k
                rt = i - 1
    return Z

N = int(input())
S = input()
answer = 0
for i in range(N-1):
    ZZ = z_arr(S[i:])
    # print(ZZ)
    temp_max = max(ZZ[1:])
    if answer < temp_max:
        answer = temp_max
print(answer)

Submission status: Runtime Error

Solution code:
def calc_length(s: str, l1: int, l2: int, n: int) -> int:
  max_len = min([l2 - l1, n - l2])
  for i in range(1, max_len):
    if s[l1 + i] != s[l2 + i]:
      return i
  return max_len

n = int(input())
s = input()

longest = 0
for l1 in range(n - 2, -1, -1):
  for l2 in range(l1 + longest + 1, n):
    if s[l1] == s[l2]:
      length = calc_length(s, l1, l2, n)
      if length > longest:
        longest = length

print(longest)

Submission status: Runtime Error

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]


N, M = [int(i) for i in input().split()]
A = sorted([int(i) for i in input().split()])
for i in range(M):
    A[-1] = A[-1]//2
    A = sorted(A)
print(sum(A))

Submission status: Runtime Error

Solution code:
import sys
s = sys.argv
weathers = ['Sunny', 'Cloudy', 'Rainy']
for i, weather in enumerate(weathers):
    if s == weather:
        return weathers[(i+1)%3]

Submission status: Runtime Error

Solution code:
import sys
s = sys.argv
weathers = ['Sunny', 'Cloudy', 'Rainy']
for i, weather in enumerate(weathers):
    if s == weather:
        return weathers[i+1]

Submission status: Runtime Error

Solution code:

n = int(input())
ab = str(input())

ans = set([0])
lenab = len(ab)
for h in range(lenab):
    abc = ab[h:]
    lenabc = lenab - h
    A = [0] * lenabc
    i = 1; j = 0
    midlen = lenabc//2
    while i < lenabc:
        while i+j < lenabc and abc[j] == abc[i+j] and j < midlen:
            j += 1
        if not j:
            i += 1
            continue
        A[i] = j
        ans.add(j)
        k= 1
        while lenabc-i > k < j - A[k]:
            A[i+k] = A[k]
            k += 1
        i += k; j -= k

print(max(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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