text
stringlengths 37
1.41M
|
|---|
L=list(input())
if len(set(L))==3:
print("Yes")
else:
print("No") |
line = list(input())
line.sort()
if line[0] == line[1] and line[2] == line[3] and line[1] != line[2]:
print("Yes")
else:
print("No") |
class Dice(object):
def __init__(self, line):
self.top = 1
self.bottom = 6
self.south = 2
self.east = 3
self.west = 4
self.north = 5
self.convert = [int(s) for s in line.split()]
def move(self, direction):
if 'N' == direction:
self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom
elif 'S' == direction:
self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top
elif 'W' == direction:
self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top
elif 'E' == direction:
self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom
def search(self, line):
top, south = [int(s) for s in line.split()]
for direction in 'NNNNWNNNN':
self.move(direction)
if self.convert[self.south - 1] == south:
break
for direction in 'WWWW':
self.move(direction)
if self.convert[self.top - 1] == top:
break
return self.result()
def result(self):
return self.convert[self.east - 1]
dice = Dice(input())
for i in range(int(input())):
print(dice.search(input())) |
str = [int(input()) for i in range(3)]
area = (str[0]+str[1])*str[2]/2
print(round(area)) |
a,b,c = (map(int, input().split()))
s1 = a+b
s2 = b+c
s3 = c+a
if s1==c or s2==a or s3==b:
print("Yes")
else:
print("No")
|
# coding: utf-8
# Your code here!
import math
from decimal import Decimal
a, b, c = map(int, input().split())
if Decimal(str(a * b))**Decimal('0.5') >= Decimal(str((c - a - b) / 2)):
print('No')
else:
print('Yes')
|
x = list(map(str,input().split()))
if(x[0]>x[1]):
print('>')
else:
if(x[0]<x[1]):
print('<')
else:
print('=')
|
# n choose 0, n choose 1, ..., n choose kすべて一気に求める
def binomials_p(n, k, p):
'''
Input: integers n, k such that n >= k >= 0, prime number p
Output: [n choose 0 mod p, n choose 1 mod p, ..., n choose k mod p]
'''
binomials = [1, n] # binomial[i] = n choose i mod p
inv = [0, 1] # inv[i] : inverse of i mod p
for i in range(2, k + 1):
inv.append(( inv[p % i] * (p - p//i) ) % p ) # inverse of i
binomials.append(binomials[i - 1] * (n - i + 1) * inv[i] % p)
return binomials
# a^n mod p
def exp_by_sq_p(a, n, p):
if n == 0:
exp = 1
elif n == 1:
exp = a % p
elif n % 2 == 0:
exp = exp_by_sq_p(a * a % p, n // 2, p)
else:
exp = a * exp_by_sq_p(a * a % p, (n - 1) // 2, p) % p
return exp % p
N, M, K = [int(x) for x in input().split()]
p = 998244353
binomials = binomials_p(N - 1, K, p)
ans = 0
pow = 1 # (m - 1)^0 mod p
for j in range(K + 1):
ans = (ans + binomials[K - j] * pow % p) % p
pow = pow * (M - 1) % p
ans = ans * M * exp_by_sq_p(M - 1, N - K - 1, p) % p
print(ans) |
word = raw_input()
counter = 0
while True:
line = raw_input()
if line == "END_OF_TEXT":
break
counter += line.lower().split(" ").count(word)
print counter |
import numpy as np
n = int(input())
flag = False
for i in range(n):
a = int(input())
if a %2 == 1:
flag = True
if flag:
print("first")
else:
print("second") |
n = int(input())
i = 0
list_n = [n]
map_n = map(int, input().split())
list_n = list(map_n)
for value in reversed(list_n):
print(value, end ='')
if value != list_n[0]:
print(' ', end = '')
print() |
def FactorialMod(N,Mod):
if N>=Mod:
return 0
else:
FactM = 1
for TF in range(1,N+1):
FactM = (FactM*TF)%Mod
return FactM
print(FactorialMod(int(input()),10**9+7)) |
n = int(input())
ans = ""
for i in range(1, n+1):
if (i % 3 == 0 or "3" in str(i)):
ans += " {}".format(i)
print(ans)
|
# D - Sum of Divisors
N = int(input())
# 1と自分自身はかならず約数になるので、計算から除外
f = [2] * (N + 1)
for i in range(2, N//2 + 1):
j = 2
while True:
if i * j <= N:
f[i*j] += 1
j += 1
else:
break
ans = 1
for i in range(2, N + 1):
ans += f[i] * i
print(ans)
|
c = input()
if c == "a":
print("vowel")
elif c == "i":
print("vowel")
elif c == "u":
print("vowel")
elif c == "e":
print("vowel")
elif c == "o":
print("vowel")
else:
print("consonant") |
# E - 1 or 2
from typing import List
def main():
def dfs(source: int) -> None:
stack = [source]
is_visited[source] = True
while stack:
u = stack.pop()
for v in graph[u]:
if is_visited[v]:
continue
is_visited[v] = True
stack.append(v)
N, M, *X = map(int, open(0).read().split())
graph: List[List[int]] = [[] for _ in range(N + 1)]
for x, y, _ in zip(*[iter(X)] * 3):
graph[x].append(y), graph[y].append(x)
is_visited = [False] * (N + 1)
res = 0
for i in range(1, N + 1):
if is_visited[i]:
continue
res += 1
dfs(i)
print(res)
if __name__ == "__main__":
main()
|
S = input()
ans = ''
for i, s in enumerate(S):
if i % 2 == 0:
ans += s
print(ans)
|
S = input()
S_c = S.count("o")
if(S_c==3):
print("1000")
elif(S_c==2):
print("900")
elif(S_c ==1):
print("800")
else:
print("700") |
x = int(input())
res = (x // 11) * 2 + (x % 11 + 5) // 6
print(res)
|
S=input()
if S[0]==S[1]==S[2] or S[1]==S[2]==S[3]:
print("Yes")
else:
print("No") |
N, M = map(int, input().split())
edges = {i : [] for i in range(1, N+1)}
visited = [False for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
edges[a].append(b)
edges[b].append(a)
def dfs(n, count):
# 定期便2つでは行けない
if count == 3:
return False
if n == N:
return True
visited[n] = True
for edge in edges[n]:
if visited[edge]:
continue
if dfs(edge, count + 1):
return True
return False
print("POSSIBLE" if dfs(1, 0) else "IMPOSSIBLE") |
s = input()
ans = 0
if 'RRR' in s:
ans = 3
elif 'RR' in s:
ans = 2
elif 'R' in s:
ans = 1
print(ans) |
def eratosthenes(n):
is_prime = [True for i in range(n+1)]
is_prime[0], is_prime[1] = False, False
prime = []
for i in range(2, n+1):
if is_prime[i]:
prime.append(i)
for j in range(2*i, n+1, i):
is_prime[j] = False
return prime
N = int(input())
prime = eratosthenes(55555)
ans = []
for p in prime:
if p % 5 == 1:
ans.append(p)
if len(ans) == N:
break
print(*ans)
|
miti = [[] for _ in range(5)]
for i in range(3):
a, b = map(int, input().split())
miti[a].append(b)
miti[b].append(a)
cnt_list = []
for m in miti:
cnt_list.append(len(m))
cnt_list.sort()
if cnt_list == [0, 1, 1, 2, 2]:
print("YES")
else:
print("NO")
|
n = input()
print("Yes" if n == "hi" * (len(n)// 2) else "No") |
# A - Programming Education
N = int(input())
if N == 1:
print('Hello World')
else:
ans = 0
for i in range(2):
ans += int(input())
print(ans) |
se = set([])
n = int(raw_input())
for i in range(n):
s = raw_input().split()
if s[0] == 'insert':
se.add(s[1])
elif s[0] == 'find':
if s[1] in se:
print 'yes'
else:
print 'no' |
count = int(input());
data = input().split(" ");
def bubble_sort(data):
# print(data);
count = len(data);
for i in range(count):
for j in range(count - 1, i, -1):
if data[j][1] < data[j - 1][1]:
data[j], data[j - 1] = data[j - 1], data[j];
# print(data);
def selection_sort(data):
count = len(data);
# print(data);
for i in range(count - 1):
minI = i;
for j in range(i + 1, count):
if data[j][1] < data[minI][1]:
minI = j;
if i != minI:
data[i], data[minI] = data[minI], data[i];
# print(data);
def show(data):
print(" ".join(data));
A = list(data);
bubble_sort(A);
show(A);
print("Stable");
B = list(data);
selection_sort(B);
show(B);
if A == B:
print("Stable");
else:
print("Not stable");
|
#coding:utf-8
#1_5_B 2015.4.1
while True:
length,width = map(int,input().split())
if (length,width) == (0,0):
break
for i in range(length):
for j in range(width):
if j == width - 1:
print('#')
elif i == 0 or i == length - 1 or j == 0:
print('#', end='')
else:
print('.', end='')
print() |
s=list(str(input()))
if s.count("1") >= s.count("0"):
print(2*s.count("0"))
elif s.count("1") < s.count("0"):
print(2*s.count("1")) |
n = input()
A = list(input())
B = list(input())
C = list(input())
ans = 0
for a, b, c in zip(A, B, C):
if len(set([a, b, c])) == 3:
ans += 2
elif len(set([a, b, c])) == 2:
ans += 1
print(ans)
|
x = input()
if x[-1] in 'sS':
x += 'es'
else:
x += 's'
print(x) |
import math
a,b,x = list(map(int,input().split()))
check = a*a*b/2
if x >= check:
ans = math.degrees(math.atan(2*(b/a-x/(a**3))))
else :
c_=a*b*b/2
ans = math.degrees(math.atan((c_/x)))
print(ans) |
import collections
dict_values = []
S = input()
c = collections.Counter(S)
d = len(c)
f = list(c.values())
if (d==2) and f[0]==f[1]:
print("Yes")
else:
print("No") |
x = input()
a, b = x.split()
if int(a) == int(b):
print('a == b')
elif int(a) > int(b):
print('a > b')
elif int(a) < int(b):
print('a < b') |
def main():
base_distance = int(input().rstrip())
min_distance, max_distance = (int(i) for i in input().rstrip().split(' '))
if (max_distance // base_distance) * base_distance >= min_distance:
print('OK')
else:
print('NG')
if __name__ == '__main__':
main()
|
s=input()
ans=0
if s=="SSS":
ans=0
if s=="SSR" or s=="SRS" or s=="RSS" or s=="RSR":
ans=1
if s=="RRS" or s=="SRR":
ans=2
if s=="RRR":
ans=3
print(ans) |
n = int(input())
ans = 0
for i in range(1, n+1):
if i % 3 == 0 and i % 5 == 0:
pass
elif i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
ans += i
if i >= n:
print(ans)
exit()
|
cnt=0
def insertion_sort(A, g):
global cnt
N=len(A)
for i in range(g,N):
v=A[i]
j=i-g
while j>=0 and A[j]>v:
A[j+g]=A[j]
j-=g
cnt+=1
A[j+g]=v
def shell_sort(A):
G=[]
i=1
while i<=len(A):
G.append(i)
i=i*3+1
G=G[::-1]
for g in G:
insertion_sort(A, g)
return G
N=int(input())
A=[int(input()) for _ in range(N)]
G=shell_sort(A)
print(len(G))
print(*G)
print(cnt)
for a in A:
print(a)
|
N=input()
total=0
for i in N:
total += int(i)
print('Yes' if total % 9 == 0 else 'No') |
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
#1,2,3,...,Nまでの順列の合計
#実はN(N+1)//2で表せる
def sigma(n):
return n*(n+1)//2
print(sigma(n-1)) |
a = list(input())
a.sort()
#sortメソッドを使って、順番に並べる。
# たとえbcaでもcbaでもabcの順にしてくれる
if a[0] == 'a' and a[1] == 'b' and a[2] == 'c':
print("Yes")
else:
print("No") |
s=input()
if int(s[:2])<=12 and int(s[:2])>0:
if int(s[2:4])<=12 and int(s[2:4])>0:
print("AMBIGUOUS")
else:
print("MMYY")
elif int(s[2:4])<=12 and int(s[2:4])>0:
print("YYMM")
else:
print("NA") |
X = int(input())
l = [3,5,7]
if X in l:
r = 'YES'
else:
r = 'NO'
print(r) |
s=input()
if 12<int(s[:2]) or 0==int(s[:2]):
if 12>=int(s[2:])>=1:
print("YYMM")
else:
print("NA")
elif 1<=int(s[:2])<=12:
if 12>=int(s[2:])>=1:
print("AMBIGUOUS")
else:
print("MMYY")
|
for n in input():
if n == "7":
print('Yes')
exit()
print('No') |
number = int(input())
string = input()
if number >= 3200:
print(string)
else:
print('red') |
age,fee=map(int,input().split())
if age>=13:
print(fee)
elif age<13 and age>=6:
print(int(fee/2))
else:
print(0)
|
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
n,l = map(int,input().split())
words=[]
words=[input().rstrip() for _ in range(n)]
s_words=sorted(words,key=lambda x:x[0:])
ans=""
for s_word in s_words:
ans+=s_word
print(ans)
if __name__=="__main__":
main() |
import math
def isprime(x):
if x == 2:
return True
elif x < 2 or x % 2 == 0:
return False
else:
for i in range(3, int(math.sqrt(x)) + 1,2):
if x % i == 0:
return False
return True
n = int(input())
cnt = 0
for i in range(n):
x = int(input())
if isprime(x):
cnt += 1
print(str(cnt)) |
#ABC160-A
word=str(input())
if word[3]==word[2] and word[5]==word[4]:
print('Yes')
else:
print('No') |
n=list(str(input()))
for i in n:
if i=='1':
print(9,end='')
else:
print(1,end='')
print() |
S=list(input())
s=0
op_count=len(S)-1
for i in range(2**op_count) :
op=[""]*op_count
for j in range(op_count) :
if (i>>j) & 1 :
op[j]="+"
formula=""
for p,q in zip(S,op+["+"]) :
formula+=(p+q)
formula+="0"
s+=eval(formula)
print(s)
|
a=int(1)
b=int(1)
for i in range(9):
for o in range(9):
x=int(a*b)
print(str(a)+"x"+str(b)+"="+str(x))
b+=1
a+=1
b=1
|
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
return a // gcd(a, b) * b
def isPrime(x):
if x < 2 or x % 2 == 0:
return False
if x == 2:
return True
i = 3
while i * i <= x:
if x % i == 0:
return False
i += 2
return True
def divisor(x):
res = []
i = 1
while i * i <= x:
if x % i == 0:
res.append(i)
if i * i != x:
res.append(x // i)
i += 1
res = sorted(res)
return res
def factor(x):
res = []
if x == 1:
res.push_back(1)
return res
i = 2
while i * i <= x:
while x % i == 0:
res.append(i)
x //= i
if x != 1:
res.append(x)
res = sorted(res)
return res
if __name__ == "__main__":
N,K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
sum_v = sum(A)
div = divisor(sum_v)
div = sorted(div, reverse=True)
for e in div:
ok = True
b = [int(a % e) for a in A]
b = sorted(b)
v = sum(b)
v //= e
ans = 0
for i in range(N-v):
ans += b[i]
if ans <= K:
print(e)
exit()
|
K = int(input())
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += (gcd(i,j,k))
print(ans) |
def main():
N = input()
ans = 0
for c in N:
if c == "2":
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
X = int(input())
if X>=30:
res = 'Yes'
else:
res = 'No'
print(res) |
Sa = list(input())
Sb = list(input())
Sc = list(input())
card = Sa.pop()
while 1:
if card == 'a':
if len(Sa) > 0:
card = Sa.pop(0)
else:
print('A')
break
elif card == 'b':
if len(Sb) > 0:
card = Sb.pop(0)
else:
print('B')
break
else:
if len(Sc) > 0:
card = Sc.pop(0)
else:
print('C')
break
|
a = ""
while True:
try:
a += input().lower()
except:
break
for i in range(ord("a"), ord("z")+1):
print("{} : {}".format(chr(i), a.count(chr(i))))
|
def main():
n = input()
print("".join("9" if s=="1" else "1" for s in n))
main() |
N=int(input())
S=input()
K=int(input())
letter=""
for i in S:
if i is S[K-1]:
letter +=i
else:
letter +="*"
print(letter) |
a,op,b=input().split()
if(op == "+"):
print(int(a)+int(b))
elif(op == "-"):
print(int(a)-int(b)) |
n = input()
ans = 0
for i in range(len(n)):
if n[i:i+1] == "2":
ans += 1
print(ans) |
from math import floor
N = int(input())
if N % 2 == 0:
print(round(N / 2 - 1))
else:
print(floor(N / 2)) |
a = input().lower()
cnt = 0
while 1:
c = input()
if c == 'END_OF_TEXT':
break
cnt += c.lower().split().count(a)
print(cnt)
|
a,b,h = (int(input()) for i in range(3))
print(((a+b)*h)//2)
|
S = {c: list(input()) for c in 'abc'}
s = "a"
while(S[s]):
s = S[s].pop(0)
if(S[s] == []):
print(s.upper())
break
|
A = input()
B = input()
finished = False
if len(A) > len(B):
print("GREATER")
finished = True
elif len(A) < len(B):
print("LESS")
finished = True
else:
for i in range(len(A)):
if A[i] > B[i]:
print("GREATER")
finished = True
break
elif A[i] < B[i]:
print("LESS")
finished = True
break
if not finished:
print("EQUAL")
|
n = int(input())
m = list(str(n))
f = sum([int(m) for m in m ])
print("Yes") if n%f==0 else print("No") |
values = []
while True:
value = input().split()
if int(value[0]) == 0 and int(value[1]) == 0:
break
else:
values.append(value)
for value in values:
m = int(value[0])
n = int(value[1])
for i in range(m):
row_output = ""
for j in range(n):
if i == 0 or i == m -1:
row_output += "#"
else:
if j == 0 or j == n - 1:
row_output += "#"
else:
row_output += "."
print(row_output)
print()
|
a_list = ['A', 'B', 'C', 'D', 'E', 'F']
x, y = input().split()
if int(a_list.index(x)) > int(a_list.index(y)):
print('>')
elif int(a_list.index(x)) < int(a_list.index(y)):
print('<')
else:
print('=')
|
while True:
h, w = map(int, input().split())
if h == w == 0: break
for i in range(0, h):
print(''.join(['#' for x in range(0, w)]))
print('') |
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]
def number_to_alphabet(n):
N = n-1
a = ''
while True:
d = N % 26
a = AL[d]+ a
if N == 0: break
N = N//26-1
if N < 0: break
return a
print(number_to_alphabet(n))
|
N=int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
A=make_divisors(N)
ans=0
for i in A:
if i==1:
continue
a=N//(i-1)
b=N%(i-1)
if a==b:
ans+=(i-1)
print(ans) |
# coding: utf-8
# Your code here!
# ITP1_5_A
while(True):
x,y=map(int,input().split())
if x==0 and y==0:
break
else:
for r in range(0,x):
print("#"*y)
print("")
|
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
import math
ans = 0
a, b, x = map(int, input().split())
S = x / a
if S >= (a * b / 2):
h = ((a * b - S) * 2) / a
deg = math.atan2(h, a) / (math.pi * 2) * 360
else:
w = 2 * S / b
deg = math.atan2(b, w) / (math.pi * 2) * 360
print(deg) |
s=input()
#\\///\_/\/\\\\/_/\\///__\\\_\\/_\/_/\
stack=[]
i=0
result=0
#みずたまりは、[左側の位置と、数量を表す]
mizutamari=[[-1,0]]
for item in s:
#print(stack,mizutamari)
if item=="\\":
stack.append(i)
elif item=="/":
if len(stack)>0:
temp=stack.pop()
result+=i-temp
left=mizutamari.pop()
if left[0]>temp:
vol=i-temp
while 1:
vol=left[1]+vol
mizutamari.append([temp,vol])
if len(mizutamari)<=2:
break
bk=mizutamari.pop()
bkbk=mizutamari.pop()
if bkbk<bk:
mizutamari.append(bkbk)
mizutamari.append(bk)
break
else:
left=bkbk
else:
#print(left[0],"<",temp,":","naze",left,temp)
mizutamari.append(left)
mizutamari.append([temp,i-temp])
#print(mizutamari)
i+=1
print(result)
s=""
for item in mizutamari[1:]:
s+=str(item[1])+" "
if result==0:
print(0)
else:
print(len(mizutamari)-1,s[:-1])
|
c1 = input()
c2 = input()
c3 = c1[::-1]
c4 = c2[::-1]
if c1 == c4 and c2 == c3:
print('YES')
else:
print('NO')
|
numbers = []
n = raw_input()
numbers = n.split(" ")
for i in range(3):
numbers[i] = int(numbers[i])
if numbers[0] < numbers[1] < numbers[2]:
print "Yes"
else:
print "No" |
a,b = map(int,input().split())
answer = a * b
if a*b / 2 == a*b // 2:
print("Even")
else:
print("Odd")
|
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def merge_sort(A):
N = len(A)
if N < 2:
return A, 0
mid = N//2
left, left_count = merge_sort(A[:mid])
right, right_count = merge_sort(A[mid:])
total_count = left_count+right_count
lowers = 0
answer = []
for l in left:
while lowers < len(right) and right[lowers] < l:
answer.append(right[lowers])
lowers += 1
total_count += lowers
answer.append(l)
while lowers < len(right):
answer.append(right[lowers])
lowers += 1
return answer, total_count
def solve():
N, K = read_ints()
A = read_ints()
_, left_greater = merge_sort(A)
_, right_greater = merge_sort(A[::-1])
modulo = 10**9+7
return (K*(K+1)//2*left_greater+K*(K-1)//2*right_greater)%modulo
if __name__ == '__main__':
print(solve())
|
s = raw_input()
n1, n2 = s.split()
n1 = int(n1)
n2 = int(n2)
flag = True
if n1 < 0 or n1 > 9:
flag = False
if n2 < 0 or n2 > 9:
flag = False
if flag:
print n1 * n2
else:
print -1 |
input()
S = input()
j = ""
A =""
for i in S:
if i !=j:
A += i
j = i
print(len(A)) |
n = int(input())
d = set()
for _ in range(n):
cmd, data = input().split()
if cmd == 'insert':
d.add(data)
else:
if data in d:
print("yes")
else:
print("no")
|
N = int(input())
multiplication = []
for x in range(1, 10):
for y in range(1, 10):
multiplication.append(x*y)
if N in multiplication:
print( "Yes" )
else:
print( "No" ) |
# 入力
n = int(input())
# 出力
answer = 0
for i in range(1, n + 1):
if not i % 3 == 0 and not i % 5 == 0:
answer += i
print(answer)
|
import math
r = float(input())
area = r * r * math.pi
circum = 2 * r * math.pi
print("{:f} {:f}".format(area, circum)) |
while True:
deck = input()
if deck == '-':
break
num = int(input())
shift = sum([int(input()) for i in range(num)])
print(deck[shift % len(deck):] + deck[:shift % (len(deck))])
|
name = input()
str_name = str(name)
print(str_name[:3]) |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
W, a, b = read_ints()
if a+W <= b:
return abs(a+W-b)
if b+W <= a:
return abs(b+W-a)
return 0
if __name__ == '__main__':
print(solve())
|
S=input()
num=0
ans=0
con=0
upcon=0
before="<"
for s in S:
if s==before and s=="<":
upcon+=1
num+=1
ans+=num
if s==">":
con+=1
num-=1
ans+=num
if s=="<" and before==">":
ans+=(-num)*(con+(con>upcon))
con=0
upcon=1
num=1
ans+=num
before=s
if con!=0:
ans+=(-num)*(con+(con>upcon))
print(ans) |
N=input()
n=int(N)
from itertools import product
print(sum([sum(["3" in p and "5" in p and "7" in p and int(''.join(p))<=n for p in product("357",repeat=i+1)]) for i in range(len(N))])) |
import math
from functools import reduce
N,M=map(int,input().split())
A=[int(x)//2 for x in input().split()]
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
LCM=lcm(*A)
for a in A:
if LCM//a%2==0:
print(0)
break
else:
print((M//LCM+1)//2)
|
def print_it(l, n):
print(''.join([l[x % 2] for x in range(n)]))
matrix = []
while True:
values = input()
if '0 0' == values:
break
matrix.append([int(x) for x in values.split()])
sc = ['#', '.']
cs = ['.', '#']
for height, width in matrix:
for i in range(height):
if 0 == i % 2:
print_it(sc, width)
else:
print_it(cs, width)
print() |
W = input()
s = ""
while True:
a = input()
try:
if a == "END_OF_TEXT":
break
else:
s += a.lower()
s += " "
except:
break
t = s.strip(".").split(" ")
print(t.count(W)) |
import itertools,math
n = int(input())
word = [input() for _ in range(n)]
count = 0
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(n):
word[i] = sorted(word[i])
new_word = list(sorted(word))
x = 1
for i in range(n-1):
if new_word[i] == new_word[i+1]:
x += 1
elif x >= 2:
count += combinations_count(x,2)
x = 1
if x >= 2:
count += combinations_count(x,2)
print(count) |
b,c=map(int,input().split())
if b*c%2==1:
print("Odd")
else:
print("Even")
|
S=input()
ans='NO'
# print(S.find('k'))
if S.find('k')==0 and S.rfind('eyence')==len(S)-6:
ans='YES'
elif S.find('ke')==0 and S.rfind('yence')==len(S)-5:
ans='YES'
elif S.find('key')==0 and S.rfind('ence')==len(S)-4:
ans='YES'
elif S.find('keye')==0 and S.rfind('nce')==len(S)-3:
ans='YES'
elif S.find('keyen')==0 and S.rfind('ce')==len(S)-2:
ans='YES'
elif S.find('keyenc')==0 and S.rfind('e')==len(S)-1:
ans='YES'
print(ans)
|
import random
class RandomTalk:
def __init__(self):
self.nums = '0123456789'
self.chars = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
def randomName(self, length):
random_name = []
for i in range(length):
random_name.append(random.choice(self.chars))
return "".join(random_name)
def randomAge(self, length):
random_age = []
for i in range(length):
random_age.append(random.choice(self.nums))
return int("".join(random_age))
def randomWords(self, length):
random_age = []
for i in range(length):
random_age.append(random.choice(self.nums + self.chars))
return "".join(random_age)
def randomCode(self, length):
random_code = []
for i in range(length):
random_code.append(random.choice(self.nums))
return "".join(random_code)
def randomHash(self, length):
random_hash = []
for i in range(length):
random_hash.append(random.choice(self.nums + self.chars))
return "".join(random_hash)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.