problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02612 | s677080672 | Wrong Answer | import math
def main():
N = int(input())
print(N % 1000)
main() |
p02612 | s075802048 | Wrong Answer | a=int(input())
b=a%1000
c=a-b
d=c+1000
e=int(d-a)
print(e) |
p02612 | s020845829 | Wrong Answer | n = int(input())
ans = n % 1000
ans = 1000 - ans
print(ans) |
p02612 | s466317900 | Wrong Answer | N = int(input())
print((N+999)//1000) |
p02612 | s598893998 | Wrong Answer | n = input()
num = int(n[-3:])
print(1000-num) |
p02612 | s368104404 | Wrong Answer | n = int(input()) % 1000
print(n) |
p02612 | s031792788 | Wrong Answer | def change(N):
x = N%1000
if x:
return 1000 - x
return 0 |
p02612 | s450826784 | Wrong Answer | n=int(input())
rem=n%1000
print(min(rem,1000-rem)) |
p02612 | s560514595 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
n %= 1000
res = min(n, 1000 - n)
print(res)
if __name__ == '__main__':
resolve()
|
p02612 | s629179480 | Wrong Answer | import math
n = int(input())
x = round(n/1000)
s = 1000*x
if n > s:
result = n - s
else:
result = s - n
print(math.floor(result)) |
p02612 | s602082125 | Wrong Answer | num = input()
num1 = int(num)
num2 = list(num)
sen = (int(num2[0])+1)*1000
n = sen-num1
print(n) |
p02612 | s142396481 | Wrong Answer | n=int(input())
r=n%1000
print(1000-r) |
p02612 | s378601941 | Wrong Answer | def pay(N):
return N % 1000 |
p02612 | s351269736 | Wrong Answer | N = int(input())
a = ((N//1000)+1)*1000 - N
print(a) |
p02612 | s351055425 | Wrong Answer | n = int(input())
if n % 1000 == 0:
print(0)
else:
satu=(n/1000)+1
harau=satu*1000
print(harau-n) |
p02612 | s785821755 | Wrong Answer | n = int(input()) #10000以下
for i in range(11):
if n >= 1000:
n -= 1000
else:
print(n)
break |
p02612 | s802088253 | Wrong Answer | n = int(input())
print(1000-(n % 1000)) |
p02612 | s386925828 | Wrong Answer | i = int(input().strip())
print((i // 1000 + 1) * 1000 - i)
|
p02612 | s831684120 | Wrong Answer | n = int(input())
ans = 0
for i in range(10):
if n == 1:
ans = 999
break
if 1000*i >= n:
ans = 1000*i - n
break
print(ans) |
p02612 | s926362330 | Wrong Answer | N = int(input())
if N % 1000 == 0:
print(0)
else:
cnt = (N // 1000) + 1
ans = 1000 * cnt - N
print(N) |
p02612 | s233290249 | Wrong Answer | import sys
#DEBUG = True
DEBUG = False
if DEBUG:
f=open("202007_1st/A_input.txt")
else:
f=sys.stdin
N=int(f.readline())
print(N%1000)
f.close() |
p02612 | s150968553 | Wrong Answer | N = int(input())
otsuri = N % 1000
print(otsuri) |
p02612 | s933508842 | Wrong Answer | from collections import deque
import math
import os
import random
import re
import sys
#n=list(map(int, input().split()))
#n=map(int, input().split())
def main():
n=int(input())
if n <= 2000:
print('100')
else:
print('0')
main()
'''
if __name__ == '__main__':
main()
'''
|
p02612 | s632200128 | Wrong Answer | x = int(input())
print(1000 - (x % 1000)) |
p02612 | s558286322 | Wrong Answer |
def main():
N = int(input())
print(N%1000)
if __name__ == "__main__":
main() |
p02612 | s702420902 | Wrong Answer | print(1000-int(input())) |
p02612 | s772723965 | Wrong Answer | S=int(input())
if S%1000==0:
print(0)
elif S<1000:
print(1000-S%1000)
else:
print((S//1000)*1000-S%1000) |
p02612 | s655588690 | Wrong Answer | n = int(input())
if n%1000 == 0:
print(0)
else:
if n%1000 <= 500:
print(n%1000)
else:
print(1000-n%1000) |
p02612 | s034458629 | Wrong Answer | n = int(input())
print(n % 1000) |
p02612 | s224375426 | Wrong Answer | N = int(input())
print(N - 1000*(N//1000)) |
p02612 | s801676953 | Wrong Answer | N = int(input())
print(1000 - N%1000) |
p02612 | s434506679 | Wrong Answer | N = int(input())
N = N % 1000
print(1000-N) |
p02612 | s166769336 | Wrong Answer | N = int(input())
mod = N % 1000
if mod > 500:
mod = 1000 - mod
print(mod) |
p02612 | s789901253 | Wrong Answer | n = int(input())
if n >= 1000:
num = n % 1000
else:
num = 1000 - n
print(abs(num))
|
p02612 | s395429530 | Wrong Answer | N = input()
m = len(N)
if m > 3:
N = N[-3:]
print(1000 - int(N)) |
p02612 | s297914212 | Wrong Answer | n = int(input())
x = round(n / 1000)
ans = (x * 1000) - n
print(ans) |
p02612 | s809465134 | Wrong Answer | n = int(input())
a = 1000
for i in range(n//1000 + 1):
if n <= a*i :
c = a*i - n
print(c)
break |
p02612 | s233989246 | Wrong Answer | n = int(input())
if n < 100:
print(1000-n)
else:
print(1000-(n%1000)) |
p02612 | s243004247 | Wrong Answer | # -*- coding: utf-8 -*-
n = int(input())
print(1000-(n%1000))
|
p02612 | s106841394 | Wrong Answer | a=int(input())
if a%1000==0:
print(a)
else:
b=a%1000
c=a-b
d=c+1000
e=int(d-a)
print(e)
|
p02612 | s019580257 | Wrong Answer | import sys
N = int(input())
num = 0
if N % 1000 == 0:
num = N % 1000
else:
num = (N // 1000) + 1
Money = 1000*num
change = Money % N
print(change)
|
p02612 | s412215875 | Wrong Answer | # ABC173a
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# 再帰関数を使わない限りPypyで出すこと
def dump(*args):
sys.stderr.write(str(args))
n = int(input())
import math
print(math.ceil(n/1000))
if __name__ == '__main__':
main()
|
p02612 | s254152362 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p02612 | s360745940 | Wrong Answer | N = int(input())
print(N%1000) |
p02612 | s093646174 | Wrong Answer | n=int(input())
print(1000-n%1000) |
p02612 | s375536730 | Wrong Answer | n = int(input())
print(n/1000 + 1) |
p02612 | s816591897 | Wrong Answer | n = int(input())
x = round(n/1000)
s = 1000*x
if n > s:
result = n - s
else:
result = s - n
print(result) |
p02612 | s129940385 | Wrong Answer | x = int(input())
print(1000 - x % 1000)
|
p02612 | s377827443 | Wrong Answer | N=int(input())
print(1000-N) |
p02612 | s874897298 | Wrong Answer | N=int(input())
an=N//1000
ans=(an+1)*1000-N
if an==0:
print(0)
else:
print(ans) |
p02612 | s587767503 | Wrong Answer | n = int(input())
print(1000 - n%1000) |
p02612 | s789336256 | Wrong Answer | N=int(input())
a=0
if N<1000:
print(1000-N)
exit()
else:
while 1:
if a*1000-N>0:
print(a*1000-N)
exit()
else:
a+=1 |
p02612 | s599666181 | Wrong Answer | a = int(input())
print(1000 - a%1000) |
p02612 | s604025757 | Wrong Answer | i = int(input())
a = i%1000
print(a) |
p02612 | s353798657 | Wrong Answer | N = int(input())
money = N % 1000
print(money) |
p02612 | s558494991 | Wrong Answer | N = int(input())
print(round(N, -3) - N) |
p02612 | s090221515 | Wrong Answer | n = int(input())
a = 0
if n % 1000 == 0:
print(0)
else:
a = 1000 - n % 1000
print(a) |
p02612 | s680921504 | Wrong Answer | n=int(input())
print(1000-n%1000) |
p02612 | s837491877 | Wrong Answer | N=int(input())
print(1000-N)
|
p02612 | s641957039 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s205145877 | Wrong Answer | N=int(input())
N%=1000
print(1000-N) |
p02612 | s510798130 | Wrong Answer | n = int(input())
n %= 1000
print(1000 - n) |
p02612 | s553398102 | Wrong Answer | N =int(input())
K = N % 1000
print(K)
|
p02612 | s416963908 | Wrong Answer | N = int(input())
d = int(N % 1000)
print(1000 - d)
|
p02612 | s326431565 | Wrong Answer | n = int(input())
print(n)
if n % 1000 == 0:
ans = 0
else:
ans = 1000 - n % 1000
print(ans) |
p02612 | s500583428 | Wrong Answer | N = int(input())
otsuri = 1000-N%1000
atai = 0
if otsuri == 0:
print(atai)
else:
print(otsuri) |
p02612 | s948565771 | Wrong Answer | N = int(input())
while True:
N -= 1000
if N < 1000:
break
print(1000 - N if N != 0 else 0) |
p02612 | s978841033 | Wrong Answer | N = int(input())
if N % 1000 == 0:
print(0)
else:
print(N//1000 +1 ) |
p02612 | s680267123 | Wrong Answer | n = int(input())
print(1000 - (n % 1000) if 1000 - (n % 1000) is not 1000 else 0) |
p02612 | s605852469 | Wrong Answer |
n=int(input())
print(n%1000) |
p02612 | s114839370 | Wrong Answer | n = int(input())
ans = 1000 - n%1000
print(ans) |
p02612 | s558348423 | Wrong Answer | print(1000-((int(input()))%1000)) |
p02612 | s347738607 | Wrong Answer | import math
n=int(input())
x=10000000
for i in range(101):
x=min(abs(n-i*1000),x)
print(x) |
p02612 | s796813013 | Wrong Answer | import sys
import numpy as np # noqa
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
print((N-1000) % 1000)
|
p02612 | s828793131 | Wrong Answer | N = int(input())
print(int(N / 1000 + 1) * 1000 - N ) |
p02612 | s454163778 | Wrong Answer | n = int(input())
print(1000-(n % 1000))
|
p02612 | s802096941 | Wrong Answer | N = int(input())
print(1000 - N%1000) |
p02612 | s550057627 | Wrong Answer | a = int(input())
print(0) if a%1000==0 else print(1000-(a//1000)) |
p02612 | s284235868 | Wrong Answer | x = int(input())
print(x%1000) |
p02612 | s863629820 | Wrong Answer | import sys
n = int((input()))
if n%1000 == 0:
print(0)
else:
while n > 1000:
n -= 1000
print(1000-n) |
p02612 | s138612874 | Wrong Answer | N=int(input())
if N!=10000:
n=N//(1000)
ch=(n+1)*(1000)-N
print(ch)
else:
print(0) |
p02612 | s172824369 | Wrong Answer | N = int(input())
while N >= 1000:
N = N - 1000
print(N) |
p02612 | s595189206 | Wrong Answer | n = int(input())
k = n//1000 + 1
ans = 1000*k - n
print(ans) |
p02612 | s801837678 | Wrong Answer | n = int(input())
a = n//1000
print(1000*(a+1) - n) |
p02612 | s896976110 | Wrong Answer | N = int(input())
for i in range(10):
if i*1000>=N:
print(i*1000-N)
exit() |
p02612 | s401070718 | Wrong Answer | n = int(input())
print(1000 - (n % 1000)) |
p02612 | s220232347 | Wrong Answer | n = int(input())
print(1000-(n%1000)) |
p02612 | s415738417 | Wrong Answer | N = int(input())
ans = 1000 - (N % 1000)
print(ans) |
p02612 | s715703219 | Wrong Answer | N = int(input())
d = N % 1000
print(1000 - d)
|
p02612 | s947598783 | Wrong Answer | N = int(input())
print(N % 1000) |
p02612 | s389138124 | Wrong Answer | def main():
arg = int(input())
if arg < 1000:
ans = 1000 - arg
else:
ans = 1000 - (arg % 1000)
print(str(ans))
if __name__ == '__main__':
main()
|
p02612 | s436725313 | Wrong Answer | N = int(input())
print(N - (N // 1000) * 1000) |
p02612 | s771173258 | Wrong Answer | a = int(input())
if a > 10000000:
print(f"{a-10000000}")
else:
print(f"{a % 1000}") |
p02612 | s009623302 | Wrong Answer | n=int(input())
m=n%1000
print(m) |
p02612 | s815644083 | Wrong Answer | N = int(input())
print(1000 - N % 1000) |
p02612 | s398490278 | Wrong Answer | N = int(input())
print(1000 - N % 1000) |
p02612 | s679985920 | Wrong Answer | N = int(input())
ans = N % 1000
print(ans) |
p02612 | s343856962 | Wrong Answer | print(1000-int(input())%1000) |
p02612 | s542376905 | Wrong Answer | #! /usr/bin/python3
N = int(input())
1 <= N <= 10000
if N % 1000 == 0:
print(0)
else:
sen = N//1000
sen2 = sen*1000
atai = N-sen2
print(atai) |
p02612 | s676775146 | Wrong Answer | N = int(input())
if (N % 1000 > 500):
print(1000 - (N % 1000))
else:
print(N % 1000) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.