Problem:


Score : 100 points

Problem Statement

Given is a string S representing the day of the week today.

S is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.

After how many days is the next Sunday (tomorrow or later)?

Constraints

S is SUN, MON, TUE, WED, THU, FRI, or SAT.

Input

Input is given from Standard Input in the following format:

S

Output

Print the number of days before the next Sunday.

Sample Input 1

SAT

Sample Output 1

1

It is Saturday today, and tomorrow will be Sunday.

Sample Input 2

SUN

Sample Output 2

7

It is Sunday today, and seven days later, it will be Sunday again.



Sample input:
SAT


Sample output:
1

Submission status: Runtime Error

Solution code:
import collections
n=int(input())
a,b,c,d=[],[],[],[]
for i in range(n):
    b.append([])
for i in range(n-1):
    a.append(list(map(int,input().split())))
for i in range(n-1):
    j=0
    d.append(a[i][0])
    d.append(a[i][1])
    while True:
        if j not in b[a[i][0]-1] and j not in b[a[i][1]-1]:
            c.append(j)
            b[a[i][0]-1].append(j)
            b[a[i][1]-1].append(j)
            break
        j+=1
print(collections.Counter(d).most_common()[0][1])
for i in range(n-1):
    print(c[i]+1)

Submission status: Runtime Error

Solution code:
import sys

def digit(N):
    cnt = 1
    while(N >= 10):
        cnt = cnt + 1
        N = int(N/10)

    return cnt

def price(A,B,N):
    return A*N + B * digit(N)

def affordable(X,A,B,N):
    if(X >= price(A,B,N)):
        return True
    else:
        return False

if __name__ == '__main__':
    s = sys.argv.split()
    A = int(s[1])
    B = int(s[2])
    X = int(s[3])
    upper = int(min([int(X/A),10**9]))
    
    while( (upper > 0) and (not affordable(X,A,B,upper)) ):
        print( price(A,B,upper) )
        upper = upper - 1

    print(upper)

Submission status: Runtime Error

Solution code:
import math

A, B, X = map(int, input().split())

# Nがとりうる最大値
L_M = X // A

if L_M < 1:
    print(0)
    exit()

if L_M >= 1 and (X - (int(math.log10(L_M)) + 1) * B) // A > 10 ** 9:
    print(10 ** 9)
    exit()

if L_M >= 1:
    while True:
        if A * L_M + B * (int(math.log10(L_M)) + 1) <= X:
            if L_M > 10 ** 9:
                print(10 ** 9)
            else:
                print(L_M)
            exit()
        elif L_M <= 0:
            print(0)
            exit()
        else:
            L_M -= 1
else:
    print(0)

Submission status: Runtime Error

Solution code:
inputStr = input().split()
intA = int(inputStr[0])
intB = int(inputStr[1])
intX = int(inputStr[2])

intN = 0
sum = 0

while(sum < intX):
  sum = intA * intN + intB * len(str(intN))
  intN+=1

print(intN - 2)

Submission status: Runtime Error

Solution code:
s = input()
weeks_dict = ["MON":1,"TUE":2,"WED":3,"THU":4,"FRI":5,"SAT":6,"SUN":7]
if(s=="SUN"):
    print(7)
else:
    print(7 - weeks_dict[s])

Submission status: Runtime Error

Solution code:
import math

a,b,x = map(int,input().split())

i = 1
num = 1
while (x - b*i) / a >= num:
	i += 1
	num *= 10

i -= 1
num //= 10
hikaku = (x - b*i) / a
#hikaku = min(hikaku,10**i-1)

if i > 9:
	print(1000000000)
elif i == 0:
	print(0)
else:
	#print(math.floor(hikaku))
	for n in range(math.floor(hikaku)-2,num*10):
		if a * n + b * i >= x:
			break
	print(n-1)

Submission status: Runtime Error

Solution code:
def f(N,S):
    alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    ret_s = ""
    for s in S:
        num = (alpha.index(str(s)) + int(N))
        if num <= 25:
            pass
        else:
            num = num-(num//26)*26
        ret_s += alpha[num]
    return print(ret_s)

a = input()
b = input()

f(a,b)

Submission status: Runtime Error

Solution code:
def f(N,S):
    alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    ret_s = ""
    for s in S:
        num = (alpha.index(str(s)) + int(N))
        if num <= 25:
            pass
        else:
            num = num-(num//26)*26
        ret_s += alpha[num]
    return print(ret_s)

a = input()
b = input()

Submission status: Runtime Error

Solution code:
import math
input_list = list(map(int, input().split()))
a = input_list[0]
b = input_list[1]
x = input_list[2]

a_check = math.floor(x / a)
b_check = math.floor(pow(x / b, 10))

if (a_check < 1) | (b_check < 1):
    print(0)
    exit()
elif a_check <= b_check:
    n = a_check
elif b_check <= a_check:
    n = b_check

if n > 1000000000:
    n = 1000000000

def n_check(n_):
    if a * n_ + b * len(str(n_)) <= x:
        return True

while n_check(n) != True:
    n -= 1
    n_check(n)
print(n)

Submission status: Runtime Error

Solution code:
mapping = {
  "SUN": 0,
  "MON": 1,
  "TUE": 2,
  "WED": 3,
  "THU": 4,
  "FRI": 5,
  "SAT": 6,
}


S = input()
return 7-mapping[S]

Submission status: Runtime Error

Solution code:
SAN=7
MON=6
TUE=5
WED=4
THU=3
FRI=2
SAT=1
x=input()	
print(x)

Submission status: Runtime Error

Solution code:
A,B,X=map(int,input().split())
N=0
while A*N+B*len(str(N))<X:
    N+=10000
    
N-=10000
while A*N+B*len(str(N))<X:
    N+=1000

N-=1000
while A*N+B*len(str(N))<X:
    N+=100

N-=100
while A*N+B*len(str(N))<X:
    N+=10

N=N-10
while A*N+B*len(str(N))<X:
    N+=1
print(N-1)

Submission status: Runtime Error

Solution code:
a,b,x=map(int,input().split())
if a+b>x:
  print(0)
  exit()
k=(x-b)//a+1

while k>0:
  n=a*k+len(str(k))*b

  if n<=x:
    if n>10**9:
      print(10**9)
      exit()
    print(k)
    exit()
  k-=1

Submission status: Runtime Error

Solution code:
a,b,x = map(int, input().split() )

x_s = str(x)
n = len(x_s)#桁数

cnt = 0

if(a * 1 + b > x):
  cnt = 0
elif( x >= a * 1000000000 + b * 10):
  cnt = 1000000000
else:
  for i in range( int(x//a), -1, -1 ):
    i_s = str(i)
    n = len(i_s)
    #print(a * i + b * n)
    if( a * i + b * n <= x ):
      cnt = i
      break
  

print(cnt)

Submission status: Runtime Error

Solution code:
a = input()
b = input()

N = int(a)
S = b

alpha_dict = {chr(c): i+1 for i, c in enumerate(range(ord('A'), ord('Z')+1))}

st =""

for c in S:
    n = alpha_dict[c]
    n = n + N
    if (n > 26):
        n = n - 26
    keys = [k for k, v in alpha_dict.items() if v == n]
    st += str(keys[0])
    
print(st)

Submission status: Runtime Error

Solution code:
def input():
    return sys.stdin.readline()[:-1]
a, b, x = map(int, input().split())
ans = x // a
if(ans):
    if(ans>1000000000): ans = 1000000000
    elif(b * len(str(ans)) > ans):
        while(ans>0):
            if(ans * a + len(str(ans)) * b > x):
                ans -= 1
            else: break
    else:    
        diff = x - b * len(str(ans))
        ans = diff // a
print(ans)

Submission status: Runtime Error

Solution code:
def is_upper(c):
  return ord('A') <= ord(c) and ord(c) <= ord('Z')
def shift(c, k):
  if is_upper(c):
    return chr((ord(c) - ord('A') + k) % 26 + ord('A'))
  else:
    return c
def caesar(s, k):
  return "".join([shift(c, k) for c in s])
N = int(input())
S = input()
enc = caesar(S, N)
print(enc)

Submission status: Runtime Error

Solution code:
a, b, x = map(int, input().split())
e = False
first = True
n = 0
chk = ''

if a * 1000000000 + b * len(str(1000000000)) <= x:
    print(1000000000)
    exit()

if x - (a+b) > 0:
    n = a+b-1
    
    
while e == False:
    p = a * n + b * len(str(n))
    if p <= x:
        chk = 'kaeru'
    elif p > x:
        chk += 'kaenai'
    if first == True and chk == 'kaenai':
        print(0)
        break
        
    if chk == 'kaerukaenai':
        print(n - 1)
        break
    n += 1
    first = False

Submission status: Runtime Error

Solution code:
A, B, X = map(int, input().split())

n = int(X / A)

while X < A * n + B * len(str(n)):
    n -= 1

if n > 1000000000:
    n = 1000000000

if n < 0:
    n = 0

print(n)

Submission status: Runtime Error

Solution code:
A, B, X = map(int, input().split())

n = 10 ** (len(str(X)) - 1)
n = int(X / A)

while X < A * n + B * len(str(n)):
    n -= 1

if n > 1000000000:
    n = 1000000000

if n < 0:
    n = 0

print(n)

Submission status: Runtime Error

Solution code:
n = int(input())
i_s = input()
out = ''
for s in i_s:
       s = ord(s)
       s = s + n
       if s >= 91 :
            s=s%26 + 25
       s = chr(s)
       out += s

print(out)

Submission status: Runtime Error

Solution code:
import math

[a,b,x] = [int(a) for a in input().split()]

start = 0
end = int(1e9)

cost = 0
while start <= end:
	n = int(start+(end-start)/2)
	cost = a * n + b * len(str(n))
	# if cost == x:
	# 	break
	if cost < x:
		start = n+1;
	else:
		end = n-1;

print(max(0, start-1))

Submission status: Runtime Error

Solution code:
s = input()

if s == "SUN":
  print("7")
elif s == "MON":
  print("6")
elif s == "TUE":
  print("5")
elif s == "WED":
  print("4")
elif s == "THU":
  print("3")
elif s == "FRI":
  print("2")
else
  print("1")

Submission status: Runtime Error

Solution code:
a,b,x = list(map(int,input().split()))

if(x<a+b):
    print(0)
    exit()

# 桁数を求める
r=0
s=0
j=0
for i in range(10):
    j+=1         # Nの桁数
    r=10**i      # j桁の最小整数
    s=a*r+b*j
    if(s>x):
        break    # j桁の最小数がxを超えた

# Nはj-1桁
j=j-1

xr = x - b*j
n = xr // a
if (n>10**9):
    n=10**9

#print('j: {}'.format(j))

print(n)

Submission status: Runtime Error

Solution code:
a,b,x = map(int, input().split())

s = int(x/a)
X = x - b*len(str(s))
if X < 0:
  print(0)
  exit()

for i in range(s,-1,-1):
  if a*i+b*len(str(i)) <= x:
    if i >= 10**9:
      print(10**9)
      exit()
    print(i)
    exit()
print(0)

Submission status: Runtime Error

Solution code:
move_num = int(input())
input_char_str = input()

char_list  = [chr(i) for i in range(65, 65+26)]

ans_char = ""
move_number = move_num
for input_char in input_char_str:
    if (char_list.index(input_char)+move_number) < len(char_list):
        ans_char += char_list[char_list.index(input_char)+move_number]
    else:
        char_index = (char_list.index(input_char)+move_number) - len(char_list)
        ans_char += char_list[char_index]
        
print(ans_char)

Submission status: Runtime Error

Solution code:
a=input()
if a=='SUN':
  print(7)
elif a=='MON':
  print(6)
elif a=='TUE':
  print(5)
elif a=='WED':
  pirnt(4)
elif a=='THU':
  print(3)
elif a=='FRI':
  print(2)
elif a=='SAT':
  print(1)
end

Submission status: Runtime Error

Solution code:
a=input()
if a=='SUN':
  print(7)
elif a=='MON':
  print(6)
elif a=='TUE':
  print(5)
elif a=='WED':
  pirnt(4)
elif a=='THU':
  print(3)
elif a=='FRI':
  print(2)
elif a=='SAT':
  print(1)
else:
  pass

Submission status: Runtime Error

Solution code:
str = input()

day = {"MON":1, "TUE":2, "WED":3, "THU":4, "FRI":5, "SAT":6 "SUN":7}

print(day["SUN"]() - day[str]())

Submission status: Runtime Error

Solution code:
s=input()
if s is 'SUN':
  print(7)
if s is 'MON:
  print(6)
if s is 'TUE':
  print(5)
if s is 'WED:
  print(4)
if s is 'THU':
  print(3)
if s is 'FRI:
  print(2)
if s is 'SAT':
  print(1)

Submission status: Runtime Error

Solution code:
a=input()
if a=='SUN':
  print(7)
elif a=='MON':
  print(6)
elif a=='TUE':
  print(5)
elif a=='WED':
  pirnt(4)
elif a=='THU':
  print(3)
elif a=='FRI':
  print(2)
elif a=='SAT':
  print(1)

Submission status: Runtime Error

Solution code:
import math
import sys

(A,B,X) = map(int,input().split())


if X < A * 1 + B:
    print(0)
    exit(0)
for i in range(1,10): 
    if X < A * 10**i  + B * (i+1) : 
        print ( (X - B * i)  // A )
        exit(0)

print(10**9)

Submission status: Runtime Error

Solution code:
import math

A,B,X = input().split()
A = int(A)
B = int(B)
X = math.floor(int(X))
N = 0
tmp = 0
while tmp < X:
    tmp = A * N
    tmp += B * len(str(N))
    N += 1
if A == B:
    N += 1
print(N-2)

Submission status: Runtime Error

Solution code:
s=input()
l=[SUN,MON,TUE,WED,THU,FRI,SAT]
print(7-l.index(s))

Submission status: Runtime Error

Solution code:
a=input()
if a=='SUN':
  print(7)
elif a=='MON':
  print(6)
elif a=='TUE':
  print(5)
elif a=='WED':
  pirnt(4)
elif a=='THU':
  print(3)
elif a=='FRI':
  print(2)
else:
  print(1)

Submission status: Runtime Error

Solution code:
num_price, digit_price, budget = map(int, input().split())
min_by_digit = {x: int('1'+'0'*x) * num_price + (x+1) * digit_price for x in range(0, 10)}

max_digit = 0
for i in range(0, 10):
    if min_by_digit[i] > budget:
        break
    else:
        max_digit = i+1

if max_digit == 0:
    print("0")
    exit(0)

if max_digit == 10:
    print("1000000000")
    exit(0)

least = int('1'+'0'*(max_digit-1))
ans = min((budget - (digit_price * max_digit)) // num_price, least*10-1)
print(ans)

Submission status: Runtime Error

Solution code:
str = input()
if str=="SUN":
  print(7)
elif str=="MON":
  print(6)
elif str=="TUE":
  print(5)
elif str=="WED":
  print(4)
elif str=="THU":
  print(3)
elif str=="FRI":
  print(2)
else str=="SAT":
  print(1)

Submission status: Runtime Error

Solution code:
N = [input() for i in range(1)]
str = [input() for i in range(1)]
STRING=str[0]
enc = ""

for i in list(STRING):
    ASCII = ord(i)
    num = ASCII - 65
    num = (num + int(N[0])) % 26
    ASCII = num + 65
    enc += chr(ASCII)
print(enc)

Submission status: Runtime Error

Solution code:
a=input()
if a=='SUN':
  print(7)
elif a=='MON':
  print(6)
elif a=='TUE':
  print(5)
elif a=='WED':
  pirnt(4)
elif a=='THU':
  print(3)
elif a=='FRI':
  print(2)
elif a=='SAT':
  print(1)
else:
  pass

Submission status: Runtime Error

Solution code:
S = input()
Dictionary = {"SAT":1,"FRI":2,"THU":3,"WED":4,"TUE":5,"MON":6,"SUN":7}
Day = Dictionary[S]
print(DAY)

Submission status: Runtime Error

Solution code:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s = input()
    if s == 'SUN':
        print(7)
    if s == "MON":
        print(6)
    if s == "TUE":
        print(5)
    if s == "WED":
        print(4)
    if s == "THU":
        print(3)
    if s == "FRI":
        print(2)
    if s == "SAT":
        print(1)
    return


# B
def B():
    al = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    n = I()
    s = S()
    for i in range(len(s)):
        ni = (al.index(s[i]) + n) % 26
        s[i] = al[ni]
    print(''.join(s))
    return


# C
def C():
    a, b, x = LI()
    l = [a * (10 ** (i - 1)) + b * i for i in range(1, 11)]
    p = 0
    for i in range(10):
        if x < l[i] and i == 0:
            print(0)
            return
        if l[i] <= x and i == 9:
            print(10 ** 9)
            return
        elif l[i] <= x < l[i + 1]:
            p = i + 1
            break
    if (x - b * p) // a >= 10 ** p:
        print(10 ** p - 1)
    else:
        print((x - b * p) // a)
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    C()

    return


# Solve
if __name__ == "__main__":
    C()

Submission status: Runtime Error

Solution code:
S = input()

if S == 'SUN':
    print('7')
elif S == 'MON':
    print('6')
elif S == 'TUE':
    print('5')
elif S == 'WED':
    print('4')
elif S == 'THU':
    print('3')
elif S == 'FRI':
    print('2')
else S == 'SUT':
    print('1')

Submission status: Runtime Error

Solution code:
a,b,x = map(int, input().split())

s = int(x/a)

for i in range(s,-1,-1):
  if a*i+b*len(str(i)) <= x:
    if i >= 10**9:
      print(10**9)
      exit()
    print(i)
    exit()
print(0)

Submission status: Runtime Error

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

n_s = ""

for c in s:
    add = n
    c_num = ord(c) - 64
    if(n % 26 == 0):
        n_s += c
    else:
        if(c_num + n > 26):
            add = (c_num + n) % 26
            n_s += chr(add + 64)
        else:
            n_s += chr(c_num + add + 64)

print(n_s)

Submission status: Runtime Error

Solution code:
A,B,X = map(int,input().split())
#print(A,B,X)
out=0
for i in range(X):
	num = i
	price = A*num+B*len(str(num)) #Nの金額
	if price < X:
		out = num
	else:
		break

print(out)

Submission status: Runtime Error

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

ns = []

for ch in S:
        
    if ('A' <= ch and ch <= 'Z'):
        ns.append(chr((ord(ch) - ord('A') + N) % 26 + ord('A')))

O = "".join(ns)
print(O)

Submission status: Runtime Error

Solution code:

def main():
    N = input()
    S = raw_input()
    ch = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q","R","S", "T", "U", "V", "W", "X", "Y", "Z"]
    ans=""
    for i in S:
        #print(i)
        ind = ch.index(i)+N
        ans+= ch[ind%26]

    print(ans)


if __name__=="__main__":
    main()

Submission status: Runtime Error

Solution code:
S = input()

if S == ("SUN"):
    pritn(7)
elif S == ("MON"):
    print(5)
elif S == ("TUE"):
    print(4)
elif S == ("WED"):
    print(3)
elif S == ("THU"):
    print(2)
elif S == ("FRI"):
    print(1)
elif S == ("SAT"):
    print(1)

Submission status: Runtime Error

Solution code:
str = input()
#days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

if str =="SUN":
  print(str(7))
else if str = "MON":
  print(str(6))
else if str = "TUE":
  print(str(5))
else if str = "WED":
  print(str(4))
else if str = "THU":
  print(3)
else if str = "FRI":
  print(2)
else if str = "SAT":
  print(1)

Submission status: Runtime Error

Solution code:
days=['SUN','MON','TUE','WED','THU','FRI','SAT']
in_day=input()
inx=days.index(in_day)
out_day=7-inx
print(days[out_day])

Submission status: Runtime Error

Solution code:
S = input()

if S == ("SUN"):
    pritn(7)
elif S == ("MON"):
    print(6)
elif S == ("TUE"):
    print(5)
elif S == ("WED"):
    print(4)
elif S == ("THU"):
    print(3)
elif S == ("FRI"):
    print(2)
elif S == ("SAT"):
    print(1)

Submission status: Runtime Error

Solution code:
str = input()
#days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

if str =="SUN":
  print(7)
else if str = "MON":
  print(6)
else if str = "TUE":
  print(5)
else if str = "WED":
  print(3)
else if str = "THU":
  print(3)
else if str = "FRI":
  print(2)
else if str = "SAT":
  print(1)

Submission status: Runtime Error

Solution code:
s = input()
if s == "SUN":
    print 7
if s == "MON":
    print 6
if s == "TUE":
    print 5       
if s == "WED":
    print 4
if s == "THU":
    print 3        
if s == "FRI":
    print 2    
if s == "SAT":
    print 1

Submission status: Runtime Error

Solution code:
if S=="SUN":
  print(7)
elif S=="MON":
  print(6)
elif S=="TUE":
  print(5)
elif S=="WED":
  print(4)
elif S=="THU":
  print(3)
elif S=="FRI":
  print(2)
elif S=="SAT":
  print(1)

Submission status: Runtime Error

Solution code:
days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']

s = input()

days_till_next_sunday = len(days) - days.index(s)

print(days_till_next_sunday)

Submission status: Runtime Error

Solution code:

s = input()

d = ['SUN', 'MON', 'TUE', 'WEN', 'THU', 'FRI', 'SAT']

if s == 'SUN':
  print(0)
else:
  print(7- d.index(s))

Submission status: Runtime Error

Solution code:
cha=str(input())
if(cha==SUN):
  print(7)
if(cha==SAT):
  print(1)
if(cha==FRI):
  print(2)
if(cha==THR):
  print(3)
if(cha==WED):
  print(4)
if(cha==TUE):
  print(5)
if(cha==MON):
  print(6)

Submission status: Runtime Error

Solution code:
S = input()
if S = ' SUN ':
	print(7)
elif S = ' MON ':
	print(6)
elif S = ' TUE ':
	print(5)
elif S = ' WED ':
	print(4)
elif S = ' THU ':
	print(3)
elif S = ' FRI ':
	print(2)
elif S = ' SAT ':
	print(1)
else:
  print(-1)

Submission status: Runtime Error

Solution code:
S=input()
Day={"SUN":"7","MON:"6","TUE":"5","WED":"4","THU":"3","FRI":"2",
    "SAT":"1"}
print(Day[S])

Submission status: Runtime Error

Solution code:
s = input()

d = ['SUN', 'MON', 'TUE', 'WEN', 'THU', 'FRI', 'SAT']

index = 7- d.index(s)

print(index)

Submission status: Runtime Error

Solution code:
s=input()
if s=="SUN":
    print(7)
elif s=="MON":
    print(6)
elif s=="TUE":
    pirnt(5)
elif s=="WED":
    print(4)
elif s=="THU":
    print(3)
elif s=="FRI":
    print(2)
else:
    print(1)

Submission status: Runtime Error

Solution code:
rot = int(input())
s = input()
g = (chr((ord(c) - ord('A') + rot) % 26 + ord('A')) for c in s)
print(g)

Submission status: Runtime Error

Solution code:
 = input()
lst = {"MON":0,"TUE":1,"WED":2,"THU":3,"FRI":4,"SAT":5,"SUN":6}

ans = lst[S]
if ans == 6:
    print(7)
else:
    print(7-ans-1)

Submission status: Runtime Error

Solution code:
s = input()
d = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRY', 'SAT']
print(7 - d.index(s))

Submission status: Runtime Error

Solution code:
def main():
	a = {"SUN" : 0,
	"SAT" : 6,
	"FRI" : 5,
	"THI" : 4, 
	"WED" : 3,
	"TUE" : 2,
	"MON" : 1}
	s = input()
	print(7-a[s])
	
main()

Submission status: Runtime Error

Solution code:
S=int(input())
MON=6
TUE=5
WED=4
THU=3
FRI=2
SAT=1
SUN=0
print(7-S)

Submission status: Runtime Error

Solution code:
S = input()
week_list = ["SUN", "MON", "TUE", "WED", "THE", "FRI", "SAT"]
print(7 - week_list.index(S))

Submission status: Runtime Error

Solution code:
lis = ["SUN","MON","TUE","WEN","THU","FRI","SAT"]
s = str(input())
print((7-lis.index(s))%7)

Submission status: Runtime Error

Solution code:
import sys

lines = sys.stdin.readlines()
S = lines[0]

lst = ['SUN','MON','TUE','WED','THU','FRI','SAT']

num = lst.index(S)
print(7 - num)

Submission status: Runtime Error

Solution code:
S = input()

if S == 'SUN':
  ans = 7
elif S == 'MON':
  ans = 6
elif S == 'TUE':
  ans == 5
elif S == 'WED':
  ans = 4
elif S == 'THU':
  ans = 3
elif S == 'FRI':
  ans = 2
elif S == 'SAT':
  ans = 1

print(ans)

Submission status: Runtime Error

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

str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alist = list(str)

print(alist)

Submission status: Runtime Error

Solution code:
day = input()
 
if(day=="SUN"):
  print(7)
elif(day=="MON"):
  print(6)
elif(day=="TUE"):
  print(5)
elif(day=="WEN"):
  print(4)
elif(day=="THU"):
  print(3)
elif(day=="FRI"):
  print(2)
elif(day=="SAT"):

Submission status: Runtime Error

Solution code:
day == input()

if(day=="SUN"):
  print(7)
elif(day=="MON"):
  print(6)
elif(day=="TUE"):
  print(5)
elif(day=="WEN"):
  print(4)
elif(day=="THU"):
  print(3)
elif(day=="FRI"):
  print(2)
elif(day=="SAT"):
  print(1)

Submission status: Runtime Error

Solution code:
s = input()
if s == 'SUN':
  print(7)
elif s == 'SAT':
  print(1)
elif s == 'MON':
  print(6)
elif s == 'TUE':
  print(5)
elif s==  'WED':
  print(4)
elif s == 'THU':
  print(3)
elif s == 'FRI':
  print(2)= input()

Submission status: Runtime Error

Solution code:
s = input()
if s == 'MAN':
    print(6)
if s == 'TUE':
    print(5)
if s == 'WED':
    print(4)
if s == 'THU':
    print(3）
if s == 'FRI':
    print(2)
if s == 'SAT':
    print(1)
if s == 'SUN':
    print(7)

Submission status: Runtime Error

Solution code:
days = ['SUN', 'MON', 'TUE', 'WED', 'THU',' FRI', 'SAT']
S = input()
print(7 - days.index(S))

Submission status: Runtime Error

Solution code:

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<random>

//#include<boost/circular_buffer.hpp>
using namespace std;

//cout << fixed << setprecision(10);
typedef long long ll;
#define PI 3.141592653589793
#define Yes(a) a ? "Yes" : "No";
#define YES(a) a ? "YES" : "NO";
#define rep(i,n) for(int i=0;i<n;i++)

int gcd(int a, int b) {
	if (a < b) {
		int tmp = a;
		a = b;
		b = tmp;
	}
	int r = a % b;
	while (r != 0) {
		a = b;
		b = r;
		r = a % b;
	}
	return b;
}

int lcm(int a, int b) {
	long long int L;
	L = (a * b) / gcd(a, b);
	return L;
}

vector<long long  int> Prime;
void Eratosthenes(long long int n) {
	vector<bool> is_prime(n, true);
	for (int i = 2; i * i <= n; i++) {
		;
		if (is_prime.at(i)) {
			for (int j = i * i; j <= n; j += i) {
				is_prime.at(j) = false;
			}
		}
		Prime.emplace_back(i);
	}
}

/*
map<int, int> prime;
void Prime_number(long long int n) {
	for (int i = 2; i <= n; i++) {
		int count = 0;
		while (n % i == 0) {
			count++;
			n /= i;
		}
		if (count != 0) {
			prime.insert(make_pair(i, count));
		}
	}
}
*/
//std::cout.fill('0');

int main() {
	int n;
	string s;
	string str[7] = { "SUN","MON","TUE","WED","THU","FRI","SAT" };
	int k = 0;

	cin >> s;
	rep(i, 7) if (s == str[i]) { k = i; }
	cout << 7-k << endl;
}

Submission status: Runtime Error

Solution code:
arr = ['NONE', 'SAT', ' FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
s = input()
print(arr.index(s))

Submission status: Runtime Error

Solution code:
a=input()

s=['x','SAT','FRY','THU','WED','TUE','MON','SUN']

print(s.index(a))

Submission status: Runtime Error

Solution code:
a=input()
if a=="MON":
  print("6")
elif a=="SUN":
  ptint("7")
elif a=="TUE":
  print("5")
elif a=="WED":
  print("4")
elif a=="THU":
  print("3")
elif a=="FRI":
  print("2")
else:
  print("1")

Submission status: Runtime Error

Solution code:
N = input()

day_d = {\
    "SUN":7,
    "MAN":6,
    "TUE":5,
    "WED":4,
    "THU":3,
    "FRI":2,
    "SAT":1
    }

print(day_d[N])

Submission status: Runtime Error

Solution code:
arr = ['SAT','FRI','TUR','WED','TUE', 'MON','SUN']
s = input()
print(arr.index(s) + 1)

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
As = ""
for i in range(len(S)):
    As += chr(((ord(S[i]) - 65) + N) % 26 + 65)
print(As)

Submission status: Runtime Error

Solution code:
n = input()
if n == "MON":
    print("6")
elif n == "TUE":
    print("5")
elif n == "WEN":
    print("4")
elif n == "THU":
    print("3")
elif n == "FRI":
    print("2")
elif n == "SAT":
    print("1")
else n == "SUN":
    print("7")

Submission status: Runtime Error

Solution code:
S = input()

if S == "SAT":
    res = "1"
elif S == "SUN":
    res = "7"
elif S == "MON":
    res = "6"
elif S == "TUE":
    res = "5"
elif S == "WED":
    res = "4"
elif S == "THU":
    res = "3"
elif S == "Fri":
    res = "2"
print(res)

Submission status: Runtime Error

Solution code:
S=input()
if S=='SUN':
    print(7)
elif S=='MON':
    print(6)
elif S=='TUE':
    print(5)
elif S=='WED':
    print(4)
elif S=='THU':
    print(3)
elif S=='FRI':
    print(2)
elif S=='SAT'
    print(1)

Submission status: Runtime Error

Solution code:
S = input()
ans = {'SUN': 7, 'MON': 6, 'TUE': 5 'WED': 4, 'THU': 3, 'FRI': 2, 'SAT': 1}
print(ans[S])

Submission status: Runtime Error

Solution code:
def judge(S):
    if S == "SUN":
        print(7)
    if S == "MON"
        print(6)
    if S == "TUE":
        print(5)
    if S == "WED"
        print(4)
    if S == "THU":
        print(3)
    if S == "FRI"
        print(2)
    if S == "SAT":
        print(1)

S = input()
judge(S)

Submission status: Runtime Error

Solution code:
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>

using namespace std;

#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)

int main()
{
    string s;
    cin >> s;

    if (s == "SUN") {
        cout << 7 << endl;
    } else if (s == "MON") {
        cout << 6 << endl;
    } else if (s == "TUE") {
        cout << 5 << endl;
    } else if (s == "WED") {
        cout << 4 << endl;
    } else if (s == "THU") {
        cout << 3 << endl;
    } else if (s == "FRI") {
        cout << 2 << endl;
    } else {
        cout << 1 << endl;
    }

    return 0;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <queue> //priority queue
#include <stack>
#include <map> // multimap
#include <set> //multiset
#include <list> 
#include <utility> // pair
#include <iterator>
#include <deque> // insertion as both ends
#include <string>
// g1=s.substr(0,n/2);
// g2=s.substr(n/2+n%2,n/2);
#include <cctype> //isaplha
#include <iomanip>      // std::setprecision
#include <algorithm> //binary_search,sort, next_permutation in lexicographically greater permutation, fill(it1,it2,val)
#include <cmath>
#include <limits.h> //INT_MIN,INT_MAX
#include <numeric>  //iota,partial_sum,inner_product,accumulate(begin,end,num)
#include <functional>  //Arithmetic, comparators, logical
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <stdio.h> 
#include <cstring>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define pi 3.14159
#define ll long long 
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define tc int t; cin >> t; while(t--)

using namespace std;
string repeat(string s, int n) {
    string s1 = s; 
    for (int i=1; i<n;i++) 
        s += s1;
    return s; 
}
string getString(char x) {
    string s(1, x); 
    return s;    
} 

void optimizeIO(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    cout.tie(NULL);
}

vector<ll> primeFactors(ll n)  { 
    vector<ll> v;
    if(n%2==0) v.pb(2); 
    while (n % 2 == 0)  {  
        n = n/2;  
    }  
    for (ll i = 3; i <= sqrt(n); i = i + 2) {  
        if(n%i==0) v.pb(i);
        while (n % i == 0) {  
            n = n/i;  
        }  
    } 
    if (n > 2)  v.pb(n);
    return v;
}  
bool isPrime(ll n){
    if (n <= 1)  return false; 
    if (n <= 3)  return true;
    if (n%2 == 0 || n%3 == 0) return false; 
    for (ll i=5; i*i<=n; i=i+6) 
        if (n%i == 0 || n%(i+2) == 0) 
           return false; 
    return true; 
} 
int main(){
    optimizeIO();
    string x[7]={"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"}   ;
    string s;
    cin>>s;
    rep(i,0,7){
        if(x[i]==s){
            cout<<7-i<<endl;
            break;
        }
    }
}