Problem:


Score : 100 points

Problem Statement

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

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

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

Constraints

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

Input

Input is given from Standard Input in the following format:

S

Output

Print the number of days before the next Sunday.

Sample Input 1

SAT

Sample Output 1

1

It is Saturday today, and tomorrow will be Sunday.

Sample Input 2

SUN

Sample Output 2

7

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



Sample input:
SAT


Sample output:
1

Submission status: Accepted

Solution code:
from sys  import stdin,stdout

import bisect

import math

from collections import deque,Counter

mod=10**9 +7 

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")
    
def DFS(dictionary,vertex,visited):
    visited[vertex]=True
    stack=[vertex]
    print(vertex)
    while stack:
        a=stack.pop()
        for i in dictionary[a]:
            if not visited[i]:
                print(i)
                visited[i]=True
                stack.append(i)


def BFS(dictionary, vertex,visited):
    visited[vertex]=True
    q=deque()
    q.append(vertex)
    while q:
        a=q.popleft()
        for i in dictionary[a]:
            if not visited[i]:
                visited[i]=True
                q.append(i)
                print(i)

                


def soe(limit):
    l=[1]*(limit+1)
    l[0]=0
    l[1]=0
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0
    
    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r
  

def solve():
    d={'SUN':1,'MON':2,'TUE':3,'WED':4,'THU':5,'FRI':6,'SAT':7}
    s=input()
    pr(7-(d[s]-1))
    
    
for _ in range(1):
    solve()

Submission status: Accepted

Solution code:
# 入力
S = input('')

# 比較して出力
if S == str('SUN'):
    print(7)
elif S == str('MON'):
    print(6)
elif S == str('TUE'):
    print(5)
elif S == str('WED'):
    print(4)
elif S == str('THU'):
    print(3)
elif S == str('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)
else:
    print(1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

ans = 7 - L.index(S)

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:
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:
#曜日を入力する
weekday=input()

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

Submission status: Accepted

Solution code:
#何曜日かを入力
weekday = input()
#日曜日までの日数を出力
if weekday == "SUN":
    print(7)
elif weekday == "MON":
    print(6)
elif weekday == "TUE":
    print(5)
elif weekday == "WED":
    print(4)
elif weekday == "THU":
    print(3)
elif weekday == "FRI":
    print(2)
elif weekday == "SAT":
    print(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 = ["SUN","MON","TUE","WED","THU","FRI","SAT"].index(input())
print(7-s)

Submission status: Accepted

Solution code:
s=input()
dict1={7:'SUN',6:'MON',5:'TUE',4:'WED',3:'THU',2:'FRI',1:'SAT'}
keys = [k for k, v in dict1.items() if v == s]
print(keys[0])

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

Submission status: Accepted

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

# 文字列 S の入力
S = input()
# print(S)

# 何日後か求める条件文
if S == 'SUN':
    # print(7)
    answer = 7
elif S == 'MON':
    # print(6)
    answer = 6
elif S == 'TUE':
    # print(5)
    answer = 5
elif S == 'WED':
    # print(4)
    answer = 4
elif S == 'THU':
    # print(3)
    answer = 3
elif S == 'FRI':
    # print(2)
    answer = 2
elif S == 'SAT':
    # print(1)
    answer = 1

print(answer)

Submission status: Accepted

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

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:
# 146A

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:
# A - Can't Wait for Holiday

# 文字列 S の入力
S = input()
# print(S)

# 何日後か求める条件文
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:
days = ["DAYS","SAT","FRI","THU","WED","TUE","MON","SUN"]
s = str(input())
for i in days:
    if i == s:
        print(days.index(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)

else:
    print(1)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

day_of_week = input()

if day_of_week == 'SUN':
    print(week_dict[day_of_week])

else:
    days_left_to_sunday = 7 - week_dict[day_of_week]
    print(days_left_to_sunday)

Submission status: Accepted

Solution code:
#一週間　何日後は何曜日

S=input()
print()

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

i = days.index(S)

print (7-i)

Submission status: Accepted

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

if day == 'SUN':
    print('7')
elif day == 'MON':
    print('6')
elif day == 'TUE':
    print('5')
elif day == 'WED':
    print('4')
elif day == 'THU':
    print('3')
elif day == '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:
# A Can't wait for Holiday
S = input()
L =["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
ct = L.index(S)
x = 7 - ct
print(x)

Submission status: Accepted

Solution code:
s=input()
if "M" in s:
    print("6")
elif "D" in s:
    print("4")
elif "E" in s:
    print("5")
elif "H" in s:
    print("3")
elif "F" in s:
    print("2")
elif "A" in s:
    print("1")
else:
    print("7")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Submission status: Accepted

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

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

s = input()

print(l.index(s))

Submission status: Accepted

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

t = M.index(S)
print(7 - t)

Submission status: Accepted

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

print(abs(Array.index(S)-7))

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
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()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - day.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:
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:
week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - week.index(input()))

Submission status: Accepted

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

Submission status: Accepted

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

P = input()
print(7-A.index(P))

Submission status: Accepted

Solution code:
week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
s = input()
i = 1
while s != week[-i]:
    i = i + 1
print(int(i))

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

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

print(daylist[n])

Submission status: Accepted

Solution code:
S = input()

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

day = [7, 6, 5, 4, 3, 2, 1]

ans = week.index(S)

print(day[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
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    S = input()
    X = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

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






if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

i=date.index(S)
print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
day = ['','SAT','FRI','THU','WED','TUE','MON','SUN']
s = str(input())
for i in range(8):
    if s==day[i]:
        break
print(i)

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

    d = ('SUN' ,'MON' ,'TUE' ,'WED' ,'THU' ,'FRI' ,'SAT')

    ans = 7 - d.index(S)
    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
lis=['SUN','MON','TUE','WED','THU','FRI','SAT']
i=lis.index(S)
if S=='SUN':
    print(7)
else:
    for j in range(1,8):
        if lis[i-j]=='SUN':
            print(7-j)
            break

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


print(x)

Submission status: Accepted

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

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

s = input()[:-1]

print(7-day.index(s))

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
INF =  float("inf")
import bisect

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

print(Date.index(S)+1)

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(7):
  if y == youbi[i]:
    print(7-i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(1,8):
  if S == D[i]:
    print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    DW = 'SUN,MON,TUE,WED,THU,FRI,SAT'
    DW = DW.split(',')

    s = input()
    ind_sun = DW.index('SUN')
    ind_s = DW.index(s)
    diff = ind_sun - ind_s
    print(diff if diff > 0 else diff + 7)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print((-day.index(input())-1)%7+1)

Submission status: Accepted

Solution code:
s = input()

week = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
ans_dic = {k: v for k, v in zip(week, range(7, 0, -1))}

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ls = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
cnt = 0
dict = {}
for item in ls:
    dict[item] = cnt
    cnt += 1
print(7 - dict[S])

Submission status: Accepted

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

def main():

    S = input()

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

    for i, name in enumerate(week):
        if name == S:
            ans = 7 - i

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

Submission status: Accepted

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

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

day = input()

print(ary.index(day))

Submission status: Accepted

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

Submission status: Accepted

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

print(str(7 - wd.index(s) % 7))

Submission status: Accepted

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

Submission status: Accepted

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

b=input()

print(6-a.index(b) if b!='SUN' else '7')

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

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

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:
# abc146_a.py
# https://atcoder.jp/contests/abc146/tasks/abc146_a

# A - Can't Wait for Holiday /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 今日の曜日を表す文字列 Sが与えられます。
# Sは SUN,MON,TUE,WED,THU,FRI,SAT のいずれかであり、それぞれ日曜日、月曜日、火曜日、水曜日、木曜日、金曜日、土曜日を表します。
# 次の日曜日 (あす以降) が何日後か求めてください。

# 制約
#     Sは SUN,MON,TUE,WED,THU,FRI,SAT のいずれか

# 入力
# 入力は以下の形式で標準入力から与えられる。
# S

# 出力
# 次の日曜日が何日後か出力せよ。

# 入力例 1
# SAT

# 出力例 1
# 1

# 今日は土曜日です。よって、次の日曜日は 1日後です。

# 入力例 2
# SUN

# 出力例 2
# 7

# 今日は日曜日です。よって、次の日曜日は 7日後です。


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    # N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

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

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['SAT']
        lines_export = [1]
    if pattern == 2:
        lines_input = ['SUN']
        lines_export = [7]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
a = a * 2
c = 0
z = input()
for i in range(0,7):
	if z == a[i]:
		for j in range(i + 1, 14):
			if a[j] == "SUN":
				print(j - 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:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
import numpy as np
sys.setrecursionlimit(4100000)

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

if __name__ == '__main__':
    S = input()
    for i, d in enumerate(day):
        if S==d:
            print(7-i)

Submission status: Accepted

Solution code:
s = input()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
num = [7, 6, 5, 4, 3, 2, 1]
dic = dict(zip(day, num))
print(dic[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:
print(['SUN','MON','TUE','WED','THU','FRI','SAT'][::-1].index(input())+1)

Submission status: Accepted

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