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

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

print(len(youbi) - youbi.index(S))

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)
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':
  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:
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


class AtCoder:
    def main(self):
        S = input().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)
        elif S == 'SAT':
            print(1)


# Run main
if __name__ == '__main__':
    AtCoder().main()

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

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

num = weeks.index(a)

print(7-num)

Submission status: Accepted

Solution code:
S = str(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:
a = input()
if a == 'MON':
    b = 6
if a == 'TUE':
    b = 5
if a == 'WED':
    b = 4
if a == 'THU':
    b = 3
if a == 'FRI':
    b = 2
if a == 'SAT':
    b = 1
if a == 'SUN':
    b = 7
print(b)

Submission status: Accepted

Solution code:
s = input()

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

for i, n in enumerate(l):
    if s == n:
        print(7-i)

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
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 MI() : return map(int, input().split())
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 chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

S = input()

day = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
index = day.index(S)

print(7 - index)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(7-day.index(s))

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
sys.setrecursionlimit(10**7)

lis = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
dic = {}
for i,s in enumerate(lis[::-1]):
    dic[s] = i+1
S = input()

print(dic[S])

Submission status: Accepted

Solution code:
def main():
    s = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

Solution code:
import sys
import math
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

print(day[s])

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    s = input().strip()
    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)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import *
from heapq import *
from fractions import gcd
import itertools
import math

sys.setrecursionlimit(10**6)

def InMap(): return list(map(int, input().split(' ')))
def In(): return int(input())
def InS(): return input()

S = InS()

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

print(res[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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    s=ST()
    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:
yo = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT", ""][::-1]
print(yo.index(input()))

Submission status: Accepted

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

s = input()

idx = lst.index(s)

print(7 - idx)

Submission status: Accepted

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

print( 7-day.index(s) )

Submission status: Accepted

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

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
sys.setrecursionlimit(10 ** 7)

s = input().rstrip()

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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


def main():
    ds = "SUN,MON,TUE,WED,THU,FRI,SAT".split(",")
    s = input()
    res = 7 - ds.index(s)
    print(res)


if __name__ == "__main__":
    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:
#coding:utf-8
s = input()
day = ['SUN','MON','TUE','WED','THU','FRI','SAT']
num = [7, 6, 5, 4, 3, 2, 1,]

for i in range(0, 7):
    if s == day[i]:
        print(num[i])

Submission status: Accepted

Solution code:
S = input()

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

s = m.get(S)

print(s)

Submission status: Accepted

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

day = 0

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

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:
#n = input()
#n = int(input())
#a,b = map(int,input().split())
#a_L = map(int,input().split())

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

s = input()

print(7-a_L.index(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def readInts():
  return [int(s) for s in input().split(" ")]

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)
  else:
    raise Exception('something wrong')

if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
n = input()

if n == 'SUN':
    print(7)
elif n == 'MON':
    print(6)
elif n == 'TUE':
    print(5)
elif n == 'WED':
    print(4)
elif n == 'THU':
    print(3)
elif n == 'FRI':
    print(2)
elif n == '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 }

ret=dic[s]
print(ret)

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:
youbi_list=["SUN","MON","TUE","WED","THU","FRI","SAT"]
nichiji=[7,6,5,4,3,2,1]

S=input()
print(nichiji[youbi_list.index(S)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

d = days.index(S)

print(7 - d)

Submission status: Accepted

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

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

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

i = x.index(S)

print(7 - i)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

S = input().strip()

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

print(7-l.index(S))

Submission status: Accepted

Solution code:
s = input()

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

  
#SUN,MON,TUE,WED,THU,FRI,SAT

Submission status: Accepted

Solution code:


x = input()


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

Submission status: Accepted

Solution code:
S = raw_input()

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

print dictionary[S]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = input()[: -1]
week = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
t = 0
for i in range(7):
  if S == week[i]:
    t = i
print(7 - t)

Submission status: Accepted

Solution code:
def read():
    S = str(input().strip())
    return S,

def solve(S):
    WEEK = ['SUN','MON','TUE','WED','THU','FRI','SAT',]
    idx = WEEK.index(S)
    return len(WEEK) - idx

if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
# A
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()
week = {'SUN': 7, 'MON':6, 'TUE': 5, 'WED': 4, 'THU': 3, 'FRI': 2, 'SAT': 1}

print(week[S])

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

print(7 - S.index(s))

Submission status: Accepted

Solution code:
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

s = ns()

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

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

Submission status: Accepted

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

s = input()

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

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:
# -*- coding: utf-8 -*-
#abc146_a
import sys
import math
import collections
#sys.setrecursionlimit(100000)

#m=int(input())

#tmp = input().split()
#d,c = list(map(lambda a: int(a), tmp))

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()
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()
d = ['MON','TUE','WED','THU','FRI','SAT','SUN']
d.reverse()
for i in range(7):
  if d[i] == s:
    if i != 0:
      print(i)
    else:
      print(7)

Submission status: Accepted

Solution code:
S = input()

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

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 == '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:
import sys

input = sys.stdin.readline

S = input().strip()

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

Submission status: Accepted

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

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

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:
#!/usr/bin/env python3
#ABC146 A

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

Submission status: Accepted

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

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

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:
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:
import sys
import math
input = sys.stdin.readline


def main():
    sc = Scan()
    s = sc.strarr()[0]
    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')


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


main()

Submission status: Accepted

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

print(dic[s])

Submission status: Accepted

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

Submission status: Accepted

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

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

I = L.index(S)

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

print(7 - wd.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:
l = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']

s = input()
ind = l.index(s)
ans = 7 - ind
if ans == 0:
    ans = 7
print(ans)

Submission status: Accepted

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


def solve(S: str):
    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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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