problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02612 | s209865674 | Wrong Answer | n = int(input())
num = n%1000
ans = 1000-num
print(ans) |
p02612 | s276584166 | Wrong Answer | import math
n=int(input())
print(1000*math.ceil(n//1000)-n+1000)
|
p02612 | s407291424 | Wrong Answer | N = int(input())
if N % 1000 == 0:
print(N // 1000)
else:
print(N // 1000 + 1)
|
p02612 | s893253628 | Wrong Answer | N=int(input())
while N>=1000:
N-=1000
print(N) |
p02612 | s482468512 | Wrong Answer | N = int(input())
if N % 1000 == 0:
print(0)
print(1000 - N % 1000)
|
p02612 | s549218486 | Wrong Answer | from sys import stdin
def readline_from_stdin() -> str:
return stdin.readline().rstrip
if __name__ == '__main__':
N = int(input())
print(1000 - N % 1000)
|
p02612 | s770077748 | Wrong Answer | N = int(input())
print(1000-(N%1000)) |
p02612 | s349597322 | Wrong Answer | N = int(input())
ans = N % 1000
print(1000-ans) |
p02612 | s053805298 | Wrong Answer | n = int(input())
print(1000 - (n % 1000)) |
p02612 | s792956985 | Wrong Answer | N=int(input(""))
A = N % 1000
if A > 1:
B=1000-A
print(B)
else:
print(A)
|
p02612 | s752083178 | Wrong Answer | i = int(input())
print(i % 1000)
|
p02612 | s597755111 | Wrong Answer | x = int(input())
while x<=0:
x -=1000
print(abs(x)) |
p02612 | s768162018 | Wrong Answer | N=int(input())
if N>1000:
print(1000-N%1000)
else:
print(1000-N) |
p02612 | s277450673 | Wrong Answer | N=int(input())
print(N%1000) |
p02612 | s581085703 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p02612 | s422147342 | Wrong Answer | n = int(input())
print(n-1000*(n//1000)) |
p02612 | s523850767 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s268212386 | Wrong Answer | import math
a = input()
b = int(a)
c = 1000
if len(a) < 5:
print(c-b)
else:
if a[-4] != '0':
b = int(a[-5:])
print(c-b)
elif a[-3] != '0':
b = int(a[-4:])
print(c-b)
elif a[-2] != '0':
b = int(a[-3:])
print(c-b)
else:
print(int(0)) |
p02612 | s922877571 | Wrong Answer | N = int(input())
print(1000-N)
|
p02612 | s825525546 | Wrong Answer | n = int(input())
ans = n % 1000
print(ans) |
p02612 | s274580615 | Wrong Answer | #!/usr/bin/env python3
import os
from sys import stdin, stdout
def solve(tc):
n = int(stdin.readline().strip())
print(1000 - (n%1000))
tcs = 1
tc = 1
while tc <= tcs:
solve(tc)
tc += 1 |
p02612 | s929873710 | Wrong Answer | N = int(input())
while N >= 1000:
N -= 1000
print(N) |
p02612 | s970916714 | Wrong Answer | a = int(input())
print(1000-a%1000) |
p02612 | s061531884 | Wrong Answer | import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools
N=int(input())
print(N%1000) |
p02612 | s668559650 | Wrong Answer | a=input()
if len(a)==(4 or 5):
b=a[1:]
c=1000-int(b)
if c==1000 :
print('0')
else:
print(c)
else:
print(1000-int(a))
|
p02612 | s549196930 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s780585341 | Wrong Answer | print(1000 - int(input()) % 1000) |
p02612 | s761455329 | Wrong Answer | def solver(N):
return N % 1000
print(solver(int(input()))) |
p02612 | s045324228 | Wrong Answer | a=int(input())
print(a%1000)
|
p02612 | s081441668 | Wrong Answer | N = int(input())
ans = []
for i in range(10):
ans.append(abs((i*1000)-N))
print(min(ans)) |
p02612 | s485142619 | Wrong Answer | N = int(input())
print(1000-N%1000) |
p02612 | s350194042 | Wrong Answer | N = int(input())
if N%1000 == 0:
print(N/1000 * 1000 - N)
else:
print(((N/1000) + 1)*1000 - N)
|
p02612 | s226041489 | Wrong Answer | N=int(input())
N%=1000
print(min(N,1000-N)) |
p02612 | s438798628 | Wrong Answer | n = int(input())
if n >= 1000:
num = n % 1000
else:
num = 1000 - n
print(int(num))
|
p02612 | s914380186 | Wrong Answer | a=int(input())
if a/1000==type(int):
print(0)
else:
b=a%1000
c=1000-b
print(c) |
p02612 | s829143554 | Wrong Answer | print(int(input())%1000) |
p02612 | s163947638 | Wrong Answer | N = int(input())
print(N%1000) |
p02612 | s768768181 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
#import numpy as np
def main():
n = int(input())
if n % 1000:
print(n // 1000 + 1)
else:
print(n // 1000)
if __name__ == '__main__':
main() |
p02612 | s647754618 | Wrong Answer | N = int(input())
a = N//1000
print((a+1)*1000-N) |
p02612 | s336121249 | Wrong Answer | N = int(input())
otsuri = N % 1000
print(otsuri)
if not otsuri == 0:
otsuri = 1000 - otsuri
print(otsuri)
|
p02612 | s585027595 | Wrong Answer |
def main():
A = int(input())
s = A % 1000
print(1000-s)
if __name__ == '__main__':
main()
|
p02612 | s725982406 | Wrong Answer | n=input()
t=len(n)
if t<4:
print(1000-int(n))
else:
k=int(n[0])
if int(n)>k*1000:
print((k+1)*1000-int(n))
else:
print(0) |
p02612 | s432692972 | Wrong Answer | n = int(input())
n = n % 1000
print(1000-n) |
p02612 | s876895436 | Wrong Answer | n=int(input())
print(n//1000) |
p02612 | s326136507 | Wrong Answer | N=int(input())
if N>=1000:
print(N%1000)
elif N<1000:
print(1000-N) |
p02612 | s467938710 | Wrong Answer | print(0) |
p02612 | s323924465 | Wrong Answer | n = int(input())
a = 1000
for i in range(n):
if n <= a*i :
c = a*i - n
print(c)
break |
p02612 | s717011367 | Wrong Answer | n = int(input())
payment = abs(n - round(n / 1000) * 1000)
print(payment) |
p02612 | s857743718 | Wrong Answer | n = int(input())
print(n - (-n // 1000) * 1000) |
p02612 | s814409530 | Wrong Answer | N = int(input())
N = 1000 - N
print(N) |
p02612 | s353787673 | Wrong Answer | n = int(input())
d = n//1000+1
print(d*1000-n) |
p02612 | s373365829 | Wrong Answer | n=int(input())
print(n%1000) |
p02612 | s381844857 | Wrong Answer | N = int(input())
print(1000-(N-round(N,-3))) |
p02612 | s431848151 | Wrong Answer | print(1000 - (int(input()) % 1000))
|
p02612 | s514023224 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Sun Jul 5 21:00:39 2020
@author: NEC-PCuser
"""
N = int(input())
print(N % 1000) |
p02612 | s795221456 | Wrong Answer | n = int(input())
if n <= 1000:
print(1000 - n)
else:
m = n // 1000 + 1
print(m * 1000 - n) |
p02612 | s014080863 | Wrong Answer | n = int(input()) - 1
k = list(str(n))
kk = int(k[0])
print((kk + 1)*1000 - n - 1) |
p02612 | s100243420 | Wrong Answer | N=int(input())
print(1+N/1000) |
p02612 | s229557346 | Wrong Answer | N = int(input())
print(N % 1000) |
p02612 | s276193968 | Wrong Answer | n =int(input())
n = n%1000
print(1000- n) |
p02612 | s644579553 | Wrong Answer | n = int(input())
ans = n % 1000
print(ans)
|
p02612 | s803753633 | Wrong Answer | N = int(input())
n = 1000
while N > n:
n += 1000
print(N - n) |
p02612 | s886718663 | Wrong Answer | a = int(input())
b = a % 1000
ans = 1000 - b
print(ans) |
p02612 | s786854561 | Wrong Answer | n = int(input())
if n % 1000 == 0 :
print(n / 1000)
else :
tmp = n // 1000
print(1000 * (tmp + 1) - n) |
p02612 | s790116098 | Wrong Answer | N=int(input())
money=0
for i in range(8):
if(money>N):
break
money=1000*i
print(money-N) |
p02612 | s030303870 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s885861972 | Wrong Answer | N = int(input())
if N%1000==0:
print(0)
elif N<1000:
print(N)
else:
print(1000-N%1000) |
p02612 | s966377442 | Wrong Answer | S = int(input())
A = S % 1000
print(1000 - A) |
p02612 | s821719898 | Wrong Answer | a=int(input())
print(a%1000)
|
p02612 | s937027332 | Wrong Answer | Y=int(input())
def payment(Y):
if 1000-Y>-2000:
print(((Y-2000)*-1))
payment(Y) |
p02612 | s774259351 | Wrong Answer | input1 = input()
print(1000 - int(input1) % 1000) |
p02612 | s736481899 | Wrong Answer | n = int(input())
print(1000*((n//1000)+1) - n) |
p02612 | s872236337 | Wrong Answer | # coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.8.2)
import math
import statistics
import numpy as np
import queue
import itertools
import functools
n = int(input())
print(0 if n == 1000 else 1000 - (n % 1000))
|
p02612 | s791799303 | Wrong Answer | i = int(input())
a = 1000-(i%1000)
print(a) |
p02612 | s356893128 | Wrong Answer | N= input()
x=int(N)
if x<1000:
print(1000-x)
if x > 999:
while True: #0 1 2 4 5が出力される
x -= 1000
if x <= 1000:
break
print(1000-x)
|
p02612 | s186482361 | Wrong Answer | n=int(input())
c=n%1000
if c>=500:
print(1000-c)
else:
print(c) |
p02612 | s955429939 | Wrong Answer | print(int(input()) % 1000) |
p02612 | s530922382 | Wrong Answer | print(1000 - (int(input()) % 1000)) |
p02612 | s121340536 | Wrong Answer | amount = int(input())
if(amount % 1000 == 0):
print(0)
else:
change = (amount / 1000 + 1) * 1000 - amount
print(change) |
p02612 | s503476487 | Wrong Answer | '''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前
sort()
sorted(reverse=true)
配列の初期化
配列名=[a]*n+[b]*m
Decimal()
'''
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions
import sys
print(1000-int(stdin.readline().rstrip()) % 1000)
|
p02612 | s954471128 | Wrong Answer | N=int(input())
if N>1000:
if N%2==0:
print(0)
else:
print(1000-N%1000)
else:
print(1000-N) |
p02612 | s434331486 | Wrong Answer | N = int(input())
a = 1000-N%1000
print(a) |
p02612 | s825872550 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s804475877 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s831144420 | Wrong Answer | N=int(input())
x=N%1000
if x==1000:
print(0)
else:
print(1000-x) |
p02612 | s725973260 | Wrong Answer | n = int(input())
print(1000-n%1000) |
p02612 | s713359766 | Wrong Answer | n = int(input())
print(n%1000) |
p02612 | s463535251 | Wrong Answer | n = int(input())
for i in range(1000,10001,1000):
if i > n:
print(i-n)
break |
p02612 | s398276757 | Wrong Answer | N = int(input())
if N >=1000:
N2 = round(N,-3)
else:
N2 = 1000
print(N2-N) |
p02612 | s528356000 | Wrong Answer | def main():
N = input()
if len(N)<4:
print(int(N))
else:
print(int(N[len(N)-2:]))
if __name__ == "__main__":
main() |
p02612 | s290308919 | Wrong Answer | n = int(input())
a = n%1000
if a == 1000:
print(0)
else:
print(1000-a) |
p02612 | s698755855 | Wrong Answer | N = int(input())
pay = N % 1000
print(pay) |
p02612 | s876063400 | Wrong Answer | price = int(input())
amari = price % 1000
print(amari) |
p02612 | s213655587 | Wrong Answer | n = int(input())
print(min(n % 1000, (-n % 1000)))
|
p02612 | s179751468 | Wrong Answer | n=int(input())
1000-n%1000
|
p02612 | s769210509 | Wrong Answer | print(1000 - int(input()) % 1000) |
p02612 | s064614537 | Wrong Answer | N = int(input())
print(round(N,-3)-N) |
p02612 | s112079490 | Wrong Answer | n = int(input())
if n < 1000:
print(1000-n)
elif 1000< n <=2000:
print(2000-n)
elif 2000< n <=3000:
print(3000-n)
elif 3000< n <=4000:
print(4000-n)
elif 4000< n <=5000:
print(5000-n)
elif 5000< n <=6000:
print(6000-n)
elif 6000< n <=7000:
print(7000-n)
elif 7000< n <=8000:
print(8000-n)
elif 8000< n <=9000:
print(9000-n)
elif 9000< n <=10000:
print(10000-n) |
p02612 | s151409718 | Wrong Answer | N = int(input())
print(1000-N%1000) |
p02612 | s859940992 | Wrong Answer | n=input()
t=len(n)
if t<4:
print(1000-int(n))
else:
k,p=int(n[0]),int(n[1])
if p!=0:
print((k+1)*1000-int(n))
else:
print(0) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.