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: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


s = S()

if s == 'SAT':
    print(1)
elif 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)

Submission status: Accepted

Solution code:
S = input()

k = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
for x in range(len(k)):
    if S == "SUN":
        print(7)
        exit(0)
    if S == k[x]:
        print(7-x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019-11-24 20:59:47(JST)
import sys
#import numpy as np

days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
def main():
    s = sys.stdin.readline().rstrip()
    ans = 7 - days.index(s)
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

weeklist = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

ans = 7
for w in weeklist:
    if w == S:
        break
    ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    weekdays = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
    ans = 7-weekdays.index(S)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re
import heapq


from copy import deepcopy
import itertools

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    s = input()
    day = ['SUN','MON','TUE','WED','THU','FRI','SAT']

    for i in range(len(day)):
        if day[i] == s:
            print(7-i)
            exit()
            




main()

Submission status: Accepted

Solution code:
s = input()
day = ['SUN', 'MON','TUE','WED','THU','FRI','SAT']

print(7 - day.index(s))

Submission status: Accepted

Solution code:
s = input()
d = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(len(d)):
    if s == d[i]:
        print(7-i)
        break

Submission status: Accepted

Solution code:
s=input()[:2]
if s=="SU":
    print(7)
elif s=="MO":
    print(6)
elif s=="TU":
    print(5)
elif s=="WE":
    print(4)
elif s=="TH":
    print(3)
elif s=="FR":
    print(2)
else:
    print(1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
AtCoder A
"""

import sys, math, random
import numpy as np

# N = int(input())
# A = list(map(int,input().split())) # N row 1 column
# A = [int(input()) for _ in range(N)] # 1 row N column
# S = str(input()) # str(input()) == input() -> 'abc'
# S = list(input()) # abc -> ['a','b','c']
# S.replace('ABC','X') # "testABCABC" -> "testXX"
# S=numpp.assaray(S)=="#"
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LLS(): return [list(sys.stdin.readline().rstrip()) for _ in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()



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




if __name__ == "__main__":
    main()

Submission status: Accepted

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
else: ans = 1

print(ans)

Submission status: Accepted

Solution code:
def main():
    # input
    s = input()
    li = ['SUN','MON','TUE','WED','THU','FRI','SAT']

    # calc
    for i in range(7):
        if li[i] == s:
            print(7-i)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
days = ['SUN','MON','TUE','WED','THU','FRI','SAT']
temp = [7,6,5,4,3,2,1]
idx = days.index(s)
print(temp[idx])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
dict_ = {}
for i, day in enumerate(a):
    dict_[day] = i

s = input()
out = 7 - dict_[s]
print(out)

Submission status: Accepted

Solution code:
import sys
S = input()

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

Submission status: Accepted

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: Accepted

Solution code:
S = input()

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

n = h.index(S)

print(7-n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
to=input()

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

Submission status: Accepted

Solution code:
a=input()
if a=='SUN':
    print(7)
elif a=='MON':
    print(6)
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: Accepted

Solution code:
#!/usr/bin/env python

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

ls = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = raw_input()
for i in range(7):
    if S == ls[i]:
        print 7 - i

Submission status: Accepted

Solution code:
def main():
    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)


if __name__ == "__main__":
    main()

Submission status: Accepted

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: Accepted

Solution code:
W=["SUN","MON","TUE","WED","THU","FRI","SAT"]
A=[7,6,5,4,3,2,1]

S=input()
for i in range(7):
    if W[i]==S:
        print(A[i])

Submission status: Accepted

Solution code:
s = str(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: Accepted

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

print(d[s])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
days = {'SUN': 7, 'MON': 6, 'TUE':5, 'WED':4, 'THU': 3, 'FRI':2, 'SAT':1}

print(days[s])

Submission status: Accepted

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: Accepted

Solution code:
s = str(input())
ans = int(0)
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: Accepted

Solution code:
# coding: utf-8
def main():
    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)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
ans = ""
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: Accepted

Solution code:
if __name__ == "__main__":
	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: Accepted

Solution code:
def solve():
    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)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

print(d[S])

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

Solution code:
s=input()

days=["SUN","MON","TUE","WED","THU","FRI","SAT"]

print(7-days.index(s))

Submission status: Accepted

Solution code:
s = input()
data = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(0,7):
    if data[i] == s:
        print(7-i)

Submission status: Accepted

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

s = input()


for i,x in enumerate(a):
  if s == x:
    print(7-i)

Submission status: Accepted

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

S = input().strip()

L = ['SAT','FRI','THU','WED','TUE','MON','SUN']
print(L.index(S)+1)

Submission status: Accepted

Solution code:
S = input().strip()
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: Accepted

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

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: Accepted

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: Accepted

Solution code:
s=input()
a=["SUN","MON","TUE","WED","THU","FRI","SAT","SUN"]
for i in range(7):
    if s==a[i]:
        print(7-i)
        break

Submission status: Accepted

Solution code:
import collections



S = input()
l = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
ans = 7 - l.index(S)

if ans == 0:
    ans += 7
print(( ans) )

Submission status: Accepted

Solution code:
dic = {'SUN': 7, 'MON': 6, 'TUE': 5, 'WED': 4, 'THU': 3, 'FRI': 2, 'SAT': 1}

print(dic[input()])

Submission status: Accepted

Solution code:
holidays = ["SUN","MON","TUE","WED","THU","FRI","SAT" ]
S = input()
ans = 0
for i in range(len(holidays)):
    if S == holidays[i]:
        print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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: Accepted

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: Accepted

Solution code:
S = input()
list = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(len(list)):
    if list[i] == S:
        print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
convs = dict(zip(['SUN','MON','TUE','WED','THU','FRI','SAT'],[7,6,5,4,3,2,1]))

Ss = input()

print(convs[Ss])

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
s = str(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: Accepted

Solution code:
S = input()

ans = 0

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: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ss = ['SUN', 'MON','TUE','WED','THU','FRI','SAT']

print(7-ss.index(S))

Submission status: Accepted

Solution code:
S = input().strip()

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: Accepted

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

s = input()

cnt = 0
for i in range(len(A)):
    if A[i] == s:
        cnt = i
        break

print(7-i)

Submission status: Accepted

Solution code:
s = input()
if 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("7")

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
d = {}

for i in range(6,-1,-1):
    d[a[i]] = 7-i
kkk = input()

print(d[kkk])

Submission status: Accepted

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)

Submission status: Accepted

Solution code:
s = input()

a = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

if s == a[0]:
    print(7)
elif s == a[1]:
    print(6)
elif s == a[2]:
    print(5)
elif s == a[3]:
    print(4)
elif s == a[4]:
    print(3)
elif s == a[5]:
    print(2)
elif s == a[6]:
    print(1)

Submission status: Accepted

Solution code:
def main():
    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)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import collections
import sys
day = input()
if day == 'SAT':
    print(1)
    sys.exit()
if day == 'FRI':
    print(2)
    sys.exit()
if day == 'THU':
    print(3)
    sys.exit()
if day == 'WED':
    print(4)
    sys.exit()
if day == 'TUE':
    print(5)
    sys.exit()
if day == 'MON':
    print(6)
    sys.exit()
if day == 'SUN':
    print(7)
    sys.exit()

Submission status: Accepted

Solution code:
l = ['SUN','MON','TUE','WED','THU','FRI','SAT']
s = input()
for i in range(7):
  if l[i] == s:
    print(7-i)
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = str(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: Accepted

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: Accepted

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

Submission status: Accepted

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

for i in range(7):
    if s==days[i]:
        print(7-i)
        break

Submission status: Accepted

Solution code:
S = input()

youbi = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]

print(7 - int(youbi.index(S)))

Submission status: Accepted

Solution code:
day=input()

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d=["SUN","MON","TUE","WED","THU","FRI","SAT"][::-1]
print(d.index(input())+1)

Submission status: Accepted

Solution code:
S = input()
days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
j = 0
for i in range(7):
    if days[i] == S:
        j = i
        break
print(7-j)

Submission status: Accepted

Solution code:
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
S = input()

if S == 'SUM': print(7)
else: print(7-day.index(S))

Submission status: Accepted

Solution code:
def main():
    S = input()
    d = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
    print(7 - d.index(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
S = (stdin.readline().rstrip())
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: Accepted

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: Accepted

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: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]

def main():
    s=input()
    if 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) 
    elif s=='SUN':
        print(7) 

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(7):
    if S == lst[i]:
        print (7 - i)
        exit()

Submission status: Accepted

Solution code:
s = input()

res = 0
if 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
elif s=='SAT':
    res = 1
print(res)

Submission status: Accepted

Solution code:
s = input()
if 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(7)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = 1e9+7

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def main():
    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)
    return


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys

# import numpy as np
import math
from fractions import gcd
from collections import deque
import bisect

sys.setrecursionlimit(10000)


def main():
    # map(int, input().split())
    # l = list(map(int, input().split()))
    S = input()
    d = {'SUN': 7, 'MON': 6, 'TUE': 5, 'WED': 4, 'THU': 3, 'FRI': 2, 'SAT': 1}
    print(d[S])


if __name__ == "__main__":
    main()

Submission status: Accepted

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: Accepted

Solution code:
S=input()
l=["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(7):
    if S ==l[i]:
        print(7-i)

Submission status: Accepted

Solution code:
s=input()
if 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(7)

Submission status: Accepted

Solution code:
s = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
S = input()

print(7 - s.index(S))

Submission status: Accepted

Solution code:
import sys


def main():
    # input = sys.stdin.readline
    day = input()

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

    print(7-days.index(day))


if __name__ == '__main__':
    main()