input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n,m = list(map(int, input().split()))
sc = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
flag = True
for s in sc:
num = str(i)
if len(num) >= s[0] and str(s[1]) == num[s[0] - 1]:
... | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
n,m = list(map(int, input().split()))
v = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
flag = True
num = str(i)
for sc in v:
if len(num) >= sc[0] and str(sc[1]) == num[sc[0] - 1]:
... | p02761 |
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
C=[list(map(int,input().split())) for i in range(M)]
for i in range(1000):
S=str(i)
if len(S)==N:
for s,c in C:
s-=1
if S[s]==str(c):
True
else:
... | import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
score=[-1]*N
for i in range(M):
s,c=list(map(int,input().split()))
s-=1
if score[s]==-1 or score[s]==c:
score[s]=c
else:
print((-1))
sys.exit()
if N>1 and score[0]==0:
print((-... | p02761 |
N,M = list(map(int,input().split()))
pattern = ["."] * N
for i in range(M):
s,c = input().split()
s = int(s)
if pattern[s - 1] not in (".",c):
print((-1))
exit(0)
pattern[s - 1] = c
import re
comp = re.compile("^" + "".join(pattern) + "$")
for i in range(1001):
res = comp.match(str... | N,M = list(map(int,input().split()))
if N == 1:
ans = ["0"]
default = "0"
else:
ans = ["1"] + ["0"] * (N - 1)
default = "1" + "0" * (N - 1)
for i in range(M):
s,c = input().split()
s = int(s) - 1
if N > 1 and s == 0 and c == "0":
print((-1))
exit(0)
if ans[s] == default[s] or an... | p02761 |
N,M=list(map(int,input().split()))
SC=[input().split() for _ in range(M)]
ans=["0"]*N
for s,c in SC:
if ans[int(s)-1]!="0" and ans[int(s)-1]!=c:
print((-1))
exit()
if N>1 and s=="1" and c=="0":
print((-1))
exit()
ans[int(s)-1]=c
if ans[0]=="0" and N>1:
ans[0]="1"
print(("".join(ans)... | N,M=list(map(int,input().split()))
SC=[input().split() for _ in range(M)]
ans=["0"]*N
for s,c in SC:
if ans[int(s)-1]!="0" and ans[int(s)-1]!=c:
print((-1))
exit()
if N>1 and int(s)==1 and c=="0":
print((-1))
exit()
ans[int(s)-1]=c
if N>1 and ans[0]=="0":
ans[0]="1"
print(("".join(a... | p02761 |
n, m = list(map(int, input().split()))
lst = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
i = str(i)
if len(i) != n:
continue
for [x, y] in lst:
if i[x-1] != str(y):
break
else:
print(i)
exit()
print((-1))
| n, m = list(map(int, input().split()))
lst = [list(input().split()) for _ in range(m)]
ans = [''] * 3
for [s, c] in lst:
s = int(s) - 1
if ans[s] in ['', c]:
ans[s] = c
else:
print((-1))
exit()
if n == 1:
if m == 0:
print((0))
exit()
else:... | p02761 |
n,m = list(map(int,input().split()))
req = [list(map(int,input().split())) for i in range(m)]
for i in range(10000):
st = str(i)
if len(st) != n:
continue
ok = True
for s,c in req:
if int(st[s-1]) != int(c):
ok = False
if ok:
print(st)
exit()
print((-1)) | N,M = list(map(int,input().split()))
sc = [list(map(int,input().split())) for m in range(M)]
for i in range(10**N):
if len(str(i))==N and all(str(i)[s-1]==str(c) for s,c in sc):
print(i)
break
else:
print((-1)) | p02761 |
import sys
n,m = list(map(int,input().split()))
sc = []
if m == 0 and n == 1:
print((0))
sys.exit()
elif m == 0 and n != 1:
print((10**n // 10))
sys.exit()
for _ in range(m):
sc.append(list(map(int,input().split())))
sc.sort()
if n == 1:
tmp = 0
for i in range(m):
if sc[i][0... | import sys
n,m = list(map(int,input().split()))
sc = []
for _ in range(m):
sc.append(list(map(int,input().split())))
sc.sort()
ans = ['0' for _ in range(n)]
if n > 1:
ans[0] = '1'
d = {}
for i in range(m):
if sc[i] == [1,0]:
if n > 1:
print((-1))
sys.exit()
if sc[i][0] not in d:
d[sc[i... | p02761 |
import math
N, M = list(map(int, input().split()))
candidate = []
for i in range(1000):
if N == len(str(i)):
candidate.append(i)
for _ in range(M):
s, c = list(map(int, input().split()))
tmp = []
for n in candidate:
if int(str(n)[s - 1]) == c:
tmp.append(n)
... | n, m = list(map(int, input().split()))
nums = []
for i in range(1000):
if len(str(i)) == n:
nums.append(i)
for _ in range(m):
s, c = list(map(int, input().split()))
next_nums = []
for a in nums:
if int(str(a)[s - 1]) == c:
next_nums.append(a)
nums = next_nums... | p02761 |
import collections
N, M = list(map(int, input().split()))
sc = [tuple(map(int, input().split())) for i in range(M)]
t = collections.defaultdict(int)
flag = True
for s, c in sc:
if s in t and t[s] != c:
flag = False
break
else:
t[s] = c
if flag:
ans = []
for i in ra... | N,M=list(map(int,input().split()))
d = dict()
for i in range(M):
a,b=list(map(int,input().split()))
if a not in d:
d[a]=b
else:
if d[a]!=b:
print((-1))
exit(0)
tmp=0
for i in range(10):
if 3 in d and d[3] != i:
continue
for j in range(10):
if 2 in d and d[2] != j:
... | p02761 |
N,M=list(map(int,input().split()))
d = dict()
for i in range(M):
a,b=list(map(int,input().split()))
if a not in d:
d[a]=b
else:
if d[a]!=b:
print((-1))
exit(0)
tmp=0
for i in range(10):
if 3 in d and d[3] != i:
continue
for j in range(10):
if 2 in d and d[2] != j:
... | N, M = list(map(int, input().split()))
ans = [-1]*N
for i in range(M):
s, c = list(map(int, input().split()))
if ans[s-1] > 0:
if ans[s-1] == c:
continue
else:
print((-1))
exit(0)
else:
if s == 1 and c == 0 and N != 1:
pri... | p02761 |
n,m = list(map(int,input().split()))
sc = [list(map(int,input().split())) for i in range(m)]
for i in range(10000):
s = str(i)
if len(s) != n:
continue
ok = True
for a, b in sc:
if s[a - 1] != str(b):
ok = False
break
if ok:
print(i)
... | n,m = list(map(int,input().split()))
sc = [list(map(int,input().split())) for _ in range(m)]
for i in range(1000):
s = str(i)
if len(s) != n: continue
if all(s[a - 1] == str(b) for a, b in sc):
print(i)
exit()
print((-1))
| p02761 |
n, m = list(map(int, input().split()))
x = [list(map(int, input().split())) for i in range(m)]
count = 0
for i in range(1000):
count = 0
i = str(i)
if len(i) == n:
for s, c in x:
if i[s-1] == str(c):
count += 1
else:
break
i... | n, m = list(map(int, input().split()))
x = [list(map(int, input().split())) for i in range(m)]
for i in range(10**(n-1) if n>1 else 0, 10**n):
i = str(i)
for s, c in x:
if i[s-1] != str(c):
break
else:
print(i)
exit()
print((-1)) | p02761 |
N, M = list(map(int,input().split()))
check_lis = [-1 for _ in range(N)]
for _ in range(M):
s,c = list(map(int,input().split()))
if check_lis[s-1] == -1:
check_lis[s-1] = c
else:
if check_lis[s-1] != c:
print('-1')
break
if check_lis[0] == 0 and N != 1:
... | N, M = list(map(int, input().split()))
if N == 1:
min_range = 0
max_range = 10
else:
min_range = 10 ** (N-1)
max_range = 10 ** N
digits_lis = ['not defined' for _ in range(N+1)]
for _ in range(M):
s, c = list(map(int, input().split()))
if digits_lis[s] == 'not defined':
digits... | p02761 |
n,m=map(int,input().split())
l=[tuple(map(int,input().split())) for i in range(m)]
l=set(l)
#[s,c]
ans=['1']+['0']*(n-1)
for s,c in l:
#1桁の数の時は例外
if s==1 and c==0 and n>1:
print(-1)
exit()
#既に変更済みの場合
if s==1 and ans[0]!='1':
print(-1)
exit()
if s!=1 an... | n,m=map(int,input().split())
sc=set(tuple(map(int,input().split())) for i in range(m))
S=['1']+['0']*(n-1)
for s,c in sc:
if s==1 and c==0 and n>1:
print(-1)
exit()
elif s==1 and S[0]!='1':
print(-1)
exit()
elif s>1 and S[s-1]!='0':
print(-1)
exi... | p02761 |
N,M = list(map(int, input().split()))
ans = 0
S = [""]*N
for _ in range(M):
s, c = list(map(int,input().split()))
if S[s-1] == "" or S[s-1] == c:
S[s-1] = c
elif S[s-1] != "" and S[s-1] != c:
print((-1))
exit(0)
if N != 1:
if S[0] == "":
S[0] = 1
if S[0] == 0:
print((-1))
... | N,M = list(map(int, input().split()))
ans = 0
S = [""]*N
for _ in range(M):
s, c = list(map(int,input().split()))
if S[s-1] == "" or S[s-1] == c:
S[s-1] = c
elif S[s-1] != "" and S[s-1] != c:
print((-1))
exit(0)
if N == 3:
if S[0] == "":
S[0] = 1
if S[0] == 0:
print((-1))
... | p02761 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *SC = list(map(int, read().split()))
ans = -1
for i in range(1000):
n = str(i)
if len(n) != N:
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, M, *SC = list(map(int, read().split()))
A = [-1] * N
for s, c in zip(*[iter(SC)] * 2):
s -= 1
if A[s... | p02761 |
N, M = list(map(int, input().split()))
SC = [list(map(int, input().split())) for _ in range(M)]
i = 10**(N-1) if N > 1 else 0
while i < 10**N:
n = [(i//10**j)%10 for j in reversed(list(range(N)))]
f = True
for s, c in SC:
if n[s-1] != c:
f = False
if f:
break
i += 1
if i >= 10**N:
... | N, M = list(map(int, input().split()))
num = [-1]*N
err = False
for _ in range(M):
s, c = list(map(int, input().split()))
if num[s-1] == -1:
num[s-1] = c
else:
if num[s-1] != c:
err = True
if err or (N > 1 and num[0] == 0):
print((-1))
else:
ans = 0
i = 0
n = 0
while i < N:... | p02761 |
from collections import defaultdict
d = defaultdict(list)
N, M = map(int, input().split())
for _ in range(M):
s, c = map(int, input().split())
d[s].append(c)
val = [-1] * N
# とりあえず桁を確定させる
for k, v in d.items():
if len(set(v)) > 1:
print(-1)
exit()
val[k - 1] = v[0]
i... | N, M = list(map(int, input().split()))
sc = [list(map(int, input().split())) for _ in range(M)]
ans = 10000
L = 10 ** (N - 1)
if N == 1:
L = 0
U = 10**N
for i in range(L, U):
x = str(i).zfill(N)
for s, c in sc:
if x[s - 1] == str(c):
continue
break
else:
... | p02761 |
import collections
N,M=list(map(int,input().split()))
#if not(M==0):
s=[list(map(int,input().split())) for _ in range(M)]
flag=1
l=[[i+1,-1] for i in range(N)]
ns=""
#print(l)
"""
if M==0:
for i in range(M):
if i==0:
l[i][1]=1
else:
l[i][1]=0
ns="".jo... | N,M=list(map(int,input().split()))
rest=[[] for _ in range(N)]
r2=[]
end=0
flag=0
buf=""
ans=float("inf")
end=0
for i in range(M):
s,c=list(map(int,input().split()))
if len(rest[s-1])==0:
rest[s-1].append(c)
elif rest[s-1].count(c)==0:
end=1
break
#print(rest)
if N ... | p02761 |
def f(K):
sum = 0
for i in range(K+1):
sum += (pow(10, i, K)*7)
sum %= K
if sum == 0:
return i+1
return -1
K = int(eval(input()))
print((f(K)))
| def f(K):
sum = 0
p10 = 1
for i in range(K+1):
sum += p10*7
p10 *= 10
p10 %= K
sum %= K
if sum == 0:
return i+1
return -1
K = int(eval(input()))
print((f(K)))
| p02596 |
def solve(string):
k = int(string)
if k % 2 == 0 or k % 5 == 0:
return "-1"
n = 7
ans = 1
while n % k:
n = (10 * n + 7) % k
ans += 1
return str(ans)
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| def solve(string):
k = int(string)
if k % 2 == 0 or k % 5 == 0:
return "-1"
n = 7
for i in range(k):
if not n % k:
return str(i + 1)
n = (10 * n + 7) % k
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| p02596 |
N = int(eval(input()))
r = 7
for i in range(N):
if r % N > 0:
r = (10 * r + 7) % N
else:
print((i + 1))
break
else:
print((-1))
|
K = int(eval(input()))
cur = 7
for n in range(K):
if cur % K != 0:
cur = (cur * 10 + 7) % K
else:
print((n + 1))
break
else:
print((-1))
| p02596 |
k=int(eval(input()))
if not k&1:
print((-1))
exit()
ks=str(k)
carry=0
d1=int(ks[-1])
i=1
while i<=10**8:
flag=False
car=int(carry)
for j in range(0,10):
if (d1*j+car)%10==7:
carry=str((car+k*j)//10)
if len(carry)==carry.count('7'):
print... | k=int(eval(input()))
mod=7
cnt=1
for i in range(k):
if mod%k==0:
print(cnt)
exit()
mod=(mod*10+7)%k
cnt+=1
print((-1)) | p02596 |
k=int(eval(input()))
n=7
ans=1
if k%2==0:
print((-1))
exit()
while n%k!=0:
n=(n*10+7)%k
ans+=1
print(ans) | k=int(eval(input()))
n=7
ans=1
if k%2==0 or k%5==0:
print((-1))
exit()
while n%k!=0:
n=(n*10+7)%k
ans+=1
print(ans) | p02596 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
sys.exit()
p = 7
plus = 7
amari = set()
r = 1
while (p % k) != 0:
if p in amari:
print((r, -1, p))
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
sys.exit()
p = 7 # '7,77,777…'のmod kをいれる変数
plus = 7 # '70,700,7000…'のmod kをいれる変数
r = 1 # カウント
while (p % k) != 0:... | p02596 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
sys.exit()
p = 7 # '7,77,777…'のmod kをいれる変数
plus = 7 # '70,700,7000…'のmod kをいれる変数
r = 1 # カウント
while (p % k) != 0:... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
sys.exit()
if k % 7 == 0:
l = k * 9 // 7
else:
l = k * 9
r = 1 # カウント
p = 10 ** r
while (p % l) != ... | p02596 |
k = int(eval(input()))
cnt = 1
ans = 7
ans %= k
flags = [False] * k
flags[ans] = True
while ans != 0:
ans += 7*pow(10,cnt,k)
cnt += 1
ans %= k
if flags[ans]:
cnt = -1
break
flags[ans] = True
print(cnt)
| k = int(eval(input()))
cnt = 1
ans = 7
mul = 70 % k
ans %= k
flags = [False] * k
flags[ans] = True
while ans != 0:
ans += mul
cnt += 1
ans %= k
mul *= 10
mul %= k
if flags[ans]:
cnt = -1
break
flags[ans] = True
print(cnt)
| p02596 |
k=int(eval(input()))
if k%2==0 or k%5==0:
print((-1))
exit()
num=7
num%=k
ans=1
while num!=0:
num=10*num+7
num%=k
ans+=1
print(ans) | k=int(eval(input()))
if k%2==0 or k%5==0:
print((-1))
exit()
ans=1
num=7%k
while num!=0:
num=(10*num+7)%k
ans+=1
print(ans) | p02596 |
K = int(eval(input()))
if K % 2 == 0:
print((-1))
exit()
else:
n = 7
n_before = 7
count = 1
while n % K != 0:
n = n % K
count += 1
n_before = 10 * n_before % K
n = n + n_before
print(count)
| K = int(eval(input()))
if K % 2 == 0 or K % 5 ==0:
print((-1))
exit()
else:
n = 7
n_before = 7
count = 0
while True:
count += 1
n = n % K
if n == 0:
print(count)
exit()
else:
n_before = 10 * n_before % K
... | p02596 |
def solve(k):
a_mod = 0
for i in range(1000000):
a_mod += 7 * pow(10, i, k)
a_mod %= k
if a_mod == 0:
return i + 1
return -1
def main():
k = int(eval(input()))
res = solve(k)
print(res)
def test():
assert solve(101) == 4
assert so... | def solve(k):
a_mod = 0
pow_10 = 7
for i in range(1000000):
a_mod += pow_10
a_mod %= k
if a_mod == 0:
return i + 1
pow_10 *= 10
pow_10 %= k
return -1
def main():
k = int(eval(input()))
res = solve(k)
print(res)
def te... | p02596 |
k = int(eval(input()))
val = 7
if k%2 == 0:
ans = -1
else:
for i in range(1,10**12+1):
if val >= k:
sub = val % k
if sub == 0:
ans = i
break
else:
val = 10 * sub + 7
else:
val = 10... | k = int(eval(input()))
val = 7
if k%2 == 0:
ans = -1
elif k%5 == 0:
ans = -1
else:
for i in range(1,10**12+1):
if val >= k:
sub = val % k
if sub == 0:
ans = i
break
else:
val = 10 * sub + 7
... | p02596 |
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
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 ... | p02596 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
K = I()
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
if K % 7 == 0:
K //= 7
A = [1] # A[i] = 10**i mod K
for i in range(K):
A.append((A[-1]*10) % K)
s = 1
for i in range(1,K+1):
if s % K == 0:
print(i)
... | import sys
def I(): return int(sys.stdin.readline().rstrip())
K = I()
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
if K % 7 == 0:
K //= 7
s = 1
for i in range(1,K+1):
if s % K == 0:
print(i)
exit()
else:
s *= 10
s += 1
s %= K
| p02596 |
K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
i = 0
ai = 0
while True:
ai = (ai * 10 + 7) % K
i += 1
if ai == 0:
break
print(i) | N = int(eval(input()))
# if N < 7:
# print(-1)
# exit()
if N % 2 == 0 or N % 5 == 0:
print((-1))
exit()
i = 0
num = 0
while True:
num = (num * 10 + 7) % N
i += 1
if num == 0:
print(i)
exit()
K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print(... | p02596 |
k=int(input())
if (k%2)*(k%5)<1: exit(print(-1))
a,t,m=1,7,7
while m%k:
a+=1
t=t*10%k
m+=t
print(a)
| k=int(input())
t=7
for i in range(k):
if t%k<1: exit(print(i+1))
t=(t*10+7)%k
print(-1)
| p02596 |
K = int(eval(input()))
num = 0
if K%2 == 0:
print((-1))
else:
for i in range(1, 100000000):
num = num*10 + 7
num %= K
if num == 0:
print(i)
break | K = int(eval(input()))
num = 0
if K%2 == 0:
print((-1))
else:
for i in range(1, 1000000):
num = num*10 + 7
num %= K
if num == 0:
print(i)
break
else:
print((-1)) | p02596 |
k = int(eval(input()))
m = 0
for i in range(1, 10**7):
n = m *10 +7
m = n % k
if m == 0:
print(i)
exit(0)
print((-1)) | k = int(eval(input()))
m = 0
for i in range(1, 10**6):
n = m *10 +7
m = n % k
if m == 0:
print(i)
exit(0)
print((-1)) | p02596 |
# coding: utf-8
def solve(*args: str) -> str:
k = int(args[0])
ret = 1
a = 7 % k
while(a):
a = (a*10+7) % k
ret += 1
if k < ret:
ret = -1
break
return str(ret)
if __name__ == "__main__":
print((solve(*(open(0).read().splitl... | # coding: utf-8
def solve(*args: str) -> str:
k = int(args[0])
l = 9*(k//7 if k % 7 == 0 else k)
if l % 2 == 0 or l % 5 == 0:
return '-1'
r = phi = l
for i in range(2, int(-pow(l, 1/2))):
if r % i == 0:
phi = phi//i*(i-1)
while r % i:
... | p02596 |
# coding: utf-8
def solve(*args: str) -> str:
k = int(args[0])
l = 9*(k//7 if k % 7 == 0 else k)
if l % 2 == 0 or l % 5 == 0:
return '-1'
r = phi = l
for i in range(2, int(-pow(l, 1/2))):
if r % i == 0:
phi = phi//i*(i-1)
while r % i:
... | # coding: utf-8
from math import sqrt
def solve(*args: str) -> str:
k = int(args[0])
l = 9*(k//7 if 0 == k % 7 else k)
if 0 == l % 2 or 0 == l % 5:
return '-1'
r = phi = l
for i in range(2, int(sqrt(l)+1)):
if 0 == r % i:
phi = phi*(i-1)//i
... | p02596 |
K = int(eval(input()))
n = 7
ans = 0
i = 1
if K%2==0:
ans = -1
else:
while True:
if n%K==0:
ans = i
break
n *= 10
n += 7
n %= K
i += 1
print(ans) | K = int(eval(input()))
n = 7
ans = -1
i = 1
if K%2==0:
ans = -1
else:
for i in range(K*2+10):
if n%K==0:
ans = i+1
break
n *= 10
n += 7
n %= K
print(ans) | p02596 |
K = int(eval(input()))
if K % 2 == 0:
print('-1')
exit()
i = 1
A = 7 % K
while A != 0:
A = (10 * A + 7) % K
i += 1
print(i)
| K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print('-1')
exit()
A = 0
for i in range(K):
A = (10 * A + 7) % K
if A == 0:
print((i+1))
break
| p02596 |
#!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
k = int(eval(input()))
if k % 10 == 2 or k % 10 == 4 or k % 10 == 5 or k % 10 == 6 or k % 10 == 8 or k % 10 == 0:
print((-1))
exit()
elif k % 10 == 1:
tmp = k * 7
ans = 1
while T... | #!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
k = int(eval(input()))
if k % 10 == 2 or k % 10 == 4 or k % 10 == 5 or k % 10 == 6 or k % 10 == 8 or k % 10 == 0:
print((-1))
exit()
elif k % 10 == 1:
tmp = k * 7
ans = 1
while T... | p02596 |
#!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
k = int(eval(input()))
if k % 10 == 2 or k % 10 == 4 or k % 10 == 5 or k % 10 == 6 or k % 10 == 8 or k % 10 == 0:
print((-1))
exit()
elif k % 10 == 1:
tmp = k * 7
ans = 1
while T... | #!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
k = int(eval(input()))
if k % 10 == 2 or k % 10 == 4 or k % 10 == 5 or k % 10 == 6 or k % 10 == 8 or k % 10 == 0:
print((-1))
exit()
elif k % 10 == 1:
tmp = k * 7
ans = 1
while T... | p02596 |
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
elif k == 1 or k == 7:
print((1))
else:
t = 2
ex = 77
for i in range(10 ** 8):
if ex % k == 0:
break
ex = (ex % k) * 10 + 7
t += 1
print(t) | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
exc = 0
for i in range(1, 10 ** 8):
exc = exc * 10 + 7
exc = exc % k
if exc % k == 0:
ans = i
break
print(ans) | p02596 |
import sys
K = int(eval(input()))
power = 7
SUM = 0
for i in range(1, 10 ** 6):
SUM += power
if SUM % K == 0:
print(i)
sys.exit()
power *= 10
power %= K
print((-1)) | import sys
K = int(eval(input()))
L = 9 * K
if K % 7 == 0:
L //= 7
power = 1
for i in range(1, 10 ** 6):
power *= 10
power %= L
if power == 1:
print(i)
sys.exit()
print((-1)) | p02596 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
k = int(eval(input()))
x = 0
for i in range(k+1):
x *= 10
x %= k
x += 7
x %= k
if x == 0:
print((i+1))
break
else:
print((-1)) | p02596 |
K = int(eval(input()))
if K % 7 == 0:
K //= 7
L = 9 * K
ans = -1
r = 10
for i in range(L):
r %= L
if r == 1:
ans = i + 1
break
else:
r = 10 * r
print(ans) | def main():
K = int(eval(input()))
work = 7
answer = -1
for i in range(1, K+1):
i_mod = work % K
if i_mod == 0 :
answer = i
break
work = i_mod * 10 + 7
print(answer)
main() | p02596 |
import sys
K=int(eval(input()))
if K%2==0 or K%5==0:
print((-1))
sys.exit(0)
k_mod=0
seven_k=0
for i in range(1,K+1):
k_mod=10*k_mod+7
k_mod%=K
if k_mod==0:
print(i)
break
else:
print((-1)) | K=int(eval(input()))
k_mod=0
for i in range(1,K+1):
k_mod=(10*k_mod+7)%K
if k_mod==0:
print(i)
break
else:
print((-1)) | p02596 |
K = int(eval(input()))
dic = {}
x = 0
count = 0
while 1:
x = (x * 10 + 7) % K
count += 1
if x == 0:
print(count)
exit()
if x in dic:
print((-1))
exit()
dic[x] = 1
| K = int(eval(input()))
x = 0
for i in range(K + 5):
x = (x * 10 + 7) % K
if x == 0:
print((i + 1))
exit()
print((-1))
| p02596 |
import sys
import math
import time
sys.setrecursionlimit(int(1e6))
if False:
dprint = print
else:
def dprint(*args):
pass
k = list(map(int, input().split()))[0]
if (k % 7 == 0):
l = 9*k/7
else:
l = 9*k
dprint('k, l = ', k, l)
i = 1
n = 10
while(i < 10**6):
m = n % l
... | import sys
import math
import time
sys.setrecursionlimit(int(1e6))
if False:
dprint = print
else:
def dprint(*args):
pass
k = list(map(int, input().split()))[0]
am = 7 % k
i = 1
for i in range(k):
if am==0:
print(i+1)
exit()
else:
i+=1
am=(... | p02596 |
import sys
import math
import time
sys.setrecursionlimit(int(1e6))
if False:
dprint = print
else:
def dprint(*args):
pass
k = list(map(int, input().split()))[0]
am = 7 % k
i = 1
for i in range(k):
if am==0:
print(i+1)
exit()
else:
i+=1
am=(... | import sys
import math
import time
sys.setrecursionlimit(int(1e6))
if False:
dprint = print
else:
def dprint(*args):
pass
k = list(map(int, input().split()))[0]
modk = 7 % k
i = 1
for i in range(k):
if modk == 0:
print(i+1)
exit()
modk = (modk * 10 + 7) % k
... | p02596 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve(K):
visited = [False] * K
p = 7 % K
for i in range(K):
if p == 0:
return i + 1
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve(K):
visited = [False] * K
p = 7 % K
for i in range(K):
if p == 0:
return i + 1
... | p02596 |
k = int(eval(input()))
# 解説AC
if k % 2 == 0 or k % 5 == 0:
print((-1))
exit()
num = 7
for i in range(k):
if num % k == 0:
print((i + 1))
break
num = (num % k) * 10 + 7
| def makedivisor(N): # 約数列挙
p, upper, lower = 1, [], []
while p * p <= N:
if N % p == 0:
lower.append(p)
if p * p != N:
upper.append(N // p)
p += 1
return lower + upper[::-1]
def totient(N): # オイラーのトーシェント関数
p, phi = 2, N
while p... | p02596 |
k=int(input())
if k%2==0:exit(print(-1))
ans=0
x=k
for i in range(10**9):
while x%10!=7:x+=k
x//=10
if x==0:exit(print(i+1))
| import time
start=time.time()
k=int(input())
if k%2==0:exit(print(-1))
ans=0
x=k
for i in range(10**9):
while x%10!=7:
x+=k
if time.time()-start>=1.9:exit(print(-1))
x//=10
if x==0:exit(print(i+1))
| p02596 |
k=int(eval(input()))
def get(k):
ans=7
i=1
while True:
if ans%k==0:
return i
ans=(ans*10+7)%k
i+=1
if k%2==0:
print((-1))
else:
print((get(k)))
| k=int(eval(input()))
def get(k):
ans=7
i=1
while True:
if ans%k==0:
return i
ans=(ans*10+7)%k
i+=1
if k%2==0 or k%5==0:
print((-1))
else:
print((get(k)))
| p02596 |
def calc(k):
cur = 7 % k
for i in range(1, 10 ** 7):
if cur == 0:
return i
else:
cur *= 10
cur += 7
cur %= k
return -1
k = int(eval(input()))
print((calc(k))) | def calc(k):
cur = 0
for i in range(1, 10 ** 7):
cur *= 10
cur += 7
cur %= k
if cur == 0:
return i
return -1
k = int(eval(input()))
print((calc(k))) | p02596 |
def calc(k):
cur = 0
for i in range(1, 10 ** 7):
cur *= 10
cur += 7
cur %= k
if cur == 0:
return i
return -1
k = int(eval(input()))
print((calc(k))) | def calc(k):
cur = 7 % k
for i in range(1, k + 1):
if cur == 0:
return i
else:
cur *= 10
cur += 7
cur %= k
return -1
k = int(eval(input()))
print((calc(k)))
| p02596 |
K = int(eval(input()))
count = 1
mod = 7
answer = -1
for _ in range(K):
if mod % K == 0:
answer = count
break
count += 1
mod = (mod * 10 + 7) % K
print(answer) | K=int(eval(input()))
amari=0
for i in range(K):
amari = (amari * 10 + 7)% K
if amari == 0:
print((i+1))
break
if i == (K-1):
print((-1)) | p02596 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | p02596 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p02596 |
#200802C
X = int(eval(input()))
L = len(str(X))
#print(L)
Y = 0
for l in range(L):
Y += 7*10**l
flag = 0
for i in range(10000000):
Y = Y%X
#print(i)
if Y == 0:
ans = L+i
flag = 1
break
else:
Z = Y * 10 + 7
if Z == Y:
... | #200802C
X = int(eval(input()))
L = len(str(X))
#print(L)
Y = 0
for l in range(L):
Y += 7*10**l
flag = 0
for i in range(1000000):
Y = Y%X
#print(i)
if Y == 0:
ans = L+i
flag = 1
break
else:
Z = Y * 10 + 7
if Z == Y:
... | p02596 |
k=int(eval(input()))
if k%2==0 or k%5==0:
print("-1")
quit()
ki=0
for i in range(1,10**6):
ki=(ki*10+7)%k
if ki==0:
print(i)
quit()
print("-1")
| k=int(eval(input()))
if k%2==0:
print("-1")
quit()
ki=0
for i in range(1,10**6):
ki=(ki*10+7)%k
if ki==0:
print(i)
quit()
print("-1")
| p02596 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
impo... | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import copy
impo... | p02596 |
K = int(eval(input()))
if K%2 == 0 or K%2 ==0:
print((-1))
exit(0)
count = 0
an = 0
while True:
an = (10*an + 7) % K
count +=1
if an == 0:
break
print(count) | K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
i = 0
ai = 0
while True:
ai = (ai * 10 + 7) % K
i += 1
if ai == 0:
break
print(i) | p02596 |
def main():
K = int(input())
for i in range(1, K+1):
a = 7*(pow(10, i, 9*K)-1)
a %= 9*K
if a == 0:
return print(i)
print(-1)
if __name__ == '__main__':
main()
| def main():
K = int(eval(input()))
a = 7
for i in range(1, K+1):
if a % K == 0:
print(i)
return
a = a * 10 + 7
a %= K
print((-1))
if __name__ == '__main__':
main()
| p02596 |
def main():
K = int(eval(input()))
a = 7
for i in range(1, K+1):
if a % K == 0:
print(i)
return
a = a * 10 + 7
a %= K
print((-1))
if __name__ == '__main__':
main()
| def main():
K = int(eval(input()))
a = 7 % K
for i in range(1, K+1):
if a == 0:
print(i)
return
a = a * 10 + 7
a %= K
print((-1))
if __name__ == '__main__':
main()
| p02596 |
K = int(eval(input()))
A = [0]*1000001
A[0] = 7%K
ans = -1
for i in range(1,1000001):
A[i] = (A[i-1]*10+7)%K
for i in range(1000001):
if A[i]==0:
ans = i+1
break
print(ans) | K = int(eval(input()))
ans = -1
mod = 7%K
for i in range(1000001):
if mod==0:
ans = i+1
break
else:
mod = (mod*10+7)%K
print(ans) | p02596 |
import sys
input = sys.stdin.readline
k = int(eval(input()))
if k == 7 or k == 1:
print((1))
elif k % 2 == 0 or k % 5 == 0: print((-1))
else:
if k % 7 == 0: k = k // 7
mod = 9*k
i = 1;
result = 10;
while result != 1:
result = (result * 10) % mod
i += 1
print... | import sys
input = sys.stdin.readline
k = int(eval(input()))
'''if k == 7 or k == 1:
print(1)
elif k % 2 == 0 or k % 5 == 0: print(-1)
else:
if k % 7 == 0: k = k // 7
mod = 9*k
i = 1;
result = 10;
while result != 1:
result = (result * 10) % mod
i += 1
print(... | p02596 |
K = int(eval(input()))
if K % 2 == 0:
print((-1))
else:
mod, modt, ans = 7 % K, 7 % K, 1
while mod != 0:
modt = (modt * (10 % K)) % K
mod, ans = (mod + modt) % K, ans + 1
print(ans)
| K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print((-1))
else:
mod, modt, ans = 7 % K, 7 % K, 1
while mod != 0:
modt = (modt * (10 % K)) % K
mod, ans = (mod + modt) % K, ans + 1
print(ans)
| p02596 |
k = int(eval(input()))
ans = -1
a = [7%k] * k
for i in range(k - 1):
a[i + 1] = (10*a[i] + 7) % k
for i in range(k):
if a[i] == 0:
ans = i + 1
break
print(ans) | k = int(eval(input()))
ans = -1
a = 7%k
for i in range(k):
if a == 0:
ans = i + 1
break
a = (10*a + 7) % k
print(ans) | p02596 |
k=int(eval(input()))
ans='-1'
a=7
for i in range(1,10**6+1):
if a%k==0:
ans=i
break
a=((10*a)+7)%k
print(ans) | k=int(eval(input()))
if k%2==0:
print((-1))
exit()
ans=1
pin=7
mod=k
for i in range(1000000):
if pin%k==0:
print(ans)
exit()
ans+=1
pin*=10
pin+=7
pin%=mod
print('-1')
| p02596 |
K = int(eval(input()))
val = 7 % K
ans = -1
for i in range(1, 10**7):
if val == 0:
ans = i
break
val = (val * 10 + 7) % K
print(ans) | K = int(eval(input()))
val = 7 % K
ans = -1
for i in range(1, 10**6):
if val == 0:
ans = i
break
val = (val * 10 + 7) % K
print(ans) | p02596 |
import sys
input = sys.stdin.readline
k = int(eval(input()))
if k%2 == 0:
print((-1))
exit()
if k == 7:
print((1))
exit()
if k == 1:
print((1))
exit()
seven = 7
d = 1
while seven != 0:
seven += pow(7*pow(10,d,k),1,k)
seven = pow(seven,1,k)
d += 1
print(d... | import sys
input = sys.stdin.readline
k = int(eval(input()))
if k%2 == 0:
print((-1))
exit()
if k == 7:
print((1))
exit()
if k == 1:
print((1))
exit()
if k % 5 == 0:
print((-1))
exit()
seven = 7
d = 1
while seven != 0:
seven += pow(7*pow(10,d,k),1,k)
... | p02596 |
from itertools import count
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
m = 0
for i in count(0):
m += pow(10, i, k) * 7
m %= k
if m == 0:
print((i+1))
break
| k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
i = 1
m = 7 % k
while True:
if m == 0:
print(i)
break
m = (10 * m + 7) % k
i += 1
| p02596 |
k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
ten = 1
now = 0
for i in range(10**7):
x = (ten*7)%k
now = (now+x)%k
if now == 0:
print((i+1))
exit()
ten = ten*10%k | k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
ten = 1
now = 0
for i in range(10**8):
x = (ten*7)%k
now = (now+x)%k
if now == 0:
print((i+1))
exit()
ten = ten*10%k
print((-1)) | p02596 |
k = int(eval(input()))
if k%2==0 or k%5==0:
print('-1')
else:
from itertools import accumulate
ac = list(accumulate([7*pow(10, i, k)%k for i in range(999983)]))
for idx, a in enumerate(ac):
if a%k == 0:
print((idx+1))
break
else:
print('-1') | k = int(eval(input()))
if k%2==0 or k%5==0:
print('-1')
else:
a = 0
for i in range(999983):
a = (a*10+7) % k
if a == 0:
print((i+1))
break
else:
print((-1))
| p02596 |
def main():
k = int(input().strip())
x = 7 % k
ans = -1
for n in range(1, k + 1):
if x == 0:
ans = n
break
x = (10 * x + 7) % k
print(ans)
return
if __name__ == "__main__":
main()
| def main():
k = int(input().strip())
if k % 2 == 0 or k % 5 == 0:
print((-1))
return
x = 7 % k
for n in range(1, k + 1):
if x == 0:
print(n)
return
x = (10 * x + 7) % k
print((-1))
return
if __name__ == "__main__":
m... | p02596 |
ma = lambda :map(int,input().split())
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
k = ni()
a = 0
for i in range(10**6):
a=(a+7*pow(10,i,k))%k
if a== 0:
print(i+1)
break
else:
pri... | ma = lambda :map(int,input().split())
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
k = ni()
if k%2==0 or k%5==0:
print(-1)
exit()
if k%7==0:
L=9*k//7
else:
L=9*k
tmp=1
for i in range(1,10*... | p02596 |
K = int(eval(input()))
t = 7
for i in range(K):
if t % K == 0:
print((i + 1))
break
t = (t * 10 + 7) % K
else:
print((-1)) | num=int(eval(input()))
a=7
flag=0
for i in range(num):
if a%num==0:
print((i+1))
flag=1
break
a=(a*10+7)%num
if flag==0:
print((-1)) | p02596 |
# -*- coding: utf-8 -*-
# 標準入力を取得
K = int(eval(input()))
# 求解処理
ans = -1
remainder = 7 % K
for i in range(1, 9000000):
if remainder == 0:
ans = i
break
remainder = (10 * remainder + 7) % K
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
K = int(eval(input()))
return K
def main(K: int) -> None:
"""
メイン処理.
Args:\n
K (int): 整数（1 <= K <= 10^6）
"""
# 求解処理
ans = -1
remainder ... | p02596 |
K = int(eval(input()))
flg = [False]*K
tmp = 7 % K
cnt = 1
if tmp == 0:
print(cnt)
exit()
while True:
tmp = (tmp*10+7)%K
if flg[tmp]:
print((-1))
break
else:
cnt += 1
if tmp == 0:
print(cnt)
break
flg[tmp] = True
| K = int(eval(input()))
t = 7
t %= K
for i in range(K+1):
if t == 0:
print((i+1))
exit()
t = (t*10+7)%K
print((-1))
| p02596 |
k = int(eval(input()))
x = 0
ans = -1
if k % 2 == 1:
for i in range(10**6):
x = (x + 7 * pow(10, i, k)) % k
if x == 0:
ans = i + 1
break
print(ans) | def abc174_c():
k = int(eval(input()))
ans = -1
if k % 2 == 0 or k % 5 == 0:
return ans
f = 0
for i in range(k+1):
f = (f * 10 + 7) % k
if f == 0:
ans = i + 1
break
return ans
if __name__ == '__main__':
print((abc174_c())) | p02596 |
k=int(eval(input()))
ama=[0]*(k)
now=7
if now%k==0:
print((1))
exit()
else:
ama[now%k]+=1
for _ in range(2*k):
now=(now*10+7)%k
if now%k==0:
print((_+2))
exit()
elif ama[now%k]==0:
ama[now%k]+=1
else:
print((-1))
exit()
| k=int(eval(input()))
ama=[0]*(k)
now=7%k
ama[now]+=1
if now==0:
print((1))
exit()
for i in range(2,k+1):
now=(10*now+7)%k
if ama[now]!=0 and now>0:
print((-1))
exit()
elif now==0:
print(i)
exit()
else:
ama[now]+=1
| p02596 |
K = int(eval(input()))
n = 7
c = 0
while 1:
m = n % K
c += 1
if m == 0:
break
tmp = m * 10 + 7
if tmp == n:
print((-1))
exit()
n = tmp
print(c) | K = int(eval(input()))
n = 7
c = 0
while c <= K:
n %= K
c += 1
if n == 0:
print(c)
exit()
n = n * 10 + 7
print((-1)) | p02596 |
K = int(eval(input()))
if(K%2 == 0):
print("-1")
exit()
A = 7
ans = 1
while(A < K): #O(6)
A = A*10 + 7
ans += 1
while(True):
#print(A)
A = A % K #1
if(ans > K):
print("-1")
if(A==0): #1
print(ans)
exit()
A = A * 10 + 7 # 1
ans += 1#... | K = int(eval(input()))
if(K%2 == 0):
print("-1")
exit()
A = 7
ans = 1
while(A < K): #O(6)
A = A*10 + 7
ans += 1
while(True):
#print(A)
A = A % K #1
if(ans > K):
print("-1")
exit()
if(A==0): #1
print(ans)
exit()
A = A * 10 + 7 # ... | p02596 |
K = int(eval(input()))
mod = 0
last_mod = 0
for i in range(K):
if i==0:
last_mod = 7 % K
else:
last_mod = (last_mod*10)%K
mod += last_mod
mod %= K
if mod%K == 0:
print((i+1))
exit()
print((-1)) | K = int(eval(input()))
mod = 7 % K
for i in range(K):
if mod == 0:
print((i+1))
exit()
mod = (10*mod + 7) % K
if mod == 0:
print(K)
else:
print((-1)) | p02596 |
k = int(eval(input()))
count = 1
n = 0
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
while 1:
n = (n * 10 + 7) % k
if n == 0:
break
count += 1
print(count) | def main(h):
count = 1
n = 0
for i in range (k):
n = (n * 10 + 7) % k
if n == 0:
print(count)
return 0
count += 1
print((-1))
if __name__ == '__main__':
k = int(eval(input()))
main(k) | p02596 |
K = int(eval(input()))
powlis = [pow(10, i, K) for i in range(K)]
for i in range(K-1):
powlis[i+1] = (powlis[i] + powlis[i+1]) % K
lis = [(7 *powlis[i])%K for i in range(K) ]
try:
print((lis.index(0) + 1))
except:
print((-1)) | K = int(eval(input()))
powlis = [7*pow(10, i, K) for i in range(K)]
for i in range(K-1):
powlis[i+1] = (powlis[i] + powlis[i+1]) % K
powlis[0] %= K
try:
print((powlis.index(0) + 1))
except:
print((-1)) | p02596 |
K = int(eval(input()))
hist = set()
INF = 10**8
w = 0
for i in range(INF):
w += 7 * pow(10,i,K)
w %= K
if w == 0:
print((i+1))
break
else:
if w in hist:
print((-1))
break
else:
hist.add(w)
#print(hist)
| K = int(eval(input()))
hist = set()
INF = 10**8
w = 0
pows = 1
for i in range(INF):
w += 7 * pows
pows = pows * 10 % K
w %= K
if w == 0:
print((i+1))
break
else:
if w in hist:
print((-1))
break
else:
hist.add(w)
#print(hist)
| p02596 |
def main():
K = int(eval(input()))
first = 7 % K
curr = first
yet = True
ans = 1
while yet:
if curr == 0:
print(ans)
return
curr = (curr*10+7) % K
if first == curr:
yet = False
ans += 1
print((-1))
if __na... | def main():
K = int(eval(input()))
curr = 7 % K
for i in range(1, K+1):
if curr == 0:
print(i)
return
curr = (curr*10+7) % K
else:
print((-1))
if __name__ == "__main__":
main()
| p02596 |
import sys
input=sys.stdin.readline
def main():
K = int(eval(input()))
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,L+1):
a = (a * 10) % L
if a == 1:
return i
return -1
ans =main()
print(ans) | import sys
input = sys.stdin.readline
def main():
K = int(eval(input()))
if K%2==0:
print((-1))
return
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,L+1):
a = (a * 10) % L
if a == 1:
print(i)
... | p02596 |
import sys
input = sys.stdin.readline
def main():
K = int(eval(input()))
if K%2==0:
print((-1))
return
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,L+1):
a = (a * 10) % L
if a == 1:
print(i)
... | #!python3.8
# -*- coding: utf-8 -*-
# abc174/abc174_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2s... | p02596 |
import sys
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
def main():
K = i2n()
if K%2==0:
print((-1))
return
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,L+1):
a = (a * 10) % L
if a... | import sys
input = sys.stdin.readline
def main():
K = int(eval(input()))
if K%2==0:
print((-1))
return
if K % 7:
L = 9*K
else:
L = 9*K//7
a = 1
for i in range(1,K+10):
a = (a * 10) % L
if a == 1:
print(i)
... | p02596 |
k = int(eval(input()))
rem = 7%k
alreadys = [False]*k
alreadys[rem] = True
ans = 1
while True:
if rem == 0:
print(ans)
exit()
ans += 1
rem = (rem*10+7)%k
if alreadys[rem]:
print((-1))
exit()
alreadys[rem] = True | k = int(eval(input()))
rem = 7%k
for i in range(10**6+1):
if rem == 0:
print((i+1))
break
rem = (rem*10+7)%k
else:
print((-1)) | p02596 |
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
import bisect
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return... | from collections import defaultdict
from collections import deque
from collections import Counter
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
k = readInt()
... | p02596 |
import sys
K = int(eval(input()))
seven = 0
for i in range(K+2):
seven += (7 * pow(10, i, K)) % K
seven %= K
if seven == 0:
print((i+1))
sys.exit()
print((-1)) | import sys
K = int(eval(input()))
seven = 7
seven %= K
for i in range(K+2):
if seven == 0:
print((i+1))
sys.exit()
seven = seven * 10 + 7
seven %= K
print((-1)) | p02596 |
k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
i = 7
cnt = 1
while i % k != 0:
if i % k != i:
i = i % k
i = i * 10 + 7
cnt += 1
print(cnt) | k = int(eval(input()))
j = 7
for i in range(k):
if j % k < 1:
print((i + 1))
exit()
j = (j * 10 + 7) % k
print((-1)) | p02596 |
import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9+7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
a = defaultdict(int)
cnt = 0
N = 7
while True:
cnt += 1
s = N % K
if s == 0:
... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
MOD = 10**9+7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
cnt = 0
N = 7
for i in range(K+1):
if N % K == 0:
prin... | p02596 |
K=int(eval(input()))
D=7
for i in range(10000000):
if D%K==0:
print((i+1))
break
# print(D)
D=D*10+7
D%=K
else:
print((-1))
| K=int(eval(input()))
D=7
for i in range(1000000):
if D%K==0:
print((i+1))
break
# print(D)
D=D*10+7
D%=K
else:
print((-1))
| p02596 |
if __name__ == '__main__':
k = int(eval(input()))
# mod K 問題
s = set()
x = 7 % k
i = 1
cnt = -1
while x not in s:
if x == 0:
cnt = i
break
s.add(x)
x = (10 * x + 7) % k
i += 1
print(cnt)
| if __name__ == '__main__':
k = int(eval(input()))
x = 0
for i in range(10**6):
x = (10 * x + 7) % k
if x == 0:
print((i+1))
exit()
print((-1))
| p02596 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.