input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# -*- coding:utf-8 -*-
import itertools
N, P = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
odd = [ tmp for tmp in a if tmp%2 != 0]
even = [ tmp for tmp in a if tmp%2 == 0]
if P == 0:
ans += 1
b = sum([ len(list(itertools.combinations(odd,tmp))) for tmp in range(2, len(od... | # -*- coding:utf-8 -*-
import itertools, math
N, P = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
odd = [ tmp for tmp in a if tmp%2 != 0]
even = [ tmp for tmp in a if tmp%2 == 0]
d = math.factorial(len(odd))
e = math.factorial(len(even))
if P == 0:
ans += 1
b = sum([ (d... | p03665 |
import functools
import math
@functools.lru_cache()
def combinations(n, r):
return math.factorial(n) / math.factorial(r) / math.factorial(n - r)
def main():
n, p = list(map(int, input().split()))
a = tuple([int(x) % 2 for x in input().split()])
if n == 1 and a[0] % 2 != p:
pri... | import math
def comb(n, r):
return math.factorial(n) / math.factorial(r) / math.factorial(n - r)
def main():
n, p = list(map(int, input().split()))
a = tuple([int(x) % 2 for x in input().split()])
if n == 1 and a[0] % 2 != p:
print((0))
return 0
t = len(tuple([x ... | p03665 |
N,P=list(map(int, input().split()))
*A,=list(map(int, input().split()))
even=sum(1 for a in A if a&1==0)
odd =sum(1 for a in A if a&1==1)
def comb(n, r):
p, q = 1, 1
for i in range(min(r,n-r)):
p *= n-i
q *= i+1
return p // q
ans=0
for i in range(P,odd+1,2):
ans+=comb(o... | N,P=list(map(int, input().split()))
*A,=list(map(int, input().split()))
odd=sum(1 for a in A if a&1)
if odd==0:
if P==1:
print((0))
else:
print((1<<N))
else:
print((1<<(N-1))) | p03665 |
#AGC017A
def f():
res=1
for x in a:
if x%2==0:
res*=1
else:
res=0
return res
return res
n,p=list(map(int,input().split()))
a=list(map(int,input().split()))
if f()==1 and p==0:
print(2**n)
elif f()==1 and p==1:
print(0)
else:
print(2**(n-1))
| def f():
for x in a:
if x%2==0:
continue
else:
return False
return True
n,p=list(map(int,input().split()))
a=list(map(int,input().split()))
if f()==True and p==0:
print(2**n)
elif f()==True and p==1:
print(0)
else:
print(2**(n-1))
| p03665 |
n, p = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [[0] * 2 for _ in range(n + 1)]
dp[0][0] = 1
for i, e in enumerate(a, 1):
if e % 2:
dp[i][0] = dp[i-1][0] + dp[i-1][1]
dp[i][1] = dp[i-1][1] + dp[i-1][0]
else:
dp[i][0] = dp[i-1][0] * 2
... | n, p = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [[0] * 2 for _ in range(n + 1)]
dp[0][0] = 1
for i, e in enumerate(a, 1):
for j in range(2):
r = e % 2
dp[i][j] = dp[i-1][j] + dp[i-1][(j-r)%2]
print((dp[n][p]))
| p03665 |
n,p = list(map(int,input().split()))
an = [int(i) for i in input().split()]
dpo = [0]*n
dpe = [0]*n
if an[0] % 2 == 0:
dpe[0] = 2
else:
dpo[0] = 1
dpe[0] = 1
for i in range(1,n):
if an[i] % 2 == 0:
dpe[i] = dpe[i-1] * 2
dpo[i] = dpo[i-1] * 2
else:
dpe[i] = dpe[i-1] + dpo[i-1]
... | n,p = list(map(int,input().split()))
an = [int(i) for i in input().split()]
x = 0
for i in an:
x |= i%2
if x:
print((2**(n-1)))
else:
if p:
print((0))
else:
print((2**n)) | p03665 |
from math import factorial
def cmb(n,r):
return factorial(n)//(factorial(n-r)*factorial(r))
n,p=list(map(int,input().split()))
A=list(map(int,input().split()))
A=[A[i]%2 for i in range(n)]
cnt=A.count(0)
B=2**cnt
ans=0
for i in range(p,n-cnt+1,2):
ans +=cmb(n-cnt,i)
print((ans*B)) | from math import factorial
def cmb(n,r):
return factorial(n)//(factorial(n-r)*factorial(r))
n,p=list(map(int,input().split()))
A=list(map(int,input().split()))
A=[A[i]%2 for i in range(n)]
cnt=A.count(0)
ans=0
for i in range(p,n-cnt+1,2):
ans +=cmb(n-cnt,i)
print((ans*(2**cnt))) | p03665 |
from math import factorial
def cmb(n,r):
return factorial(n)//(factorial(n-r)*factorial(r))
n,p=list(map(int,input().split()))
A=list(map(int,input().split()))
A=[A[i]%2 for i in range(n)]
cnt=A.count(0)
ans=0
for i in range(p,n-cnt+1,2):
ans +=cmb(n-cnt,i)
print((ans*(2**cnt))) | from math import factorial
n,p=list(map(int,input().split()))
A=list(map(int,input().split()))
a,b=0,0
for i in A:
if i%2==0:a +=1
else:b +=1
cnt=0 if p==1 else 1
for i in range(p,b+1,2):
if i==0:continue
cnt +=factorial(b)//(factorial(i)*factorial(b-i))
print((cnt*(2**a))) | p03665 |
from collections import Counter
def combination(n, r): # nCrを求める
r = min(n-r, r)
result = 1
for i in range(n, n-r, -1):
result *= i
for i in range(1, r+1):
result //= i
return result
n,p = list(map(int,input().split()))
a =list(map(int,input().split()))
for i in range(n):
... | n, m = list(map(int,input().split()))
a = list(map(int,input().split()))
a = [i%2 for i in a]
if sum(a)>0:print((2**(n-1)))
else:
if m == 0:print((2**n))
else:print((0)) | p03665 |
n,p=list(map(int,input().split()))
a=[int(x)%2 for x in input().split()]
even=0
for aa in a:
if aa%2==0:
even+=1
if even==n:
if p==0:
print((2**n))
else:
print((0))
else:
print((2**(n-1)))
| n,p=list(map(int,input().split()))
a=list(map(int,input().split()))
even=0
for aa in a:
if aa%2==0:
even+=1
if even==n:
if p==0:
print((2**n))
exit(0)
else:
print((0))
exit(0)
print((2**(n-1)))
| p03665 |
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7
def lcm(x,y):
return... | import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from math import *
sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7
def lcm(x,y):
return... | p03665 |
import sys
readline = sys.stdin.readline
S = list(map(ord, readline().strip()))
N = len(S)
S = [None] + S + [None]
K = int(readline())
if N == 1:
ans = 1
elif N == 2:
ans = 1
if S[1] == S[2]:
ans = 2
if K:
ans = 2
else:
dp1 = [[0]*(K+1) for _ in range(N+2)]
dp... | import sys
readline = sys.stdin.readline
S = list(map(ord, readline().strip()))
N = len(S)
S = [None] + S + [None]
K = int(readline())
if N == 1:
ans = 1
elif N == 2:
ans = 1
if S[1] == S[2]:
ans = 2
if K:
ans = 2
else:
dp1 = [[0]*(K+1) for _ in range(N+2)]
dp... | p03430 |
# ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def get_fact(lim):
# compute a toble of factorials (1-idx)
fact = [1] * (lim + 1)
x = 1
for i in range(1, lim + 1):
x = (x * i) % MOD
fact[i] = x
return fact
def get_inv(lim):
# compute a toble of inverse factorials ... | # ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def get_fact(lim):
# compute a toble of factorials (1-idx)
fact = [1] * (lim + 1)
x = 1
for i in range(1, lim + 1):
x = (x * i) % MOD
fact[i] = x
return fact
def get_inv(lim):
# compute a toble of inverse factorials ... | p04040 |
"""
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_factorials(limit: int, MOD: int) -> list:
"""Compute a mod table of factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials[0] = 1
x = 1
f... | """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_fact_and_inv(limit: int, MOD: int) -> tuple:
"""Compute mod tables of factorials and inverse factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials... | p04040 |
"""
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_fact_and_inv(limit: int, MOD: int) -> tuple:
"""Compute mod tables of factorials and inverse factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials... | """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_fact_and_inv(limit: int, MOD: int) -> tuple:
"""Compute mod tables of factorials and inverse factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials... | p04040 |
BIG = (10 ** 9) + 7
f_list = [1] * 200000
f_r_list = [1] * 200000
for i in range(199999):
f_list[i + 1] = int((f_list[i] * (i + 2)) % BIG)
def power(n, x):
if x == 1:
return n
elif x % 2 == 0:
return power(int((n * n) % BIG), int(x / 2))
else:
return int((n * power(n, x - 1)) % BIG)
for i ... | BIG = (10 ** 9) + 7
f_list = [1] * 200000
f_r_list = [1] * 200000
for i in range(199999):
f_list[i + 1] = int((f_list[i] * (i + 2)) % BIG)
def power(n, x):
if x == 1:
return n
elif x % 2 == 0:
return power(int((n * n) % BIG), int(x / 2))
else:
return int((n * power(n, x - 1)) % BIG)
f_r_li... | p04040 |
from sys import stdin, stdout, stderr, setrecursionlimit
from functools import lru_cache
setrecursionlimit(10**7)
mod = 10**9 + 7
def solve():
def binom(n, k):
res = (modfact[n] * factinv[k]) % mod
res = (res * factinv[n - k]) % mod
return res
h, w, a, b = list(map(int, ... | from sys import stdin, stdout, stderr
mod = 10**9 + 7
def solve():
def binom(n, k):
res = (modfact[n] * factinv[k]) % mod
res = (res * factinv[n - k]) % mod
return res
h, w, a, b = list(map(int, input().split()))
ans = 0
modfact = [1] * (h + w)
factinv = [1] *... | p04040 |
from sys import stdin, stdout, stderr
mod = 10**9 + 7
def solve():
def binom(n, k):
res = (modfact[n] * factinv[k]) % mod
res = (res * factinv[n - k]) % mod
return res
h, w, a, b = list(map(int, input().split()))
ans = 0
modfact = [1] * (h + w)
factinv = [1] *... | from sys import stdin, stdout, stderr
mod = 10**9 + 7
def solve():
def binom(n, k):
res = (modfact[n] * factinv[k]) % mod
res = (res * factinv[n - k]) % mod
return res
h, w, a, b = list(map(int, input().split()))
ans = 0
modfact = [1] * (h + w)
factinv = [1] *... | p04040 |
# -*- coding: utf-8 -*-
"""
Created on Sun Jun 24 18:23:54 2018
ITP22C
@author: maezawa
"""
from collections import deque
n, q = list(map(int, input().split()))
a = [deque() for _ in range(n)]
for i in range(q):
c = list(map(int, input().split()))
if c[0] == 0:
if a[c[1]]:
... | import heapq
n, q = list(map(int, input().split()))
a = [[] for _ in range(n)]
for i in range(q):
c = list(map(int, input().split()))
if c[0] == 0:
heapq.heappush(a[c[1]],-c[2])
elif c[0] == 1:
if a[c[1]]:
print((-a[c[1]][0]))
else:
if a[c[1]]:
... | p02437 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s = str(input().rstrip('\n'))
print(("NO" if s.count("x") >= 8 else "YES"))
if __name__ == '__main__':
solve()
| import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s = str(input().rstrip('\n'))
print(("YES" if s.count("x") < 8 else "NO"))
if __name__ == '__main__':
solve()
| p03024 |
N,X=list(map(int,input().split()))
above=[0]*N
now=0
data=[0]*N
for i in range(N):
b,l,u=list(map(int,input().split()))
above[i]=(i,b*l+(X-b)*u)
data[i]=(b,l,u)
now-=l*b
above.sort(key=lambda x:x[1],reverse=True)
used=set()
ans=0
idx=0
for i in range(N):
if now+above[i][1]<0:
... | N,X=list(map(int,input().split()))
data=[0]*N
A=[0]*N
zero=0
for i in range(N):
b,l,u=list(map(int,input().split()))
zero-=l*b
data[i]=(b,l,u)
A[i]=(i,(X-b)*u+b*l)
A.sort(key=lambda x:x[1],reverse=True)
S=[0]*N
idx=[0]*N
for i,a in enumerate(A):
S[i]=S[i-1]+a[1]
idx[a[0]]=i
def ch... | p03019 |
import sys
from bisect import bisect_left
from itertools import accumulate
from operator import itemgetter
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma... | import sys
n, x = list(map(int, input().split()))
exams = []
norma = 0
for i, line in enumerate(sys.stdin):
b, l, u = list(map(int, line.split()))
exams.append((u * x - b * (u - l), b, l, u, i))
norma += b * l
exams_sorted = sorted(exams, reverse=True)
remain_norma = norma
sub_d = -1
i = 0
u... | p03019 |
n, x = list(map(int, input().split()))
B = 0
blu = []
for i in range(n):
b, l, u = list(map(int, input().split()))
blu.append((b, l, u, x*u-b*u+b*l))
B += b*l
blu.sort(key=lambda x: x[3], reverse=True)
ans = n*x
for i in range(n):
ok = n*x
ng = -1
while ok-ng>1:
A = 0
tB = B
m... | n, x = list(map(int, input().split()))
B = 0
blu = []
s = [0 for i in range(n)]
for i in range(n):
b, l, u = list(map(int, input().split()))
blu.append((b, l, u, x*u-b*u+b*l))
B += b*l
blu.sort(key=lambda x: x[3], reverse=True)
for i in range(n):
if i==0:
s[i] = blu[i][3]
else:
s[i] =... | p03019 |
N, X = list(map(int, input().split()))
items = []
for i in range(N):
b, l, u = list(map(int, input().split()))
items.append((b, l, u, u * (X - b), - b * l))
items = sorted(items, key=lambda x: -(x[3] - x[4]))
def f(num):
cnt = num // X
mod = num % X
point = 0
for i in range(cnt):... | N, X = list(map(int, input().split()))
items = []
for i in range(N):
b, l, u = list(map(int, input().split()))
items.append((b, l, u, u * (X - b), - b * l))
items = sorted(items, key=lambda x: -(x[3] - x[4]))
def f(num):
cnt = num // X
mod = num % X
point = 0
for i in range(cnt):... | p03019 |
import sys
input = sys.stdin.readline
N,X=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(N)]
A.sort(key=lambda x:x[2]*(X-x[0])+x[0]*x[1],reverse=True)
ALL=[a[2]*(X-a[0])+a[0]*a[1] for a in A]
from itertools import accumulate
SUM=[0]+list(accumulate(ALL))
MAX=0
MINUS=0... | import sys
input = sys.stdin.readline
N,X=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(N)]
A.sort(key=lambda x:x[2]*(X-x[0])+x[0]*x[1],reverse=True)
ALL=[a[2]*(X-a[0])+a[0]*a[1] for a in A]
from itertools import accumulate
SUM=[0]+list(accumulate(ALL))
MAX=0
MINUS=0... | p03019 |
import sys
import math
readline = sys.stdin.readline
N, X = list(map(int, input().split()))
q_array = []
score_needed = 0
for i in range(N):
b, l, u = list(map(int, readline().split()))
q_array.append([b, l, u, b * l + (X - b) * u])
score_needed += b * l
q_array = sorted(q_array, key=lam... | import sys
readline = sys.stdin.readline
N, X = list(map(int, input().split()))
q_array = []
s_array = []
score_needed = 0
for i in range(N):
b, l, u = list(map(int, readline().split()))
q_array.append([b, l, u, b * l + (X - b) * u])
s_array.append(b * l + (X - b) * u)
score_needed += ... | p03019 |
class Combination:
'''MOD上の
計算量：階乗・逆元テーブルの作成O(N)
nCkを求めるO(1)'''
def __init__(self, n, MOD):
self.fact = [1] * (n + 1)
for i in range(1, n + 1):
self.fact[i] = self.fact[i-1] * i % MOD
self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]
... | class Combination:
def __init__(self, n, MOD):
self.fact = [1] * (n + 1)
for i in range(1, n + 1):
self.fact[i] = self.fact[i-1] * i % MOD
self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]
self.MOD = MOD
def factorial(self, k):
... | p03184 |
# coding: utf-8
# Your code here!
SIZE=300000; MOD=10**9+7 #ここを変更する
inv = [0]*(SIZE+1)# inv[j] = j^{-1} mod MOD
fac = [0]*(SIZE+1)# fac[j] = j! mod MOD
finv = [0]*(SIZE+1)# finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE+1):
inv[i] = MOD -(MOD//i)*i... | # coding: utf-8
# Your code here!
SIZE=300000; MOD=10**9+7 #ここを変更する
inv = [0]*(SIZE+1)# inv[j] = j^{-1} mod MOD
fac = [0]*(SIZE+1)# fac[j] = j! mod MOD
finv = [0]*(SIZE+1)# finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE+1):
inv[i] = MOD -(MOD//i)*i... | p03184 |
str1 , str2 = input().split(" ")
str3 = str2+str1
print(str3) | #---Strings
S, T = map(str, input().split(" "))
print(T, S, sep="")
| p02817 |
def main():
S,T = input().split()
print(("{}{}".format(T,S)))
main() | S,T = input().split()
print((T+S)) | p02817 |
S=list(input().split())
a=S[1]+S[0]
print(a) | S,T=input().split()
print((T+S)) | p02817 |
import sys
S,T = input().split()
if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()
print(T,end='')
print(S)
| import sys
S,T = input().split()
if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()
print(T,S,sep='')
| p02817 |
s,t=list(map(str,input().split()))
print((t+s))
| s,t=input().split()
print((t+s)) | p02817 |
S, T = input().split()
S = str(S)
T = str(T)
print((T+S)) | def funk(S,T):
return T+S
S,T = input().split()
print((funk(S,T))) | p02817 |
A, B = input().split()
print((B+A)) | S, T = input().split()
print((T+S)) | p02817 |
import sys
#import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
S, T = input().split()
print((T+S))
| import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
S, T = sr().split()
answer = T + S
print(answer)
# 39 | p02817 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
print((t + s))
if __name__ == '__main__':
solve()
| import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s, t = list(map(str, str(input().rstrip('\n')).split()))
print((t + s))
if __name__ == '__main__':
solve()
| p02817 |
b, c = list(map(str, input().split()))
print((c+b)) | s,t=list(map(str,input().split()))
print((t+s)) | p02817 |
a, b = list(map(str, input().split()))
print(('{}{}'.format(b, a))) | str_l = list(map(str, input().split()))
print((''.join(list(reversed(str_l))))) | p02817 |
eval(input());print((sum([i-1 for i in list(map(int,input().split()))]))) | print((-int(eval(input()))+sum(map(int,input().split())))) | p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-len(a))) | n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-n)) | p03294 |
N = int(eval(input()))
L = list([x - 1 for x in list(map(int,input().split()))])
print((sum(L))) | N = eval(input())
print((sum(list([x - 1 for x in list(map(int,input().split()))]))))
| p03294 |
import math
class Sieve:
"""Sieve of Eratosthenes.
List primes up to n.
"""
def __init__(self, n):
self.__prime = []
self.__is_prime = [i >= 2 for i in range(n + 1)]
for i in range(2, int(math.sqrt(n)) + 1):
if self.__is_prime[i]:
f... | import math
class Sieve:
"""Sieve of Eratosthenes.
List primes up to n.
"""
def __init__(self, n):
self.__prime = []
self.__is_prime = [i >= 2 for i in range(n + 1)]
for i in range(2, int(math.sqrt(n)) + 1):
if self.__is_prime[i]:
f... | p03294 |
def main():
n, *a = list(map(int, open(0).read().split()))
ans = sum(a) - n
print(ans)
if __name__ == '__main__':
main()
| print((-int(eval(input()))+sum(map(int, input().split())))) | p03294 |
# 最大公約数を求める関数
def gcd(a,b):
rem = a % b
while rem != 0:
a = b
b = rem
rem = a % b
return b
# 最小公倍数を求める関数
def lcm(a,b):
return (a*b)/gcd(a,b)
n = int(eval(input()))
a = list(map(int, input().split()))
m = lcm(a[0],a[1])
for i in range(1,len(a)):
m = lcm(... | n = int(eval(input()))
res = sum(list(map(int, input().split()))) - n
print(res) | p03294 |
n = int(eval(input()))
a = [ int(x) for x in input().split(" ") ]
s = 0
for i in a:
s += i - 1
print(s)
| N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in a:
ans += i-1
print(ans)
| p03294 |
# author: kagemeka
# created: 2019-11-08 15:54:47(JST)
### modules
## from standard library
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
import functools
# import operator
... | # author: kagemeka
# created: 2019-11-08 15:54:47(JST)
### modules
## from standard library
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator... | p03294 |
n=int(eval(input()))
a=[int(x) for x in input().split()]
print((sum(a)-n)) | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
print((sum(A) - N))
if __name__ == "__main__":
main() | p03294 |
N = int(eval(input()))
a =list(map(int, input().split()))
ans = 0
a_all = 1
for i in range(N):
a_all = a_all*a[i]
for i in range(N):
ans += (a_all -1) % a[i]
print(ans) | N = int(eval(input()))
a = [int(i) for i in input().split()]
ans = sum(a) - N
print(ans) | p03294 |
N=int(eval(input()))
A=list([int(x)-1 for x in input().split()])
print((sum(A))) | N=int(eval(input()))
A=list(map(int,input().split()))
print((sum(A)-N)) | p03294 |
N = int(eval(input()))
A = list([int(x) - 1 for x in input().split()])
print((sum(A)))
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = sum(A) - N
print(ans)
| p03294 |
N = int(eval(input()))
a = list(map(int, input().split()))
print((sum([i-1 for i in a])))
| N = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-N))
| p03294 |
def gcd(x,y):
r=x%y
return gcd(y,r) if r else y
def lcm(x, y):
return (x * y) // gcd(x, y)
n=int(eval(input()))
A=list(map(int,input().split()))
k=1
for i in A:
k=lcm(k,i)
def f(n):
return sum(list([n%x for x in A]))
print((f(k-1))) | n=int(eval(input()))
A=list(map(int,input().split()))
print((sum(A)-n))
| p03294 |
from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def gcd(a, b):
# a>b
while(b):
c = a % b
a = b
b = c
return a
def calcMod(a, m):
return sum([m % v for v in a])
def lcm(a, b):
return a*b/gcd(a, b)
def lcm_list(l):
... | from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def gcd(a, b):
# a>b
while(b):
c = a % b
a = b
b = c
return a
def calcMod(a, m):
return sum([m % v for v in a])
def lcm(a, b):
return a*b/gcd(a, b)
def lcm_list(l):
... | p03294 |
from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def gcd(a, b):
# a>b
while(b):
c = a % b
a = b
b = c
return a
def calcMod(a, m):
return sum([m % v for v in a])
def lcm(a, b):
return a*b/gcd(a, b)
def lcm_list(l):
... | from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def calcMod(a, m):
return sum([m % v for v in a])
def mul(a, b):
return a*b
print((calcMod(a, reduce(mul, a)-1)))
| p03294 |
from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def calcMod(a, m):
return sum([m % v for v in a])
def mul(a, b):
return a*b
print((calcMod(a, reduce(mul, a)-1)))
| from functools import reduce
n = (int)(eval(input()))
a = (list)(list(map(int, input().split())))
def calcMod(a, m):
return sum([m % v for v in a])
def mul(a, b):
return a*b
#print(calcMod(a, reduce(mul, a)-1))
print((sum(a)-n))
| p03294 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
ans = 0
for a in map(int, input().split()):
ans += a
print((ans - N)) | N = int(eval(input()))
print((sum(map(int, input().split())) - N))
| p03294 |
N = int(eval(input()))
A = [int(zz) for zz in input().split()]
print((sum(A)-N))
| N = int(eval(input()))
print((sum([int(i)-1 for i in input().split()])))
| p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a) - n)) | i = input;i();print((sum([int(x)-1 for x in i().split()])))
| p03294 |
N=int(eval(input()))
a = list(map(int,input().split()))
print((sum(a)-len(a))) | N=int(eval(input()))
a = list(map(int,input().split()))
print((sum(a)-N)) | p03294 |
n = int(eval(input()))
A = [int(i) for i in input().strip().split()]
print((sum(A) - n))
| import sys
def input():
return sys.stdin.readline().strip()
# sys.setrecursionlimit(100000)
def main():
n = int(input().strip())
A = [int(i) for i in input().split()]
print((sum(A) - n))
return
if __name__ == "__main__":
main()
| p03294 |
# モジュールのインポート
import fractions
# 標準入力を取得
N = int(eval(input()))
a = list(map(int, input().split()))
# 求解処理
ans = sum(a) - N
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N = int(eval(input()))
a = list(map(int, input().split()))
return N, a
def main(N: int, a: list) -> None:
"""
メイン処理.
Args:\n
N (int): 正整数の数(2 <= N... | p03294 |
N = eval(input())
a = list(map(int, input().split()))
summ = 1
for i in a:
summ *= i
summ2 = 0
for i in a:
summ2 += (summ-1)% i
print(summ2) | N = eval(input())
a = list(map(int, input().split()))
summ2 = sum(a) - int(N)
print(summ2) | p03294 |
#ABC 103
#最小公倍数
from functools import reduce
#a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm_base(a, b):
return a * b // gcd (a, b)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
N=int(eval(input()))
A = [int(j) for j in input().split()]
... | #ABC 103
import functools
import operator
N=int(eval(input()))
A = [int(j) for j in input().split()]
result = functools.reduce(operator.mul, A)
ans = 0
for a in A:
ans+=(result-1)%a
print(ans) | p03294 |
import sys
import itertools
input = sys.stdin.readline
N = int(eval(input()))
li = [int(i) for i in input().split()]
sum = 0
for i in range(N) :
sum += li[i]- 1
print(sum)
| #template
def inputlist(): return [int(k) for k in input().split()]
#template
N = int(eval(input()))
A = inputlist()
print((sum(A)-N)) | p03294 |
from collections import defaultdict
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n = readInt()
a = readInts()
ma = max(a)
ans = 0
seki = 1
for i in a:
seki*=i
f... | from collections import defaultdict
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n = readInt()
a = readInts()
ans = 0
for i in a:
ans+=i-1
print(ans) | p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
x = 1
for i in a:
x *= i
ans = 0
for i in a:
ans += (x - 1) % i
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a) - len(a))) | p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a) - len(a))) | n = int(eval(input()))
a = list(map(int, input().split()))
print((sum([x - 1 for x in a]))) | p03294 |
# -*- coding: utf-8 -*-
from functools import reduce
N = int(eval(input()))
aN = list(map(int, input().split()))
def gcd(a, b):
while b > 0:
a, b = b, a%b
return a
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
def f... | # -*- coding: utf-8 -*-
N = int(eval(input()))
aN = list(map(int, input().split()))
print((sum(aN)-N)) | p03294 |
eval(input())
numbers = tuple(map(int, input().split(' ')))
print((sum([n - 1 for n in numbers])))
| N = int(eval(input()))
print((sum(tuple(map(int, input().split(' ')))) - N))
| p03294 |
n=int(eval(input()))
a=list(map(int,input().split()))
c=0
for i in range(n):
c+=a[i]-1
print(c) | n=eval(input())
print((sum([i-1 for i in list(map(int,input().split()))]))) | p03294 |
import math
n = eval(input())
a = input().split()
N = int(n)
ans_list = []
ann = []
ana = 1
for j in range(N):
ana = ana * int(a[j])
ana = ana -1
for i in range(N):
ans = 0
for k in range(i+1):
ans += int(ana % int(a[k]))
ans_list.append(ans)
ans_list.sort()
ans_list.reve... | import math
n = eval(input())
a = input().split()
N = int(n)
ans_list = []
ann = []
ana = 1
for j in range(N):
ana = ana * int(a[j])
ana = ana -1
ans = 0
for k in range(N):
ans += int(ana % int(a[k]))
ans_list.append(ans)
ans_list.sort()
ans_list.reverse()
print((str(ans_list[0])))
... | p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-len(a))) | N = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-N)) | p03294 |
def gcd(a, b):
if a < b:
a, b = b, a
if b == 0:
return a
c = a % b
return gcd(b, c)
def lcm(x, y):
return (x * y) // gcd(x, y)
N = int(eval(input()))
A = []
s = input().split(" ")
for i in range(N):
A.append(int(s[i]))
tmp=lcm(A[0],A[1]);
i = 2
while i < N:... | N = int(eval(input()))
print((sum(list(map(int, input().split(" "))))-N)) | p03294 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
for i in range(N):
ans += A[i] - 1
print(ans) | import math
N = int(eval(input()))
A = list(map(int,input().split()))
A = list([int(math.copysign(x-1, x)) for x in A])
print((sum(A))) | p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-n)) | n = int(eval(input()))
a = list(map(int, input().split()))
a = list([x-1 for x in a])
print((sum(a)))
| p03294 |
import typing
n = int(eval(input()))
a = list(map(int, input().split()))
def gcd(x : int, y : int):
x, y = min(x, y), max(x, y)
while True:
mod = y % x
if mod == 0:
break
y = x
x = mod
return x
lcm = a[0]
for i in range(1, n):
lcm = lcm * a... | n = int(eval(input()))
a = list(map(int, input().split()))
def gcd(x, y):
x, y = min(x, y), max(x, y)
while True:
mod = y % x
if mod == 0:
break
y = x
x = mod
return x
lcm = a[0]
for i in range(1, n):
lcm = lcm * a[i] // gcd(lcm, a[i])
re... | p03294 |
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
#aをすべてかけて1を引いた整数をmにすればよい
print((sum(list([x-1 for x in a])))) | # -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
#aをすべてかけて1を引いた整数をmにすればよい
print((sum(a)-len(a))) | p03294 |
#coding:utf-8
n = int(eval(input()))
A = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return (a * b) // gcd(a, b)
def func(x, A):
ans = 0
for y in A:
ans += x%y
return ans
def hoge(A):
B = []
for i in range(... | n = int(eval(input()))
A = list(map(int, input().split()))
print((sum(A) - n)) | p03294 |
N = int(eval(input()))
A = list(map(int, input().split()))
def gcd(x,y):#ユークリッドの互除法
if y > x:
x, y = y, x
while y != 0:
x, y = y, x % y
if y == 0:
return x
def lcm(x,y):
return x * y / gcd(x,y)
m = 1
for i in range(N):
m = lcm(m, A[i])
count = 0
for i in range(N):
... | N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(N):
count += A[i] - 1
print(count) | p03294 |
n = int(eval(input()))
print((sum(list(map(int, input().split()))) - n))
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
t = 0
for i in range(n):
t += (a[i] - 1)
print(t)
if __name__ == '__main__':
slove()
| p03294 |
# ans
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(N):
ans += a[i] - 1
print(ans) | N = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a) - N)) | p03294 |
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
ans = 0
for x in a:
ans += (reduce(lcm, a) - 1) % x
print(ans) | from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
x = reduce(lcm, a) - 1
ans = 0
for i in a:
ans += x % i
print(ans) | p03294 |
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
x = reduce(lcm, a) - 1
ans = 0
for i in a:
ans += x % i
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a)-n)) | p03294 |
eval(input())
A = list(map(int, input().split()))
ans = 0
x = 1
for a in A:
x *= a
for a in A:
ans += (x-1)%a
print(ans)
| def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
print((sum(A)-N)) | p03294 |
input = open(0).read
N, *an = [int(i) - 1 for i in input().split()]
N += 1
def main():
print((sum(an)))
return
main()
| def main():
N, *a = [int(i) - 1 for i in open(0).read().split()]
print((sum(a)))
return
main()
| p03294 |
print((-int(eval(input()))+sum(map(int,input().split())))) | eval(input());print((sum([x-1 for x in list(map(int,input().split()))]))) | p03294 |
# coding: utf-8
def gcd(n1, n2):
if n1 < n2:
n1, n2 = n2, n1
while n1 % n2 != 0:
rest = n1 % n2
n1, n2 = n2, rest
return n2
def lcm(n1, n2):
return n1 * n2 // gcd(n1, n2)
def getM(alist):
nLcm = lcm(alist[0], alist[1])
for i in range(2, len(alist)):
... | #coding: utf-8
if __name__ == "__main__":
N = int(eval(input()))
alist = [int(x)-1 for x in input().split(" ")]
print((sum(alist)))
| p03294 |
def gcd(a, b):
if(a < b):
a, b = b, a
while b:
a, b = b, a % b
return a
def lcm(a,b):
return a*b / gcd(a,b)
n = int(eval(input()))
a = list(map(int, input().split()))
nums = 1
for i in range(n):
nums = lcm(nums, a[i])
ans = 0
for i in a:
ans += (nums - 1) % i... | n = int(eval(input()))
a = list(map(int, input().split()))
nums = a[0]
for num in a:
if(nums % num != 0):
nums *= num
ans = 0
nums -= 1
for i in a:
ans += nums % i
print(ans) | p03294 |
def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
*A, = map(int, input().split())
ans = f(N, A)
print(ans)
def f(N, A):
"""
直感: 最小公倍数,最大... | def main():
"""
2 <= N <= 10^3
2 <= ai <= 10^5
非負整数 m に対して
f(m) = (m mod a1) + (m mod a2) + (m mod aN)
f_max
mの制約は問題文中には直接記述されていない
"""
N = int(input())
*A, = map(int, input().split())
ans = editorial(N, A)
print(ans)
def f(N, A):
"""
直感: ... | p03294 |
import math
n = int(eval(input()))
a = list(map(int, input().split()))
common_num = 1
for num in a:
common_num = (common_num * num) // math.gcd(common_num, num)
total = 0
for num in a:
total += (common_num - 1) % num
print(total)
| # 合計が最大になるのは、余りが各aにおいてa-1となるとき。
n = int(eval(input()))
a = list(map(int, input().split()))
# 各aから1ずつ引くをn繰り返しているため。
ans = sum(a) - n
print(ans) | p03294 |
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
def lcm(a, b):
return a * b // gcd(a, b)
N = int(eval(input()))
A = list(map(int, input().split()))
l = 0
for i in range(1, len(A)):
l = lcm(A[i - 1], A[i])
ans = l - 1
ans = sum(A) - len(A)
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
ans = sum(A) - len(A)
print(ans)
| p03294 |
n = int(eval(input()))
A = sorted(list(map(int,input().split())))
print((sum([n-1 for n in A]))) | n = int(eval(input()))
print((sum(map(int,input().split()))-n)) | p03294 |
N=int(eval(input()))
A=list(map(int,input().split()))
all=0
for i in range(N):
all+=A[i]
print((all-N)) | N=int(eval(input()))
A=list(map(int,input().split()))
all=sum(A)
print((all-N))
| p03294 |
def gcd(i,j):
a=max(i,j)
b=min(i,j)
if a%b==0:
return b
else:
return gcd(b,a%b)
def lcm(i,j):
return i*j//gcd(i,j)
N=int(eval(input()))
A=list(map(int,input().split()))
l=lcm(A[0],A[1])
for i in range(2,N):
l=lcm(l,A[i])
ans=0
for i in A:
ans+=(l-1)%i
print(a... | N=int(eval(input()))
A=list(map(int,input().split()))
print((sum(A)-N))
| p03294 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
m = 1
for i in range(n):
m = m*a[i]
m -= 1
for i in range(n):
ans += m%a[i]
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
print((sum(a) - n)) | p03294 |
n=int(eval(input()))
xl=[list(map(int,input().split())) for _ in range(n)]
xl.sort(key=lambda x: x[0])
ans=0
for i in range(n):
xi,li=xl[i]
cnt=1
for j in range(n):
xj,lj=xl[j]
if xi+li<=xj-lj:
cnt+=1
xi=xj
li=lj
ans=max(ans,cnt)
print(ans)
| n=int(eval(input()))
xl=[list(map(int,input().split())) for _ in range(n)]
xl.sort(key=lambda x: x[0])
cnt=0
nx,nl=xl[0]
for i in range(1,n):
x,l=xl[i]
if nx+nl<=x-l:
nx=x
nl=l
else:
cnt+=1
if nx+nl>=x+l:
nx=x
nl=l
print((n-cnt)) | p02796 |
H = int(eval(input()))
x = [[float('inf')]*2 for i in range(H)]
for i in range(H):
X, L = list(map(int, input().split()))
x[i][0] = X - L
x[i][1] = X + L
from operator import itemgetter
sf = sorted(x, key=itemgetter(1))
ans = 0
last = float('inf')*-1
for i in range(H):
if last <= sf[i... | N = int(eval(input()))
S = []
for i in range(N):
xi, li = list(map(int, input().split()))
S.append([xi - li, xi + li])
from operator import itemgetter
S = sorted(S, key=itemgetter(1))
ans = 0
last = -1*float('Inf')
for si in S:
if si[0] >= last:
ans += 1
last = si[1]
print... | p02796 |
import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10 ** 10
N = int(eval(input()))
XL = sorted([list(map(int,input().split())) for _ in range(N)])
# print(N,XL)
DP = [ INF for _ in range(N+1)]
DP[0] = -INF
for i in range(N):
#print(DP)
(x,l) = XL[i]
# print(x,l)
for... | import math
import sys
m=10**9 + 7
sys.setrecursionlimit(1000010)
INF=10 ** 10
N = int(eval(input()))
XL = [list(map(int,input().split())) for _ in range(N)]
XLs =sorted([ [xl[0]+xl[1],xl[0]-xl[1]] for xl in XL ])
# print(N,XL,XLs)
t = -INF
n = 0
for xl in XLs:
if t <= xl[1]:
t = xl[0]
... | p02796 |
n = int(eval(input()))
dat = []
for _ in range(n):
x, l = list(map(int, input().split()))
# 0 1 2 3 4co 5
dat.append([x, l, x-l, x+l, 0 , []])
dat.sort(key = lambda x: x[1], reverse=True)
#print(dat)
res = []
res_safe = []
def do_count():
for i in range(n):
... | n = int(eval(input()))
dat = []
for _ in range(n):
x, l =list(map(int, input().split()))
dat.append([x-l, x+l])
dat.sort(key=lambda x: x[1])
#print(dat)
prevr = -99999999999999999
res = 0
for i in range(n):
if dat[i][0] >= prevr:
prevr = dat[i][1]
res += 1
print(res)
| p02796 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.