input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
mod=10**9+7
n,m=list(map(int,input().split()))
A=[]
for i in range(m):
a=int(eval(input()))
A.append(a)
S=[0]*(n+1)
S[0]=1
if 1 not in A:
S[1]=1
for i in range(2,n+1):
if i in A:
S[i]=0
else:
S[i]=(S[i-1]+S[i-2])%mod
print((S[n]%mod))
| import sys
input = sys.stdin.readline
mod=10**9+7
n,m=list(map(int,input().split()))
A=set()
for i in range(m):
A.add(int(eval(input())))
S=[0]*(n+1)
S[0]=1
if 1 not in A:
S[1]=1
for i in range(2,n+1):
if i in A:
S[i]=0
else:
S[i]=(S[i-1]+S[i-2])%mod
print((S[n]%mod))
| p03013 |
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
N, M = list(map(int, input().split()))
broken_floors = [int(eval(input())) for _ in range(M)]
dp = [0]*(N+2)
dp[1] = 1
for i in range(1, N+1):
if i not in broken_floors:
dp[i+1] = (dp[i] + dp[i-1]) % MOD
print((dp[-1])) | import sys
input = sys.stdin.readline
MOD = 10**9 + 7
N, M = list(map(int, input().split()))
broken_floors = set(int(eval(input())) for _ in range(M))
dp = [0]*(N+2)
dp[1] = 1
for i in range(1, N+1):
if i not in broken_floors:
dp[i+1] = (dp[i] + dp[i-1]) % MOD
print((dp[-1])) | p03013 |
N, M = list(map(int, input().split()))
A_ = [int(eval(input())) for _ in range(M)]
A = [0] * (N+3)
for a in A_:
A[a] = 1
dp = [0] * (N+3)
dp[0] = 1
mod = 10**9+7
for i in range(1, N+1):
if A[i-1] == 0:
dp[i] += dp[i-1]
if A[i-2] == 0:
dp[i] += dp[i-2]
dp[i] %= mod
print... | n,m=list(map(int,input().split()))
dp=[0]*(n+3)
a=[int(eval(input())) for i in range(m)]
mod=10**9+7
for i in range(m):
dp[a[i]]=-1
dp[0]=1
if dp[1]!=-1:
dp[1]+=dp[0]
for i in range(n+1):
if dp[i+2]==-1:
continue
if dp[i]!=-1:
dp[i+2]+=dp[i]
if dp[i+1]!=-1:
... | p03013 |
n,m=list(map(int,input().split()))
dp=[0]*(n+3)
a=[int(eval(input())) for i in range(m)]
mod=10**9+7
for i in range(m):
dp[a[i]]=-1
dp[0]=1
if dp[1]!=-1:
dp[1]+=dp[0]
for i in range(n+1):
if dp[i+2]==-1:
continue
if dp[i]!=-1:
dp[i+2]+=dp[i]
if dp[i+1]!=-1:
... | n,m = list(map(int,input().split()))
a = []
stairs = [0]*(n+2)
for _ in range(m):
a = int(eval(input()))
stairs[a] = 1
mod = 10**9 + 7
dp = [0]*(n+2)
dp[0] = 1
for i in range(n):
if i <= 1:
if stairs[i+1] == 0:
dp[i+1] += dp[i]
dp[i+1] %= mod
sta... | p03013 |
# DP
N, M = list(map(int, input().split()))
broken = [int(eval(input())) for _ in range(M)]
MOD = 10**9+7
dp = [0 for i in range(N+2)]
dp[N] = 1
for i in reversed(list(range(N))):
if i in broken:
continue
dp[i] = (dp[i+1] + dp[i+2]) % MOD
print((dp[0]))
| # DP
N, M = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(M)])
MOD = 10**9+7
dp = [0 for i in range(N+2)]
dp[N] = 1
for i in reversed(list(range(N))):
if i in broken:
continue
dp[i] = (dp[i+1] + dp[i+2]) % MOD
print((dp[0]))
| p03013 |
# DP
N, M = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(M)])
MOD = 10**9+7
dp = [0 for i in range(N+2)]
dp[N] = 1
for i in reversed(list(range(N))):
if i in broken:
continue
dp[i] = (dp[i+1] + dp[i+2]) % MOD
print((dp[0]))
| # DP
N, M = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(M)])
MOD = 10**9+7
dp = [0 for i in range(N+2)]
dp[N] = 1
for i in reversed(list(range(N))):
if i in broken:
continue
dp[i] = dp[i+1] + dp[i+2]
dp[i] %= MOD
print((dp[0]))
| p03013 |
n,m=list(map(int,input().split()))
al=[int(eval(input())) for i in range(m)]
mod=1000000007
ansl=[0,1]
for i in range(1,n+1):
if i in al:
ansl.append(0)
else:
ansl.append((ansl[-2]+ansl[-1])%mod)
print((ansl[-1]%mod)) | n,m=list(map(int,input().split()))
al=set([int(eval(input())) for i in range(m)])
mod=1000000007
ansl=[0,1]
for i in range(1,n+1):
if i in al:
ansl.append(0)
else:
ansl.append((ansl[-2]+ansl[-1])%mod)
print((ansl[-1]%mod)) | p03013 |
MOD = 10**9 + 7
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
# i段目にたどり着く方法
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if 1 not in a else 0
for i in range(2, n+1):
dp[i] = (dp[i-1] + dp[i-2]) % MOD if i not in ... | MOD = 10**9 + 7
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a = [0] * (n + 1)
for _ in range(m):
a[int(eval(input()))] = 1
# i段目にたどり着く方法
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if a[1] == 0 else 0
for i in range(2, n+1):
dp[i] = (dp[i-1] + dp[i-2]) % MOD if a[... | p03013 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
dan = [0]*(n+1)
dan[0] = 1
for i in range(1,n+1):
if i not in a:
dan[i] += dan[i-1]
if i >= 2:
dan[i] += dan[i-2]
print((dan[n]%(10**9+7))) | n, m = list(map(int, input().split()))
li = [True]*(n+1)
for i in range(m):
a = int(eval(input()))
li[a] = False
dan = [0]*(n+1)
dan[0] = 1
for j in range(1,n+1):
if li[j]:
dan[j] += dan[j-1]
if j >= 2:
dan[j] += dan[j-2]
print((dan[n]%(10**9+7))) | p03013 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
mod = 10**9 + 7
def nCr(n, r):
r = min(r, n-r)
num, den = 1, 1
for i in range(r):
num *= (n-i)
den *= (i+1)
return num // den % mod
lv = 0
a.append(n+1)
ans = 1
for v in a:
vr = v-1 - ... | n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
mod = 10**9+7
a.append(float('INF'))
a = a[::-1]
dp = [0] * (n+1)
dp[0] = 1
if a[-1] != 1:
dp[1] = 1
else:
a.pop()
for i in range(2, n+1):
if i == a[-1]:
a.pop()
continue
dp[i] = dp[i-1] + ... | p03013 |
import sys
max_num = 1000000007
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)]
current_step, prev_step, two_prev_step = 0, 1, 0
for i in sorted(list(range(N)), reverse=True):
if i in A:
prev_step, two_prev_step = 0, prev_step
c... | import sys
max_num = 1000000007
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)]
stairs = [1] * (N+1)
for i in A:
stairs[i] = 0
for i in range(1, N):
if stairs[i+1] != 0:
stairs[i+1] = stairs[i] + stairs[i-1]
print((stairs[N] % m... | p03013 |
n,m=list(map(int,input().split()))
a=[]
mod=1000000007
for _ in range(m):
a.append(int(eval(input())))
a=set(a)
ans=[1]+[0]*(n)
for i in range(1,n+1):
if i in a:
ans[i]=0
else:
ans[i]=(ans[i-1]+ans[i-2])%mod
print((ans[n])) | n,m=list(map(int,input().split()))
a=set([int(eval(input())) for _ in range(m)])
dp=[1]+[0 for _ in range(n)]
mod=1000000007
for i in range(1,n+1):
if i in a:
dp[i]=0
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[-1])) | p03013 |
import sys
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
if N == 1:
print((1))
sys.exit()
B = ['.'] * (N + 1)
for a in A:
B[a] = '#'
dp = [0] * (N + 1)
if B[1] == '.' and B[2] == '.':
dp[1] = 1
dp[2] = 2
elif B[1] == '#' ... | import sys
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
mod = 1000000007
if n == 1:
print((1))
sys.exit()
B = ['.'] * (n + 1)
for a in A:
B[a] = '#'
dp = [0] * (n + 1)
if B[1] == '.' and B[2] == '.':
dp[1] = 1
dp[2] = 2
elif B[1] == '#' an... | p03013 |
# -*- coding: utf-8 -*-
def main():
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
ans = [1]
ans.append(0) if 1 in A else ans.append(1)
for i in range(2,N+1):
ans.append(0)
if i in A:
continue
ans[i]... | # -*- coding: utf-8 -*-
def main():
N,M = list(map(int,input().split()))
A = set([int(eval(input())) for _ in range(M)])
MOD = 1000000007
ans = [1]
ans.append(0) if 1 in A else ans.append(1)
for i in range(2,N+1):
ans.append(0)
if i in A:
continue
a... | p03013 |
n, m = [int(i) for i in input().split()]
a = [-1] + [int(eval(input())) for _ in range(m)] + [n+1]
fib_l = [-1] * (n+3)
def make_fib(n):
fib_l[0] = fib_l[1] = 1
for i in range(2, n):
fib_l[i] = fib_l[i-1] + fib_l[i-2]
make_fib(n+3)
ret = 1
for i in range(m+1):
t = a[i+1] - a[i] - 2
... | from sys import stdin
n, m = [int(i) for i in stdin.readline().rstrip().split()]
a = [-1] + [int(stdin.readline()) for _ in range(m)] + [n+1]
fib_l = [-1] * (n+3)
def make_fib(n):
fib_l[0] = fib_l[1] = 1
for i in range(2, n):
fib_l[i] = fib_l[i-1] + fib_l[i-2]
make_fib(n+3)
ret = 1
for... | p03013 |
n,m = list(map(int,input().split()))
A = list()
for i in range(m):
a = int(eval(input()))
A.append(a)
dp = [0]*(n+1)
dp[0] = 1
if 1 not in A:
dp[1] = 1
for i in range(2,n+1):
if i not in A:
dp[i] = dp[i-2] + dp[i-1]
dp[i] = dp[i]%1000000007
print((dp[-1]%1000000007)) | n,m = list(map(int,input().split()))
A = list()
for i in range(m):
a = int(eval(input()))
A.append(a)
dp = [0]*(n+1)
dp[0] = 1
if 1 in A:
del A[0]
else:
dp[1] = 1
for i in range(2,n+1):
if len(A) != 0:
if i != A[0]:
dp[i] = dp[i-2] + dp[i-1]
dp[i] =... | p03013 |
Num = 10 ** 9 + 7
N, M = list(map(int, input().split()))
danger = []
for i in range(M):
danger.append(int(eval(input())))
l = [1, 1]
for i in range(1, N):
if i in danger:
l[1] = 0
l = [l[1] % Num, l[0] + l[1]]
if l == [0, 0]:
break
if N in danger:
l[1] = 0
print((l[1] % Num)) | Num = 10 ** 9 + 7
N, M = list(map(int, input().split()))
danger = -1
if M != 0:
danger = int(eval(input()))
count = 1
l = [1, 1]
for i in range(1, N):
if i == danger:
l[1] = 0
if count < M:
danger = int(eval(input()))
count += 1
l = [l[1] % Num, l[0] + l[1]]
if l == [0, 0]:
... | p03013 |
from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]
if m != 0:
lin = [int(stdin.readline().rstrip()) for _ in range(m)]
else:
lin = [-1]
dp = [-1]*(n+1)
dp[0] = 1
if lin[0] == 1:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,n+1):
if i in lin:
... | from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]
lin = [0]*(n+1)
if m != 0:
for i in range(m):
lin[int(stdin.readline().rstrip())] = -1
dp = [-1]*(n+1)
dp[0] = 1
if lin[1] == -1:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,n+1):
if lin[i] ... | p03013 |
from sys import stdin
import bisect
n,m = [int(x) for x in stdin.readline().rstrip().split()]
if m == 0:
li = [0]
else:
li = [int(stdin.readline().rstrip()) for _ in range(m)]
dp = [-1]*(n+1)
dp[0] = 1
if li[0] == 1:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,n+1):
if li[bise... | n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
now = 0
point = 1
mod = 10**9+7
def fib(n,mod):
a, b = 1, 1
for _ in range(n):
a, b = b %mod, (a + b)%mod
return a%mod
for i in range(1,m):
if a[i-1]+1 == a[i]:
print((0))
exit()
... | p03013 |
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r)*math.factorial(r))
n,m=[int(i) for i in input().split()]
a1=[int(eval(input())) for i in range(m)]
a1.append(n+1)
c1=1
a2=0
for i in a1:
a3=i-1-a2
c2=0
for j in range(a3//2+1):
c2+=combinat... | #フィボナッチ数列か…
#c問題も解けないのか…
#典型問題なんだろうな
#踏めない段の分は除いて考えれば良い
n,m=input().split()
n,m=int(n),int(m)
ax=[1]*(n+1)
for i in range(m):
ax[int(eval(input()))]=0
bx=[1,1]
for i in range(2,n+1):
if ax[i-1]==1:
f1=bx[i-1]
else:
f1=0
if ax[i-2]==1:
f2=bx[i-2]
else:
... | p03013 |
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
def resolve():
N, M = list(map(int,input().split()))
A = [int(ev... | # import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
def resolve():
N,M=list(map(int,input().split()))
A=[int(eval(... | p03013 |
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
is_broken = [1] * (n+1)
for i in range(n):
if i in a:
is_broken[i] = 0
step = [i for i in range(n+1)]
step[0] = 1
for i in range(n):
if i - 1 >= 0:
step[i+1] = step[i] * is_broken[i... | mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
is_broken = [1] * (n+1)
for i in range(m):
is_broken[a[i]] = 0
step = [i for i in range(n+1)]
step[0] = 1
for i in range(n):
if i - 1 >= 0:
step[i+1] = step[i] * is_broken[i] + step[i-1] *... | p03013 |
n,m=list(map(int,input().split()))
A=[int(eval(input())) for i in range(m)]
mod=10**9+7
flag=1
S=[0 for i in range(n+3)]
S[0]=1
SET=set(A)
for i in range(n):
if i in SET:
S[i]=0
if i+1 in SET:
flag=0
S[i+1]+=S[i]
S[i+2]+=S[i]
print((S[n]%mod if flag==1 else 0)... | import sys
input=sys.stdin.buffer.readline
n,m=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(n+1)
for _ in range(m):
a=int(eval(input()))
dp[a]=-1
dp[0]=1
for i in range(n):
if dp[i]>=0:
if i+1<=n:
if dp[i+1]>=0:
dp[i+1]+=dp[i]
dp[i+1]%=... | p03013 |
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [0]*M
mod = 10**9+7
for i in range(M):
a[i] = int(eval(input()))
DP = [0]*(N+1)
DP[0] = 1
if 1 in a:
DP[1] = 0
else:
DP[1] = 1
for i in range(2, N+1):
if(i not in a):
DP[i] = (DP[i-1]+DP[i-2])... | import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [0]*M
mod = 10**9+7
for i in range(M):
a[i] = int(eval(input()))
a = set(a)
DP = [0]*(N+1)
DP[0] = 1
if 1 in a:
DP[1] = 0
else:
DP[1] = 1
for i in range(2, N+1):
if(i not in a):
DP[i] = (DP[i... | p03013 |
mod=10**9+7
N,M=list(map(int,input().split()))
A=[int(eval(input())) for m in range(M)]
L=[1 for n in range(N+1)]
for a in A:
L[a]=0
Block=[0,1]
for n in range(1,N+1):
if L[n]==1:
Block=Block[1:]+[sum(Block)%mod]
else:
Block=Block[1:]+[0]
print((Block[-1])) | mod=10**9+7
N,M=list(map(int,input().split()))
A=[int(eval(input())) for m in range(M)]
L=[1 for n in range(N+1)]
for a in A:
L[a]=0
Block=[0,1]
for n in range(1,N+1):
if L[n]:
Block=Block[1:]+[sum(Block)%mod]
else:
Block=Block[1:]+[0]
print((Block[-1])) | p03013 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10**9+7
dp = [0] * (n+1)
dp[0] = 1
for i in range(1,n+1):
if i in a:
continue
else:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1])) | n,m = list(map(int,input().split()))
mod = 10**9+7
a = set()
for i in range(m):
s = int(eval(input()))
a.add(s)
dp = [0]*(n+1)
dp[0] = 1
for i in range(1,n+1):
if i in a:
continue
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1])) | p03013 |
import sys
S = sys.stdin.readline().strip()
T = sys.stdin.readline().strip()
ls = len(S)
lt = len(T)
match = 0
for i in range(ls - lt + 1):
tmp = 0
for j in range(lt):
if S[i+j] == T[j]:
tmp += 1
match = max(match, tmp)
print((lt - match)) | import sys
input = sys.stdin.readline
S = input().strip()
T = input().strip()
ans = float("inf")
ls = len(S)
lt = len(T)
for i in range(ls - lt + 1):
tmp = 0
for j in range(lt):
if S[i+j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) | p02571 |
import sys
import math
#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033... | import sys
import math
#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033... | p02571 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
S,T = LS2(),LS2()
a,b = len(S),len(T)
ans = 1000
for i in range(a-b+1):
x = 0
for j in range(b):
if S[i+j] != T[j]:
x += 1
ans = min(ans,x)
print(ans)
| p02571 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
S = LS2()
T = LS2()
s = len(S)
t = len(T)
ans = 10**5
for i in range(s-t+1):
count = 0
for j in range(t):
if T[j] != S[i+j]:
count += 1
ans = min(ans,count)
print(ans)
| p02571 |
from sys import stdin
import re
from itertools import combinations
def main():
_in = [_.rstrip() for _ in stdin.readlines()]
S = _in[0] # type:str
T = _in[1] # type:str
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
ans = 0
if T in S:
ans = 0
else:
fo... | from sys import stdin
def main():
_in = [_.rstrip() for _ in stdin.readlines()]
S = _in[0] # type:str
T = _in[1] # type:str
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
ans = float('inf')
S_ = list(S)
T_ = list(T)
for i in range(len(S_)-len(T_)+1):
s_ =... | p02571 |
s,t=open(0)
print((min(sum(x!=y for x,y in zip(s[i:],t[:-1]))for i in range(len(s)-len(t)+1)))) | s,(*t,_)=open(0)
print((min(sum(x!=y for x,y in zip(s[i:],t))for i in range(len(s)-len(t))))) | p02571 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = list(ma... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = list(ma... | p02368 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = list(ma... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = list(ma... | p02368 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def dfs_Tarjan(current, low, dfn, scc_stack, in_scc_stack):
global timer
dfn[current... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
5 6
0 1
1 0
1 2
2 4
4 3
3 2
4
0 1
0 3
2 3
3 4
output:
1
0
1
1
"""
import sys
from math import isinf
sys.setrecursionlimit(int(1e5))
def generate_adj_table(_v_info):
for v_detail in _v_info:
v_from, v_to = l... | p02368 |
# Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
adj = [[] for i in range(V)]
for i in range(E):
s, t = list(map(int, file_input.readline().split()))
adj[s].append(t)
# dfs path detect
import collections
def isConnected(u, v):
... | # Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
adj = [[] for i in range(V)]
for i in range(E):
s, t = list(map(int, file_input.readline().split()))
adj[s].append(t)
# Tarjan's strongly connected components algorithm
import collec... | p02368 |
def solve():
N, M = list(map(int, input().split()))
edges = [[] for _ in [0]*N]
r_edges = [[] for _ in [0]*N]
for _ in [0]*M:
a, b = list(map(int, input().split()))
edges[a].append(b)
r_edges[b].append(a)
c = get_strongly_connected_components(edges, r_edge... | def solve():
N, M = list(map(int, input().split()))
edges = [[] for _ in [0]*N]
r_edges = [[] for _ in [0]*N]
for _ in [0]*M:
a, b = list(map(int, input().split()))
edges[a].append(b)
r_edges[b].append(a)
c = get_strongly_connected_components(edges, r_edges)
... | p02368 |
def solve():
N, M = list(map(int, input().split()))
edges = [[] for _ in [0]*N]
r_edges = [[] for _ in [0]*N]
for _ in [0]*M:
a, b = list(map(int, input().split()))
edges[a].append(b)
r_edges[b].append(a)
c = kosaraju(edges, r_edges)
group = [0]*N
for i ... | def solve():
N, M = list(map(int, input().split()))
edges = [[] for _ in [0]*N]
r_edges = [[] for _ in [0]*N]
for _ in [0]*M:
a, b = list(map(int, input().split()))
edges[a].append(b)
r_edges[b].append(a)
c = kosaraju(edges, r_edges)
group = [0]*N
for i ... | p02368 |
"""
強連結成分分解
"""
import sys
sys.setrecursionlimit(1000000)
def dfs(v, visited, edges, order):
visited[v] = True
for to in edges[v]:
if not visited[to]:
dfs(to, visited, edges, order)
order.append(v)
def search_strongly_connection(v, visited, reverse_edges, parent):
visited[v] = True... | """
強連結成分分解
"""
import sys
sys.setrecursionlimit(1000000)
def dfs(v, visited, edges, order):
visited[v] = True
for to in edges[v]:
if not visited[to]:
dfs(to, visited, edges, order)
order.append(v)
def search_strongly_connection(v, visited, reverse_edges, parent, num):
visited[v] =... | p02368 |
import sys
sys.setrecursionlimit(10001)
def dfs(u, g, stack):
visited[u] = True
for v in g[u]:
if not visited[v]:
dfs(v, g, stack)
stack.append(u)
return stack
nv, ne = list(map(int, input().split(' ')))
adj, tps = ([[] for _ in range(nv)] for _ in range(2))
for _ in... | import sys
sys.setrecursionlimit(10001)
def dfs(u, g, stack):
visited[u] = True
for v in g[u]:
if not visited[v]:
dfs(v, g, stack)
stack.append(u)
return stack
nv, ne = list(map(int, input().split(' ')))
adj, tps = ([[] for _ in range(nv)] for _ in range(2))
for _ in... | p02368 |
N = int(eval(input()))
from math import sqrt
#N mod K = 0 or 1 となるk をさがす
#K = Nの約数 or N-1 の約数
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
if i != 1:
divisor_list.append(i)
divisor_lis... | N = int(eval(input()))
from math import sqrt
#N mod K = 0 or 1 となるk をさがす
#K = Nの約数 or N-1 の約数
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
if i != 1:
divisor_list.append(i)
if num // i... | p02722 |
N = int(eval(input()))
from math import sqrt
#N mod K = 0 or 1 となるk をさがす
#K = Nの約数 or N-1 の約数
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
if i != 1:
divisor_list.append(i)
if num // i... | N = int(eval(input()))
from math import sqrt
def divisor(num):
max_num = int(sqrt(num))
divisor_list = []
for i in range(1, max_num + 1):
if num % i == 0:
divisor_list.append(i)
divisor_list.append(num//i)
return divisor_list
K0 = divisor(N)
K1 = divisor(N-... | p02722 |
N = int(eval(input()))
def solve(num):
ret = set()
p = 1
while p * p <= num:
if num % p == 0:
ret.add(p)
ret.add(num // p)
p += 1
return ret
s1 = solve(N)
s2 = solve(N-1)
# 1は答えに入らないので抜いた
ans = len(s2) - 1
for n in s1:
if n =... |
N = int(eval(input()))
"""
愚直にやると、Kを2～Nの範囲で全部調べて数え上げる。N <= 10**12 なので間に合わない。
たとえば N=100だと、
[2, 3, 4, 9, 10, 11, 33, 99, 100]
が条件を満たす数字になる。
割り算を行わないとき、明らかに N % K = 1 になる
これは、「NをKで割ったら、１あまる」であるから、「N-1をKでわったら割り切れる」ともいえる。
なので、割り算が起こらないものは、N-1の約数。
割り算が起こるやつは、割れるだけ割った後、余りを調べればよい。
"""
def solv... | p02722 |
n = int(eval(input()))
def check(n, k):
while n % k == 0:
n = n // k
if n >= k:
n = n - k * (n // k)
return n
def count(n):
total = 0
cands = set([n, n-1])
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
cands.add(i)
cands... | n = int(eval(input()))
def check(n, k):
while n % k == 0:
n = n // k
if n >= k:
n = n - k * (n // k)
return n
def count(n):
total = 0
cands = set([n, n-1])
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
cands.add(i)
cands... | p02722 |
N=int(eval(input()))
k=2
ans=1
factors=[]
i=1
while i*i<N-1:
if (N-1)%i==0:
ans+=1
i+=1
while k*k<=N:
n=0
while pow(k,n)<=N:
if (N-pow(k,n))%(pow(k,n+1))==0:
ans+=1
break
n+=1
k+=1
print(ans) | n=int(eval(input()))
ans=set()
ans.add(n)
i=2
x = 1
while x * x <= n-1 :
if (n-1) % x == 0:
ans.add(x)
ans.add((n-1)//x)
x += 1
while i*i<=n:
t=n
while t%i==0:
t/=i
if t%i==1:
ans.add(i)
i+=1
print((len(ans)-1)) | p02722 |
def make_div(n):
divs = []
for i in range(1, int(n**0.5)+1):
if n%i==0:
divs.append(i)
if i!=n//i:
divs.append(n//i)
divs.sort()
return divs
N = int(eval(input()))
d = make_div(N)
d = d[1:]
s = set()
for di ... | def make_divs(n):
divs = []
for i in range(1, int(n**0.5)+1):
if n%i==0:
divs.append(i)
if i!=n//i:
divs.append(n//i)
return divs
N = int(eval(input()))
divs = make_divs(N)
ans = 0
for d in divs:
if d==1:
... | p02722 |
N = int(eval(input()))
divisor = set([N, N - 1])
x = N
for i in range(2, int(x ** 0.5) + 1):
z = x
while z % i == 0:
z //= i
if z % i == 1:
divisor.add(i)
if i == x // i:
continue
z = x
while z % (x // i) == 0:
z //= (x // i)
... |
N = int(eval(input()))
def calc_divisor(x):
divisor = []
for i in range(1, int(x ** 0.5) + 1):
if x % i == 0:
if i != 1:
divisor.append(i)
if i != x // i:
divisor.append(x // i)
return divisor
cand = len(calc_divisor(N - 1))... | p02722 |
N = int(eval(input()))
if N == 2:
print((1))
exit()
if N == 3:
print((2))
exit()
ans = []
for n in range(1, int(N ** 0.5) + 1):
if (N - 1) % n == 0:
ans.append(n)
ans.append((N - 1) // n)
for k in range(2, int(N ** 0.5) + 1):
x = N
while x % k == 0:
... | N = int(eval(input()))
ans = []
for n in range(1, int(N ** 0.5) + 1):
if (N - 1) % n == 0:
ans.append(n)
ans.append((N - 1) // n)
for k in range(2, int(N ** 0.5) + 1):
if N % k != 0:
continue
x = N
while x % k == 0:
x //= k
if x % k == 1:
... | p02722 |
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)
# divisors.sort()
return divisors
n = int(eval(input()))
i = 2
cnt = 1
check = 0
# for i in ran... | 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)
# divisors.sort()
return divisors
n = int(eval(input()))
out = make_divisors(n)
ans = []
for i in ... | p02722 |
def MI():return list(map(int,input().split()))
def LI():return list(MI())
# n,k,c=MI()
# s=input()
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
whi... | def MI():return list(map(int,input().split()))
def LI():return list(MI())
def factorization(n):
arr=[]
temp=n
for i in range(2,int(n**0.5)+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp//=i
arr.append([i,cnt])
if temp!=1:arr.append([temp,1])
if ... | p02722 |
N=int(eval(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)
divisors.sort()
return divisors
s=len(make_divisors(N-1))
for i in range(1,len(mak... | N=int(eval(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)
divisors.sort()
return divisors
s=len(make_divisors(N-1))
p=make_divisors(N)
for ... | p02722 |
N = int(eval(input()))
cnt = 2 if N > 2 else 1
ret = []
for i in range(2, int(N**0.5)+1):
if N % i == 0:
k = N//i
while k % i == 0:
k //= i
if k % i == 1:
cnt += 1
if N // i != i:
j = N // i
k = i
while k % ... | N = int(eval(input()))
def divisor(N):
ret = []
for i in range(1, int(N**0.5)+1):
if N % i == 0:
ret.append(i)
if N // i != i:
ret.append(N//i)
return ret
div_N = divisor(N)
div_N_1 = divisor(N-1)
ans = 0
for k in div_N[1:]:
n = N
... | p02722 |
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)
# divisors.sort() #小さい順位欲しいとき
return divisors
## [[2, 3], [3, 1]]
## 24 = 2^3 * 3^1
n=int(eval(inp... | 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)
# divisors.sort() #小さい順位欲しいとき
return divisors
n=int(eval(input()))
a=make_divisors(n)[1:]
ans=0
for ... | p02722 |
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
N = int(eval(in... | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
N = int(eval(in... | p02722 |
def check(i):
tot=k
while(tot%i==0):
tot//=i
if(tot%i==1):
setl.add(i)
import math
k=int(eval(input()))
if(k==2):
print((1))
exit()
setl = set()
setl.add(k); setl.add(k-1)
for x in range(2,int(math.sqrt(k))+1):
check(x)
check(k//x)
print((len(setl))) | def check(i):
tot=k
pw=0
while(tot%i==0):
tot//=i
pw+=1
if(tot%i==1):
other = tot//i
if(pw==0 and other>=2 and other<=k):
setl.add(other)
setl.add(i)
import math
k=int(eval(input()))
if(k==2):
print((1))
exit()
setl = set()
setl.add(k); setl.add(k-1)
for x in range(2,int(math.sqrt... | p02722 |
import sys
from math import sqrt, floor
def divisors(n):
res = set()
for i in range(1, floor(sqrt(n)) + 1):
if n % i == 0:
res.add(i)
res.add(n // i)
return res
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n - 1)
cnt = len(res) -... | import sys
from math import sqrt, floor
def divisors(n):
res = set()
for i in range(1, floor(sqrt(n)) + 1):
if n % i == 0:
res.add(i)
res.add(n // i)
return res - set([1])
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n - 1)
cnt ... | p02722 |
import sys
from math import sqrt, floor
def divisors(n):
res = set()
for i in range(1, floor(sqrt(n)) + 1):
if n % i == 0:
res.add(i)
res.add(n // i)
return res - set([1])
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n - 1)
cnt ... | import sys
from math import sqrt, floor
def divisors(n):
res = set()
for i in range(1, floor(sqrt(n)) + 1):
if not n % i:
res.add(i)
res.add(n // i)
return res - set([1])
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n - 1)
cnt =... | p02722 |
import math
def make_divisors(n):
divisors = []
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
def main():
n = int(eval(input()))
r = len(... | import math
def make_divisors(n):
divisors = []
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
def main():
n = int(eval(input()))
r = len(... | p02722 |
N = int(eval(input()))
def isOk(k):
n = N
while n % k == 0:
n //= k
return n % k == 1
if N <= 10**6:
ans = 0
for i in range(2, N + 1):
if isOk(i):
ans += 1
print(ans)
exit()
ans = 0
V = set()
for i in range(2, int(N**0.5) + 10):
if isOk(i... | N = int(eval(input()))
def isOk(k):
n = N
while n % k == 0:
n //= k
return n % k == 1
# 約数の全列挙
def 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... | p02722 |
import math
def prime(x):
L = []
last = math.floor(x ** 0.5)
for i in range(1, last + 1):
if x % i == 0:
L.append(i)
if x // i != i:
L.append(x // i)
return L
N = int(eval(input()))
if N == 2:
print((1))
exit()
L = prime(N - 1)
ans = len(L) - 1
D = prime(N)... | import math
def prime(x):
p = {}
last = math.floor(x ** 0.5)
if x % 2 == 0:
cnt = 1
x //= 2
while x & 1 == 0:
x //= 2
cnt += 1
p[2] = cnt
for i in range(3, last + 1, 2):
if x % i == 0:
x //= i
cnt = 1
while x % i == 0:
cnt += 1
... | p02722 |
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)
divisors.sort()
return divisors
n = int(eval(input()))
nl = make_divisors(n)
nl_p = make_divisors(n... | 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)
divisors.sort()
return divisors
n = int(eval(input()))
nl = make_divisors(n)
nl_m = make_divisors(n... | p02722 |
def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while(a > 1):
for i in range(j, int(a**0.5)+1):
if a % i == 0:
y(i)
a, j = a//i, i
break
... | def main():
from collections import Counter as ct
def soinsuu(a):
yy, j = [], 2
y = yy.append
while(a > 1):
for i in range(j, int(a**0.5)+1):
if a % i == 0:
y(i)
a, j = a//i, i
break
... | p02722 |
import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: list(map(int, stdin.readline().split()))
nl = lambda: list(map(int, stdin.readline().split()))
def divisor(n):
ass = []
for i in range(1, int(n**0.5)+1):
if n%i == ... | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: list(map(int, stdin.readline().split()))
nl = lambda: list(map(int, stdin.readline().split()))
def divisor(n):
ass = []
for i in range(1, int(n**0.5)+1):
if n%i == ... | p02722 |
N=int(eval(input()))
DN={N}
k=2
while(k*k<=N):
if N%k==0:
DN.add(k)
DN.add(N//k)
k+=1
DN1={N-1}
k=2
while(k*k<=(N-1)):
if (N-1)%k==0:
DN1.add(k)
DN1.add((N-1)//k)
k+=1
DN=sorted(list(DN))
DN1=sorted(list(DN1))
#print(DN)
#print(DN1)
ans=set()
for K in ... | N=int(eval(input()))
if N==2:
print((1))
exit()
DN={N}
k=2
while(k*k<=N):
if N%k==0:
DN.add(k)
DN.add(N//k)
k+=1
DN1={N-1}
k=2
while(k*k<=(N-1)):
if (N-1)%k==0:
DN1.add(k)
DN1.add((N-1)//k)
k+=1
DN1=len(DN1)
#print(DN)
#print(DN1)
ans=0
for K... | p02722 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
def make_divisors(n): # nの約数を列挙、1を除く
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
# 候補はNかN-1の約数
answer = 0
def make_divisors(n): # nの約数を列挙
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.... | p02722 |
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)
divisors.sort()
return divisors
n = int(eval(input()))
l = make_divisors(n)
ans = make_divisors(n-1)
... | def main():
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)
divisors.sort()
return divisors
n = int(eval(input()))
l = make_div... | p02722 |
N = int(eval(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
L = len(make_divisors(N))
ans = 0
for i in range(1,L):
t ... | N = int(eval(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
L = len(make_divisors(N))
A = make_divisors(N)
ans = 0
for ... | p02722 |
N = int(eval(input()))
originalN = 0 +N
if N == 2:
print((1))
exit()
ans = 0
primenum = [2]
count = [0 for _ in range(int(N**0.5)+2)]
for k in range(3, len(count), 2):
if count[k] == 0:
primenum.append(k)
for j in range(k, len(count), k):
count[j] = 1
def factorization(n):
lis ... | N = int(eval(input()))
originalN = 0 +N
if N == 2:
print((1))
exit()
ans = 0
"""
primenum = [2]
count = [0 for _ in range(int(N**0.5)+2)]
for k in range(3, len(count), 2):
if count[k] == 0:
primenum.append(k)
for j in range(k, len(count), k):
count[j] = 1
def factorization(n):
... | p02722 |
N = int(eval(input()))
originalN = 0 +N
if N == 2:
print((1))
exit()
ans = 0
"""
primenum = [2]
count = [0 for _ in range(int(N**0.5)+2)]
for k in range(3, len(count), 2):
if count[k] == 0:
primenum.append(k)
for j in range(k, len(count), k):
count[j] = 1
def factorization(n):
... | N = int(eval(input()))
if N == 2:
print((1))
exit()
ans = 0
def factorization(n):
lis = []
if n % 2 == 0:
c = 0
while n%2 == 0:
n //= 2
c += 1
lis.append([2, c])
k = 3
while k*k <= n:
if n%k == 0:
c = 0
while n%k == 0:
n //= k
... | p02722 |
import sys
sys.setrecursionlimit(10 ** 6)
n = int(eval(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)
# divisors.sort()
return divisors
... | n = int(eval(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)
# divisors.sort()
return divisors
ansl = make_divisors(n-1)
an... | p02722 |
import sys,math,copy,queue,itertools,bisect
NI = lambda : int(sys.stdin.readline())
INF = 10**18
N = NI()
if N == 2:
print((1))
exit (0)
ans = 0
max_b = int(math.log(N,2))
for x in range(2,int(math.sqrt(N-1))+1):
if (N-1) % x == 0:
if (N-1) == x**2:
ans += 1
else:
... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
NI = lambda : int(sys.stdin.readline())
N = NI()
max_i = int(math.log2(N))
div = []
for i in range(1,int(math.sqrt(N))+1):
if N % i == 0:
div.append((i,N//i)); div.append((N//i,i))
ans = ... | p02722 |
N = int(eval(input()))
sqrt_N = int(N ** 0.5) + 1
dividers_for_N = [N]
ans_list = [N - 1]
for i in range(2, sqrt_N + 1):
if (N - 1) % i == 0:
ans_list.append(i)
ans_list.append((N - 1) // i)
if N % i == 0:
dividers_for_N.append(i)
dividers_for_N.append(N // i)
... | N = int(eval(input()))
sqrt_N = int(N ** 0.5)
dividers_for_N = set()
ans_set = set()
for i in range(1, sqrt_N + 1):
if (N - 1) % i == 0:
ans_set.add(i)
ans_set.add((N - 1) // i)
if N % i == 0:
dividers_for_N.add(i)
dividers_for_N.add(N // i)
dividers_for_N -= {... | p02722 |
N = int(eval(input()))
sqrt_N = int(N ** 0.5)
dividers_for_N = set()
ans_set = set()
for i in range(1, sqrt_N + 1):
if (N - 1) % i == 0:
ans_set.add(i)
ans_set.add((N - 1) // i)
if N % i == 0:
dividers_for_N.add(i)
dividers_for_N.add(N // i)
dividers_for_N -= {... | N = int(eval(input()))
sqrt_N = int(N ** 0.5)
dividers_for_N = []
ans_list = []
for i in range(1, sqrt_N + 1):
if (N - 1) % i == 0:
ans_list.append(i)
if i != (N - 1) // i:
ans_list.append((N - 1) // i)
if N % i == 0:
dividers_for_N.append(i)
if i != ... | p02722 |
from copy import deepcopy
# 約数を全列挙する関数
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)
divisors.sort()
return divisors
N0 = int(eval(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)
divisors.sort()
return divisors
N0 = int(eval(input()))
ans = 0
# N = K^a (bK +... | p02722 |
N=int(eval(input()))
if N==2:
print((1))
exit()
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)
# divisors.sort()
return divisors
#N-1の約数(1は除く) Nそのもの
#2
d=make_divisors(N-... | N=int(eval(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)
# divisors.sort()
return divisors
#print(make_divisors(3141))
#N, N-1, 2
... | p02722 |
import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
div = []
ans = 0
for i in range(1, int(N**0.5)+1):
if N % i == 0:
div.append(i)
if i != N // i:
div.append(N//i)
for d in div:
if d == 1: continue
tmp = N
while tmp % d == 0:
... | import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
ans = 0
def divisor(x):
res = []
for i in range(1, int(x**0.5) + 1):
if x % i == 0:
if i != x//i:
res.append(i)
res.append(x//i)
else:
... | p02722 |
from math import sqrt
def f(x):
ret = []
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
ret.append(i)
ret.append(x // i)
return ret
n = int(eval(input()))
ans = 1
for k in range(2, int(sqrt(n)) + 1):
r = n
while r % k == 0:
r //= ... | from math import sqrt
def divisors(x):
for i in range(1, int(sqrt(x)) + 1):
if x % i == 0:
yield i
if x // i != i:
yield x // i
n = int(eval(input()))
ans = 0
for e in divisors(n):
if e == 1:
continue
r = n
while r % e == 0... | p02722 |
n = int(eval(input()))
def divisior(n):
a = []
i = 1
while (i*i <= n):
if n%i == 0:
a.append(i)
if (i*i != n): a.append(n//i)
i += 1
return a
ans = 0
a = divisior(n)
for x in a[1:]:
tmp = n
while (tmp%x == 0): tmp = tmp//x
if (tmp%... | n = int(eval(input()))
def divisior(n):
a = []
i = 1
while (i*i <= n):
if n%i == 0:
a.append(i)
if (i*i != n): a.append(n//i)
i += 1
return a
ans = 0
a = divisior(n)
for x in a:
if x == 1: continue
tmp = n
while (tmp%x == 0): tmp =... | p02722 |
N = int(eval(input()))
def check(p):
_N = N
while _N%p == 0:
_N //= p
return ((_N-1)%p == 0) or (_N == 1)
n = int(N**0.5) + 1
P0 = set([N])
P1 = set([N-1])
for i in range(2, n+1):
if (N-1)%i == 0:
P1.add(i)
P1.add((N-1)//i)
if N%i == 0:
P0.add(i)
P0.add(N//i)
ans = le... | N = int(eval(input()))
def check(p):
_N = N
while _N%p == 0:
_N //= p
return (_N-1)%p == 0
n = int(N**0.5) + 1
P0 = set([N])
P1 = set([N-1])
for i in range(2, n+1):
if (N-1)%i == 0:
P1.add(i)
P1.add((N-1)//i)
if N%i == 0:
P0.add(i)
P0.add(N//i)
P0.discard(1)
P1.disca... | p02722 |
N = int(eval(input()))
def check(p):
_N = N
while _N%p == 0:
_N //= p
return (_N-1)%p == 0
n = int(N**0.5) + 1
P0 = set([N])
P1 = set([N-1])
for i in range(2, n+1):
if (N-1)%i == 0:
P1.add(i)
P1.add((N-1)//i)
if N%i == 0:
P0.add(i)
P0.add(N//i)
P0.discard(1)
P1.disca... | def check(p):
_N = N
while _N%p == 0:
_N //= p
return (_N-1)%p == 0
def calc_divisors(n):
m = int(n**0.5)
left = []
right = []
for i in range(1, m+1):
if n%i == 0:
left.append(i)
right.append(n//i)
if left[-1] == right[-1]:
right.pop(... | p02722 |
# 1は除外
# ・N-1の約数は全て対象
# ・Nの約数で、sqrt(N)以下であればOK ただしN自身は対象
# これを足し合わせる
N = int(eval(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 div... | # 1は除外
# ・N-1の約数は全て対象
# ・Nの約数でsqrt(N)以下の数について、Nで割れなくなるまで割って、最後にあまりが1になればOK
# ・N自身は必ず対象
# これを足し合わせる
N = int(eval(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:
diviso... | p02722 |
def make_divisors(n):
divisors = [n]
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
def main():
N = int(eval(input()))
if N == 2:
... | def make_divisors(n):
divisors = [n]
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
def main():
N = int(eval(input()))
if N == 2:
... | p02722 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def divisors(n):
lower = []
upper = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
lower.append(i)
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def divisors(n):
lower = []
upper = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
lower.append(i)
... | p02722 |
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)
divisors.sort()
return divisors
def all_pattern(l):
global n
ans=0
for ds in make_diviso... | 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)
divisors.sort()
return divisors
def all_pattern(l):
global n
ans=0
for ds in make_diviso... | p02722 |
N = int(eval(input()))
def divisor(M):
div = set()
for i in range(1, int(N ** 0.5 + 0.5) + 1):
if M % i == 0:
div.add(i)
div.add(M // i)
return div
def simu(M, X):
cnt = 0
while M >= X:
if M % X == 0:
M //= X
elif M % X... | N = int(eval(input()))
def divisor(M):
div = set()
for i in range(1, int(N ** 0.5 + 0.5) + 1):
if M % i == 0:
div.add(i)
div.add(M // i)
return div
def simu(M, X):
while M % X == 0:
M //= X
return M % X == 1
B = divisor(N - 1)
ans = le... | p02722 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
AGC028 D
"""
import itertools
from functools import reduce
from functools import lru_cache
nn, k = list(map(int, input().split()))
n = 2*nn
abli = []
for i in range(k):
a, b = list(map(int, input().split()))
if a < b:
... | #! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
"""
AGC028 D
"""
import itertools
from functools import reduce
from functools import lru_cache
nn, k = list(map(int, input().split()))
n = 2*nn
abli = []
for i in range(k):
a, b = list(map(int, input().split()))
if a < b:
... | p03234 |
n=int(eval(input()))
if n%2==0:
print(n)
else:
print((2*n))
| N = int(eval(input()))
if N%2 == 0:
print(N)
else:
print((N*2)) | p03307 |
n = int(input())
if n % 2 == 0:
print(n)
else:
print(n * 2)
| n = int(input())
if n % 2 == 1:
print(n * 2)
else:
print(n)
| p03307 |
# -*-coding=utf-8-*-
n = int(eval(input()))
if n%2:
n *= 2
print(n) | n=int(eval(input()))
if n%2==0:
print(n)
else:
print((n*2))
| p03307 |
n = int(eval(input()))
if n % 2:
print((2 * n))
else:
print(n) | n = int(eval(input()))
if n % 2 == 0:
ans = n
else:
ans = 2*n
print(ans) | p03307 |
N = int(eval(input()))
if N%2 == 0:
print(N)
else:
print((2*N))
| N = int(eval(input()))
print((2*N if N%2==1 else N)) | p03307 |
import math
n = int(eval(input()))
print((2 // math.gcd(2, n) * n))
| n = int(eval(input()))
if n % 2 == 0:
print(n)
else:
print((2 * n)) | p03307 |
N=int(eval(input()))
#A1,A2,A3=map(int,input().split())
if N%2==0:
print(N)
else:
print((N*2)) | N=int(eval(input()))
if N%2==0:
print(N)
else:
print((N*2))
| p03307 |
n=int(eval(input()))
print((2*n if n%2 else n)) | n=int(eval(input()))
print((n+n%2*n)) | p03307 |
import math
n = int(eval(input()))
gcd = math.gcd(2, n)
lcm = 2 * n // gcd
print(lcm)
| n = int(eval(input()))
if n % 2 == 0:
print(n)
else:
print((2 * n)) | p03307 |
a=eval(input());print(a+a%2*a) | n=int(eval(input()))
print((n+n%2*n)) | p03307 |
n = int(eval(input()))
print((n if n%2==0 else n*2)) | n = int(eval(input()))
if n%2 ==0 :
print(n)
else:
print((n*2)) | p03307 |
N = int(eval(input()))
if N%2 == 1:
print((N*2))
else:
print(N)
| N = int(eval(input()))
print((N if N%2==0 else 2*N)) | p03307 |
N = int(eval(input()))
def gcd(m, n):
while n:
m, n = n, m%n
return m
def lcm(m, n):
return int((m * n) / gcd(m, n))
print((lcm(N,2))) | N = int(eval(input()))
def gcd(m, n):
while n:
m, n = n, m%n
return m
def lcm(m, n):
print((m * n // gcd(m, n)))
lcm(N,2) | p03307 |
a = int(eval(input()))
if a%2 == 0:
print(a)
else:
print((a*2)) | a = int(eval(input()))
if a%2 == 0:
print(a)
else:
print((2*a)) | p03307 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.