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:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()
dic = {}
dic["SUN"] = 7
dic["MON"] = 6
dic["TUE"] = 5
dic["WED"] = 4
dic["THU"] = 3
dic["FRI"] = 2
dic["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)
else:
	print(0)

Submission status: Accepted

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

def solve():
    S = input()
    return {'SUN':7, 'MON':6, 'TUE':5, 'WED':4, 'THU':3, 'FRI':2, 'SAT':1}[S]
    



if __name__ == '__main__':
    print(solve())

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=='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, 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
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

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

S = input()

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

for i in range(7):
	if day[i] == S:
		print(7-i)
		sys.exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

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

print(m[s])

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  l=['SUN','MON','TUE','WED','THU','FRI','SAT']
  s=S()
  t=l.index(s)
  return 7-t

# main()
print(main())

Submission status: Accepted

Solution code:
import sys

S = input()

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

for i in range(7):

    if lis[i] == S:
        print (7 - i)
        sys.exit()

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:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s2i = {s:i for i, s in enumerate(["SUN","MON","TUE","WED","THU","FRI","SAT"])}
S = input()
print(7-s2i[S])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
S = ['SUN','MON','TUE','WED','THU','FRI','SAT']
k = input()
for i in range(7):
  if S[i] == k:
    print(7-i)

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
elif s == 'SAT':
    ans = 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
D = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
D = list(reversed(D))
for i,d in enumerate(D):
    if S==d:
        break
print(i+1)

Submission status: Accepted

Solution code:
s = input()
#x, y = map(int, input().split())
#in_ls = list(map(int, input().split()))
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)




#print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()
idx = x.index(s)

print(7 - idx)

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

Submission status: Accepted

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

Submission status: Accepted

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

S=input()

for index,item in enumerate(l):
    if item==S:
        print(7-index)

Submission status: Accepted

Solution code:
s = input()

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

print(s_dic[s])

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:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9

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

Submission status: Accepted

Solution code:
s = input()

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

for i in range(8):
    if s == wd[i]:
        print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
a = ['SUN','MON','TUE','WED','THU','FRI','SAT']
print({key:7-i for i, key in enumerate(a)}[S])

Submission status: Accepted

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

Submission status: Accepted

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


def solve(S: str):
    a = {'SUN':7,'MON':6,'TUE':5,'WED':4,'THU':3,'FRI':2,'SAT':1}
    print(a[S])
    return


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
#import heapq
#import itertools
#import math
#import numpy as np
#import sys

S = input()
# A,B = list(map(int, input().split()))
# S = [input() for _ in range(H)]
# T = [list(map(int,input().split())) for _ in range(N)]
# sys.exit()
if S == 'SAT' :
    print(1)
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 == 'SUN' :
    print(7)

Submission status: Accepted

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

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:
#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, 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)
	


if __name__ == '__main__':
	main()

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:
import queue
import math
import copy
"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

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

Submission status: Accepted

Solution code:
#A
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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def main():
  v = input().strip()
  i = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'].index(v)

  print(7 - i)


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
from sys import stdin

S = stdin.readline().rstrip()

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

print(7 - days.index(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    return


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:
print({s:7-i for i,s in enumerate(['SUN','MON','TUE','WED','THU','FRI','SAT'])}[input()])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
b = input()
for i, v in enumerate(a):
    if v == b:
        print(7 - i)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#SUN,MON,TUE,WED,THU,FRI,SAT
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:
# coding: utf-8
l = ["SUN","MON","TUE","WED","THU","FRI","SAT","SUN"]
S = input()
print(7 - l.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:
S = input()
ans = {'SUN': 7, 'MON': 6, 'TUE': 5, 'WED': 4, 'THU': 3, 'FRI': 2, 'SAT': 1}
print(ans[S])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    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)
resolve()

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

print(res[s])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

d = {
    'SUN': 7,
    'MON': 6,
    'TUE': 5,
    'WED': 4,
    'THU': 3,
    'FRI': 2,
    'SAT': 1,
}
s = rs()
print(d[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:
# -*- coding: utf-8 -*-

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

print(lst.index(S))

Submission status: Accepted

Solution code:
# ABC146a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

    # map(int,input().split())
    yo = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
    #n = int(input())
    s = input()[:-1]
    if yo.index(s) == 0:
        print(7)
    else:
        print(7-yo.index(s))


if __name__ == '__main__':
    main()

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

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
elif S == 'SAT':
    ans = 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
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)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    s = input()
    f = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
    for i in range(7):
        if f[i] == s:
            break
    print(7-i)
    return

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
li=['SU','MO','TU','WE','TH','FR','SA']
a = li.index(S[:2])
if(a == 0):
    print(7)
else:
    print(7-a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
SUN,MON,TUE,WED,THU,FRI,SAT = 0,1,2,3,4,5,6
print(7-eval(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

id = tmp.index(S)
print(7 - id)

Submission status: Accepted

Solution code:
import sys
import collections


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d = collections.defaultdict(int)
    d["SUN"] = 7
    d["MON"] = 6
    d["TUE"] = 5
    d["WED"] = 4
    d["THU"] = 3
    d["FRI"] = 2
    d["SAT"] = 1
    print(d[str(readline().rstrip().decode('utf-8'))])


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

S=one_str()

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

print(dicts[S])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(7-T.index(S))

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

Solution code:


def a():
    day = input()

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

    print(7 - week[day])



if __name__ == "__main__":
    a()

Submission status: Accepted

Solution code:
S = input()

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

print(T[S])

Submission status: Accepted

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

print(ans[S])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

S = sys.stdin.buffer.readline().decode().rstrip()
i = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT'].index(S)
print(7 - i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

S = input()[:-1]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input('曜日をSUN,MON,TUE,WED,THU,FRI,SATから入力 >>')
SUN = 7
MON = 6
TUE = 5
WED = 4
THU = 3
FRI = 2
SAT = 1
print('次の日曜日は{}日後です。'.format{S})

Submission status: Runtime Error

Solution code:
S = input('曜日をSUN,MON,TUE,WEN,THU,FRI,SATから入力 >>')
SUN = 7
MON = 6
TUE = 5
WED = 4
THU = 3
FRI = 2
SAT = 1
print('次の日曜日は{}日後です。'.format{S})