problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02612 | s459642033 | Wrong Answer | # -*- coding: utf-8 -*-
a = int(input())
b = a % 1000
print(b) |
p02612 | s791265615 | Wrong Answer | n = int(input())
x = 0
for i in range(10) :
if 1000*i>n and x == 0:
x = i
print(1000*x-n) |
p02612 | s547501709 | Wrong Answer | import math
n=int(input())
print(1000*math.ceil(n//1000)-n) |
p02612 | s053008677 | Wrong Answer | n=int(input())
print(min(n%1000,1000-n%1000)) |
p02612 | s760197325 | Wrong Answer | n = int(input())
if n%1000 == 1:
print(0)
else:
print(1000-n%1000) |
p02612 | s566710250 | Wrong Answer | N = int(input())
print(N%1000) |
p02612 | s286195264 | Wrong Answer | n=int(input())
money=1000
while(1):
if n<=money:
break
money+=1000
print(money%n) |
p02612 | s036342958 | Wrong Answer | n=int(input())
ans=n%1000
print(1000-ans) |
p02612 | s415767572 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p02612 | s381449173 | Wrong Answer | n = int(input())
print(1000 - n % 1000)
|
p02612 | s093436850 | Wrong Answer | n=int(input())
x=0
while x<n:
x+=1000
print(n-x) |
p02612 | s327176041 | Wrong Answer | n=int(input())
while n>=1000:
n-=1000
print(abs(n)) |
p02612 | s067560850 | Wrong Answer | n = int(input())
while n >= 1000:
n = n-1000
print(1000-n) |
p02612 | s412218619 | Wrong Answer | n = int(input())
t1 = n%1000
t2 = (int(n/1000) + 1)*1000 - n
if t1 < t2:
print(t1)
else:
print(t2) |
p02612 | s189590714 | Wrong Answer | n = int(input())
x = n % 1000
if x == 0:
print(x)
print(1000 - x) |
p02612 | s957961014 | Wrong Answer | N=int(input())
print((1+N//1000)*1000-N) |
p02612 | s625945372 | Wrong Answer | n = input()
a = int(n[:1])+1
ans = a*1000-int(n)
if(ans == 1000):
print(0)
elif ans>1000:
print(1000-int(n))
else:
print(ans) |
p02612 | s791963627 | Wrong Answer | N = int(input())
for i in range(11):
if N < 1000:
break
N = N - 1000
print(N) |
p02612 | s361120463 | Wrong Answer | x=int(input())
if(x&1000==0):
print(0)
else:
print(x%1000) |
p02612 | s149408555 | Wrong Answer | N = int(input())
tmp = N // 1000
answer = (tmp+1)*1000 -N
print(int(answer)) |
p02612 | s332303570 | Wrong Answer | N = int(input())
print(1000-N%1000) |
p02612 | s112529188 | 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().strip())
A=N%1000
print(A)
f.close() |
p02612 | s372695362 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s597709943 | Wrong Answer | a = int(input())
print(1000 - a % 1000)
|
p02612 | s251184498 | Wrong Answer | N = int(input())
res = N%1000
if N == 0:
print(res)
else:
print(1000-res) |
p02612 | s575723385 | Wrong Answer | N = int(input())
while N >= 1000:
N = N - 1000
else:
print(N) |
p02612 | s346988796 | Wrong Answer | n = int(input())
print(n % 1000) |
p02612 | s087375981 | Wrong Answer | a=int(input())
b=a//1000
c=b+1
d=c*1000-a
print(d) |
p02612 | s520141005 | Wrong Answer | a = int(input())
b = a % 1000
print(1000 - b)
|
p02612 | s908342432 | Wrong Answer | n=int(input())
print(1000-(n%1000)) |
p02612 | s356089807 | Wrong Answer | n=int(input())
print(1000-n%1000)
|
p02612 | s008001308 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p02612 | s494317320 | Wrong Answer | n = int(input())
ans = n%1000
if (0<=ans and ans<=500):
print(ans)
else:
print(1000 - ans)
|
p02612 | s949449112 | Wrong Answer | n = int(input())
if (n%1000) <=500:
print(n%1000)
else:
print(1000-(n%1000))
|
p02612 | s732091762 | Wrong Answer | print(1000-(int(input())%1000)) |
p02612 | s035116540 | Wrong Answer | n = int(input())
print(1000-(n%1000)) |
p02612 | s582998632 | Wrong Answer | n = int(input())
ans = 1000 - n % 1000
print(ans)
|
p02612 | s008832679 | Wrong Answer | price = int(input())
amari = price % 1000
print(amari) |
p02612 | s242705867 | Wrong Answer | N = int(input())
ans = N%1000
print(ans) |
p02612 | s624586392 | Wrong Answer | N = int(input())
ans = ((N//1000)+1)*1000-N
print(ans) |
p02612 | s545776659 | Wrong Answer | n=int(input())
print(((n//1000)+1)*1000-n) |
p02612 | s086666795 | Wrong Answer | n = int(input())
if n%1000 <= 500:
print(n%1000)
else:
print(1000-n%1000) |
p02612 | s735689993 | Wrong Answer | N = int(input())
div = N % 1000
exc = (div + 1)*1000 -N
print(exc) |
p02612 | s094675261 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s866734371 | Wrong Answer | n=int(input())
print(min(n%1000,1000-n%1000)) |
p02612 | s706933760 | Wrong Answer | n = int(input())
while n >= 1000:
n -= 1000
n = max(n, 0)
# print((1000 - n % 1000) % 1000)
print(n)
|
p02612 | s662713812 | Wrong Answer | n = int(input())
while n < 1000:
n //= 1000
print(n) |
p02612 | s740375650 | Wrong Answer | print(1000-int(input())%1000) |
p02612 | s268734264 | Wrong Answer | n = int(input())
ans = 1000 - (n % 1000)
print (ans) |
p02612 | s576730326 | Wrong Answer | N = int(input())
print(N % 1000) |
p02612 | s479019264 | Wrong Answer | input1 = int(input())
while input1 > 999:
input1 -= 1000
print(1000 - input1) |
p02612 | s648091403 | Wrong Answer | N=int(input())
for i in range(0,11000,1000):
if N<=i:
print(int(i-N))
|
p02612 | s567622044 | Wrong Answer | N = int(input())
for i in range(20):
if(N < 1000):
break
N -= 1000
print(str(1000-N)) |
p02612 | s146230021 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s413089718 | Wrong Answer | n = int(input())
mod = n%1000
print(1000-mod) |
p02612 | s798789804 | Wrong Answer | N = int(input())
print(1000 - 1000 % N) |
p02612 | s179576582 | Wrong Answer | n = int(input())
print(n % 1000) |
p02612 | s791658670 | Wrong Answer | N = int(input())
print((N // 1000 + 1) * 1000 - N)
|
p02612 | s174333296 | Wrong Answer | n=int(input())
if(n%1000):
print(n%1000) |
p02612 | s884011906 | Wrong Answer |
#n,m=map(int,input().split())
a=int(input())
print(1000-(a%1000))
|
p02612 | s000727739 | Wrong Answer | print(1000 - int(input())%1000) |
p02612 | s298930698 | Wrong Answer | N = int(input())
otsuri = N % 1000
if otsuri > 0:
orsuri = 1000 - otsuri
print(otsuri)
|
p02612 | s860435966 | Wrong Answer |
n=int(input())
print(n%1000)
|
p02612 | s669954452 | Wrong Answer | n = int(input())
print(1000 - (n % 1000))
|
p02612 | s081475789 | Wrong Answer | n=int(input())
k=0
while k <= n:
k += 1000
print(k-n) |
p02612 | s683505416 | Wrong Answer |
def abc173_a():
N = int(input())
#N = 1900
print(1000-N%1000)
abc173_a() |
p02612 | s232096420 | Wrong Answer | n = int(input()) #10000以下
for i in range(11):
if n >= 1000:
n -= 1000
if n < 1000:
print(1000 - n)
break |
p02612 | s515525950 | Wrong Answer | i = int(input())
print(i % 1000)
|
p02612 | s458928286 | Wrong Answer | N = int(input())
print((N // 1000 + 1) * 1000 - N) |
p02612 | s362719105 | Wrong Answer | N=int(input())
if (N%1000)>=500:
print(1000-(N%1000))
else:
print((N%1000)) |
p02612 | s091972838 | Wrong Answer | n = int(input())
if n < 1000:
print(n)
elif n % 1000 == 0:
print(0)
else:
x = n // 1000
y = (x+1)*1000
print(y-n) |
p02612 | s628238227 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s256893495 | Wrong Answer | N = int(input())
for i in range (11):
if(N<1000*(i+1)):
pre = i+1
break
ans = pre*1000 - N
print(ans) |
p02612 | s958597704 | Wrong Answer | N=int(input())
a=N%1000
print(a) |
p02612 | s232836489 | Wrong Answer | n = int(input())
if n%1000 == 0:
print(0)
else:
while n > 1000:
n = n - 1000
print(n) |
p02612 | s085652784 | Wrong Answer | n=int(input())
print(n%1000) |
p02612 | s522345078 | Wrong Answer | N = int(input())
a = 0
if N >= 1000:
a = N - 1000
else:
a = a
while a >= 1000:
a = a - 1000
if a != 0:
a = 1000 - a
print(a) |
p02612 | s499840361 | Wrong Answer | N = int(input())
print(1000-N % 1000) |
p02612 | s595304227 | Wrong Answer | number = int(input())
print(1000 - number % 1000) |
p02612 | s548958204 | Wrong Answer | N = int(input())
while N > 0:
N = N - 1000
print(N) |
p02612 | s631713562 | Wrong Answer | print(int(int(input()) % 1000)) |
p02612 | s374847179 | Wrong Answer | n = int(input())
m = n % 1000
if m < 501:
print(m)
else:
print(1000-m) |
p02612 | s389457077 | Wrong Answer | N = int(input())
yen1000 = round(N / 1000)
change = (yen1000)*1000 - N
print(change) |
p02612 | s967719613 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s714003735 | Wrong Answer | N = int(input())
a = 1000 - (N % 1000)
print(a) |
p02612 | s526549724 | Wrong Answer | N=int(input())
S=N%1000
print(1000-S)
|
p02612 | s535561774 | Wrong Answer | N = int(input())
while N >= 1000:
N = N % 1000
print(1000 - N) |
p02612 | s097771349 | Wrong Answer | def main():
N = int(input())
print(1000 - (N % 1000))
if __name__ == "__main__":
main()
|
p02612 | s560852376 | Wrong Answer | N = int(input())
print(1000-N%1000) |
p02612 | s605893408 | Wrong Answer | n = int(input())
print((1000-n//1000)%1000) |
p02612 | s476432960 | Wrong Answer | N = int(input().strip())
print(N%1000)
|
p02612 | s673552927 | Wrong Answer | n = input()
print(n[-3:]) |
p02612 | s265085161 | Wrong Answer | n = int(input())
print(1000-(n % 1000))
|
p02612 | s702270049 | 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():
din=int(input())
ar=[1000,2000,3000,4000,5000]
if din not in ar:
print(din-1800)
else:
print(0)
main()
'''
if __name__ == '__main__':
main()
'''
|
p02612 | s189286708 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s204929500 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s033391063 | Wrong Answer |
a = int(input())
b = 0
while b <= a:
b = b + 1000
print(abs(a-b)) |
p02612 | s508374509 | Wrong Answer | print(int(input())%1000) |
p02612 | s289085271 | Wrong Answer | n = int(input())
print(1000-n%1000) |
p02612 | s719353435 | Wrong Answer | s = int(input())
print(1000 - s % 1000) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.