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

print(ans)

Submission status: Accepted

Solution code:
S = input()

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

print(d.get(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)
else:
    pass

Submission status: Accepted

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

s_num = s.index(S)
print(7 - s_num)

Submission status: Accepted

Solution code:
#a=int(input())
#a,b,c=map(int, input().split())
#c=list(map(int, input().split()))
L=['SUN','MON','TUE','WED','THU','FRI','SAT']
S=str(input())
N=L.index(S)
if N==0:
  print(7)
else:
  print(7-N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
days = ['SUN','MON','TUE','WED','THU','FRI','SAT']
s = input().rstrip()
index = days.index(s)
for i in range(7):
    ni = (index + i + 1) % 7
    if days[ni] == 'SUN':
        print(i + 1)
        break

Submission status: Accepted

Solution code:
S=input()

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

print(7-index)

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


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    s = inputs[0]
    weekly = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    c = 7
    index = None
    for i in range(len(weekly)):
        if s == weekly[i]:
            return c - i


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
mlmis = lambda: [-int(x) for x in input().split()]
INF = float('inf')
#

def main():
    d = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
    i = d.index(input())
    print(7-i)

main()

Submission status: Accepted

Solution code:
#coding:utf-8
from collections import deque
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True

def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]


    s = input()

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




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
list = ["SUN","MON","TUE","WED","THU","FRI","SAT"] 

target = input()

for i in range(7):
    if list[i] == target:
        out = 7-i
        break
print(out)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

if __name__ == '__main__':
    s = sys.stdin.readline().strip()
    solve(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC146 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
s = si()
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:

def calc(s):
    if s == 'SUN':
        return 7
    elif s == 'MON':
        return 6
    elif s == 'TUE':
        return 5
    elif s == 'WED':
        return 4
    elif s == 'THU':
        return 3
    elif s == 'FRI':
        return 2
    else:
        return 1


s = input()
print(calc(s))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(7-n)

Submission status: Accepted

Solution code:
S = input()

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

print(7-youbi.index(S))

Submission status: Accepted

Solution code:
import heapq as h
import math
import numpy as np
import copy
import itertools

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

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

Submission status: Accepted

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

index = days.index(s)

ans = 7 - index
print(ans)

Submission status: Accepted

Solution code:
s = input()

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

print(7 - youbi.index(s))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

day = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
p = [7, 6, 5, 4, 3, 2, 1]

idx = day.index(s)
# print(idx, p[idx])
print(p[idx])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = "SUN, MON, TUE, WED, THU, FRI, SAT".split(", ")
index = T.index(S)
ans = 7 - index
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=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()
weak = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
if s == "SUN":
    print(7)
else:
    index = weak.index(s)
    print(7-index)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

def main():
    s = input().strip()
    if s[:2] == 'SU':
        print(7)
    elif s[:2] == 'MO':
        print(6)
    elif s[:2] == 'TU':
        print(5)
    elif s[:2] == 'WE':
        print(4)
    elif s[:2] == 'TH':
        print(3)
    elif s[:2] == 'FR':
        print(2)
    elif s[:2] == 'SA':
        print(1)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
from sys import stdin

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

s = stdin.readline().rstrip()
if s == "SUN":
    print(7)
    exit()
print(7-li.index(s)-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

s = input()

if s == 'SUN':
  print(7)
  exit()
print((7 - days.index(s))%7)

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

i = youbi.index(S)

print(7 - i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
d = input()

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

Submission status: Accepted

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

print(7 - week.index(S))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()

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

Submission status: Accepted

Solution code:
n=input()
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()
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
else:
  ans = 1

print(ans)

Submission status: Accepted

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

S = input()

print(holiday_dict[S])

Submission status: Accepted

Solution code:
def examA():
    S = SI()
    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)

    return


def examB():
    return

def examC():
    return

def examD():
    return

def examE():
    return

def examF():
    return

import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

dict = dict()
dict["SUN"] = 7
dict["MON"] = 6
dict["TUE"] = 5
dict["WED"] = 4
dict["THU"] = 3
dict["FRI"] = 2
dict["SAT"] = 1

print(dict[S])

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

import os
import sys


def main():
    S = inp()

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


###############################################################################

DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

ind = D.index(S)

print(7-ind)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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=='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()

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

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

S = input()
i = a.index(S)
print((-i - 1) % 7 + 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()
list = {'SUN':7, 'MON':6, 'TUE':5, 'WED':4, 'THU':3, 'FRI':2, 'SAT':1}
print(list[S])

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(7 - pos)

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:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


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


# B
def B():
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    A()
    return


# Solve
if __name__ == "__main__":
    A()

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

s = input()
# n = INT()
# print(a, b)
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()

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

print(m[s])

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
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()

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()
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" ]
id = days.index(S)
print(7-id)

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math

#import bisect

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def main():
#    h,w,a,b = map(int, input().split())
    s=input()
    a=0
    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
#    a = [[0] * i for i in range(h)]

    print(a)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(week[day])