s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s157309184 | p03470 | u194894739 | 1556673698 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 182 | n = int(input())
D = list(map(int,input().split()))
daburi = 0
for i in range(n):
for j in range(n):
if i != j and D[i] == D[j]
daburi += 1
print(n - daburi)
|
s040092457 | p03470 | u076996519 | 1556646804 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | n = int(input())
print(len(set(map(int, [input for i in range(n)])))) |
s213646457 | p03470 | u325282913 | 1556601886 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 100 | a = int(input())
mochi = []
for _ in range(a):
mochi.append(int(input())
print(len(set(mochi))) |
s355570870 | p03470 | u325282913 | 1556601844 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 101 | a = int(input())
mochi = []
for _ in range(a):
mochi.append(int(input())
print(len(set(mochi)))
|
s600259084 | p03470 | u325282913 | 1556601238 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 100 | a = int(input())
mochi = []
for _ in range(a):
mochi.append(int(input())
print(len(set(mochi)))
|
s493433237 | p03470 | u751485759 | 1556553816 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 546 | N,A,B = map(int,input().split())
def sum(N,A,B):
sum = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if N > a*1000 + b*100 + c*10 + d and a + b + c + d >= A and a + b + c + d <= B:
sum += a*1000 + b*100 + c*10 + d
elif N == a*1000 + b*100 + c*10 + d:
... |
s161953863 | p03470 | u488737015 | 1556317790 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 245 | n = int(input())
num_list = [input() for i in range(n)]
bucket = {}
for i in range(1,100):
bucket[i] = 0
for i in range(n):
bucket[int(num_list[i])] += 1
res = 0
for i in range(1,100):
if bucket[i] > 0:
res += 1
print(res)
|
s626600491 | p03470 | u488737015 | 1556317713 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 241 | n = int(input())
num_list = [input() for i in range(n)]
bucket = {}
for i in range(100):
bucket[i] = 0
for i in range(n):
bucket[int(num_list[i])] += 1
res = 0
for i in range(100):
if bucket[i] > 0:
res += 1
print(res)
|
s243384017 | p03470 | u897328029 | 1554586484 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 130 | length_list = []
for _ in range(n):
x = int(input().split()[0])
length_list.append(x)
print(len(list(set(length_list))))
|
s467036542 | p03470 | u812867074 | 1554351668 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 169 | n=int(input())
li=[input() for i in range(n)]
li.sort()
ans=0
if n=1:
print(1)
else:
for i in range(n-1):
if li[i+1] > li[i]:
ans+=1
print(ans)
|
s458470137 | p03470 | u812867074 | 1554351618 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 158 | n=int(input())
li=[input() for i in range(n)]
li.sort()
ans=0
if n=1:
print(1)
else:
for i in range(n-1):
if li[i+1] > li[i]:
ans+=1
|
s081034228 | p03470 | u859897687 | 1554097956 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 93 | n=int(input())
{input():1for i in range(n)}
print(sum({input():1for i in range(n)}.values())) |
s410176335 | p03470 | u859897687 | 1554097705 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | n=int(input())
d={input();1for i in range(n)}
print(sum(d.values())) |
s640031653 | p03470 | u363610900 | 1553727962 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | N = int(input())
d = [int(input()) for i in range(N)]
cnt = set(l)
print(len(cnt)) |
s008568360 | p03470 | u013408661 | 1553567086 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 101 | n=input()
mochi=[]
for i in range(n):
k=int(input())
mochi.append(k)
print(len(list(set(mochi)))) |
s684924125 | p03470 | u013408661 | 1553567044 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | n=input()
mochi=[]
for i in range(n):
k=int(input())
mochi.append(k)
print(len(set(mochi))) |
s180278890 | p03470 | u254050469 | 1553397818 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | N=input()
di = []
for i in range(N):
di.append(input())
print(len(list(set(di)))) |
s128421624 | p03470 | u280512618 | 1552941809 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | print(len(set(int(input()) for _ in range(int(input())))) |
s341944055 | p03470 | u292810930 | 1552284485 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 239 | #バケット法による解
N = int(input())
dlist = []
for i in range(N):
dlist.append(int(input()))
dbacket = [0]*100
for d in dlist:
dbacket[d] += 1
answer = 0
for db in dbacket:
if db > 0:
answer += 1
print(answer) |
s466232060 | p03470 | u083960235 | 1552180667 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 271 | #include<iostream>
#include<set>
using namespace std;
int main(){
int N;
int d[110];
cin>>N;
for(int i=0;i<N;i++){
cin>>d[i];
}
set<int>values;
for (int i=0;i<N;i++){
values.insert(d[i]);
}
cout<<values.size()<<endl;
} |
s961154845 | p03470 | u040986872 | 1552013081 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 207 | N = input()
a = []
for i in range(int(N)):
a.append(input())
cnt = []
cnt2 = 0
while(int(N)-cnt2 != 0):
s = a.count(a[0])-1
cnt.append(s)
a.remove(a[0])
cnt2 += s+1
su = sum(cnt)
print(int(N)-su) |
s074776407 | p03470 | u040986872 | 1552013067 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 220 | N = input()
a = []
for i in range(int(N)):
a.append(input())
cnt = []
cnt2 = 0
while(int(N)-cnt2 != 0):
s = a.count(a[0])-1
cnt.append(s)
a.remove(a[0])
cnt2 += s+1
print(cnt)
su = sum(cnt)
print(int(N)-su) |
s518270650 | p03470 | u367130284 | 1551714446 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 289 | a,b=map(int,input().split())
for s in range(b//10000+1):
try:
for t in range(b//5000+1):
r=b-s-t
if 10000*s+5000*t+1000*r==b and s+t+r==a:
print(s,t,r)
exit()
except ZeroDivisionError:
continue
print(-1,-1,-1) |
s945968872 | p03470 | u209918867 | 1551338608 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 85 | n=int(input())
arr=[int(input()) for idx in range(n)]
print(length(list(set(arr))))
|
s110399216 | p03470 | u209918867 | 1551338551 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | n=int(input())
arr=[int(input()) for idx in range(n)]
print(length(set(arr))) |
s375118121 | p03470 | u815659544 | 1551217570 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | n = input()
a = np.array(list(map(int, input().split())))
print(len(np.unique(a))) |
s749008396 | p03470 | u815659544 | 1551217429 | Python | Python (3.4.3) | py | Runtime Error | 152 | 12388 | 105 | import numpy as np
a = list(map(int, input().split()))
arr = np.array(a[1:])
print(len(np.unuque(arr))) |
s066996346 | p03470 | u652081898 | 1550924700 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 191 | n = int(input())
list = [int(input()) for i in range(n)]
check = 101
count = 0
list.sorted(reverse=True)
for k in list:
if k < check:
count += 1
check = k
print(count)
|
s231125324 | p03470 | u119983020 | 1550870134 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | N = int(input())
d = []
for _ in range(N):
d.append(int(input())
print(len(set(d)))
|
s664863122 | p03470 | u401487574 | 1550788600 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 154 | n = int(input())
m = [int(input()) for i in range(n)]
mso = sorted(m)
count = 0
for s in range(1,n):
if mso[s] == mso[s-1]
count += 1
print(n-count) |
s034843881 | p03470 | u089032001 | 1548128856 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 294 | #include <iostream>
#include<set>
#include<math.h>
using namespace std;
#define rep(i, n) for(int i=0;i<n;i++)
int main(){
int N;
cin >> N;
set <int> s;
int tmp;
rep(i, N){
cin >> tmp;
s.insert(tmp);
}
cout << s.size() << endl;
return 0;
} |
s433593332 | p03470 | u619819312 | 1547722158 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 43 | print(len(set([input()for i in range(n)]))) |
s678710915 | p03470 | u887207211 | 1546638944 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 78 | N = int(input())
d = list(set([int(input()) for _ in range(N)])
print(len(d))
|
s734936142 | p03470 | u928784113 | 1545590346 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 95 | N = int,input()
a = [int(input()) for i in range(N)]
li_uniq = list(set(a))
print(len(li_uniq)) |
s251858491 | p03470 | u464995425 | 1545278580 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 115 | n = int(input())
dat = []
for i in range(n):
a = int(input())
if (a in dat)!:
dat.append(a)
print(len(dat)) |
s155152940 | p03470 | u173329233 | 1544380523 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 75 | n = int(input())
print(len(list(set(map(int, input() for i in range(n)))))) |
s862895398 | p03470 | u173329233 | 1544380337 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3316 | 62 | n = int(input())
list = input().split()
print(list(set(list))) |
s191382302 | p03470 | u322529408 | 1544311231 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 93 | times = int(input())
num = list(map(int,[input() for _ in range(times)]))
print(len(set(num)) |
s657114456 | p03470 | u186838327 | 1543227429 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 81 | N = int(input())
d = []
for i in N:
d.append(int(input()))
print(len(set(d))) |
s820691159 | p03470 | u410201501 | 1543083432 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | n = int(input())
print(len(set(map(int, [input() for i in range(n)])) |
s622297792 | p03470 | u104003430 | 1541460703 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | n = int(input())
d = [input() for i in range(n)]
print(set(d).count) |
s460687007 | p03470 | u045091221 | 1540760500 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 313 | def solve(N, Y):
for x in range(N + 1):
for y in range(0, N - x + 1):
z = N - x - y
elif 10000 * x + 5000 * y + 1000 * z == Y:
return x, y, z
return -1, -1, -1
N, Y = list(map(int, input().split()))
x, y, z = solve(N, Y)
print('{} {} {}'.format(x, y, z))
|
s779441435 | p03470 | u546943614 | 1539525441 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | N=int(input())
l = [int(input()) for i in range(1,n+1)]
print(len(set(l))) |
s360937176 | p03470 | u365375535 | 1539381814 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | N = int(imput())
a_list = []
for i in range(N):
a_list.append(input())
a_set = set(a_list)
print(len(a_set)) |
s376935769 | p03470 | u822155101 | 1538961539 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 149 | import math as M
N=input()
List=[]
for i in range(N):
n=int(input())
if n not in List:
List.append(int(input()))
print(List.count()) |
s339523529 | p03470 | u853900545 | 1538099116 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | n = int(input())
d = {}
for i in range(n):
d += int(input())
print(len(d)) |
s476221900 | p03470 | u960513073 | 1536820111 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 463 | # -*- coding: utf-8 -*-
n = int(raw_input())
l = []
for i in range(n):
l.append(int(raw_input()))
#print(l)
flag = [0] *100
#print(flag)
for j in l:
if flag[j] == 0:
flag[j] = 1
#print(flag)
num = 0
for k in flag:
# print(k)
if k == 1:
num += 1
print(num)
"""
##これだとエラーでる
##flag[k]だとflag[0]かflag[1]にしかな... |
s320399592 | p03470 | u659640418 | 1534138357 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | n = input()
print(len(set(list(map(int, [input() for i in range(n)]))))) |
s872052925 | p03470 | u659640418 | 1534138324 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | n = int(input())
print(len(set(list(map(int, [input() for i in range(n+1)]))))) |
s173508193 | p03470 | u659640418 | 1534138254 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | n = input()
print(len(set(list(map(int, [input() for i in range(n+1)]))))) |
s385807678 | p03470 | u123896133 | 1526781491 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 175 | N = int(input())
d = [[i] for i in int(input())]
N = int(input())
d = [int(input()) for i in range(N)]
N = int(input())
d = [int(input()) for i in range(N)]
print(len(set(d))) |
s203955441 | p03470 | u039623862 | 1525845543 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 77 | n = int(input())
mochi = set([int(input()) for i in range(n)])
print(len(s))
|
s377467058 | p03470 | u249895018 | 1525540059 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 102 | import os
import sys
n = input()
a = []
for i in range(n):
a.append(input())
print(len(set(a))) |
s481794129 | p03470 | u988402778 | 1525451645 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 106 | n = int(input())
a_ = [[int(i) for i in input()] for j in range(n)]
a = set([_ for _ in a_])
print(len(a)) |
s519457783 | p03470 | u988402778 | 1525451585 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 112 | n = int(input())
a_ = [[int(i) for i in input()] for j in range(n)]
a = set([_[0][0] for _ in a_])
print(len(a)) |
s357538440 | p03470 | u988402778 | 1525449510 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 55 | a = set(float(input()) for i in range(n))
print(len(a)) |
s808835449 | p03470 | u856232850 | 1524196696 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 161 | a = []
b = []
for i in range(n):
a.append(int(input()))
for i in range(n):
if a[i] in b:
continue
else:
b.append(a[i])
print(len(b)) |
s900376418 | p03470 | u400596590 | 1523325871 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | n = int(input())
a = len(set(list(map(int,[input for i in range(n)]))))
print(a) |
s717362608 | p03470 | u406828576 | 1521865573 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | n = int(input())
a = []
for _ in range(n):
a.append(int(input())
print(len(set(a))) |
s471861491 | p03470 | u934099192 | 1517101543 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | N = input()
d = []
for i in range(N):
d.append(input())
print(len(list(set(d))) |
s361759908 | p03470 | u934099192 | 1517101498 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | N = input()
d = []
for i in range(N):
a.append(input())
print(len(list(set(li))) |
s773247496 | p03470 | u997023236 | 1517025966 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | print(len(set(input() for i in range(int(input())))) |
s576267051 | p03470 | u454481887 | 1516575603 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 58 | N=int(input())
print(len(set(input() for n in range(N)]))) |
s276961915 | p03470 | u947748301 | 1516469097 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 244 | #枚数
paper = int(input())
#餅リスト
moti_list = []
li_uniq = []
#取得
for w in range(paper):
paper = int(input())
moti_list.append(paper)
print(len(moti_list)) |
s609847356 | p03470 | u610950638 | 1516065443 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | inn=int(input())
sizes = []
for i in range(inn):
sizes.append(int(input())
ans = len(set(sizes))
print(ans) |
s403208193 | p03470 | u212572201 | 1515956527 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 281 | count=0
k=1
j=1
i=1
N=int(input())
d=[]
d=[int(input()) for i in range(N)]
for k in range (N-1):
for j in range(k+1,N):
dd1=d[k]
dd2=d[j]
if dd1==dd2 :break
else:count=count+1
for l in range (N-1):
if not d[N]==d[l]:count+=1
print(count) |
s162527686 | p03470 | u861966572 | 1515716420 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 47 | n=input()
n=n.remove(1)
n=list(n)
print(len(n)) |
s614567763 | p03470 | u861966572 | 1515709766 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 44 | n=input()
n=del n[0]
n=list(n)
print(len(n)) |
s210007189 | p03470 | u830842621 | 1515585780 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 93 | n = int(input())
a = []
for i in range(n):
x = int(input())
a.append(x)
print(len(set(a)) |
s607955062 | p03470 | u476468228 | 1515469363 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 62 | import sys
print(len(set(sys.input().read().strip().split()))) |
s945945304 | p03470 | u352021237 | 1515384085 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 122 | n=int(raw_input())
N=map(int,raw_input().split())
N.sort()
ans=1
for i in range(1,n):
if N[i]!=N[i-1]:
ans+=1
print ans |
s878063103 | p03470 | u541091793 | 1515381559 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 213 | n = int(input())
mochi = [int(input()) for i in range(n)]
mochi.sort(reverse=True)
size = 0
max = 9999999999
for m in mochi:
//print(m)
if m < max:
size += 1
max = m
# 出力
print(size)
|
s204761143 | p03470 | u279317402 | 1515380335 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 237 | s = '0'
l = []
ans = 0
temp = -1
n = raw_input()
for i in range(0, n):
s = raw_input()
if (s != ''):
l += [int(s)]
l.sort()
for i in range(0, len(l)):
if(l[i] != temp):
ans += 1
temp = l[i]
print(ans) |
s165744045 | p03470 | u279317402 | 1515380157 | Python | Python (2.7.6) | py | Runtime Error | 111 | 2692 | 215 | s = '0'
l = []
ans = 0
temp = -1
while s != '' :
s = raw_input()
if (s != ''):
l += [int(s)]
l.sort()
for i in range(0, len(l)):
if(l[i] != temp):
ans += 1
temp = l[i]
print(ans) |
s332112839 | p03470 | u279317402 | 1515380014 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2820 | 214 | s = '0'
l = []
ans = 0
temp = -1
while s != '' :
s = raw_input()
if (s != ''):
l += [int(s)]
l.sort()
for i in range(0, len(l)):
if(l[i] != temp):
ans += 1
temp = l[i]
print ans |
s077113222 | p03470 | u158225062 | 1515379211 | Python | Python (3.4.3) | py | Runtime Error | 351 | 22056 | 139 | # coding: utf-8
import numpy
N = input()
for i in range(N):
N_list.append(input())
aaa = []
aaa = set(N_list)
ans = len(aaa)
print(ans) |
s753913165 | p03470 | u158225062 | 1515379147 | Python | Python (3.4.3) | py | Runtime Error | 149 | 12496 | 159 | # coding: utf-8
import numpy
N = input()
for i in range(N):
N_list.append(input())
map(str,N_list)
aaa = []
aaa = set(N_list)
ans = len(aaa)
print(ans) |
s789386870 | p03470 | u558836062 | 1515378520 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 205 | N = int(input())
lis = []
for i in range(N):
lis.append(int(input()))
lis.sort(reverse = True)
for i in range(N):
if N - 1 == i:
break
if lis.count(lis[i]) >= 2:
del lis[i]
print(len(lis)) |
s188532350 | p03470 | u579875569 | 1515377308 | Python | Python (3.4.3) | py | Runtime Error | 88 | 3444 | 120 | import collections
ds = []
N = int(input())
for _ in range(N):
ds.append(input())
print(len(ollections.Counter(ds))) |
s770975577 | p03471 | u624613992 | 1601323821 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8900 | 170 | n,y = map(int,input().split())
for i in range(n+1):
for j in range(n+1):
if (y - 1000*i - 5000*j)/10000 = n-i-j:
print(i,j,n-i-j)
exit()
print(-1,-1,-1) |
s778437636 | p03471 | u244434589 | 1600657655 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9004 | 227 | n,y=map(int,input().split())
y //=1000
for i in range(n+1):
for j in range(n-i+1):
if n -(i+j) < 0
break
if 9*i+4*j+n == y:
print(i,j,n-(i+j))
exit()
print('-1','-1','-1') |
s416526525 | p03471 | u097700948 | 1600627323 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9136 | 555 | N, Y = map(int, input().split())
a = -1
b = -1
c = -1
judge = False
money = x * 10000 + y * 5000 + z * 1000
for x in range(20, -1, -1):
money_max = x * 10000 + (N-x) * 5000
money_min = x * 10000 + (N-x) * 1000
if money_min <= Y and Y <=money_max:
for y in range(N-x, -1, -1):
money = x *... |
s720662297 | p03471 | u280175105 | 1600298830 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8816 | 702 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const do... |
s825467646 | p03471 | u313117448 | 1600283684 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 74408 | 248 | N,Y = map(int,input().split())
for i in range(N+1):
if (Y - 1000*N -9000*i) % 4000 == 0:
b = (Y - 1000*N -9000*i) // 4000
c = N - i - b
if b >= 0 and c >= 0:
print(a,b,c)
exit()
print("-1 -1 -1") |
s268760092 | p03471 | u560072805 | 1600096782 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9044 | 256 | A=10000
B=5000
C=1000
ans_A=-1
ans_B=-1
ans_C=-1
x,y=map(int,input().split())
for a in range(x+1):
for b in range(x-a+1):
for c in range(x-a-b+1):
if a*A+b*B+c*C=y:
ans_A=a
ans_B=b
ans_C=c
print(ans_A,ans_B,ans_C)
|
s402166388 | p03471 | u560072805 | 1600096731 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8976 | 243 | A=10000
B=5000
C=1000
x,y=map(int,input().split())
for a in range(x+1):
for b in range(x-a+1):
for c in range(x-a-b+1):
if a*A+b*B+c*C=y:
ans_A=a
ans_B=b
ans_C=c
break
print(ans_A,ans_B,ans_C)
|
s781088201 | p03471 | u560072805 | 1600096675 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9040 | 237 | A=10000
B=5000
C=1000
x,y=map(int,input().split())
for a in range(x):
for b in range(x-a):
for c in range(x-a-b):
if a*A+b*B+c*C=y:
ans_A=a
ans_B=b
ans_C=c
break
print(ans_A,ans_B,ans_C)
|
s634634685 | p03471 | u963963908 | 1600044196 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9184 | 199 | N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
for y in range(N+1-x):
if N-x-y >=0 and 10000*x + 5000*y + 1000*z == Y:
res = (x,y,N-x-y)
print(res[0],res[1],res[2])
|
s266436184 | p03471 | u963963908 | 1600044165 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9024 | 197 | N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
for y in range(N+1-x):
if N-x-y >=0 and 10000*x + 5000*y + 1000*z = Y:
res = (x,y,N-x-y)
print(res[0],res[1],res[2]) |
s518976113 | p03471 | u317508154 | 1599880180 | Python | Python (3.8.2) | py | Runtime Error | 550 | 9212 | 239 | n, y = map(int,input().split())
y = y//1000
for i in range(n+1):
for j in range (n+1-i):
k = n - i - j
if 10*i + 5* j + 1 * k == y:
print(str(i) +' '+str(j)+' '+str(k))
syexit()
print('-1 -1 -1') |
s358938372 | p03471 | u666550725 | 1599772573 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74708 | 284 | N, Y = map(int, input().split())
Y //= 1000
i = 0
f = 0
whlie 1:
if 10 * i > Y:
break
y = Y - 10 * i
n = N - i
if n <= y <= 5 * n and (y - n) % 4 == 0:
print(str(i) + " " + str((y-n)//4) + " " + str((5 * n - y) // 4))
f = 1
i += 1
if f == 0:
print("-1 -1 -1") |
s357634607 | p03471 | u244836567 | 1599258308 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9036 | 196 | a,b=input().split()
a=int(a)
b=int(b)
c=0
for i in range(b/10000+1):
for k in range(b/5000+1):
if i*10000+k*5000+(a-i-k)+1000=b:
print(i,k,a-i-k)
break
if c==0:
print(-1,-1,-1) |
s511580387 | p03471 | u314188085 | 1599170945 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9096 | 306 | N,Y = map(int,input().split())
flag = 0
for x in range(N+1):
if flag > 0:
break
for y in range(N-x+1):
if 10000*x+5000*y+1000*z == Y and flag == 0:
z = N-x-y
flag+=1
print(x,y,z)
break
if flag == 0:
print('-1 -1 -1') |
s728465772 | p03471 | u314188085 | 1599170882 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9144 | 279 | N,Y = map(int,input().split())
flag = 0
for x in range(0,N+1):
for y in range(0,N-x+1):
if 10000*x+5000*y+1000*z == Y and flag == 0:
z = N-x-y
flag+=1
print(x,y,z)
break
if flag == 0:
print('-1 -1 -1') |
s907008177 | p03471 | u314188085 | 1599170798 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8972 | 310 | N,Y = map(int,input().split())
flag = 0
for x in range(0,N+1):
if flag > 0:
break
for y in range(0,N-x+1):
if 10000*x+5000*y+1000*z == Y and flag == 0:
z = N-x-y
flag+=1
print(x,y,z)
break
if flag == 0:
print('-1 -1 -1') |
s614055669 | p03471 | u314188085 | 1599170769 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9160 | 310 | N,Y = map(int,input().split())
flag = 0
for x in range(0,N+1):
if flag > 0:
break
for y in range(0,N-x+1):
if 10000*x+5000*y+1000*z == Y and flag == 0:
z = N-x-y
flag+=1
print(x,y,z)
break
if flag == 0:
print('-1 -1 -1') |
s697507846 | p03471 | u023408807 | 1599087531 | Python | PyPy3 (7.3.0) | py | Runtime Error | 355 | 93072 | 197 | for i in range(n+1):
for j in range(n+1-i):
k=n-i-j
if 10000*i+5000*j+1000*k==y:
print(i,j,k)
flag=False
break
if flag:
print(-1,-1,-1)
|
s633727426 | p03471 | u023408807 | 1599086087 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74812 | 222 | n,y=map(int,input().split())
t=0
flag=True
for x in range(n+1):
for k in range(n+1):
z=n-x-k
if x+k+z==s:
print(x,k,z)
flag=False
break
if flag:
print(-1,-1,-1)
|
s098235839 | p03471 | u815073939 | 1599079149 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9180 | 257 | N=int(input())
Y=int(input())
a=-1
b=-1
c=-1
for i in range(0,N+1):
for j in range(0,N-i+1):
if 10000*i+5000*j+1000*(N-i-j)==Y:
a=i
b=j
c=N-i-j
break
print(a,b,c)
|
s894912381 | p03471 | u815073939 | 1599078427 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9124 | 389 | N=int(input())
Y=int(input())
for i in range(0,N+1):
a=10000*i
if a>Y:
continue
for j in range(0,N-i+1):
a+=5000*j
if a>Y:
continue
for k in range(0,N-i-j+1):
a+=1000*k
if 10000*i+5000*j+1000*k==Y:
print(i,"",j,"",k)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.