input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
k = int(eval(input()))
temp = 7
juu = 7
for i in range(1, 10**7):
temp = temp % k
if temp == 0:
print(i)
break
juu = juu * 10 % k
temp += juu % k
else:
print((-1))
| k = int(eval(input()))
temp = 7
juu = 7
for i in range(1, 10**6):
temp = temp % k
if temp == 0:
print(i)
break
juu = (juu * 10) % k
temp += juu % k
else:
print((-1))
| p02596 |
# k = int(input())
K = eval(input())
k = int(K)
# if k%2 == 0:
# print(-1)
# exit()
# r7 = 7%k
r = 0
for i in range(1,k*10):
r = (r*10 + 7)%k
# print('r {} i {}'.format(r,i))
if r == 0:
print(i)
exit()
# print(n)
print((-1))
| k = int(eval(input()))
r = 0
for i in range(1, k+1):
r = (r*10 + 7)%k
if r == 0:
print(i)
exit()
print((-1))
| p02596 |
k = int(eval(input()))
r = 0
for i in range(1, k+1):
r = (r*10 + 7)%k
if r == 0:
print(i)
exit()
print((-1))
| def f(k):
r = 7%k
for i in range(k):
if r == 0: return i+1
r = (r*10 + 7)%k
return -1
print((f(int(eval(input())))))
| p02596 |
def f(k):
r = 7%k
for i in range(k):
if r == 0: return i+1
r = (r*10 + 7)%k
return -1
print((f(int(eval(input())))))
| def f(k):
r = 7%k
for i in range(k):
if not r: return i+1
r = (r*10 + 7)%k
return -1
print((f(int(eval(input())))))
| p02596 |
# -*- coding: utf-8 -*-
def main():
import sys
K = int( sys.stdin.readline() )
A = 7
add_digit = 7
i = 1
checked = set()
while True:
if A % K == 0:
print(i)
return
elif A in checked:
print("-1")
return
... | # -*- coding: utf-8 -*-
import sys
def main():
K = int( sys.stdin.readline() )
A = 7
for i in range(K):
if A % K == 0:
print((i+1))
return
A = (A * 10) + 7
A %= K
print((-1))
if __name__ == "__main__":
main()
| p02596 |
K = int(eval(input()))
Judge = True
remain_initial = 7 % K
remain = 0
i = 0
while Judge == True:
i += 1
remain_str = str(remain) + '7'
number = int(remain_str)
remain = number % K
if number % K == 0:
Judge = False
answer = i
elif i == 1:
continue
... | K = int(eval(input()))
remain = 0
i = 0
answer = -1
for i in range(1, K+5):
number = remain*10 + 7
remain = number % K
if remain == 0:
answer = i
break
print(answer) | p02596 |
K = int(eval(input()))
n = 1
x = 7
if K % 2 == 0:
print(( -1 ))
exit( 0 )
#
while 1:
if x % K == 0:
print( n )
break
x = (x * 10 + 7) % K
n += 1
if x == 7:
print(( -1 ))
break
#
| K = int(eval(input()))
n = 1
x = 7
if (K % 2 == 0)or(K % 5 == 0):
print(( -1 ))
exit( 0 )
#
while 1:
if x % K == 0:
print( n )
break
x = (x * 10 + 7) % K
n += 1
#
| p02596 |
k=int(eval(input()))
if k%2==0:
print((-1)); exit()
cnt=num=0
while 1:
num+=7*pow(10,cnt,k)
num%=k
cnt+=1
if num==0:
break
print(cnt) | k=int(eval(input()))
if k%2==0 or k%5==0:
print((-1)); exit()
cnt=num=0
while 1:
num+=7*pow(10,cnt,k)
num%=k
cnt+=1
if num==0:
break
print(cnt) | p02596 |
import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
d = dict()
k = ni()
... | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
k = ni()
c = 0
fo... | p02596 |
K = int(eval(input()))
x = 7 % K #mod(K)
if K == 1 or K == 7:
print((1))
exit()
ans = 1
i = 0
while i < K:
ans += 1
x = (x * 10 + 7) % K
if x == 7 % K:
print('-1')
exit()
if x == 0:
print(ans)
exit()
i += 1
print('-1') | K = int(eval(input()))
x = 7 % K #mod(K)
if K == 1 or K == 7:
print((1))
exit()
ans = 1
i = 0
while i < K:
ans += 1
x = (x * 10 + 7) % K
if x == 0:
print(ans)
exit()
i += 1
print('-1') | p02596 |
K = int(eval(input()))
rest = 7%K
count=1
while (count<=K):
if rest == 0:
print(count)
exit()
count +=1
rest = (rest%K*10%K + 7%K)%K
print((-1))
| K = int(eval(input()))
rest = 7%K
count=1
while (count<=K):
if rest == 0:
print(count)
exit()
count +=1
rest = (rest%K*10 + 7)%K
print((-1)) | p02596 |
## necessary imports
import sys
input = sys.stdin.readline
from bisect import bisect_left;
from bisect import bisect_right;
from math import ceil, factorial;
def ceil(x):
if x != int(x):
x = int(x) + 1;
return x;
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
... | ## necessary imports
import sys
input = sys.stdin.readline
from bisect import bisect_left;
from bisect import bisect_right;
from math import ceil, factorial;
def ceil(x):
if x != int(x):
x = int(x) + 1;
return x;
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
... | p02596 |
k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
a = 7
ans = 1
while True:
if a % k == 0:
print(ans)
exit()
a = (a*10+7) % k
ans += 1
| k = int(eval(input()))
if k % 2 == 0 or k%5==0:
print((-1))
exit()
a = 7
ans = 1
while True:
if a % k == 0:
print(ans)
exit()
a = (a*10+7) % k
ans += 1
| p02596 |
K=int(eval(input()))
num=7
for i in range(1000000):
modnum=num%K
if modnum==0:
print((i+1))
exit()
num=modnum*10+7
print((-1)) | K=int(eval(input()))
a=7
for i in range(K+1):
if a%K==0:
print((i+1))
exit()
else:
a=a*10+7
a%=K
print((-1)) | p02596 |
K=int(eval(input()))
if K%2==0:
print((-1))
exit(0)
ans=[0]*(pow(10,6)+1)
ans[0]=0
for i in range(1,pow(10,6)):
ans[i]=(ans[i-1]*10+7)%K
if ans[i]==0:
print(i)
exit(0)
print((-1)) | import functools
K=int(eval(input()))
if K%2==0:
print((-1))
exit(0)
mod=0
for i in range(1,pow(10,6)):
mod=(mod*10+7)%K
if mod==0:
print(i)
exit(0)
print((-1)) | p02596 |
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
exit()
ans = 1
a = 7 % k
while a:
a = a*10 + 7
a %= k
ans += 1
print(ans) | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
a = 7 % k
cnt = 1
while a:
a = (a*10 + 7) % k
cnt += 1
print(cnt) | p02596 |
import sys
k = int(eval(input()))
a =7%k
if a == 0:
print((1))
sys.exit()
for i in range(2,10**7):
a = (10*a+7) % k
if a == 0:
print(i)
sys.exit()
print((-1)) | import sys
def main():
k = int(eval(input()))
a =7%k
if a == 0:
print((1))
sys.exit()
for i in range(2,10**7):
a = (10*a+7) % k
if a == 0:
print(i)
sys.exit()
print((-1))
main() | p02596 |
k = int(eval(input()))
if k%2 == 0:
ans = -1
else:
x = 0
ans = -1
for i in range(10**6+1):
x += 7*pow(10, i, k)
x %= k
if x%k == 0:
ans = i+1
break
print(ans) | k = int(eval(input()))
x = 0
ans = -1
for i in range(10**6+1):
x = 10*x + 7
x %= k
if x == 0:
ans = i+1
break
print(ans)
| p02596 |
K = int(eval(input()))
firsta = 7 % K
seconda = 77 % K
if firsta == 0:
print((1))
elif firsta == seconda:
print((-1))
else:
ans = 2
preva = seconda
while preva != firsta and preva != 0:
preva = ((preva*10)+7) % K
ans += 1
if preva == firsta:
ans = -1... | K = int(eval(input()))
def check(k):
aaa = 0
prev = 7%k
for i in range(0,k):
aaa+=1
if prev == 0:
return(aaa)
prev = (prev*10+7)%k
return(-1)
print((check(K))) | p02596 |
k = int(eval(input()))
m = 7%k
ans = 1
jud = True
p = 70%k
while m != 0:
m = (m + p)%k
ans += 1
p = p*10%k
if p == 0:
jud = False
break
if jud:
print(ans)
else:
print((-1))
| k = int(eval(input()))
m = 0
for i in range(k):
m = (m*10 + 7)%k
if m == 0:
ans = i + 1
break
if m == 0:
print(ans)
else:
print((-1))
| p02596 |
K = int(eval(input()))
if K % 2 == 0:
print((-1))
exit()
x = 7 % K
i = 1
while True:
if x == 0:
print(i)
exit()
y = (x * 10 + 7) % K
if x == y:
print((-1))
exit()
x = y
i += 1
| K = int(eval(input()))
if K % 2 == 0:
print((-1))
exit()
x = 7 % K
i = 1
while True:
if x == 0:
print(i)
exit()
x = (x * 10 + 7) % K
i += 1
if i > 10**6:
print((-1))
exit()
| p02596 |
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
n = 7
cnt = 1
for i in range(k):
if n % k == 0:
break
cnt += 1
n = (n * 10 + 7) % k
print(cnt)
| # -*- coding: utf-8 -*-
k = int(eval(input()))
ans = 0
n = 7
if k % 2 == 0 or k % 5 == 0:
print((-1))
exit(0)
c = 1
while True:
if n % k == 0:
break
n = (n * 10 + 7) % k
c += 1
print(c)
| p02596 |
K = int(eval(input()))
if K % 2 == 0:
print((-1))
exit()
rest = 7 % K
x = rest
ans = 1
while rest:
ans += 1
x = x*10 % K
rest = (rest + x) % K
print(ans) | K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
rest = 7 % K
x = rest
ans = 1
while rest:
ans += 1
x = x*10 % K
rest = (rest + x) % K
print(ans) | p02596 |
k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
modk = 7 % k
num = 0
for i in range(1,10**7):
num = (num+modk)%k
if num == 0:
print(i)
exit()
modk = (modk * 10)%k
print((-1)) | k = int(eval(input()))
if k % 2 == 0:
print((-1))
exit()
modk = 7 % k
num = 0
for i in range(1,10**8):
num = (num+modk)%k
if num == 0:
print(i)
exit()
modk = (modk * 10)%k
print((-1)) | p02596 |
k = int(eval(input()))
x = 7
ans = 1
s = set()
while x%k != 0:
ans += 1
x = (x*10%k+7)%k
if x in s:
ans = -1
break
s.add(x)
print(ans) | k = int(eval(input()))
x = 7
ans = 1
flag = [False]*k
while x%k != 0:
ans += 1
x = (x*10%k+7)%k
if flag[x]:
ans = -1
break
flag[x] = True
print(ans) | p02596 |
k = int(eval(input()))
x, i = 0, 0
r = set()
while True:
x = (x * 10 + 7) % k
i += 1
if x == 0:
break
if x in r:
print((-1))
quit()
r.add(x)
print(i) | def power(x, n, mod):
ans = 1
while n > 0:
if n % 2 == 1:
ans = ans * x % mod
n //= 2
x = x * x % mod
return ans
def eular(n):
ans = 1
if n % 2 == 0:
x = 1
while n % 2 == 0:
n //= 2
x *= 2
ans *= x -... | p02596 |
K = int(eval(input()))
used = set()
pos = 1
v = 0
while 1:
v += 7*pow(10, pos-1, K)
v %= K
if v==0:
print(pos)
break
if v in used:
print((-1))
break
used.add(v)
pos += 1 | K = int(eval(input()))
used = set()
pos = 1
v = 0
while 1:
v = (10*v+7)%K
if v==0:
print(pos)
break
if v in used:
print((-1))
break
used.add(v)
pos += 1 | p02596 |
K = int(eval(input()))
import sys
if K%2 == 0 or K%5 == 0:
print((-1))
sys.exit()
mod = 0
for i in range(1000000):
mod += (7*pow(10,i,K))%K
mod = mod%K
if mod%K == 0:
print((i+1))
sys.exit() | import sys
K = int(eval(input()))
tmp = 0
for i in range(1,10**7):
tmp = (tmp*10+7)%K
if tmp == 0:
print(i)
sys.exit()
print((-1)) | p02596 |
k = int(eval(input()))
mod = 7 % k
counter = 1
memo = 1
mod_map = set()
mod_map.add(mod)
while mod != 0:
memo = ((memo % k) * (10 % k)) % k
mod = (mod + 7 * memo) % k
if mod not in mod_map:
mod_map.add(mod)
else:
counter = -1
break
counter += 1
if mod == 0:... | k = int(eval(input()))
mod = 7 % k
counter = 1
memo = 1
mod_map = set()
mod_map.add(mod)
while mod != 0:
mod = ((mod * 10) % k + 7) % k
if mod not in mod_map:
mod_map.add(mod)
else:
counter = -1
break
counter += 1
if mod == 0:
break
print(counter)
| p02596 |
k = int(eval(input()))
mod = 7 % k
counter = 1
memo = 1
mod_map = set()
mod_map.add(mod)
while mod != 0:
mod = ((mod * 10) % k + 7) % k
if mod not in mod_map:
mod_map.add(mod)
else:
counter = -1
break
counter += 1
if mod == 0:
break
print(counter)
| k = int(eval(input()))
mod = 0
for i in range(1, k + 1):
mod = ((mod * 10) % k + 7) % k
if mod == 0:
print(i)
break
else:
print((-1))
| p02596 |
K = int(eval(input()))
if K%2 == 0:
print((-1))
elif K%5 == 0:
print((-1))
else:
res = 7
for i in range(K):
if res % K == 0:
break
res = (res * 10 + 7) % K
print((i + 1)) | K = int(eval(input()))
res = 7 % K
for i in range(K):
if res == 0:
ans = i+1
break
res = (res * 10 + 7) % K
if res != 0:
ans = -1
print(ans) | p02596 |
K = int(eval(input()))
if K % 2 == 0 or K % 5 == 0:
print((-1))
exit()
i = 0
sevens = 0
while True:
sevens += 7 * pow(10, i, K)
sevens %= K
i += 1
if sevens == 0:
break
print(i)
| 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 |
k=int(input())
x=i=0
while i<7e6:i+=1;x=(x*10+7)%k;x<1>exit(print(i))
print(-1)
| k=int(input())
x=i=0
while i<k:i+=1;x=(x*10+7)%k;x<1>exit(print(i))
print(-1)
| p02596 |
k = int(eval(input()))
if k % 2 == 0:
print("-1")
quit()
num = 1
cnt = 1
if k % 7 ==0:
k = k//7
while True:
num = num % k
if num == 0:
print(cnt)
break
else:
num += pow(10, cnt, k)
cnt += 1
| def main(k):
if k % 2 == 0:
return -1
num = 1
cnt = 1
if k % 7 == 0:
k = k//7
for i in range(1000000):
num = num % k
if num == 0:
return cnt
else:
num += pow(10, cnt, k)
cnt += 1
return -1
k = int(eval(input()))
print((main(k))) | p02596 |
K = int(eval(input()))
n = 7%K
r = 1
for i in range(10**6+5):
if n==0:
print((i+1))
exit()
r *= 10
n += r*7
r %= K
n %= K
#print(r,n)
print((-1)) | K = int(eval(input()))
k = 1
a = 7
for i in range(10**6+5):
if a%K == 0:
print(k)
exit()
a = (a*10 + 7) % K
k += 1
print((-1)) | p02596 |
# -*- coding: utf-8 -*-
# template: v1.3.1
# 倍数問題では、N(i)%k は k 以内でループする...はず。実際している…
# 桁落としは、mod 途中実行でできる…了解...！！！！！合点！！！！
import io
import sys
import math
### DEBUG ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
999983
"""
_EXPECTED = """\
4
"""
if _DEB:
sys.stdin = io.StringIO(_INPUT)
... | k=int(eval(input()))
n=7%k
for i in range(1,k+1):
if n == 0:
print(i)
exit()
n=(n*10+7) % k
print((-1)) | p02596 |
k=int(eval(input()))
n=7%k
s=set()
i=1
while n not in s:
if n == 0:
print(i)
exit()
s.add(n)
n=(10*n+7) %k
i+=1
print((-1)) | # Cyclic mod calculation renshuu
# kの倍数 -> N % k == 0 を探索する
# N%k の値は高々 k種類となる。k回のループで十分に網羅できる。
# kは10**6。制約上も問題がない。
k=int(eval(input()))
n=7%k
for i in range(1,k+1):
if n==0:
print(i)
exit()
# 計算量を抑えてmodするため、漸化式のような実装にすることがミソ。
n=(n*10+7)%k
print((-1))
| p02596 |
k = int(eval(input()))
num = 1
n = 7
x = True
if (k%2 == 0):
x = False
print((-1))
while x:
if (n%k == 0):
print(num)
break
else:
n = (n*10 + 7)%k
num += 1
| def main():
k = int(eval(input()))
num = 1
n = 7
if (k%2 == 0):
print((-1))
return
for i in range(1000000):
if (n%k == 0):
print(num)
return
else:
n = (n*10 + 7)%k
num += 1
print((-1)... | p02596 |
n = int(input().rstrip())
def calc(target):
excess = set()
result = 0
count = 0
if target % 2 == 0:
return -1
while True:
count += 1
result = (result * 10 + 7) % target
excess.add(result)
if result == 0:
break
ret... | n = int(input().rstrip())
def calc(target):
result = 0
count = 0
if target % 2 == 0:
print((-1))
return
for i in range(n):
result = (result * 10 + 7) % target
count += 1
if result == 0:
print(count)
return
... | p02596 |
K = int(eval(input()))
def calculate(k):
res = 1
n = 7
if k % 2 == 0:
print((-1))
return
if k % 5 == -1:
print((-1))
return
while n % k > 0:
n = n % k
n = n * 10 + 7
res += 1
print(res)
calculate(K) | K = int(eval(input()))
def calculate(k):
if k % 2 == 0:
print((-1))
return
if k % 5 == 0:
print((-1))
return
res = 1
m = (((10 ** res) - 1) // 9) * 7
while m % k > 0:
res += 1
m = m % k
m = m * 10 + 7
print(res... | p02596 |
k = int(eval(input()))
checked = [False] * k
surplus = 0
ans = 1
while 1:
surplus = ((surplus * 10) + 7) % k
if checked[surplus]:
print((-1))
exit()
if surplus == 0:
break
checked[surplus] = True
ans += 1
print(ans)
|
k = int(eval(input()))
surplus = 0
ans = 1
while 1:
if ans > k:
print((-1))
exit()
surplus = ((surplus * 10) + 7) % k
if surplus == 0:
break
ans += 1
print(ans)
| p02596 |
def main():
K = int(eval(input()))
if K%2 == 0 or K%5==0:
return -1
if K % 7 == 0:
L = K * 9 // 7
else:
L = K * 9
for i in range(1, 10000000):
x = pow(10, i, L)
if x == 1:
return i
else:
return -1
if __name__ =... | k=int(eval(input()))
if k==7 or k==1:
print((1))
else:
a=7
for i in range(1,10**6):
a=10*a+7
if a%k==0:
print((i+1))
break
else:
a=a%k
else:
print((-1)) | p02596 |
k = int(eval(input()))
if k % 2 == 0:
print((-1))
else:
ans = 1
num = 7 % k
temp = 7 % k
while True:
if num % k == 0:
print(ans)
break
else:
ans += 1
temp = temp * 10 % k
num += temp % k
num %= k... | k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
ans = 1
num = 7 % k
temp = 7 % k
while True:
if num % k == 0:
print(ans)
break
else:
ans += 1
temp = temp * 10 % k
num += temp % k
... | p02596 |
k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
ans = 1
num = 7
while True:
if int(num) % k == 0:
print(ans)
break
else:
ans += 1
num += 7 * pow(10, ans - 1, k)
num %= k
| k = int(eval(input()))
if k % 2 == 0 or k % 5 == 0:
print((-1))
else:
ans = 1
num = 7
while True:
if num % k == 0:
print(ans)
break
else:
ans += 1
num += 7 * pow(10, ans - 1, k)
num %= k
| p02596 |
K = int(eval(input()))
like = 7
ans = -1
for i in range(K):
if like % K == 0:
ans = i+1
break
like = (like*10+7) % K
print(ans)
| K = int(eval(input()))
ans = -1
N = 7
for i in range(K):
if N % K == 0:
ans = i+1
break
N = (N*10+7) % K
print(ans)
| p02596 |
k = int(eval(input()))
ans = 0
ai = 0
if k%2 == 0:
print((-1))
exit()
while True:
ai = (ai*10 + 7)% k
ans += 1
if ai == 0:
break
print(ans)
| 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 |
K=int(eval(input()))
if K%2==0:
print('-1')
exit()
a=0
i=1
while True:
a=(a*10+7)%K
if a==0:
print(i)
break
i+=1
| K=int(eval(input()))
if K%2==0 or K%5==0:
print('-1')
exit()
a=0
i=1
while True:
a=(a*10+7)%K
if a==0:
print(i)
break
i+=1
| p02596 |
k = int(eval(input()))
now = 7
cnt = 1
used = [False] * k
ten = 10
while not used[now % k]:
if now % k == 0:
print(cnt)
exit()
used[now % k] = True
now = (now + ten * 7) % k
ten = ten * 10 % k
cnt += 1
print((-1))
| k = int(eval(input()))
n = 7
for i in range(k):
if n % k == 0:
print((i + 1))
exit()
n = (n * 10 + 7) % k
print((-1))
| p02596 |
K = int(eval(input()))
a = 7
flag = False
for i in range(1,K+1):
b = a%K
if b==0:
flag = True
break
a = b*10 + 7
if flag:
print(i)
else:
print((-1)) | # 解答
K = int(eval(input()))
A = 7 % K
flag = False
for i in range(1, K+1):
if A == 0:
flag = True
break
A = (A*10 + 7) % K
if flag:
print(i)
else:
print((-1)) | p02596 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(K):
m = 0
for i in range(1, 10**6):
m = (m * 10 + 7) % K
if m == 0:
print(i)
return
print((-1))
if __name__ == '__main__':
input = sys.stdin.readline
K = int(eval(input()))
m... | K = int(eval(input()))
mod = 0
for i in range(K):
mod = (10 * mod + 7) % K
if mod == 0:
print((i + 1))
exit()
print((-1))
| p02596 |
k = int(eval(input()))
ans = 1
num = 0
if not k%2:
print((-1))
else:
while True:
num = (num*10+7)%k
if num == 0:
print(ans)
break
ans += 1 | k = int(eval(input()))
num = 0
if not k%2:
print((-1))
else:
for i in range(k):
num = (num*10+7)%k
if num == 0:
print((i+1))
break
else:
print((-1)) | p02596 |
import math
from functools import reduce
import collections
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
... | k=int(eval(input()))
if k%7==0:
k//=7
res=1
if k%2==0 or k%5==0:
print((-1))
else:
k*=9
for i in range(k):
res*=10
if res%k==1:
print((i+1))
break
else:
res%=k
| p02596 |
K = int(eval(input()))
num = 0
for i in range(1000001):
num += 7 * pow(10, i, K)
num %= K
if num == 0:
print((i + 1))
break
else:
print((-1))
| def solve(K):
cur = 0
tens = 1
for i in range(1_000_001):
cur += 7 * tens
cur %= K
if cur == 0:
return i + 1
tens *= 10
tens %= K
else:
return -1
print((solve(int(eval(input())))))
| p02596 |
k=int(eval(input()))
n=7
i=1
x=7%k
if k==1 or k==7:
print((1))
else:
while i>=0:
n=n*10+7
n=n%k
i+=1
if n==0:
print(i)
break
if n==x:
print((-1))
break | k=int(eval(input()))
n=0
for i in range(1,k+1):
n=n*10+7
n=n%k
if n==0:
print(i)
exit()
print((-1))
| p02596 |
K = int(eval(input()))
a = 7 % K
for i in range(999983):
if a == 0:
print((i+1))
exit()
a = (a * 10 + 7) % K
print((-1)) | K = int(eval(input()))
a = 7 % K
for i in range(K):
if a == 0:
print((i+1))
exit()
a = (a * 10 + 7) % K
print((-1)) | p02596 |
K = int(eval(input()))
L = 0
if K % 7 == 0:
L = 9*K//7
else:
L = 9*K
ans = -1
a = 10
for i in range(1,L+1,1):
if a % L == 1:
ans = i
break
a = (a % L) * 10
print(ans) | K = int(eval(input()))
L = 0
if K % 7 == 0:
L = 9*K//7
else:
L = 9*K
ans = -1
s = 10
for i in range(1,L,1):
if s % L == 1:
ans = i
break
s = s % L * 10
print(ans) | p02596 |
N=int(eval(input()))
if N%2==0:
print((-1))
else:
ans=1
a=7
num=7
while(num%N!=0):
a=(a*10)%N
num=(num+a)%N
ans+=1
print(ans)
| N=int(eval(input()))
if N%2==0:
print((-1))
elif N%5==0:
print((-1))
else:
ans=1
a=7
num=7
while(num%N!=0):
a=(a*10)%N
num=(num+a)%N
ans+=1
print(ans)
| p02596 |
from sys import stdin,stdout
#for _ in range(int(stdin.readline())):
n=int(stdin.readline())
#a=list(map(int,stdin.readline().split()))
dividend=7;ans=-1
for add in range(10**7):
rem=dividend%n
if rem==0:
ans=add+1
break
dividend=rem*10+7
print(ans)
| from sys import stdin,stdout
#for _ in range(int(stdin.readline())):
n=int(stdin.readline())
#a=list(map(int,stdin.readline().split()))
dividend=7;ans=-1
for add in range(10**6+5):
rem=dividend%n
if rem==0:
ans=add+1
break
dividend=rem*10+7
print(ans)
| p02596 |
import math
import sys
def main():
#an+1=(10~n)*7+an
K=int(eval(input()))
if K%2==0:
print((-1))
sys.exit()
n=0
a=7
while True:
if a%K==0:
break
n+=1
a=(a+(pow(10,n,K)*7))%K
print((n+1))
if __name__=="__main__":
mai... | import math
import sys
def main():
#an+1=(10~n)*7+an
K=int(eval(input()))
if K%2==0:
print((-1))
sys.exit()
elif K%5==0:
print((-1))
sys.exit()
n=0
a=7
while True:
if a%K==0:
break
n+=1
a=(a+(pow(10,n,K)... | p02596 |
k = int(eval(input()))
mod = 7 % k
if k % 2 == 0:
print((-1))
else:
ans = 1
while mod != 0:
mod = (10*mod + 7) % k
ans += 1
if ans >= 10**10:
print((-1))
break
if ans < 10**10:
print(ans) | k = int(eval(input()))
mod = 7 % k
if k % 2 == 0:
print((-1))
else:
ans = 1
while mod != 0:
mod = (10*mod + 7) % k
ans += 1
if ans >= 10**7:
print((-1))
break
if ans < 10**7:
print(ans) | p02596 |
K = int(eval(input()))
if K % 2 == 0:
print((-1))
elif K % 5 == 0:
print((-1))
else:
seven = 7
ans = 1
while ans < 1000000:
amari = seven % K
if amari == 0:
print(ans)
break
else:
ans += 1
seven = amari * 10 + 7... | K = int(eval(input()))
if K%2 == 0 or K%5 == 0:
print((-1))
else:
if K%7 == 0:
L = 9*K//7
else:
L = 9*K
i = 1
A = 10
while i < 9000000:
re = A%L
if re == 1:
print(i)
break
else:
A = re*10
i... | p02596 |
K = int(eval(input()))
n = 0
for i in range(1, 1010101):
n = (n*10 + 7) % K
if n == 0:
print(i)
exit()
else:
print((-1)) | K = int(eval(input()))
n = 0
for i in range(1, 1000000):
n = (n*10 + 7) % K
if n == 0:
print(i)
exit()
else:
print((-1)) | p02596 |
k = int(eval(input()))
if k % 2 == 0 & k % 5 == 0:
print((-1))
exit()
x = 7 % k
s = set()
i = 1
ans = -1
while x not in s:
if x == 0:
ans = i
break
s.add(x)
x = (10 * x + 7) % k
i += 1
print(ans) | k = int(eval(input()))
if k % 2 == 0 & k % 5 == 0:
print((-1))
exit()
x = 7 % k
s = set()
ans = -1
for i in range(1,k+1):
if x == 0:
ans = i
break
s.add(x)
x = (10 * x + 7) % k
i += 1
print(ans) | p02596 |
def c_repsept():
K = int(eval(input()))
if (K % 2 == 0 or K % 5 == 0):
return -1 # repsept の因数に 2, 5 はない
repsept = 7 % K
count = 1
while repsept % K !=0:
repsept = ((repsept * 10) + 7) % K
count += 1
return count
print((c_repsept())) | def c_repsept():
K = int(eval(input()))
L = 9 * K // 7 if K % 7 == 0 else 9 * K
if L % 2 == 0 or L % 5 == 0:
return -1
remainder = 1
for n in range(1, L + 1):
remainder = (10 * remainder) % L
if remainder == 1:
return n
return -1
print((c_reps... | p02596 |
def c_repsept():
K = int(eval(input()))
L = 9 * K // 7 if K % 7 == 0 else 9 * K
if L % 2 == 0 or L % 5 == 0:
return -1
remainder = 1
for n in range(1, L + 1):
remainder = (10 * remainder) % L
if remainder == 1:
return n
return -1
print((c_reps... | def c_repsept_totient():
def euler_phi(n):
"""正整数 n に対して、n と互いに素な n 以下の正整数の個数"""
ret = n
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
ret = ret // i * (i - 1)
while n % i == 0:
n //= i
if n > 1:
... | p02596 |
K = int(eval(input()))
ans = -1
if K in [2,5]:
pass
else:
num = 7
ans = 0
while True:
ans += 1
if num % K == 0:
break
else:
num = (num * 10 + 7)%K
print(ans) | K = int(eval(input()))
ans = -1
if K%2 == 0:
pass
elif K%5 == 0:
pass
else:
num = 7
ans = 0
while True:
ans += 1
if num % K == 0:
break
else:
num = (num * 10 + 7)%K
print(ans) | p02596 |
k=int(eval(input()))
if k%2==0:
print((-1))
exit()
count=1
a=0
while True:
a=(a*10+7)%k
if a==0:
print(count)
exit()
count+=1 | k=int(eval(input()))
if k%2==0 or k%5==0:
print((-1))
exit()
a=0
for i in range(k):
a=(a*10+7)%k
if a==0:
print((i+1))
exit() | p02596 |
#! /usr/bin/env python3
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
def isMultiple(s, m):
tmp = 0
for i in range(len(s)):
tmp = (tmp * 10 + int(s[i])) % m
... | #! /usr/bin/env python3
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
k = int(readline())
ans = -1
acc = 7 % k
for n in range(1, k + 10):
if acc == 0:
ans = n
... | p02596 |
k = int(eval(input()))
x = 1
if k%7 != 0:
mod = 9*k
else:
mod = 9*k//7
for i in range(10**6):
x = x*10%mod
if x == 1:
print((i + 1))
exit()
print((-1)) | k = int(eval(input()))
a = 0
for i in range(k + 10):
a = (a*10 + 7)%k
if a == 0:
print((i + 1))
exit()
print((-1)) | p02596 |
a=sorted(map(int,input().split()));print((a[-1]*(2**(int(eval(input()))))+sum(a)-a[-1])) | a=sorted(map(int,input().split()))[::-1];print((a[0]*(2**(int(eval(input()))))+sum(a)-a[0])) | p03360 |
L = [list(map(int,input().split()))]
K = int(eval(input()))
import copy
def peice_double(L):
l = []
for x in L:
tmp = copy.copy(x)
for i in range(3):
tmp[i] = tmp[i] * 2
l.append(copy.copy(tmp))
tmp[i] = tmp[i] // 2
return l
for i in range(K)... | L = list(map(int,input().split()))
K = int(eval(input()))
m = max(L)
print((sum(L)-m + m* (2 ** K))) | p03360 |
import heapq
def main():
A, B, C = list(map(int, input().split()))
K = int(eval(input()))
lv = []
heapq.heappush(lv, -A)
heapq.heappush(lv, -B)
heapq.heappush(lv, -C)
for _ in range(K):
v = heapq.heappop(lv)
heapq.heappush(lv, v*2)
return -sum(lv)
if... | def main():
A, B, C = list(map(int, input().split()))
K = int(eval(input()))
v = [A, B, C]
v.sort(reverse = True)
return pow(2, K)*v[0] + v[1] + v[2]
if __name__ == '__main__':
print((main()))
| p03360 |
A,B,C = list(map(int,input().split()))
K = int(eval(input()))
maxV = max(A,B,C)
print((A+B+C-maxV+maxV*2**K)) | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# --------------------------------------... | p03360 |
A=list(map(int,(input().split())))
K=int(eval(input()))
X=sum(A)
for i in range(K) :
X+=max(A)*(2**i)
print(X) | A=list(map(int,(input().split())))
K=int(eval(input()))
print((sum(A)+max(A)*((2**K)-1))) | p03360 |
a,b,c = list(map(int, input().split()))
k = int(eval(input()))
print((a+b+c+max(a,b,c)*((2**k)-1))) | L = sorted(map(int, input().split()))
k = int(eval(input()))
print((L[0]+L[1]+L[2]*2**k)) | p03360 |
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.... | from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.... | p03360 |
a,b,c,=list(map(int,input().split()))
k=int(eval(input()))
while k>0:
if max(a,b,c)==c:
c=2*c
k-=1
elif max(a,b,c)==b:
b=2*b
k-=1
else:
a=2*a
k-=1
print((sum([a,b,c]))) | a=list(map(int,input().split()))
k=int(eval(input()))
a.sort()
for _ in range(k):
a[-1]*=2
print((sum(a))) | p03360 |
l=[int(_) for _ in input().split()]
k=int(eval(input()))
print((max(l)*2**k+sum(l)-max(l))) | l=[int(_) for _ in input().split()]
print((max(l)*2**int(eval(input()))+sum(l)-max(l))) | p03360 |
A,B,C = list(map(int,input().split()))
K = int(eval(input()))
S = A+B+C-max(A,B,C)
M = max(A,B,C)
for k in range(K):
M = M*2
print((M+S))
| a = list(map(int,input().split()))
k = int(eval(input()))
a.sort()
print((a[0]+a[1]+a[2]*(2**k)))
| p03360 |
a = list(map(int,input().split()))
b = int(eval(input()))
print((sum(a)+max(a)*(2**b)-max(a))) | A,B,C = sorted(list(map(int,input().split())),reverse=True)
K = int(eval(input()))
print((A*(2**K)+B+C)) | p03360 |
l = list(map(int, input().split()))
k = int(eval(input()))
ans = sum(l) - max(l) + max(l)*2**k
print(ans) | l = list(map(int, input().split()))
k = int(eval(input()))
print((max(l)*2**k + sum(l)- max(l))) | p03360 |
A, B, C = list(map(int, input().split()))
print((max(A, B, C) * 2 ** int(eval(input())) + A + B + C - max(A, B, C))) | a, b, c = list(map(int, input().split()))
k = int(eval(input()))
print((a + b + c + max(a, b, c) * 2 ** k - max(a, b, c))) | p03360 |
A = list(map(int, input().split()))
k = int(eval(input()))
x = max(A)
for _ in range(k):
x *= 2
print((sum(A) - max(A) + x)) | A = [int(i) for i in input().split()]
k = int(eval(input()))
print((max(A) * (2 ** k) + (sum(A) - max(A)))) | p03360 |
N=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
res=0
back=-1
for a in A:
res=res+B[a-1] #listは０スタート
if a-1==back: #A内の今考えている変数が前のと同じなら
res=res+C[back-1] #listは０スタート
back=a
print(res) | n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
res=sum(B)
for i in range(n-1):
if A[i+1]-A[i]==1:
res += C[A[i]-1]
print(res) | p02916 |
n = int(eval(input()))
a = [input().split() for l in range(3)]
mnpk = 0
fl = 0
for i in range(n):
b = int(a[0][i]) - 1
mnpk = mnpk + int(a[1][b])
if fl == 1:
if int(a[0][i-1]) == b:
mnpk = mnpk + int(a[2][b-1])
else:
fl = 1
print(mnpk)
| n = int(eval(input()))
a = [list(map(int,input().split())) for l in range(3)]
mnpk = 0
fl = 0
for i in range(n):
b = a[0][i] - 1
mnpk = mnpk + a[1][b]
if fl == 1:
if a[0][i-1] == b:
mnpk = mnpk + a[2][b-1]
else:
fl = 1
print(mnpk) | p02916 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
point = sum(b)
for i in range(1,n):
if a[i-1] +1 == a[i]:
point += c[a[i-1]-1]
print(point)
if __name__ == '__m... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
total_score = sum(b)
for i in range(1, n):
prev = a[i - 1]
if prev + 1 == a[i]:
total_score += c[prev - 1]
... | p02916 |
n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c= list(map(int,input().split()))
cnt=0
for i in range(n-1):
if a[i+1] == a[i]+1:
cnt+=c[a[i]-1]
print((sum(b)+cnt)) | n = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = sum(b)
for i in range(1,n):
if a[i]-1==a[i-1]:
ans+=c[a[i-1]-1]
print(ans) | p02916 |
import sys
import math
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(int, tinput()))
def rlinput():
return list(rinput(... | n = int(eval(input())); summ = 0;
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
for i in range(n):
summ = summ + b[a[i]-1]
if i>0:
if a[i] == a[i-1] + 1:
summ = summ + c[a[i-1]-1]
print(summ) | p02916 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=0
b_n=-2
for i in range(n):
num=a[i]-1
ans+=b[num]
if num==b_n+1:
ans+=c[b_n]
b_n=a[i]-1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
ans=sum(b)
for i in range(n-1):
if a[i+1]==a[i]+1:
ans+=c[a[i]-1]
print(ans) | p02916 |
N = int(eval(input()))
A = [-1] + list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
ans += B[A[i] - 1]
if A[i] == A[i - 1] + 1:
ans += C[A[i] - 2]
print(ans)
| N = int(eval(input()))
A = [-1] + list(map(int, input().split()))
B, C = list(map(int, input().split())), list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
ans += B[A[i] - 1]
if A[i] == A[i - 1] + 1:
ans += C[A[i] - 2]
print(ans)
| p02916 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
a_sp = [c[a[i] - 1] for i in range(n - 1) if a[i + 1] - a[i] == 1]
print((sum(b + a_sp))) | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
print((sum(b + [c[a[i] - 1] for i in range(n - 1) if a[i + 1] - a[i] == 1]))) | p02916 |
def resolve():
n=int(eval(input()))
A=list([int(x)-1 for x in input().split()])
ans=sum(map(int,input().split()))
C=list(map(int,input().split()))
for i in range(n-1):
if A[i+1]-A[i]==1: ans+=C[A[i]]
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=sum(B)
for i in range(n-1):
... | p02916 |
N=int(eval(input()))
Alist=list(map(int,input().split()))
Blist=list(map(int,input().split()))
Clist=list(map(int,input().split()))
Cplus=0
for n in range (N-1):
if Alist[n+1] == Alist[n]+1:
Cplus += Clist[Alist[n]-1]
print((sum(Blist)+Cplus)) | N=int(eval(input()))
Alist=list(map(int,input().split()))
Blist=list(map(int,input().split()))
Clist=list(map(int,input().split()))
Cplus=0
for n in range (0,N-1):
if Alist[n+1] == Alist[n]+1:
Cplus += Clist[Alist[n]-1]
print((sum(Blist)+Cplus)) | p02916 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
point= 0
for i in range(n):
point += b[a[i]-1]
if i != 0:
if a[i-1]+1 == a[i]:
point += c[a[i]-... | n = int(eval(input()))
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
c_list = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += b_list[a_list[i]-1]
#print(b_list[a_list[i]-1])
if i == 0:
continue
else:
if a_list[i] ... | p02916 |
n=int(eval(input()))
a=[0]+[int(i) for i in input().split()]
b=[0]+[int(i) for i in input().split()]
c=[0]+[int(i) for i in input().split()]
res = 0
prev = -1
for i in range(1, n+1):
res += b[a[i]]
if prev+1 == a[i]:
res += c[prev]
prev = a[i]
print(res)
| n=int(eval(input()))
a=[int(i)-1 for i in input().split()]
b=[int(i) for i in input().split()]
c=[int(i) for i in input().split()]
res = 0
prev = -2
for i in range(n):
res += b[a[i]]
if prev+1 == a[i]:
res += c[prev]
prev = a[i]
print(res)
| p02916 |
n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for a in A:
ans += B[a-1]
for i in range(n-1):
if A[i] + 1 == A[i+1]:
ans += C[A[i]-1]
print(ans) | n = int(eval(input()))
a = [i-1 for i in map(int, input().split())]
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
prev_ind = 50
for i in a:
ans += b[i]
if prev_ind + 1 == i:
ans += c[prev_ind]
prev_ind = i
print(ans) | p02916 |
n = int(eval(input()))
a, b, c = [list(map(int, input().split())) for _ in range(3)]
ans = sum(b)
last = -1
for x in a:
if last+1 == x:
ans += c[last-1]
last = x
print(ans)
| n = int(eval(input()))
a, b, c = [list(map(int, input().split())) for _ in range(3)]
ans = sum(b)
for x, y in zip(a[:-1], a[1:]):
if x + 1 == y:
ans += c[x-1]
print(ans)
| p02916 |
n = int(eval(input())) #waiting_for_pudging
a = list(map(int, input().split())) #waiting_for_pudging
b = list(map(int, input().split())) #waiting_for_pudging
c = list(map(int, input().split())) #waiting_for_pudging
summ = 0 #waiting_for_pudging
for i in range(n-1): #pudging
if a[i] + 1 == a[i + 1]: #pudging
... | n = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
s = sum(B)
for i in range(len(A)-1):
# print(A[i], A[i+1]-1, C[i+1], i)
if A[i] == A[i+1]-1:
s+=C[A[i]-1]
print(s)
| p02916 |
N = int(eval(input()))
ans = 0
for i in range(N):
ans += i
print(ans) | N = int(eval(input()))
print((N*(N-1)//2)) | p02924 |
# ABC139
# D
# ModSum
n = int(eval(input()))
print((sum(i for i in range(n)))) | # ABC139
# D
# ModSum
n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.