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:
import math
import re
import copy

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()
d = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(d[s])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
cnt=7
l=["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in l:
	if s==i:print(cnt)
	cnt-=1

Submission status: Accepted

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

Submission status: Accepted

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

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:
print(7 - ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'].index(input()))

Submission status: Accepted

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

Submission status: Accepted

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

print( 7 - dl.index(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = [
  "MON",
  "TUE",
  "WED",
  "THU",
  "FRI",
  "SAT",
  "SUN"
]

s = input()
if s == "SUN":
  print(7)
else:
  print(6 - data.index(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:
import sys
input = sys.stdin.readline
def main():
    S = input().rstrip()
    days = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
    today = days.index(S)
    ans = 7 - today
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

l = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
idx = l.index(s)

print(7-idx)

Submission status: Accepted

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

print(8-d[S])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(7):
    if y[i]==s:
        break

print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = str(input())

week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
week.reverse()

index = week.index(s)
print(index+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

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

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

for d in week:
    if d==s:
        print(7-week.index(d))

Submission status: Accepted

Solution code:
import sys

a= ['SAT','FRI','THU','WED','TUE','MON','SUN']
b=input()
c = a.index(b) + 1

print(c)

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()
S = ['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7 - S.index(s))

Submission status: Accepted

Solution code:
a=str(input())
L=[" ","SAT","FRI","THU","WED","TUE","MON","SUN"]
for i in range(8):
    if a==L[i]:
        print(i)

Submission status: Accepted

Solution code:
import sys
a=str(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:
s=input()
li=["MON","TUE","WED","THU","FRI","SAT","SUN"]
if s=="SUN":
  print(7)
else:
  print(6-(li.index(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

if S == "SUN":
  print("7")
elif S[2] == "N":
  print("6")
elif S[2] == "E":
  print("5")
elif S[2] == "D":
  print("4")
elif S[2] == "U":
  print("3")
elif S[2] == "I":
  print("2")
else:
  print("1")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
S = input()

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

if S == "SUN":
    print(7)
else:
    sun_ind = week.index("SUN")
    today_ind = week.index(S)
    
    print(sun_ind - today_ind)

Submission status: Accepted

Solution code:

s = input()
arr = [7,6,5,4,3,2,1]
if s == "SUN":
    print(arr[0])
elif s == "MON":
    print(arr[1])
elif s == "TUE":
    print(arr[2])
elif s == "WED":
    print(arr[3])
elif s == "THU":
    print(arr[4])
elif s == "FRI":
    print(arr[5])
elif s == "SAT":
    print(arr[6])

Submission status: Accepted

Solution code:
s = input()
m = {"SUN": 7, "MON": 6, "TUE": 5, "WED": 4, "THU": 3, "FRI": 2, "SAT": 1}
print(m[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: #SAT
    print (1)

Submission status: Accepted

Solution code:
# ABC146A

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

Submission status: Accepted

Solution code:
s = input()
 
weekday = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
 
idx = -1
for i, w in enumerate(weekday):
  if w == s:
    idx = i
 
print(7 - idx)

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)
else:
  print(1)

Submission status: Accepted

Solution code:
W = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
print(7 - W.index(input()))

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()
week=['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(7):
    if s==week[i]:
        ans=7-i
print(ans)

Submission status: Accepted

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

print(next_sunday[input()])

Submission status: Accepted

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

for i in DAY:
    if S == i:
        break
    count += 1
print(7 - count)

Submission status: Accepted

Solution code:
S = str(input())

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

print(7 - week.index(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = "SUN,MON,TUE,WED,THU,FRI,SAT"
S = S.split(",")

print(7-S.index(input()))

Submission status: Accepted

Solution code:
s = str(input())
w = ["MON","TUE","WED","THU","FRI","SAT"]
if s == "SUN":
    print("7")
else:
    print(7-(w.index(s)+1))

Submission status: Accepted

Solution code:
import fileinput

days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
i = days.index(input())

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

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:
def ABC_146_A():
    S = input()
    list = ['SUN','MON','TUE','WED','THU','FRI','SAT']
    print(7-list.index(S))

if __name__ == '__main__':

    ABC_146_A()

Submission status: Accepted

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

for i in range(len(a)):
  if S == a[i]:
    print(len(a) - i)

Submission status: Accepted

Solution code:
s = input()
li = range(1,8)
if(s == 'SUN'):
    print(li[6])
elif(s == 'MON'):
    print(li[5])
elif(s == 'TUE'):
    print(li[4])
elif(s == 'WED'):
    print(li[3])
elif(s == 'THU'):
    print(li[2])
elif(s == 'FRI'):
    print(li[1])
elif(s == 'SAT'):
    print(li[0])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    days = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}
    S = input()
    print(days[S])
    return 0
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
w = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]

s = input()

print(6-w.index(s)+1)

Submission status: Accepted

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


def main():
    d = ['SUN','MON','TUE','WED','THU','FRI','SAT']
    s = input().rstrip()
    print(7 - d.index(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
a=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-a.index(input()))

Submission status: Accepted

Solution code:
# A - Can't Wait for Holiday
s = input()
c_list = ['MON','TUE','WED','THU','FRI','SAT','SUN']
if s == 'SUN':
    print(7)
else:
    print(6-c_list.index(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

s = S()
W = ['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(len(W)):
    if s == W[i]:
        print(7-i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Can't Wait for Holiday

week = ['MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
S = str(input())
print(7 - week.index(S) - 1 if S != 'SUN' else 7)

Submission status: Accepted

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

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:
week = ['SUN','MON','TUE','WED','THU','FRI','SAT']

print( 7 - week.index(input()) )

Submission status: Accepted

Solution code:
S = input()
for idx, s in enumerate(['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'][::-1]):
    if S == s:
        print(idx+1)

Submission status: Accepted

Solution code:
s = input()
l = ['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
for i in l:
    if i == s:
        print(l.index(i) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

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:
S = input()
A =['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON','SUN']
for i in range(7):
  if A[i] == S:
    print(i+1)
    break

Submission status: Accepted

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

Submission status: Accepted

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

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

List=["SUN","MON","TUE","WED","THU","FRI","SAT"]
List.reverse()

for i in range(len(List)):
    if List[i]==S:
        print(i+1)

Submission status: Accepted

Solution code:
n = input()

t = []
t.append('SUN')
t.append('MON')
t.append('TUE')
t.append('WED')
t.append('THU')
t.append('FRI')
t.append('SAT')

print(7 - (t.index(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)
else:
  print(1)

Submission status: Accepted

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

idx = lst.index(s)

if s == 'SUN':
    print(7)
else:
    print(6-idx)

Submission status: Accepted

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

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:
W=['MON','TUE','WED','THU','FRI','SAT','SUN']
S=input()
for i in range(7):
    if W[i]==S:
        if i==6:
            print(7)
        else:
            print(6-i)

Submission status: Accepted

Solution code:
w = ['MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
S = input()
res = abs(w.index("SUN") - w.index(S))
if res == 0:
    res = 7
print(res)

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')
else:
    print('1')

Submission status: Accepted

Solution code:
week =input()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
arr =['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7-arr.index(S))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  2 21:05:25 2020

@author: Kanaru Sato
"""

s = input()
days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

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

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:
week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
s = str(input())
ans = 0

for i in range(7):
    if week[i]==s:
        ans = 7 - i

print(ans)

Submission status: Accepted

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

print(d[input()])

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc146/tasks/abc146_a

S = input()
week_list =  ['SUN','MON','TUE','WED','THU','FRI','SAT']

S_week = week_list.index(S)

ans = 7 - S_week

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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:
s = input()
d = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}

print(d[s])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str):
    weeks = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
    print(7 - weeks.index(S))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S.strip())


if __name__ == '__main__':
    main()

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)
elif S == "SUN":
    print(7)

Submission status: Accepted

Solution code:
import os

def main():
	lists = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
	s = input()
	l = lists.index(s)
	print(7-l)

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

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

Submission status: Accepted

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

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()
ls = ['MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
for i in ls:
    if s == i:
        p = ls.index(s)

if s == 'SUN':
    print(7)
else:
    print(ls.index('SUN') - p)

Submission status: Accepted

Solution code:

s=input()
yobi="SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
for i in range(7):
    if s==yobi[i]:
        print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N = input()

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
date = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
date_rvs = date[::-1]
print(date_rvs.index(input())+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:
n = input()
n_list = ["MON","TUE","WED","THU","FRI","SAT","SUN"]
count = 7
for i in range(7):
    count -= 1
    if n == n_list[i]:
        break
if count == 0:
    count = 7
print(count)

Submission status: Accepted

Solution code:
s=input()
A=["SUN","MON","TUE","WED","THU","FRI","SAT"]
b=A.index(s)		#Aの中にあるsの場所を返す
print(7-b)

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()
week = ['SUN','MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
s_idx = week.index(S)

print(7 - s_idx)

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

S = str(inputS())

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

for i in range(8):
  if S == l[i]:
    print(int(i))

Submission status: Accepted

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

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()
L=['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7-L.index(S))

Submission status: Accepted

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

Submission status: Accepted

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