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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s044980950 | p03597 | u190875453 | 1592262148 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | A,B = map(int, input().split());
print(A*A-B) |
s635651414 | p03597 | u190875453 | 1592262043 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 38 | A,B = map(input(), int);
print(A*A-B) |
s195288261 | p03597 | u587589241 | 1592074978 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 739 | a,b,c,d,e,f=map(int,input().split())
a=100*a
b=100*b
dp1=[0]*(f+1)
dp2=[0]*(f+1)
for i in range(f+1):
if i%a==0:
if i+a<=f:
dp1[i+a]=1
for i in range(f+1):
if i==0 or dp1[i]==1:
if i+b<=f:
dp1[i+b]=1
for i in range(f+1):
if i%c==0:
if i+c<=f:
dp2[i... |
s195656723 | p03597 | u860546679 | 1591996972 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | print(int(input())**2-int(input()) |
s727396141 | p03597 | u945359338 | 1591930531 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 49 | N = int(input())
A = int(inpiut())
print(N**2-A) |
s935432544 | p03597 | u519923151 | 1590786825 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | a,b = map(int, input().split())
print(a*a -b ) |
s245992074 | p03597 | u957198490 | 1589339740 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 137 | N = int(input())
K = int(input())
x = list(map(int,input().split()))
ans = 0
for i in range(N):
ans += min(x[i],K-x[i])*2
print(ans)
|
s521014676 | p03597 | u423665486 | 1589047298 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38640 | 590 | def dense(a, b):
return b / (a+b)
def resolve():
a, b, c, d, e, f = map(int, input().split())
ws = set()
ss = set()
for i in range(31):
for j in range(31):
if a*100*i + b*100*j <= f:
ws.add(a*100*i + b*100*j)
for i in range(3001):
for j in range(3001):
if c*i + j*d <= f:
ss.add(c*i + j*d)
ans_... |
s530854242 | p03597 | u911276694 | 1588874365 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 161 | N=int(input())
K=int(input())
a=list(map(int,input().split()))
s=0
for i in range(len(a)):
if a[i]<=K-a[i]:
s=s+2*a[i]
else:
s=s+2*(K-a[i])
print(s)
|
s423596973 | p03597 | u005469124 | 1588395398 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | a, b = map(int, input().split())
print(a * a - b)
|
s426369791 | p03597 | u005469124 | 1588395294 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 |
a, b = map(int, input().split())
A = 0
print(a * a - b)
|
s866071211 | p03597 | u190079347 | 1588387801 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 403 | A,B,C,D,E,F = map(int,input().split())
W=set()
for a in range(0,F+1,100*A):
for b in range(0,F+1-a,100*B):
W.add(a+b)
S=set()
for c in range(0,F+1,C):
for d in range(0,F+1,D):
S.add(c+d)
rate = -1
for w in W:
for s in S:
if 0 < w+s <= F and s <= w*E//100:
if s/(w+s) > rat... |
s736815113 | p03597 | u380534719 | 1588341194 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | N=input()
A=input()
print(N*N-A) |
s981843564 | p03597 | u855378574 | 1588307762 | Python | PyPy2 (5.6.0) | py | Runtime Error | 43 | 28396 | 655 | A, B, C, D, E, F = map(int,input().split())
answer_number = [0,0,0,0]
answer_max = 0
for i in range((F//(100*A))+1):
for j in range(((F-100*A*i)//(100*B))+1):
if i==0 and j ==0: continue
for k in range(((F-100*A*i-100*B*j)//C)+1):
for l in range(((F-100*A*i-100*B*j-C*k)//D)+1):
if (C*k+D*l)/(A*i... |
s993608343 | p03597 | u855378574 | 1588307620 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38384 | 651 | A, B, C, D, E, F = map(int,input().split())
answer_number = [0,0,0,0]
answer_max = 0
for i in range((F/(100*A))+1):
for j in range(((F-100*A*i)/(100*B))+1):
if i==0 and j ==0: continue
for k in range(((F-100*A*i-100*B*j)/C)+1):
for l in range(((F-100*A*i-100*B*j-C*k)/D)+1):
if (C*k+D*l)/(A*i+B*j... |
s246946594 | p03597 | u867826040 | 1587719260 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | n=int(input())
m=int(input())
print((i*i)-m) |
s620912693 | p03597 | u235066013 | 1587693966 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 33 | n=input()
a=input()
print(n**2-a) |
s881977549 | p03597 | u725359833 | 1587604132 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | a=[]
for i in range(0,2):
a.append(input())
print(a[0]**2-a[1]) |
s073750617 | p03597 | u725359833 | 1587604058 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 42 | a=[]
a.append(input())
print(a[0]**2-a[1]) |
s356966227 | p03597 | u725359833 | 1587603830 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | import math
a=int(input("")).split("")
return (a[1]**2-a[0])
|
s310324709 | p03597 | u655048024 | 1587603799 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 47 | N = int(input())
A - int(input())
print(N**2-A) |
s952434709 | p03597 | u483242705 | 1587319229 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | N = int(input())
A = int(input())
print(eval(N**N-A)) |
s344820379 | p03597 | u252964975 | 1587265588 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 44 | n=int(input())
a=int(input())
print(Nn**2-a) |
s384018203 | p03597 | u772649753 | 1586241242 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | n,a = map(int,input().split())
print(n*n-a) |
s016896125 | p03597 | u772649753 | 1586241208 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | n,a = map(int,input().split())
print(n**2-a) |
s963100277 | p03597 | u497952650 | 1585908460 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 40 | N = int(input())
print(N**2-int(input()) |
s853781203 | p03597 | u930705402 | 1585432083 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 725 | A,B,C,D,E,F=map(int,input().split())
wDP=[False]*(F+1)
wDP[0]=True
water=[]
for i in range(1,int(F/100)+1):
if(i>=B and wDP[i-B]):
wDP[i]=True
elif(i>=A and wDP[i-A]):
wDP[i]=True
for i in range(F+1):
if(wDP[i] and i!=0):
water.append(i*100)
A,B=A*100,B*100
water=list(set(water))
ans... |
s467410866 | p03597 | u440129511 | 1585319773 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 50 | n,a=map(int,input().split('/n'))
print((n**2) -a ) |
s819109206 | p03597 | u440129511 | 1585319598 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 51 | n,a=map(int,input().splitlines())
print((n**2) -a ) |
s791442746 | p03597 | u440129511 | 1585319484 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 46 | n,a=map(int,input().split())
print((n**2) -a ) |
s245190219 | p03597 | u639104973 | 1585146469 | Python | Python (3.4.3) | py | Runtime Error | 159 | 13240 | 127 | from scipy.misc import comb
import numpy as np
A,B=map(int,input().split())
print(int(np.round(comb(A,2))+np.round(comb(B,2)))) |
s170719203 | p03597 | u550814027 | 1585142783 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38256 | 515 | # ๅ
ฅๅใฎๅๅพ
i = list(map(int, input().split()))
kazoeru = i[0]
ao = i[1]
aka= i[2]
kaisuu = i[0]/(i[1]+i[2])
answer = divmod(kazoeru, (i[1]+i[2]))
if ao == 0:
print(0)
exit()
#ๅใฎๅใ่จ็ฎ
aa = ao * answer[0]
#ใใพใใฎๅใ่จ็ฎ
if answer[1] == 0:
print(aa)
exit()
#ใใพใ6ใงใ้ใ6ใชใ
# ใใพใใ้ใใๅคใใชใ(ใใพใ4ใ้2)
if answer[1] >= ao... |
s062271265 | p03597 | u260036763 | 1585011834 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 531 | A, B, C, D, E, F = map(int, input().split())
density = 0
for i in range(F//(100*A) +1):
for j in range((F-100*A*i)//(100*B)+1):
water = 100*A*i + 100*B*j
if water == 0:
continue
for k in range((F-water)//C+1):
for l in range((F-water-C*k)//D+1):
sugar ... |
s727493629 | p03597 | u731665172 | 1585003719 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 42 | N,A=map(int,input().split())
print(N**2-A) |
s344486343 | p03597 | u058720266 | 1584574304 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | n = int(intput())
a = int(input())
print(n**2 - a) |
s661110154 | p03597 | u037901699 | 1584383506 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | N, A = [input() for i in range(2)]
print(N ** 2 - A)
|
s414607929 | p03597 | u863442865 | 1584112412 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3316 | 1219 | #pypyใฏๅ
ๅ
่กจ่จไฝฟใใชใ
def main():
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bis... |
s312120332 | p03597 | u916478767 | 1583682808 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 54 | N, A = map(int, raw_input() .split())
print N * N - A
|
s345493710 | p03597 | u666844906 | 1583103452 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | N = int(input())
A = int(input())
print(N*M-A) |
s594293516 | p03597 | u460468647 | 1583096565 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 6 | N**2-A |
s362594084 | p03597 | u460468647 | 1583093187 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 13 | print(N**2-A) |
s051433303 | p03597 | u305366205 | 1583009384 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38384 | 651 | n = int(input())
a = [list(map(int, input().split())) for _ in range(n)]
# ่พบใฎๅฟ
่ฆๆง
f = [[True] * n for _ in range(n)]
for k in range(n):
for i in range(n):
for j in range(n):
# ใฏใผใทใฃใซใใญใคใใฎๆดๆฐใ้ฉ็จใใใใใใก
# ่ฟๅ่ทฏใๆ็ญใณในใใชใ็ด็ต่ทฏใฏไธ่ฆ
if a[i][k] + a[k][j] < a[i][j]:
print(-... |
s333121088 | p03597 | u375681664 | 1582931224 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 584 | A,B,C,D,E,F=map(int,input().split())
maxx=0
s=1
t=0
for i in range(F//(100*B)+1):
for j in range((F-i*100*B)//(100*A)+1):
for k in range(((i*B+j*A)*E)//D+1):
for l in range (((i*B+j*A)*E-k*D)//C+1):
if i==0 and j==0 and k==0 and l==0:
continue
... |
s719377217 | p03597 | u639340617 | 1582146964 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | n = input()
a = input()
print(n*n-a) |
s293653472 | p03597 | u476604182 | 1581876736 | Python | Python (3.4.3) | py | Runtime Error | 166 | 13720 | 556 | from scipy.sparse.csgraph import floyd_warshall
N = int(input())
dic = [0]*N
for i in range(N):
dic[i] = [int(c) for c in input().split()]
d = floyd_warshall(dic)
ans = 0
for i in range(N-1):
for j in range(i+1,N):
if d[i][j] < dic[i][j]:
print(-1)
break
elif dic[i][j] == d[i][j]:
flag = ... |
s595854498 | p03597 | u519460719 | 1581739417 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | int s = int(input());
int s1 = int(input());
print(s*s-s1); |
s072049288 | p03597 | u086503932 | 1581457333 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | a=open(0).read();print(int(a[0])**2-int(a[2])) |
s604147128 | p03597 | u541610817 | 1581393527 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 710 | A, B, C, D, E, F = [int(x) for x in input().split()]
a_water = 0
a_sugar = 0
a_conc = 0
max_conc = 100 * E / (100 + E)
for i in range(F//(100*A) + 1):
for j in range(F//(100*B) + 1):
water = i * 100 * A + j * 100 * B
ms = E * water
for k in range(ms//C + 1):
for l in range(ms//D ... |
s875031291 | p03597 | u752552310 | 1581375713 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | n, a = map(int, input().split())
print(n**2 - a) |
s314952271 | p03597 | u752552310 | 1581375634 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | n, a = map(int, input().split())
print(n^2 - a) |
s979492754 | p03597 | u686713618 | 1581297277 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << N*N-A << endl;
}
|
s769927602 | p03597 | u686713618 | 1581297249 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << N*N-A << endl;
}
|
s414615432 | p03597 | u721970149 | 1581210511 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 100 | # ๅ
ฅๅ : ๆฐๅญ2ใค
N, A = map(int, input().split())
# ๅบๅใN^2-A
ans = N * N - A
print(ans)
|
s865191328 | p03597 | u721970149 | 1581210438 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | # ๅ
ฅๅ : ๆฐๅญ2ใค
N, A = map(int, input().split())
# ๅบๅใN^2-A
print(N*N-A)
|
s008461541 | p03597 | u881116515 | 1580497869 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | print(int(input())**2-int(input()) |
s088984681 | p03597 | u995004106 | 1580422424 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 42 | N,A=map(int,input().split())
print(N*N-A) |
s937791328 | p03597 | u188396343 | 1579295576 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | n = input(int())
a = input(int())
print(n*n-a) |
s656487055 | p03597 | u686036872 | 1579075640 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | N = input().split()
A = input().split()
print(N*N-A) |
s913278848 | p03597 | u763881112 | 1578976794 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 |
#import numpy as np
n,a=map(int,input().split())
print(n*n-a) |
s840650074 | p03597 | u763881112 | 1578976717 | Python | Python (3.4.3) | py | Runtime Error | 159 | 12416 | 63 |
import numpy as np
n,a=map(int,input().split())
print(n*n-a) |
s787973057 | p03597 | u823044869 | 1578432115 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | n = int(input())
a = int(input())
print(abs(n**2-a)
|
s923526660 | p03597 | u401949008 | 1577942770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | n=int(input())
a=iny(input())
print(n**2-a) |
s460751193 | p03597 | u614875193 | 1576772238 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 528 | A,B,C,D,E,F=map(int,input().split())
water=[]
for i in range(31):
for j in range(30):
if (A*i+B*j)*100<=F:
water.append((A*i+B*j)*100)
sugar=[]
for i in range(501):
for j in range(500):
if C*i+D*j<=F//2:
sugar.append(C*i+D*j)
ans_sum=A*100
ans_sugar=0
ans_rate=0
for i i... |
s831062508 | p03597 | u807084817 | 1576734485 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 169 | n = int(input())
k = int(input())
b = list(map(int, input().split()))
sum = 0
for ball in b:
sum += ball - 0 if (ball - 0) < k - ball else k - ball
print(sum*2) |
s741106438 | p03597 | u807084817 | 1576733731 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | a = int(input())
b=int(input())
return a*a - b |
s122184153 | p03597 | u760802228 | 1576588993 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 821 | A, B, C, D, E, F = map(int, input().split())
max_sugar = E / (100 + E)
res = 0
ans = [0, 0]
for a in range(F // 100*A + 1):
for b in range(F // 100*B + 1):
for c in range(int(F * max_sugar) // C + 1):
for d in range(int(F * max_sugar) // D + 1):
... |
s370213980 | p03597 | u580236524 | 1575192388 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | n,a = [input() for i in range(2)]
print(n**2-a) |
s580346016 | p03597 | u580236524 | 1575192369 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | n,a = [input() for i in range(3)]
print(n**2-a) |
s243440924 | p03597 | u363995337 | 1574652674 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 452 | import math
A,B,X = map(int,input().split())
# A * N + B * d(N) yen
check_num = [1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000]
if((A*1+B*1)>X):
print(0)
else:
flag = True
for i in range(len(check_num)):
if((A*check_num[i]+B*(i+1)) > X):
flag = False
i... |
s618725589 | p03597 | u716529032 | 1573235127 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 41 | n,a=map(int,input().split())
print(n*n-a) |
s015989764 | p03597 | u366959492 | 1572994875 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38384 | 517 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(f//a+1):
for j in range(f//b+1):
if 0<(a*i+b*j)<=f:
x.add(a*i+b*j)
y=set()
for i in range(f//c+1):
for j in range(f//d+1):
if 0<(c*i+d*j)<=f:
y.add(c*i+d*j)
ans=[]
noudoma=e/100
for n in x:
for... |
s741863463 | p03597 | u861141787 | 1572927668 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38320 | 751 | a, b, c, d, e, f = map(int, input().split())
w = {0}
s = {0}
for i in range(f+1):
for j in range(f+1):
x = 100 * (a * i + b * j)
if x <= f:
w.add(x)
for i in range(f+1):
for j in range(f+1):
y = c * i + d * j
if y <= f:
s.add(y)
s_list = list(s)
s_list... |
s508941851 | p03597 | u748241164 | 1572650393 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38256 | 726 | from sys import stdin
import math
A, B, C, D, E, F = [int(x) for x in stdin.readline().rstrip().split()]
water = set()
for i in range(0, F//(100*A)+1):
for j in range(0, F//(100*B)+1):
water.add(A*i*100+B*j*100)
sugar = set()
capa = math.ceil(F/100)*E
for k in range(0, capa//C+1):
for l in range(0, ca... |
s596718915 | p03597 | u204478136 | 1572571634 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 184 | # ๆดๆฐใๅ
ฅๅ
a = int(input())
# ๆดๆฐใในใใผในๅบๅใใงๅ
ฅๅ
b, c = map(int, input().split())
# ๆๅญๅใๅ
ฅๅ
s = input()
# ๅบๅ
print("{} {}".format(a+b+c, s))
|
s035835404 | p03597 | u597455618 | 1572144361 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 542 | def main():
a, b, c, d, e, f = map(int, input().split())
sugar = 0
water = 0
con = 0
for i in range(f//100+1):
if i%b == 0 or i%a == 0:
w = i*100
x = min(f-w, i*e)
s = 0
for j in range(x//c+1):
ss = j*c
s = max(s, ss+((x-ss)... |
s965479806 | p03597 | u672220554 | 1571930024 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38256 | 41 | n,a=map(int,input().split())
print(n*n-a) |
s483981249 | p03597 | u117193815 | 1571781063 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | a,b=map(int, input().split())
print((a*a)-b)
|
s681436921 | p03597 | u117193815 | 1571781023 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 42 | a,b=map(int, input().split())
print(a*a-b) |
s247275846 | p03597 | u591717585 | 1571369381 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 42 | n,a=map(int,input().split())
print(n**2-a) |
s644147355 | p03597 | u873269440 | 1569630423 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | N = int(input())
A = int(input())
print(N*N-a) |
s683481961 | p03597 | u740047492 | 1569355402 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | n,a = map(int,input().split())
print((n*n)-a) |
s891620814 | p03597 | u740047492 | 1569355365 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 41 | n,a = int(input().split())
print((n*n)-a) |
s130749696 | p03597 | u572142121 | 1569167555 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 541 | A, B, C, D, E, F = map(int, input().split(' '))
maxconc = 0.0
maxwater = 100*A
maxsugar = 0
for i in range(F//(100*A)+1):
for j in range((F-100*A*i)//(100*B)+1):
if i == 0 and j == 0:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
su... |
s288159332 | p03597 | u572142121 | 1569134088 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 750 | A, B, C, D, E, F = map(int, input().split(' '))
max_sugar = 0
max_water = 100*A
max_conc = 0.0
A_limit = F // (100*A)
for i in range(A_limit + 1):
B_limit = (F-100*A*i) // (100*B)
for j in range(B_limit + 1):
if i == 0 and j == 0:
continue
sugar_limit = min(E * (A*i+B*j), F-100*(A*i... |
s816626631 | p03597 | u950376354 | 1568925828 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | N,A = map(int, input().split())
print(N**2-A) |
s981180346 | p03597 | u630566616 | 1567894667 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | N=iintnt(input())
A=int(input())
black_cell=N**2-A
print(black_cell) |
s120807281 | p03597 | u214434454 | 1567809684 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 621 | a, b, c, d, e, f = map(int, input().split())
max_a = f // (100*a)
max_b = f // (100*b)
max_c = f // c
max_d = f // d
wat = []
sug = []
for i in range(max_a + 1):
for j in range(max_b + 1):
w = 100 * a * i + 100 * b * j
if w <= f and w > 0:
wat.append(w)
for i in range(max_c + 1):
for... |
s933557100 | p03597 | u546853743 | 1567716209 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 41 | a,b=map(int,input().split())
print(a*a-b) |
s040854107 | p03597 | u756696693 | 1567047839 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | N,A=map(int,input().split())
print((N*N)-A) |
s770215340 | p03597 | u639104973 | 1566868687 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 153 | N,X=map(int, input().split())
L=list(map(int, input().split()))
s=[x for x in range(N) if sum(L[:x])<=X]
if N>=len(s):
print(len(s))
else:
print(N+1) |
s482639769 | p03597 | u923010184 | 1566495904 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 47 | n,a = map(int,input().split())
print(n * n - a) |
s825235765 | p03597 | u643714578 | 1566491985 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | N = int(input())
A = int(input())
print(N**2-a) |
s817057055 | p03597 | u871841829 | 1566361811 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1169 | A, B, C, D, E, F = map(int, input().split())
# A *= 100
# B *= 100
max_solvent = 0
max_solute = 0
max_strength = 0.0
for na in range(0, 31):
for nb in range(0, 31):
for nc in range(0, 101):
for nd in range(0, 101):
solute = nc * C + nd * D
solvent = 100 * na * ... |
s583006594 | p03597 | u101490607 | 1566348262 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 796 | a,b,c,d,e,f = map(int, input().split())
x = []
y = []
k=0
i = 0
j = 0
#print(a,b,c,d,e,f)
while( 100*a*i + 100*b*j <= f ):
while( 100*a*i + 100*b*j <= f):
x.append(100*a*i + 100*b*j)
j +=1
j = 0
i +=1
i = 0
j = 0
while( c*i + d*j <= f ):
while( c*i + d*j <= f):
y.append(c*i + d*j)
j +=1
... |
s759225220 | p03597 | u635182517 | 1566336602 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 107 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin>>N>>A;
cout<<N*N-A<<endl;
}
|
s612487052 | p03597 | u635182517 | 1566336346 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 118 | #include <iostream>
using namespace std;
int main() {
int N, A;
cin >> N;
cin >> A;
cout << N * N - A << endl;
} |
s250509338 | p03597 | u635182517 | 1566336256 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 129 | #include <iostream>
using namespace std;
int main() {
int N, A;
cin >> N;
cin >> A;
cout << N * N - A << endl;
return 0;
} |
s711263764 | p03597 | u635182517 | 1566336220 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 123 | #include <iostream>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << N * N - A << endl;
return 0;
} |
s290081721 | p03597 | u101490607 | 1566274244 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 757 | a,b,c,d,e,f = map(int, input().split())
x = []
y = []
k=0
i = 0
j = 0
#print(a,b,c,d,e,f)
while( 100*a*i + 100*b*j <= f ):
while( 100*a*i + 100*b*j <= f):
x.append(100*a*i + 100*b*j)
j +=1
j = 0
i +=1
i = 0
j = 0
while( c*i + d*j <= f ):
while( c*i + d*j <= f):
y.append(c*i + d*j)
j +=1
... |
s720198235 | p03597 | u101490607 | 1566274209 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 794 | a,b,c,d,e,f = map(int, input().split())
x = []
y = []
k=0
i = 0
j = 0
#print(a,b,c,d,e,f)
while( 100*a*i + 100*b*j <= f ):
while( 100*a*i + 100*b*j <= f):
x.append(100*a*i + 100*b*j)
j +=1
j = 0
i +=1
i = 0
j = 0
while( c*i + d*j <= f ):
while( c*i + d*j <= f):
y.append(c*i + d*j)
j +=1
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.