problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02612 | s234875527 | Wrong Answer | N = int(input())
yen = N // 100 +1
shoki = yen * 1000
oturi = shoki - N
if oturi == 1000:
print(int(oturi - 1000))
else:
print(int(oturi)) |
p02612 | s106120858 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s276676058 | Wrong Answer | N=int(input())
print(1000-N%1000) |
p02612 | s796036298 | Wrong Answer | N = int(input())
res =N
while res>= 1000 :
res = res -1000
print(res) |
p02612 | s276751327 | Wrong Answer | import sys, math,os
from io import BytesIO, IOBase
#data = BytesIO(os.read(0,os.fstat(0).st_size)).readline
# from bisect import bisect_left as bl, bisect_right as br, insort
# from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
# from itertools import permutations,combinations
# from decimal import Decimal
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var): sys.stdout.write(' '.join(map(str, var)) + '\n')
def out(var): sys.stdout.write(str(var) + '\n')
#sys.setrecursionlimit(100000 + 1)
INF = 10**9
mod = 998244353
N=int(data())
out(1000-N%1000)
|
p02612 | s509592337 | Wrong Answer | n=int(input())
if n>1000:
print(n%1000)
else:
print(1000-n)
|
p02612 | s820797605 | Wrong Answer | print(1000 - int(input()) % 1000) |
p02612 | s243297917 | Wrong Answer | money1 = int(input())
money2 = 1000 - (money1 % 1000)
print(money2) |
p02612 | s455177936 | Wrong Answer | n = int(input())
print(n % 1000)
|
p02612 | s265915161 | Wrong Answer | N = int(input())
print(N%1000) |
p02612 | s812742539 | Wrong Answer | N = int(input())
while True:
if N <= 1000:
break
N -= 1000
print(N) |
p02612 | s965657008 | Wrong Answer | n = int(input())
ans = n//1000
print((ans+1)*1000 - n)
|
p02612 | s846985979 | Wrong Answer | n = int(input())
if (0 <= n and n <= 10000):
if (n % 1000) == 0:
print(0)
else:
n1 = n / 1000
n2 = (n1+1) * 1000
change = n2 - n
print(change)
|
p02612 | s820841961 | Wrong Answer | #!/usr/bin/python
# -*- Coding: utf-8 -*-
n = int(input())
if n % 1000 == 0:
print(0)
elif n > 1000:
a = (n//1000 + 1)*1000
print(a - n)
else:
print(n)
|
p02612 | s237967279 | Wrong Answer | N = int(input())
print(N%1000) |
p02612 | s174557616 | Wrong Answer | X=int(input())
while X>=1000:
X-=1000
print(X) |
p02612 | s770550098 | Wrong Answer | N = int(input())
i = N // 1000
ans = N - i * 1000
print(ans) |
p02612 | s065727333 | Wrong Answer | a = int(input())
b = a // 1000 + 1
print(b + 1000 - a) |
p02612 | s499962798 | Wrong Answer | N=int(input())
if N%1000!=0:
print(1000-N%1000)
else:
print(1000-N) |
p02612 | s533138257 | Wrong Answer | N=int(input())
print(1000-N%1000) |
p02612 | s602942238 | Wrong Answer | N = int(input())
otsuri = N % 1000
print(otsuri) |
p02612 | s490373008 | Wrong Answer | n = int(input())
m = (int(n / 1000) + 1) * 1000 - n
print(m)
|
p02612 | s867568794 | Wrong Answer | N = int(input())
q, mod = divmod(N, 1000)
print(1000-mod) |
p02612 | s628688592 | Wrong Answer | N = int(input())
a = 1000*(int(str(N)[0]) + 1) - N
print(a if a != 1000 else 0)
|
p02612 | s592385987 | Wrong Answer | N = int(input())
print(1000-N%1000)
|
p02612 | s389209647 | Wrong Answer | n = int(input())
amari = (n%1000)
print (1000 - amari) |
p02612 | s083782584 | Wrong Answer | n= int(input())
print(1000-n%1000) |
p02612 | s495631398 | Wrong Answer | n = int(input())
print(1000-n%1000) |
p02612 | s606201478 | Wrong Answer | a = int(input())
print(a%1000) |
p02612 | s219488376 | Wrong Answer | N = int(input())
print(1000 - N % 1000) |
p02612 | s870616189 | Wrong Answer | n=int(input())
t=n//1000
print((t+1)*1000-n) |
p02612 | s360447119 | Wrong Answer | n = int(input())
if n<=1000:
print(1000-n)
else:
a = int(round(n/1000,0))
b = 1000*a
print(n-b) |
p02612 | s751283038 | Wrong Answer | N = int(input())
print((1000-(N % 1000))) |
p02612 | s343890683 | Wrong Answer | N = int(input())
ans = []
for i in range(1,11):
ans.append(abs((i*1000)-N))
print(min(ans)) |
p02612 | s803458602 | Wrong Answer | N = int(input())
N = N % 1000
print(N) |
p02612 | s995753591 | Wrong Answer | import sys
N = int(input())
ans = 0
if N % 1000 == 0:
ans = 0
else:
ans = N % 1000
print(ans)
|
p02612 | s206784741 | Wrong Answer | N = int(input())
print(N//1000) |
p02612 | s169045374 | Wrong Answer | a = int(input())
if a <= 1000:
b = a//1000
else:
b = a//1000 + 1
print(b*1000 - a)
|
p02612 | s332146024 | Wrong Answer | N = int(input())
n = N/1000
for i in range(10):
if i >= n:
print(i*1000-N)
break |
p02612 | s700813115 | Wrong Answer | t=int(input())
m=0
while 1000*m<t:
m=m+1
c=1000*m-t
print(t) |
p02612 | s818663095 | Wrong Answer | n = int(input())
print(1000 - n % 1000) |
p02612 | s348683480 | Wrong Answer | N = int(input("N:"))
sa = 10000 - N
ans = sa % 1000
print(ans) |
p02612 | s955225921 | Wrong Answer | #AtCoder
N = int(input())
if (N % 1000 == 0):
print(0)
else:
print(N % 1000) |
p02612 | s220203120 | Wrong Answer | inp = input()
value = int(inp)
amari = value % 1000
result = 1000 - amari
print(result) |
p02612 | s175494829 | Wrong Answer | n=int(input())
print(1000 - (n % 1000)) |
p02612 | s027158513 | Wrong Answer | n = int(input())
print(1000-(n%1000)) |
p02612 | s331538613 | Wrong Answer | N = int(input())
print(1000-N%1000) |
p02612 | s815937075 | Wrong Answer | N=int(input())
N%=1000
if N==0:
print(0)
else:
print(N) |
p02612 | s504550176 | Wrong Answer | n = int(input())
print(1000 - (n % 1000)) |
p02612 | s476033257 | Wrong Answer | N =int(input())
L = N % 1000
if 0<= L<=500:
print(L)
elif 500< L < 1000:
P = N // 1000
K = 1000 - L
print(K) |
p02612 | s857419191 | Wrong Answer | n = int(input())
if n < 1000:
print(n)
else:
for i in range(1,n):
if 1000*i >= n:
print(1000*i - n)
break |
p02612 | s170912374 | Wrong Answer | N = int(input())
t = N//1000
print((t+1)*1000-N) |
p02612 | s390191117 | Wrong Answer | # -*- coding: utf-8 -*-
print(int(input())%1000) |
p02612 | s611534758 | Wrong Answer | n=int(input())
print(1000-n%1000) |
p02612 | s512566286 | Wrong Answer | n = int(input())
res = 1000 - n // 1000
print(res) |
p02612 | s324758051 | Wrong Answer | x=int(input())
if x//1000==0:
print(0)
else:
print(1000-(x%1000)) |
p02612 | s727581880 | Wrong Answer | # 整数の入力
a = int(input())
# スペース区切りの整数の入力
amari = a % 1000
# 出力
print("{}".format(amari)) |
p02612 | s667786225 | Wrong Answer | #A - Payment
N = int(input())
a = N % 1000
if N < 1000 :
ans = 1000- a
elif a < 500:
ans = 1000 - a
else:
ans = 1000-a
print(ans) |
p02612 | s476092493 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p02612 | s715535817 | Wrong Answer | N = int(input())
print(N % 1000)
|
p02612 | s128100649 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
ans = 1000-N
print(ans)
if __name__ == '__main__':
main()
|
p02612 | s380948860 | Wrong Answer | n=int(input())
print(n%1000) |
p02612 | s428370640 | Wrong Answer | #商品の値段を入力させる
n = int(input())
r_othuli = int()
for x in range (0 , 10000 , 1000):
if n <= x :
r_othuli += x-n
print(r_othuli)
exit() |
p02612 | s813897655 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s871184672 | Wrong Answer | pay = int(input())
print( pay%1000 ) |
p02612 | s148193564 | Wrong Answer | n = int(input())
print((10000-n)*1000)
|
p02612 | s312270253 | Wrong Answer | N = float(input())
otsuri = N%1000
print(otsuri) |
p02612 | s686644045 | Wrong Answer | n = int(input())
satu = n//1000
print(n-1000*satu) |
p02612 | s826232472 | Wrong Answer | N=int(input())
quotient=N//1000
for i in range(quotient+1):
N=N-1000
print(abs(N)) |
p02612 | s977353275 | Wrong Answer | N = int(input())
ot = N//1000
print((ot+1)*1000 - N) |
p02612 | s092400428 | Wrong Answer | N = int(input())
d = N % 1000
if 1000 - d == 0:
print(0)
else:
print(1000 - d) |
p02612 | s396507382 | Wrong Answer | n=int(input())
print(1000-(n%1000))
|
p02612 | s744342617 | Wrong Answer | N=int(input())
if N>1000:
print(1000-N%1000)
else:
print(1000-N) |
p02612 | s854482226 | Wrong Answer | n = int(input())
m =n% 1000
if m==0:
print(0)
else:
print(1000 % (m)) |
p02612 | s651777999 | Wrong Answer | n = int(input())
t = str(n)[0]
print((int(t) + 1) * 1000 - n if not n % 1000 == 0 else '0')
|
p02612 | s043822321 | Wrong Answer | import math
n = int(input())
print(n-math.floor(n/1000)*1000) |
p02612 | s045469631 | Wrong Answer | N = int(input())
print(N-N//1000*1000) |
p02612 | s440254730 | Wrong Answer | n = int(input())
if n >= 1000:
num = n / 1000
num = round(num) * 1000
print(abs(num - n))
else:
print(1000-n) |
p02612 | s902886072 | Wrong Answer | n = int(input())
print(n % 1000) |
p02612 | s232765651 | Wrong Answer | n = int(input())
t = str(n)[0]
result = 1000 * (int(t) + 1) - n
print(result) |
p02612 | s817337258 | Wrong Answer | N = int(input())
if N >=1000:
a = 1000 - (N % 1000)
print(a)
else:
print(1000 - N) |
p02612 | s550174446 | Wrong Answer | N= int(input())
mod = N%1000
if N < 1000:
print(1000-N)
exit()
elif mod > 500:
mod = 1000-mod
print(mod)
|
p02612 | s788580088 | Wrong Answer | n=int(input())
print(1000-n) |
p02612 | s111533782 | Wrong Answer | a=input()
a=int(a)
print(a % 1000) |
p02612 | s380671283 | Wrong Answer | n=int(input())
ans=n%1000
print(ans)
|
p02612 | s083676497 | Wrong Answer | n=int(input())
print(1000-n%1000)
|
p02612 | s675614096 | Wrong Answer | n = int(input())
print(1000-n) |
p02612 | s327216556 | Wrong Answer | N=int(input())
if N%1000==0:
print(0)
else:
print(N%1000) |
p02612 | s803135401 | Wrong Answer | #!/usr/bin/python
# -*- Coding: utf-8 -*-
n = int(input())
if n >= 1000:
print(n%1000)
else:
print(n)
|
p02612 | s291988417 | Wrong Answer | print(1000-int(input())%1000) |
p02612 | s977359582 | Wrong Answer | import sys
n = int(input())
if n % 1000 == 0:
print(0)
sys.exit()
while n > 1000:
n -= 1000
print(n) |
p02612 | s599376256 | Wrong Answer | class Main():
def otsuri(N):
while N < 1000 * i:
otsuri = 1000 * i - N
return otsuri
|
p02612 | s462112285 | Wrong Answer | i = int(input())
print(i%1000)
|
p02612 | s956963875 | Wrong Answer | n = int(input())
m = n//1000
print(n-(m*1000)) |
p02612 | s628572240 | Wrong Answer | n=int(input())
k=n%1000
print(k) |
p02612 | s320548345 | Wrong Answer | def main():
N = int(input())
a = N % 1000
if a > 500:
print(1000 - a)
else:
print(a)
if __name__ == '__main__':
main() |
p02612 | s821069549 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s504548911 | Wrong Answer | N = int(input())
print(min(N % 1000, abs(N - (N // 1000 + 1) * 1000)))
|
p02612 | s620109649 | Wrong Answer | n = int(input())
print(abs(n%1000 - n)) |
p02612 | s568224430 | Wrong Answer | n = int(input())
a = n % 1000
if a == 1000 & n == 0:
ans = 0
else:
ans = 1000 - a
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.