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

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

print(d.index(s))

Submission status: Accepted

Solution code:
S = input()
sl = ['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(len(sl)):
  if sl[i] == S:
    print(len(sl[i:]))
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os
import time

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    S = iss()
    key = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    time.sleep(1.98)
    print(7 - key.index(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    S = iss()
    key = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    print(7 - key.index(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
diffs = range(1, 8)[::-1]
next_sunday = {d: i for d, i in zip(days, diffs)}
print(next_sunday[S])

Submission status: Accepted

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

Submission status: Accepted

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

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:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

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

s = input()

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

Submission status: Accepted

Solution code:
s = input()
x = [ '0', 'SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
for i in range(len(x)):
     if s == x[i]:
          print(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)
else:
  raise ValueError

Submission status: Accepted

Solution code:
S = input()

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

if S == A[0]:
    ans = 7
elif S == A[1]:
    ans = 6
elif S == A[2]:
    ans = 5
elif S == A[3]:
    ans = 4
elif S == A[4]:
    ans = 3
elif S == A[5]:
    ans = 2
elif S == A[6]:
    ans = 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
days = ['HGOE', 'SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
for i in range(8):
    if days[i] == s:
        print(i)
        exit(0)

Submission status: Accepted

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

print(7-s)

Submission status: Accepted

Solution code:
s = input()

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

if s == 'SUN':
  print(7)
else:
  print(dic['SUN']-dic[s])

Submission status: Accepted

Solution code:
S = input()

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

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

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

Submission status: Accepted

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

S = input()

print(week.index(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:
# 初期入力
S =input()

youbi =[ "MON","TUE","WED","THU","FRI","SAT","SUN" ]
nanitigo =youbi.index(S)
kotae =0
if S == "SUN":
    kotae = 7
else:
    kotae =6-nanitigo
print(kotae)

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

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']
for i in range(7):
  if s==l[i]:print(7-i)

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

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

youbi = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
youbi.reverse()
print(youbi.index(s)+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def PL(L) : print(*L, sep="\n")

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

S = input()
d = weeks.index(S)

print(7 - d)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

i=input()

if i in S:
  print(7-S.index(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)
else:
    print(1)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

answer = answers.get(S)

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
D=['SUN','MON','TUE','WED','THU','FRI','SAT']
print(7-(D.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)
elif s == 'SAT': print(1)

Submission status: Accepted

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

a=input()

print(7-(l.index(a)))

Submission status: Accepted

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

s = input()
print(sun_dic[s])

Submission status: Accepted

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

S = input()

for i in range(7):
  if S == L[i]:
    x = i
    break
print(7-x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import Counter, deque

INF = float('inf')
weekly = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']


def main():
    S = input().rstrip()
    index = weekly.index(S)
    print(-(index - len(weekly)))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

S = input()

ans = 0

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

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from fractions import gcd                    # for Python3.4.3


def main():
    mod = 10000007                  # 10^9+7
    inf = float('inf')
    input = sys.stdin.readline      # 改行文字が残ることに注意
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def ii():  return int(input())
    def mi():  return map(int, input().rstrip().split())
    def lmi(): return list(map(int, input().rstrip().split()))
    def li():  return list(input().rstrip())
    
    s = input().rstrip()
    day =  ['SUN','MON','TUE','WED','THU','FRI','SAT']
    print(7 - day.index(s))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin

S = stdin.readline().rstrip()
days  = ["MON","TUE","WED","THU","FRI","SAT","SUN"]

if S == "SUN":
    print(7)
else:
    i = days.index(S)
    print(6 - i)

Submission status: Accepted

Solution code:
import sys
s = input()

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

if s == "SUN":
    print(7)
    sys.exit()
for i in range(len(day_list)):
    if s == day_list[i]:
        print(i)

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)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 146: A – Can't Wait for Holiday
weekdays = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - weekdays.index(input()))

Submission status: Accepted

Solution code:
items = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
S = input()
print(*[7-i for i, ii in enumerate(items) if ii == S], sep = '\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()
week = ["MON", "TUE", "WED", "THU", "FRI", "SAT","SUN"]

for i in range(7):
    if s ==week[i]:
       # print(i)
        break
ans = 6 -i
if ans == 0:
    ans = 7
print(ans)

Submission status: Accepted

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

print((-1 * W.index(S)) + 7)

Submission status: Accepted

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

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:
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=="SAT":
    print(1)
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)

Submission status: Accepted

Solution code:
a = ('SUN,MON,TUE,WED,THU,FRI,SAT')
b = a.split(',')
n = input()
for i in range(7):
    if b[i] == n:
        ans = 7 - i  
        print(ans)

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:
S = input()
days = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
days.reverse()
i = 0
while days[i] != S:
  i += 1
print(i + 1)

Submission status: Accepted

Solution code:
#A 
s = input()

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

print(7 - days.index(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

print(7-lis.index(S))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
days = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
day_to_x = {x: 7 - i for i, x in enumerate(days)}

print(day_to_x[S])

Submission status: Accepted

Solution code:
s = input()

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

for i in range(7):
	if d[i] == s:
		print(i+1)

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
day = day[::-1]
i = day.index(S)
print((i+1))

Submission status: Accepted

Solution code:
import sys

day = 'SUN, MON, TUE, WED, THU, FRI, SAT'.split(', ')
table = dict(zip(day, range(7, 0, -1)))

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

def main():
    print(table[s])

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = week.index(s)
print(7-s)

Submission status: Accepted

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

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()
weekday = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]

for i in range(7):
    if weekday[i] == S:
        break

print(7-i)

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

Submission status: Accepted

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

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:
st=input()
if st=="SUN":
     print("7")
elif st=="MON":
    print("6")
elif st=="TUE":
    print("5")
elif st=="WED":
    print("4")                                                 
elif st=="THU":
    print("3") 
elif st=="FRI":
    print("2") 
elif st=="SAT":
    print("1")

Submission status: Accepted

Solution code:
def main():
    day = input()
    days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
    days_dict = {days[i]:7-i for i in range(len(days))}
    print(days_dict[day])

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
S = input()

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

print(list.index(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#S,T,D = map(int,input().split())
#S,T = input().split()
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:
T=['SUN','MON','TUE','WED','THU','FRI','SAT']

S=str(input())

for i in range(7):
    if T[i]==S:
        print(7-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)
else:
  print(1)

Submission status: Accepted

Solution code:

import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

# 多次元配列
# dp = [[0] * 3 for _ in range(5)]
d = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
# 入力を受け取る
print(d[input()])

Submission status: Accepted

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

Submission status: Accepted

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

S = input()

ans = (0 - days.index(S)) % 7

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

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:
List=["MON","TUE","WED","THU","FRI","SAT","SUN"]
s=input()
num=List.index(s)
print (6-num if (num!=6) else 7)

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':
    A = 7
elif S == 'MON':
    A = 6
elif S == 'TUE':
    A = 5
elif S == 'WED':
    A = 4
elif S == 'THU':
    A = 3
elif S == 'FRI':
    A = 2
elif S == 'SAT':
    A = 1
print(A)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
S = input()

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

i = 0
while i <= 6:
    if week_list[i] == S:
        print(i+1)
        break
    else:
        i = i+1