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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
list=[Sunny,Cloudy,Rainy]
print(list[S])

Submission status: Runtime Error

Solution code:
import math

n, m = [int(x) for x in input().split()]
a = list(map(int, input().split()))

a = sorted(a, reverse=True)

for i in range(m):
    a[0] = math.floor(a[0] / 2)
    if a[0] < a[1]:
        a = sorted(a, reverse=True)

print(sum(a))

Submission status: Runtime Error

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

p = [k - q] * n

for i in range(q):
    p[int(a[i]) - 1] += 1

for i in range(n):
    if p[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

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 i in range(m):
    a = heap.heappop(A)
    heapq.heappush(A,-1* (-a//2))
print(-sum(a))

Submission status: Runtime Error

Solution code:
S = input()

ans = ""

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

Submission status: Runtime Error

Solution code:
S = input()

ans = ""

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
 
int main(){
 string S;
 cin >> S;
 
 vector<string> w= {"Sunny", "Cloudy", "Rainy"};
 int index;
 for(int i=0; i < 3; i++){
  if(S == w[i]){
    index = i;
    break;
  }
 }
 index = (index + 1) % 3;
 cout << w[index] << endl;
 
}

Submission status: Runtime Error

Solution code:
S = list(map(str, input()))
count1 = 0
count2 = 1
while count2 < len(S):        
    if S[count2] == 'R':
        print('No')
        break
    else:
        count2 += 2
while count1+1 <= len(S):
    if S[count1] == 'L':
        print('No')
        break
    else: count +=2

else:
    print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
t = ("Sunny", "Cloudy", "Rain")
s = input()
print(t(t.index(s)+1)%3))

Submission status: Runtime Error

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

dp = [[0] * n for _ in range(n)]
for i in range(n-1, -1, -1):
    for j in range(n-1, -1, -1):
        if s[i] == s[j]:
            if j+1 <= n-1 and i+1 <= n-1:
                dp[i][j] = dp[i+1][j+1] + 1
            else:
                dp[i][j] = 1
                
for i in range(n):
    for j in range(n):
        dp[i][j] = min(abs(i-j), dp[i][j])

ans = 0
for i in range(n):
    ans = max(ans, max(dp[i]))
print(ans)

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

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

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

Submission status: Runtime Error

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

import "fmt"

func main() {
	var S string
	fmt.Scan(&S)
	weather := []string{"Sunny","Cloudy","Rainy","Sunny"}
	for i, wthr := range weather{
		if S == wthr {
			fmt.Println(weather[i+1])
			return
		}
	}
}

Submission status: Runtime Error

Solution code:
a=["Sunny","Cloudy","Rainy"]
i=a.index(ioput())
print(a[i-2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
a=""
if(s.equal("Sunny")):a="Cloudy"
if(s.equal("Cloudy")):a="Rainy";
if(s.equal("Rainy")):a="Sunny";
print(a)

Submission status: Runtime Error

Solution code:
s=input();
a="";
if(s.equal("Sunny"))
  a="Cloudy";
if(s.equal("Cloudy"))
  a="Rainy";
if(s.equal("Rainy"))
  a="Sunny";
print(a)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

s = input()

ind = 0
for t in  l:
  if s = t:
    break
  ind += 1
ind %= 2
print(l[ind])

Submission status: Runtime Error

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

s = input()

ind = 0
for t in  l:
  if s = t:
    break
  ind += 1
ind %= 2
print(l[ind]

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

Submission status: Runtime Error

Solution code:
s=input()

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

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main()
{
	vector<string> vec{"Sunny","Cludy","Rainy"};
	string s,t;
	cin >> s;
	if (s == "Sunny") {
		t = "Cludy";
	}
	else if (s == "Cludy") {
		t = "Rainy";
	}
	else if(s == "Rainy"){
		t = "Sunny";
	}
	cout << t << endl;
}

Submission status: Runtime Error

Solution code:
#include "pch.h"
#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main()
{
	string s,t;
	cin >> s;
	if (s == "Sunny") {
		t = "Cludy";
	}
	else if (s == "Cludy") {
		t = "Rainy";
	}
	else {
		t = "Sunny";
	}
	cout << t << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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:
# 最大値を見つけ、それを２で割るをチケットがなくなるまで繰り返す
# 普通にやると、最大値の選定でO(n)、それをチケット数分だけ繰り返すのでO(n*m)。
# 間に合わないので、優先度付きキューを用いる
import math

n, m = map(int, input().split())
a = [0] * n
a = list(map(int, input().split()))

a = list(map(lambda x: x*(-1), a))
heapq.heapify(a)
for _ in range(m):
    tmp = heapq.heappop(a) * (-1)
    tmp = math.floor(tmp / 2) * (-1)
    heapq.heappush(a, tmp)

print(sum(list(map(lambda x: x*(-1), a))))

Submission status: Runtime Error

Solution code:
def main():
    def func(s):
        return ord(s)-ord('a')

    n=int(input())
    s=input()
    s=[func(s[i]) for i in range(n)]
    sign=0
    ans=0
    for i in range(n-1):
        if ans>(n-i)//2: break
        for j in range(i+1,n):
            if s[j]==s[i+sign] and i+2*sign<j:
                sign+=1
    
            else:
                ans=max(sign,ans)
                sign=0
                
        ans=max(sign,ans)
        sign=0

    ans=max(sign,ans)
    print(ans)
            

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    def func(s):
        return ord(s)-ord('a')

    n=int(input())
    s=input()
    s=[func(s[i]) for i in range(n)]
    sign=0
    ans=0
    for i in range(n-1):
        for j in range(i+1,n):
            if s[j]==s[i+sign] and i+2*sign<j:
                sign+=1

            else:
                if sign>ans: ans=sign
                sign=0
        
        if sign>ans: ans=sign
        sign=0

    print(ans)
        

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    def func(s):
        return ord(s)-ord('a')

    n=int(input())
    s=input()
    s=[func(s[i]) for i in range(n)]
    sign=0
    ans=0
    for i in range(n-1):

        if ans>(n-i)/2: break

        for j in range(i+1,n):
            if s[j]==s[i+sign] and i+2*sign<j:
                sign+=1

            else:
                if sign>ans: ans=sign
                sign=0
        
        if sign>ans: ans=sign
        sign=0

    print(ans)
        

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = str(input())
dic_wet = {1:"Sunny",2:"Cloudy",3:"Rainy"}
for k , v in dic_wet.items():
    if v == S:
        print(dic_wet[(k+1) % 3])

Submission status: Runtime Error

Solution code:
S = input()
weather = ["Sunny", "Cloudy", "Rainy"]
if weather.index(S) < 2:
	print(weather[weather.index(S)+1]
else:
    print(weather[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
 
mx = 0
for i in range(1, n):
    t = 0
    for j in range(n - i):
        t = t + 1 if s[j] == s[j + i] else 0
        mx = max(mx, min(i, t))
 
print(mx)

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
 
ans = 0
for i in range(1, n):
    t = 0
    for j in range(n - i):
        t = t + 1 if s[j] == s[j + i] else 0
        ans = max(ans, min(i, t))
 
print(ans)

Submission status: Runtime Error

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

dp = [[0]*(n+1) for i in range(n+1)]

for i in reversed(range(n)):
  for j in range(i, n):
    if s[i] == s[j]:
      dp[i][j] = dp[i+1][j+1]+1


ans = 0
for i in range(n-1):
  for j in range(i, n):
    ans = max(ans, min(dp[i][j], j-i))
    
print(ans)

Submission status: Runtime Error

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

res = 0
dp = [[0]* (1+n) for _ in range(n+1)]
for i in range(n-1, -1, -1):
    for j in range(i+1, n):
        if s[i] == s[j]:
            dp[i][j] = dp[i+1][j+1] +  1

for i in range(n):
    for j in range(i, n):
        res = max(res, min(dp[i][j], j -i))
print(res)

Submission status: Runtime Error

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

res = 0
dp = [[0]* (1+n) for _ in range(n+1)]
for i in range(n-1, -1, -1):
    for j in range(i+1, n):
        if s[i] == s[j]:
          	dp[i][j] = dp[i+1][j+1]
          	if j - i > dp[i+1][j+1]:
            	dp[i][j] +=1
           	res = max(res, dp[i][j])
print(res)

Submission status: Runtime Error

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

res = 0
dp = [[0]* (1+n) for _ in range(n+1)]
for i in range(n-1, -1, -1):
    for j in range(i+1, n):
        if s[i] == s[j]:
            dp[i][j] = dp[i+1][j+1] + (j - i > dp[i+1][j+1])
            res = max(res, dp[i][j])
print(res)

Submission status: Runtime Error

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

res = 0
dp = [[0]* (1+n) for _ in range(n+1)]
for i in range(n-1, -1, -1):
    for j in range(i+1, n):
        if s[i] == s[j]:
            dp[i][j] = dp[i+1][j+1] + (j - i > dp[i+1][j+1])
            res = max(res, dp[i][j]
print(res)

Submission status: Runtime Error

Solution code:
import numpy as np

# 乱数シードを指定
np.random.seed(seed=0)

X_train = np.array([0, 1, 2])
T_train = np.array([1, 2, 0])

X_test = np.array([1, 2, 0])
T_test = np.array([2, 0, 1])

# one-hot-vectorに変換
X_train = np.eye(3)[X_train.astype("int")]
X_test = np.eye(3)[X_test.astype("int")]
T_train = np.eye(3)[T_train.astype("int")]
T_test = np.eye(3)[T_test.astype("int")]


def softmax(x):
    x = x.T
    _x = x - np.max(x)
    _x = np.exp(_x) / np.sum(np.exp(_x), axis=0)
    return _x.T
  
  
def cross_entropy_error(t, y):
    delta = 1e-8
    error = -np.mean(t * np.log(y + delta)) 
    return error
  

class SoftmaxCrossEntropyLoss():
    def __init__(self):
        self.y = None
        self.t = None
        self.loss = None
        
    def __call__(self, t, y):
        self.y = softmax(y)
        self.t = t.copy()
        self.loss = cross_entropy_error(self.t, self.y)
        return self.loss
    
    def backward(self):
        batch_size = self.t.shape[0]
        dy = self.y - self.t 
        dy /= batch_size
        return dy
      
      
class FullyConnectedLayer():
    def __init__(self, input_shape, output_shape):
        self.w = np.random.randn(input_shape, output_shape) * 0.01
        self.b = np.zeros(output_shape, dtype=np.float)
        self.x = None
        self.dw = None
        self.db = None
        
    def __call__(self, x):
        self.x = x
        out = np.dot(self.x, self.w) + self.b
        return out
    
    def backward(self, dout):
        dx = np.dot(dout, self.w.T) 
        batch_size = dx.shape[0]
        self.dw = np.dot(self.x.T, dout) 
        self.db = np.sum(dout, axis=0)
        return dx
      
      
class ReLU():
    def __init__(self):
        self.mask = None

    def __call__(self, x):
        self.mask = (x <= 0)
        out = x.copy()
        out[self.mask] = 0
        return out

    def backward(self, dout):
        dout[self.mask] = 0
        dx = dout

        return dx
      
      

# 分類モデル
class MLP_classifier():

    def __init__(self):
        '''
        構造
        x -> fc(783, 256) -> relu -> fc(256, 256) -> relu -> fc(256, 10) -> out
        '''
        
        # 層の定義
        self.fc1 = FullyConnectedLayer(3, 20)
        self.relu1 = ReLU()
        self.fc2 = FullyConnectedLayer(20, 20)
        self.relu2 = ReLU()
        self.fc3 = FullyConnectedLayer(20, 3)
        self.out = None
        
        # 損失関数の定義
        self.criterion = SoftmaxCrossEntropyLoss()

    def forward(self, x):
        '''
        順伝播
        '''
        
        x = self.relu1(self.fc1(x))
        x = self.relu2(self.fc2(x))
        self.out = self.fc3(x)
        
        # 勾配計算の都合上softmaxはこの順伝播関数内では行わない
        # 予測するときはさらにsoftmaxを通す必要がある
        return self.out

    def backward(self, t):
        '''
        逆伝播
        '''
        
        # 誤差を計算
        loss = self.criterion(t, self.out)
        # 勾配を逆伝播
        d = self.criterion.backward()
        d = self.fc3.backward(d)
        d = self.relu2.backward(d)
        d = self.fc2.backward(d)
        d = self.relu1.backward(d)
        d = self.fc1.backward(d)
        
        return loss

    def optimize_GradientDecent(self, lr):
        '''
        勾配降下法による全層のパラメータの更新
        '''
        for fc in [self.fc1, self.fc2, self.fc3]:
            fc.w -= lr * fc.dw
            fc.b -= lr * fc.db
              

# モデルの宣言
model = MLP_classifier()

# 学習率
lr = 0.005
# 学習エポック数
n_epoch = 2000

# n_epoch繰り返す
for n in range(n_epoch):
    # 訓練
    # Day1範囲外のため、ミニバッチは使用しない
    y = model.forward(X_train)
    loss = model.backward(T_train)
    model.optimize_GradientDecent(lr)
    
    # テスト
    y = model.forward(X_test)
    test_loss = model.backward(T_test)
    pred = softmax(y)
    accuracy = np.mean(np.equal(np.argmax(y, axis=1), np.argmax(T_test, axis=1)))
    #print(f'EPOCH {n + 1} | TRAIN LOSS {loss:.5f} | TEST LOSS {test_loss:.5f} | ACCURACY {accuracy:.2%}')
    #print("EPOCH", n + 1, "|", "TRAIN LOSS", loss, "|", "TEST LOSS", test_loss, "|", "ACCURACY", accuracy)
    classification_accuracy = accuracy
  
y1 = np.array([int(input())])
y1 = model.forward(np.eye(3)[y1.astype("int")])
print(np.argmax(y1, axis=1)[0])

Submission status: Runtime Error

Solution code:
s=input().split()
if s=='Sunny':
  print('Cloudy')
ifelse s=='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = str(input())
if S[-3:] = "nny":
    print(Cloudy)
elif S[-2:] = "dy":
    print(Rainy)
else:
    print(Sunny)

Submission status: Runtime Error

Solution code:
S = str(input())
if S[-3:] = "nny":
    print("Cloudy")
elif S[-2:] = "dy":
    print("Rainy")
else:
    print("Sunny")

Submission status: Runtime Error

Solution code:
N = int(input())
print(N*N*N)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
N = int(input())
n = N - N//2
print(n / N)

S = list(input())
if S[0] == 'S':
    print('Cloudy')
elif S[0] == 'C':
    print('Rainy')
elif S[0] == 'R':
    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 = raw_input()
arr=["sunny","cloudy","rainy"]
n=arr.index(s)
print arr[(n+1)%len(arr)]

Submission status: Runtime Error

Solution code:
# coding:utf-8

import random
r = random.randrange(1, 69)
s = raw_input(r)  # 获取输入数据字符串S
print s

s = raw_input()


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

arr = ["Sunny", "Cloudy", "Rainy"]
n = arr.index(s

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()
c=['Sunny','Cloudy','Rainy','Sunny']
for i,n in enumerate(c[:3]):
  if S==n:
    print(c[i+1])
	break

Submission status: Runtime Error

Solution code:
S=str(input())
c=['Sunny','Cloudy','Rainy','Sunny']
for i,n in enumerate(c[:3]):
  if S==n:
    print(c[i+1])
	break

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
A =list(map(int,input().split()))
A.sort(reverse=True)
A_len =len(A)
count =0
for l in range(0,M):
    comp = A[0]/2
    for i in range(0,A_len-1,1):
        if count >= M:
            break
        if A[i+1]<comp:
            break
        while True:
            count +=1
            if A[i]/2 > A[i+1]:
                A[i] = A[i]/2
            else:
                A[i] = A[i]/2
                break
    A.sort(reverse=True)
    if count>=M:
        break
A = [int(i) for i in A]
sumN =sum(A)
print(sumN)

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
A = [int(_) for _ in input().split()]

while M != 0:
  ind = A.index(max(A))
  A[ind] = A[ind] // 2
  M -= 1
  
print(sum(A))

Submission status: Runtime Error

Solution code:
S = input()
ans_list = ["Sunny", "Cloudy", "Rainy", "Sunny"]
for i in range(2):
  if S == ans_list[i]:
    ans = ans_list[i+1]

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if S == "Sunny":
  return "Cloudy"
elif S == "Cloudy":
  return "Rainy"
else:
  return "Sunny"

Submission status: Runtime Error

Solution code:
import sys

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

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

i = WS.index(S)
i += 1
if i == 2:
    i = 0

print(WS[i])

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
input = lambda: sys.stdin.readline()
sys.setrecursionlimit(10**8)

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

Submission status: Runtime Error

Solution code:
input(S)
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:
s=input()
if s[0]=='S':
    print('Cloudy')
else if s[0]=='C':
    print('Rainy')
else:
    print('Suuny')

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:
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		String s=sc.nextLine();
		if(s.equals("Sunny")){
			System.out.println("Cloudy");
		}else if(s.equals("Cloudy")){
			System.out.println("Rainy");
		}else{
			System.out.println("Rainy");
		}
		
	}}

Submission status: Runtime Error

Solution code:
a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in range(int(a[0])):
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

Solution code:
import bisect as b
import math

n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())))

for _ in range(m):
    half = a.pop(-1) / 2
    a.insert(b.bisect_left(a, half), half)

print(sum(list(map(lambda x: math.floor(x), 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()
if s==‘Sunny’:
    print(‘Cloudy’)
elif s==‘Cloudy’:
    print(‘Rainy’)
elif s==‘Rainy’:
    print(‘Sunny’)

Submission status: Runtime Error

Solution code:
str = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
prices = [int(i) for i in input().split()]

def discount(n,m,prices):
    for i in range(m):
        prices.sort(reverse = True)
        prices[0] //= 2
    return sum(prices)

print (discount(n,m,prices))

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# A - Weather Prediction
S = str(input())

weather = ('Sunny', 'Cloudy', 'Rainy')
if S == weather[0]:
    print(weather[1])
elif S == weather[1]:
    print(weather[2])
elif S == weather[2]:
    print(weather[3])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    n, k, q = map(int, args[0].split())
    A = list(map(int, args[1:]))
    ret = ''
    p = 0
    for a in sorted(set(A)):
        ret += ('Yes\n' if 0 < k-q else 'No\n')*(a-p-1)
        ret += ('Yes' if 0 < k - (q - A.count(a)) else 'No') + '\n'
        p = a

    ret += ('Yes\n' if 0 < k-q else 'No\n')*(n-p)
    return ret.rstrip('\n')


if __name__ == "__main__":
    nkq = input()
    _, _, q = map(int, nkq.split())
    print(solve(*([nkq]+[input() for _ in range(q)])))

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:
import numpy as np
N,K,Q = [int(i) for i in input().split()]
mem_point = np.array([K for i in range(N)])
_points = np.array([-1 for i in range(N)])
for rounds in range(Q):
  anser = int(input())
  temp = _points.copy()
  temp[anser-1] = 0
  mem_point += temp
for point in mem_point:
  if 0 < point:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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:
Wethers={"Sunny":0,"Cloudy":1,"Rainy":2}
Wether=["Sunny","Cloudy","Rainy"]
S=input()
S_id = Wethers[S]
print(Wether(S_id+1)%3)