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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s071062834 | p02550 | u327466606 | 1600544143 | Python | Python (3.8.2) | py | Runtime Error | 47 | 13844 | 523 |
def solve(N,X,M):
memo = [-1]*(M+3)
acc = [0]*(M+4)
x = X
for i in range(M):
if memo[x] >= 0:
break
acc[i+1] = acc[i]+x
memo[x] = i
x = (x*x)%M
end = i
start = memo[x]
cycle = end - start
if N < end:
return acc[N]
cycle_sum = ... |
s229888842 | p02550 | u678505520 | 1600544140 | Python | Python (3.8.2) | py | Runtime Error | 90 | 12312 | 479 | n, x, m = map(int,input().split())
rem = [0] * m
chk = [0] * (m + 1)
rem[0] = x
for i in range(1,m):
rem[i] = (rem[i - 1] ** 2) % m
chk[rem[i - 1] ** 2 % m] += 1
if chk[rem[i - 1] ** 2 % m] > 1:
temp1 = rem[i - 1] ** 2 % m
temp2 = i
break
for i in range(m):
if rem[i] == temp1:
temp3 = i
br... |
s878889538 | p02550 | u328858746 | 1600544019 | Python | PyPy3 (7.3.0) | py | Runtime Error | 476 | 80336 | 470 | N,X,M = map(int,input().split())
A = [0]*M
S = 0
r = X
A[r-1] = 1
d = 0
for i in range(1,M):
r = (r*r) % M
if A[r-1] == 0:
A[r-1] = i+1
else:
I = A[r-1]
j = i+1
d = j-I
break
r = X
for i in range(I):
S += r
r = (r*r) % M
if d != 0:
t,u = (N-I)//d,(N-I)%d
... |
s298294593 | p02550 | u035603241 | 1600543897 | Python | PyPy3 (7.3.0) | py | Runtime Error | 142 | 76720 | 4468 | from math import inf, log2
class SegmentTree:
def __init__(self, array, func=max):
self.n = len(array)
self.size = 2**(int(log2(self.n-1))+1) if self.n != 1 else 1
self.func = func
self.default = 0 if self.func != min else inf
self.data = [self.default] * (2 * self.size)
... |
s311853561 | p02550 | u327466606 | 1600543825 | Python | PyPy3 (7.3.0) | py | Runtime Error | 133 | 68436 | 540 |
def solve(N,X,M):
memo = [-1]*M
acc = [0]*(M+1)
x = X%M
for i in range(M):
if memo[x] >= 0:
break
acc[i+1] = acc[i]+x
memo[x] = i
x = (x*x)%M
end = i
start = memo[x]
cycle = end - start
if N < end:
return acc[N]+(X - X%M)
cycl... |
s889593665 | p02550 | u168416324 | 1600543531 | Python | PyPy3 (7.3.0) | py | Runtime Error | 797 | 70148 | 254 | n,x,m=map(int,input().split())
yj=[x]
for i in range(n):
an=(yj[i]**2)%m
if an in yj:
lps=yj.index(an)
break
yj.append(an)
blp=yj[:lps]
lp=yj[lps:]
ans=sum(blp)+sum(lp)*((n-len(blp))//len(lp))+sum(lp[:(n-len(blp))%len(lp)])
print(ans)
|
s320075643 | p02550 | u509368316 | 1600543277 | Python | Python (3.8.2) | py | Runtime Error | 59 | 13800 | 274 | N,X,M=map(int,input().split())
l=[X]
p=[-1]*M
p[X]=0
for i in range(N-1):
x=(l[-1]**2)%M
if p[x]>=0:
break
l.append(x)
p[x]=i+1
if i==N-2:
print(sum(l))
else:
x=p[x]
y=len(l)-x
print(sum(l[:x])+(N-x)//y*sum(l[x:])+sum(l[x:x+(N-x)%y])) |
s772495136 | p02550 | u221272125 | 1600542940 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9224 | 382 | N,X,M = map(int,input().split())
R = [X]
m = min(X,M)
for i in range(m):
r = R[-1]
r = r**2%M
if r in R:
break
R.append(r)
for i in range(len(R)):
if r == R[i]:
break
a = 0
b = sum(R)
for j in range(i):
a += R[j]
b -= R[j]
n = len(R) - i
t = N - i
p = t // n
q = t % n
c = 0
f... |
s664668303 | p02550 | u221272125 | 1600542847 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9228 | 382 | N,X,M = map(int,input().split())
R = [X]
m = min(X,M)
for i in range(m):
r = R[-1]
r = r**2%M
if r in R:
break
R.append(r)
for i in range(len(R)):
if r == R[i]:
break
a = 0
b = sum(R)
for j in range(i):
a += R[j]
b -= R[j]
n = len(R) - i
t = N - i
p = t // n
q = t % n
c = 0
f... |
s120667969 | p02550 | u205116974 | 1600542771 | Python | Python (3.8.2) | py | Runtime Error | 485 | 47448 | 136 | n,x,m = map(int,input().split())
l = [0]*(n+1)
l[0] = x%m
s = l[0]
for i in range(1,n):
l[i] = (l[i-1]**2)%m
s += l[i]
print(s)
|
s632569059 | p02551 | u251897181 | 1600732181 | Python | Python (3.8.2) | py | Runtime Error | 2209 | 115212 | 1130 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def getNewMatrix(n, position, currentAxisMatrix, verticalAxisMatrix):
indexes = numpy.where(verticalAxisMatrix[1] >= position)[0]
if(indexes.size == 0):
return numpy.append(currentAxisMatrix, [[position], [n - 2]], axis=1)
else:
return numpy.append(... |
s384565808 | p02551 | u251897181 | 1600722211 | Python | Python (3.8.2) | py | Runtime Error | 511 | 290728 | 1128 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def query1(x, stonesMatrix):
line = stonesMatrix[0:, x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stonesMatrix[0:whiteIndex, x - 1] = WHITE
def query2(x, stonesMatrix):
line = stonesMatrix[x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
st... |
s467370549 | p02551 | u251897181 | 1600720773 | Python | Python (3.8.2) | py | Runtime Error | 321 | 290216 | 1120 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def query1(x, stonesMatrix):
line = stonesMatrix[x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stonesMatrix[x, 0:whiteIndex] = WHITE
def query2(x, stonesMatrix):
line = stonesMatrix[0:][x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stones... |
s637500625 | p02551 | u251897181 | 1600720422 | Python | Python (3.8.2) | py | Runtime Error | 1369 | 1209612 | 1101 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def query1(x, stonesMatrix):
line = stonesMatrix[x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stonesMatrix[x, 0:whiteIndex] = WHITE
def query2(x, stonesMatrix):
line = stonesMatrix[0:][x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stones... |
s251132424 | p02551 | u251897181 | 1600712381 | Python | Python (3.8.2) | py | Runtime Error | 1116 | 1215472 | 1054 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def query1(x, stonesMatrix):
line = stonesMatrix[x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stonesMatrix[x, 0:whiteIndex] = WHITE
def query2(x, stonesMatrix):
line = stonesMatrix[0:][x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stones... |
s040106240 | p02551 | u793981991 | 1600712302 | Python | PyPy2 (7.3.0) | py | Runtime Error | 323 | 85172 | 495 | input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, q = list(map(int, input().split()))
count = (n - 2) ** 2
c = [n] * n
r = [n] * n
for _ in range(q):
m,q = list(map(int, input().split()))
if m == 1:
pos = r[q-1]
c[:pos] = [min(q, v) for v in c[:pos]]
r[q-1] = 1
if q not in [1,n]:
... |
s872801488 | p02551 | u251897181 | 1600712190 | Python | Python (3.8.2) | py | Runtime Error | 1114 | 1215440 | 1054 | import numpy
BLACK = 1
WHITE = 2
NONE = 0
def query1(x, stonesMatrix):
line = stonesMatrix[x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stonesMatrix[x, 0:whiteIndex] = WHITE
def query2(x, stonesMatrix):
line = stonesMatrix[0:][x - 1]
whiteIndex = numpy.where(line == WHITE)[0][0]
stones... |
s990379276 | p02551 | u326609687 | 1600620419 | Python | Python (3.8.2) | py | Runtime Error | 394 | 91812 | 1207 | from numba.types import i8
ni8 = np.int64
@njit((i8, i8[:,::-1]), cache=True)
def solve(n, qr):
col = np.full(n - 1, n - 2)
col[0] = 0
col_min = n - 1
prev_col_min = n - 1
row = np.full(n - 1, n - 2)
row[0] = 0
row_min = n - 1
prev_row_min = n - 1
white = 0
for i in range(qr.sha... |
s401285740 | p02551 | u326609687 | 1600620368 | Python | Python (3.8.2) | py | Runtime Error | 368 | 91760 | 1207 | from numba.types import i8
ni8 = np.int64
@njit((i8, i8[:,::-1]), cache=True)
def solve(n, qr):
col = np.full(n - 1, n - 2)
col[0] = 0
col_min = n - 1
prev_col_min = n - 1
row = np.full(n - 1, n - 2)
row[0] = 0
row_min = n - 1
prev_row_min = n - 1
white = 0
for i in range(qr.sha... |
s209836388 | p02551 | u326609687 | 1600614268 | Python | Python (3.8.2) | py | Runtime Error | 115 | 27164 | 961 | import numpy as np
ni8 = np.int64
def solve(n, qr):
col = np.full(n - 1, n - 2)
col[0] = 0
col_min = n - 1
row = np.full(n - 1, n - 2)
row[0] = 0
row_min = n - 1
white = 0
for i in range(qr.shape[0]):
j = qr[i, 1] - 1
if qr[i, 0] == 1:
u = col[j]
... |
s545817781 | p02551 | u983853152 | 1600614143 | Python | PyPy3 (7.3.0) | py | Runtime Error | 279 | 99888 | 660 | N,Q = map(int, input().split())
ANS = (N-2)**2
R,C=N,N
RLEN=[]
CLEN=[]
for i in range(Q):
RC,num = map(int, input().split())
if RC==1:
if R>num:
for j in range(R-num-2):
RLEN.append(C)
ANS-=C-2
R=num
else:
if len(RLEN)>0:
... |
s523852047 | p02551 | u983853152 | 1600614023 | Python | PyPy3 (7.3.0) | py | Runtime Error | 265 | 99988 | 660 | N,Q = map(int, input().split())
ANS = (N-2)**2
R,C=N,N
RLEN=[]
CLEN=[]
for i in range(Q):
RC,num = map(int, input().split())
if RC==1:
if R>num:
for j in range(R-num-1):
RLEN.append(C)
ANS-=C-2
R=num
else:
if len(RLEN)>0:
... |
s434974421 | p02551 | u994521204 | 1600556843 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74560 | 2376 | import sys
input = sys.stdin.buffer.readline
n, q = map(int, input().split())
class SegmentTree:
ele = 10 ** 10
func = min
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self.n = n
self.num = 2 ** ((self.n - 1).bit_length())
self.SEG = [self.ele] * (2 ... |
s675411018 | p02551 | u994521204 | 1600554104 | Python | PyPy3 (7.3.0) | py | Runtime Error | 356 | 91764 | 2375 | import sys
input = sys.stdin.buffer.readline
n, q = map(int, input().split())
class SegmentTree:
ele = 10 ** 10
func = min
# SEG木は1-index
# Aに関しては0-index
def __init__(self, n): # Aは0-idx
self.n = n
self.num = 2 ** ((self.n - 1).bit_length())
self.SEG = [self.ele] * (2 *... |
s155930630 | p02551 | u627600101 | 1600552837 | Python | PyPy3 (7.3.0) | py | Runtime Error | 525 | 92320 | 2445 | #####segfunc#####
def segfunc(x, y):
return min(x, y)
#################
#####ide_ele#####
ide_ele = 10**9
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
"""
def __init__(self,... |
s672660561 | p02551 | u627600101 | 1600552687 | Python | PyPy3 (7.3.0) | py | Runtime Error | 467 | 92352 | 2409 | #####segfunc#####
def segfunc(x, y):
return min(x, y)
#################
#####ide_ele#####
ide_ele = 10**9
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
"""
def __init__(self,... |
s717030756 | p02551 | u627600101 | 1600552309 | Python | PyPy3 (7.3.0) | py | Runtime Error | 452 | 116980 | 2533 | #####segfunc#####
def segfunc(x, y):
return min(x, y)
#################
#####ide_ele#####
ide_ele = float('inf')
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
"""
def __init_... |
s776294443 | p02551 | u562016607 | 1600548835 | Python | PyPy3 (7.3.0) | py | Runtime Error | 369 | 135464 | 2109 | class segtree():
def segfunc(x,y):
return min(x,y)
#####単位元######
ide_ele = -1
n=1
init_val=[0]*n
#num:n以上の最小の2のべき乗
num =2**(n-1).bit_length()
seg=[ide_ele]*2*num
def __init__(self,INIT_VAL,SEGFUNC,IDE_ELE):
self.ide_ele=IDE_ELE
self.init_val=[i for i in ... |
s307719339 | p02551 | u643223021 | 1600548066 | Python | Python (3.8.2) | py | Runtime Error | 2212 | 159076 | 730 | import numpy as np
n, q = map(int, input().split())
g = np.zeros((n, n), dtype=np.uint8)
query = []
count = 0
g[1:n-1, 1:n-1] = 2
g[:n, n-1] = 1
g[n-1, :n] = 1
for _ in range(q):
query = list(map(int, input().split()))
if query[0] == 1:
g[0, query[1]] = 1
for i in range(1, n-1):
i... |
s650470064 | p02551 | u678167152 | 1600548006 | Python | PyPy3 (7.3.0) | py | Runtime Error | 762 | 100972 | 1456 | # N: 処理する区間の長さ
N, Q = map(int, input().split())
INF = 2**31
N-=1
LV = (N-1).bit_length()
N0 = 2**LV
data1 = [INF]*(2*N0)
data2 = [INF]*(2*N0)
lazy1 = [None]*(2*N0)
lazy2 = [None]*(2*N0)
# 伝搬対象の区間を求める
def gindex(l, r):
L = (l + N0) >> 1; R = (r + N0) >> 1
lc = 0 if l & 1 else (L & -L).bit_length()
rc = 0 i... |
s425942284 | p02551 | u511965386 | 1600547995 | Python | PyPy3 (7.3.0) | py | Runtime Error | 350 | 112172 | 1013 | N, Q = map(int, input().split())
Query = [[int(i) for i in input().split()] for _ in range(Q)]
# N: 処理する区間の長さ
N0 = 2**(N+10).bit_length()
data = [[None]*(2*N0) for _ in range(2)]
INF = (-1, 2**31-1)
# 区間[l, r+1)の値をvに書き換える
# vは(t, value)という値にする (新しい値ほどtは大きくなる)
def update(l, r, v, type):
L = l + N0; R = r + N0
while... |
s680977522 | p02551 | u562016607 | 1600547990 | Python | PyPy3 (7.3.0) | py | Runtime Error | 438 | 118456 | 1982 | class segtree():
def segfunc(x,y):
return min(x,y)
#####単位元######
ide_ele = -1
n=1
init_val=[0]*n
#num:n以上の最小の2のべき乗
num =2**(n-1).bit_length()
seg=[ide_ele]*2*num
def __init__(self,INIT_VAL,SEGFUNC,IDE_ELE):
self.ide_ele=IDE_ELE
self.init_val=[i for i in ... |
s321376387 | p02551 | u643223021 | 1600547988 | Python | Python (3.8.2) | py | Runtime Error | 33 | 9044 | 729 | import numpy as np
n, q = map(int, input().split())
g = np.zeros((n, n), dtype=np.uint8)
query = []
count = 0
g[1:n-1, 1:n-1] = 2
g[:n, n-1] = 1
g[n-1, :n] = 1
for _ in range(q):
query = list(map(int, input().split()))
if query[0] == 1:
g[0, query[1]] = 1
for i in range(1, n-1):
i... |
s716817349 | p02551 | u889405092 | 1600547957 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8972 | 392 | N,Q=map(int,imput().split())
X= [list(map(int, input().split())) for i in range(Q)]
count=(n-2)*(n-2)
A=[N]*(N-2)
B=[N]*(N-2)
for i in range(Q):
if X[i][0]==1 :
count=count-(A[(X[i][1]-2)]-2)
for j in range(A[(X[i][1]-2)]-2)
B[j]=min([B[j],(X[i][1])])
else:
count=count-(B[(X[i][1]-2)]-2)
for j ... |
s108335809 | p02551 | u889405092 | 1600547871 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8964 | 388 | N,Q=map(int,imput().split())
X= [list(map(int, input().split())) for i in range(Q)]
count=(n-2)*(n-2)
A=[N]*(N-2)
B=[N]*(N-2)
for i in range(Q):
if X[i][0]==1 :
count=count-(A[(X[i][1]-2)]-2)
for j in range(A[(X[i][1]-2)]-2)
B[j]=min([B[j],X[i][1]])
else:
count=count-(B[(X[i][1]-2)]-2)
for j in... |
s234507788 | p02551 | u191874006 | 1600547774 | Python | PyPy3 (7.3.0) | py | Runtime Error | 178 | 95392 | 1366 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... |
s058101625 | p02551 | u889405092 | 1600547729 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9048 | 393 | N,Q=map(int,imput().split())
X= [list(map(int, input().split())) for i in range(Q)]
count=(n-2)*(n-2)
A=[N]*(N-2)
B=[N]*(N-2)
for i in range(Q):
if X[i][0]==1 :
count=count-(A[(X[i][1]-2)]-2)
for j in range(A[(X[i][1]-2)]-2)
B[j]=min([B[j],X[i][1]])
else:
count=count-(B[(X[i][1]-2)]-2)
for j in... |
s344331700 | p02551 | u707960254 | 1600547682 | Python | PyPy3 (7.3.0) | py | Runtime Error | 355 | 94488 | 987 | N, Q = map(int, input().split())
black = pow(N-2, 2)
right = [N for _ in range(N-2)]
bottom = [N for _ in range(N-2)]
left = N-1
top = N-1
rigth_diff = 0
bottom_diff = 0
right_most = N
bottom_most = N
for i in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
black -= (bottom[x-2] -2 -bottom... |
s772472493 | p02551 | u191874006 | 1600547590 | Python | PyPy3 (7.3.0) | py | Runtime Error | 154 | 92168 | 1301 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... |
s458333982 | p02551 | u707960254 | 1600547541 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2207 | 94392 | 893 | N, Q = map(int, input().split())
black = pow(N-2, 2)
right = [N for _ in range(N-2)]
bottom = [N for _ in range(N-2)]
left = N-1
top = N-1
rigth_diff = 0
bottom_diff = 0
right_most = N
bottom_most = N
for i in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
black -= (bottom[x-2] -2 -bottom... |
s195036571 | p02551 | u143509139 | 1600547519 | Python | PyPy3 (7.3.0) | py | Runtime Error | 670 | 94120 | 508 | n, q = map(int, input().split())
c = []
r = [(n - 1, -1)]
t = 0
for i in range(q):
k, x = map(int, input().split())
if k == 1:
c.append((x - 1, t))
else:
r.append((x - 1, t))
t += 1
c.sort()
r.sort()
idx = 0
ans = (len(c)) * (r[0][0])
for i in range(len(r) - 1):
x, t = r[i]
t... |
s050943744 | p02551 | u074220993 | 1600547437 | Python | Python (3.8.2) | py | Runtime Error | 377 | 32648 | 396 |
def main():
N , Q = map(int, input().split())
query = [tuple(map(int, input().split())) for _ in range(Q)]
replace = {0:[N-2] * (N-2), 1:[N-2] * (N-2)}
replaced = 0
for i, x in range(Q):
i += -1
replaced += replace[i][x-2]
for j in range(replace[i][x-2]):
replace... |
s669145069 | p02551 | u482789362 | 1600547026 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2209 | 132152 | 3555 | # Modified from https://raw.githubusercontent.com/cheran-senthil/PyRival/master/pyrival/data_structures/LazySegmentTree.py
class LazySegmentTree:
def __init__(self, data, default=0, func=max):
"""initialize the lazy segment tree with data"""
self._default = default
self._func = func
... |
s814229801 | p02551 | u482789362 | 1600546766 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2209 | 133284 | 3496 | # Modified from https://raw.githubusercontent.com/cheran-senthil/PyRival/master/pyrival/data_structures/LazySegmentTree.py
class LazySegmentTree:
def __init__(self, data, default=0, func=max):
"""initialize the lazy segment tree with data"""
self._default = default
self._func = func
... |
s217008489 | p02551 | u880400515 | 1600546253 | Python | PyPy3 (7.3.0) | py | Runtime Error | 129 | 71724 | 548 | N, Q = list(map(int, input().split()))
tate = [(N - 2)] * (N - 2)
yoko = [(N - 2)] * (N - 2)
black = (N-2)*(N-2)
for i in range(Q):
type, x = list(map(int, input().split()))
x = x - 2
if (type == 1): # 縦に消す
black = black - tate[x]
a = min(yoko[j], x)
for j in range(tate[x]):
... |
s828901490 | p02552 | u890419631 | 1600729832 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8836 | 76 | x = int(input())
if x == 0:
print(1)
elif x == 1:
print(0)
else:
break |
s990513601 | p02552 | u644265148 | 1600704403 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8932 | 46 | import sys
a = sys.argv[1]
print(f'{1 - a}') |
s886513252 | p02552 | u921676506 | 1600679206 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8872 | 59 | x = input()
if x == 0:
print(1)
else:
print(0)
|
s013881818 | p02552 | u548272916 | 1600626083 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9144 | 385 | n = int(input())
x = []
y = []
distance = []
for i in range(n):
x1, y1 = input().split()
x1 = int(x1)
y1 = int(y1)
x.append(x1)
y.append(y1)
for i in range(len(x)):
for j in range(i+1,len(x)):
temp = abs(x[i] - x[j]) + abs(y[i] - y[j])
distance.append(temp)
for i in range(len(distance)-1):
... |
s491549363 | p02552 | u891540210 | 1600626002 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8984 | 94 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
cout<<1-N;
}
|
s167039967 | p02552 | u858244177 | 1600625439 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8940 | 52 | s=input()
if s > 0:
print(1)
else:
print(0) |
s890420621 | p02552 | u973167272 | 1600623418 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8856 | 104 | def fun(x):
x = int(input())
if x==0:
return 1
else:
return 0
print(fun(x)) |
s418181834 | p02552 | u973167272 | 1600623325 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8888 | 103 | def fun(x):
x = int(input())
if x=0:
return 1
else:
return 0
print(fun(x)) |
s504535631 | p02552 | u973167272 | 1600623264 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8880 | 84 | def fun(x)
x = int(input())
if x=0:
return 1
else:
return 0
print(fun(x)) |
s959377692 | p02552 | u323045245 | 1600609930 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8944 | 51 | x=int(input())
if x==!:
print(0)
else:
print(1) |
s663470211 | p02552 | u754511616 | 1600549154 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9052 | 118 | a,b,c,d=list(map(int,input().split()))
if (b and d)<=0:
print(a*c)
elif (b or d)<=0:
print(a*c)
else:
print(d*b) |
s686514972 | p02552 | u754511616 | 1600549114 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8920 | 118 | a,b,c,d=list(map(int,input().split()))
if (b and d)<=0:
print(a*c)
elif (b of d)<=0:
print(a*c)
else:
print(d*b) |
s694515026 | p02552 | u896403827 | 1600540089 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8648 | 61 | import sys
x = int(sys.stdin.read().strip())
print int(not x) |
s813893692 | p02552 | u921676506 | 1600539940 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9128 | 68 | x = int(input())
if x == 1:
print(0)
if X == 0:
print(1)
|
s034564490 | p02552 | u921676506 | 1600539815 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9060 | 62 | x = input()
if x == 1:
print(0)
if X == 0:
print(1)
|
s611861034 | p02552 | u119187285 | 1600534653 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8952 | 54 | a=input()
if a==0:
print(1)
else if a==1:
print(0) |
s958669146 | p02552 | u843060713 | 1600527810 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8924 | 60 | x = input()
if x = "1":
print(0)
elif x = "0":
print(1) |
s732872852 | p02552 | u639703036 | 1600523697 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8844 | 72 | n = int(input())
if(n == 0):
print(1)
else if(n == 1):
print(0) |
s665617494 | p02552 | u639703036 | 1600523653 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8880 | 74 | n = int(input())
if(n == 0):
printf(1)
else if(n == 1):
printf(0) |
s490736485 | p02552 | u639703036 | 1600523592 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9124 | 69 | n = int(input())
if(n == 0):
printf(1)
if(n == 1):
printf(0) |
s820013622 | p02552 | u639703036 | 1600523553 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9024 | 71 | n = int(input())
if(n == 0):
printf(1)
if(n == 1):
printf("0") |
s627652753 | p02552 | u090046582 | 1600517173 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9072 | 37 |
if x == 0:
print(1)
else:
print(0) |
s796454711 | p02552 | u213603001 | 1600516760 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9072 | 27 | N=int(niput())
print(1 - N) |
s293888176 | p02552 | u090046582 | 1600516696 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9008 | 36 | if x == 0:
print(1)
else:
print(0) |
s664595126 | p02552 | u182689172 | 1600516562 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9084 | 73 | x = input()
x = input()
if x == 0:
print(1)
elif x == 1:
print(0) |
s519155394 | p02552 | u918601425 | 1600516241 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8940 | 20 | print(1-int(input()) |
s981829565 | p02552 | u622838398 | 1600496832 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9020 | 38 | if x == 0:
return 1
else:
return 0 |
s742739190 | p02552 | u383805907 | 1600467608 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9012 | 53 | input = int(input())
if input == 0: return 1
return 0 |
s509847150 | p02552 | u859547105 | 1600463033 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8932 | 47 | if x == 0:
print('1')
elif x == 1:
print('0') |
s736948557 | p02552 | u472179812 | 1600457614 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8964 | 42 | x = input()
x == 0
print 1
x == 1
print 0 |
s329042800 | p02552 | u472179812 | 1600457476 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9012 | 35 |
if x==0
print 1
if x == 1
ptint 0 |
s907246500 | p02552 | u220302984 | 1600451851 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8904 | 324 | import java.util.*;
import java.io.*;
import java.lang.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
if (a==0)
System.out.println("1");
else
System.out.println("0");
... |
s940758388 | p02552 | u267933821 | 1600430831 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8908 | 55 | if x==0:
return 1
elif x==1:
return 0
else:
break |
s475560260 | p02552 | u067694718 | 1600427007 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9000 | 15 | print(~input()) |
s261682061 | p02552 | u718536599 | 1600413737 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8972 | 64 | x=int(input())
if x==0:
ans=1
else x==1:
ans=0
print(ans) |
s906318257 | p02552 | u515638999 | 1600391481 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8976 | 26 | n = int(input())
print(!n) |
s073664747 | p02552 | u627568967 | 1600386328 | Python | PyPy3 (7.3.0) | py | Runtime Error | 441 | 92748 | 24 | x=int(input())
print(!x) |
s234907499 | p02552 | u171356057 | 1600383790 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8852 | 37 | def(x)
if x == 1
return 0
return 1 |
s304912887 | p02552 | u816552564 | 1600379145 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8892 | 56 | x = input()
if x ==0:
print(1)
else x == 1:
print(0) |
s055916106 | p02552 | u629254463 | 1600376585 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9064 | 38 | if x==1 :
print(0)
else :
print(1) |
s136236380 | p02552 | u629254463 | 1600376483 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8920 | 34 | if x==1 :
print(0)
else print(1) |
s432472224 | p02552 | u191889858 | 1600373310 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8820 | 102 | x=int(input('Enter 0~1:'))
if x==0:
print('1')
elif x==1:
print('0')
else:
print('') |
s350036428 | p02552 | u191889858 | 1600372540 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8884 | 62 | x=int(input('x='))
if x=0:
print('1')
else:
print('0') |
s543663184 | p02552 | u191889858 | 1600372295 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8944 | 68 | x=int(input('x='))
if x==0:
print('1')
else x==1:
print('0') |
s192886111 | p02552 | u191889858 | 1600371982 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8944 | 70 | x=int(input)
if int(x)=0:
print('1')
elif int(x)=1:
print('0') |
s409696589 | p02552 | u191889858 | 1600371651 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8992 | 74 | x=input('Enter number:')
if int(x)==0:
print('1')
else:
print('0') |
s838251974 | p02552 | u336828547 | 1600371618 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9000 | 69 | x=input()
if x==1:
print("0")
elif x==0:
print("1")
else:
break |
s543708757 | p02552 | u517417276 | 1600371419 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8940 | 39 | if x = 0:
print(1)
else:
print(0)
|
s401139550 | p02552 | u537208079 | 1600371393 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8972 | 62 | input(a)
if a == '0':
print('1')
elif a == '1':
print('0') |
s433749080 | p02552 | u336828547 | 1600370585 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8780 | 82 | x=include("xを入力してください")
if x==1:
print("0")
else:
print("1") |
s326739745 | p02552 | u440649533 | 1600370330 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8772 | 53 | a=input()
if a=='1':
print('0')
else:
print('1') |
s307000228 | p02552 | u336828547 | 1600370282 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8848 | 84 | x=input(xを入力してください)
if x==1:
print("0")
elif x==0:
print("1") |
s731971572 | p02552 | u717792745 | 1600367120 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9192 | 755 | n=int(input())
import sys
a=list(map(int,input().split()))
b=list(map(int,input().split()))
d={}
if(n==1):
if(a==b): print('No')
else: print('Yes')
sys.exit()
possible=True
for x in b:
if(d.get(x)==None):
d[x]=1
else:
d[x]+=1
if(d[x]>(n)//2):
possible=False
break
... |
s143061943 | p02552 | u363961322 | 1600365132 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8820 | 76 | i = int(input())
if i = 0:
print(1)
elif i = 1:
print(0)
else:
pass |
s633489401 | p02552 | u818857408 | 1600362770 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8908 | 61 |
n = int(input())
if n == 1:
print(0)
elif: n == 0
print(1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.