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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s762903259 | p02546 | u345132740 | 1600615505 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8960 | 62 | S=input()
if (S[-1:]==s):
print(S+"es")
else:
print(S+"s") |
s976766112 | p02546 | u085186789 | 1600615223 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8792 | 93 | words = input()
if words[-1] != s:
words += "s"
else:
words += "es"
print(words)
|
s598459942 | p02546 | u085186789 | 1600615158 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8996 | 92 | words = input()
if words[-1] != s:
words += 's'
else:
words += 'es'
print(words)
|
s117033063 | p02546 | u548272916 | 1600612573 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9016 | 148 | string = input()
if string[-1] != 's':
new_string = string[0:-1] + 's'
if string[-1] = 's':
new_string = string[0:-1] +'es'
print(new_string) |
s015624524 | p02546 | u627600101 | 1600609337 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9288 | 2432 | #####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,... |
s818818939 | p02546 | u441320782 | 1600609091 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9128 | 185 | from itertools import product
N=int(input())
count=0
lis=[i for i in range(1,N+1)]
x=list(itertools.product(lis,repeat=3))
for i in x:
if y[0]*y[1]+y[2]==N:
count+=1
print(count) |
s428129423 | p02546 | u629355744 | 1600607662 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8944 | 67 | s = input()
if s[-1]=='s':
print(s+'es')
else:
print(s+'s') |
s745646759 | p02546 | u675313477 | 1600600566 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9132 | 205 | c=0
for _ in range(int(input())):
x,y = map(int,input().split())
if x==y:
c+=1
else:
c=0
if c==3:
c=-1
print('Yes')
break
if c!=-1:
print('No')
|
s047798225 | p02546 | u326408598 | 1600599928 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9008 | 73 | S = input()
if S[-1] == "s":
print(S + "es")
else:
print(S + "s") |
s564803025 | p02546 | u326408598 | 1600599849 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8952 | 82 | s = input()
if s[-1] != "s":
print(s+'s')
elif s[-1] == 's'
print(s[:-1]+'es') |
s282658922 | p02546 | u326408598 | 1600599737 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9000 | 119 | s = input()
if s[-1] != "s":
print(s+'s')
elif s[-1] == 's' and s[-2] != 'e':
print(s[:-1]+'es')
else:
print(s) |
s125860664 | p02546 | u624812250 | 1600599089 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9048 | 57 | if S[-1] == "s":
print(S + "es")
else:
print(S + "s") |
s950178252 | p02546 | u624812250 | 1600598833 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8900 | 58 | if S[-1] == s:
print(S + "es")
else:
print(S + "s")
|
s231480880 | p02546 | u893297141 | 1600593712 | Python | PyPy2 (7.3.0) | py | Runtime Error | 332 | 85304 | 70 | s = input()
if s[-1] == 's':
print(s + 'es')
else:
print(s + 's')
|
s807152331 | p02546 | u850087201 | 1600588603 | Python | PyPy3 (7.3.0) | py | Runtime Error | 97 | 74784 | 435 | N,K = map(int,input().split())
l = []
mod = 998244353
for i in range(K):
L,R = map(int,input().split())
l.append([L,R])
l.sort()
a = [0 for i in range(N+1)]
a[1] = 1
b = [0 for i in range(N+1)]
b[1] = 1
for i in range(2,N+1):
for j in range(K):
if l[j][0] < i:
a[i] += (b[i-l[j][0]]-b[ma... |
s995569972 | p02546 | u650932312 | 1600586848 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8956 | 72 | S = input()
if S[-1] == 's':
ans += 'es'
else:
ans += 's'
print(ans) |
s346773925 | p02546 | u629350026 | 1600583313 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9044 | 99 | s=str(input())
s=list(s)
if s[len(s)-1]=="s":
print("".join(s)+"es")
else:
print("".join()+"s") |
s500583536 | p02546 | u369133448 | 1600576270 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9396 | 584 | import collections
n,x,m=map(int,input().split())
if n==1 or x==0:
print(x)
exit()
start,end,loopcnt=0,0,0
a={x:0}
wk=x
for i in range(1,m):
wk=(wk*wk)%m
if not wk in a:
a[wk]=i
else:
start=a[wk]
end=i
break
a=sorted(a.items(),key=lambda x:x[1])
koteiindex=min(n,start)
koteiwa=0
for i in range... |
s875835937 | p02546 | u242580186 | 1600576266 | Python | PyPy3 (7.3.0) | py | Runtime Error | 95 | 74824 | 555 | import sys
input = sys.stdin.readline.rstrip
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque
def inp():
retu... |
s754130546 | p02546 | u242580186 | 1600576244 | Python | PyPy3 (7.3.0) | py | Runtime Error | 97 | 74620 | 557 | import sys
input = sys.stdin.readline.rstrip()
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque
def inp():
re... |
s791794079 | p02546 | u242580186 | 1600575954 | Python | PyPy3 (7.3.0) | py | Runtime Error | 111 | 77136 | 681 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
import decimal
from decimal import Decimal
decimal.getcontext().prec = 10
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
import collections
from collections import deque
def inp():
return in... |
s705432195 | p02546 | u872259176 | 1600565906 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8964 | 84 | s = input()
l = len(s)
if s[l - 1] == "s":
s += "es"
else:
l.append("s")
print(s) |
s353319048 | p02546 | u872259176 | 1600565840 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9084 | 83 | s = input()
l = len(s)
if s[l - 1] == s:
l.append(es)
else:
l.append(s)
print(s) |
s189546365 | p02546 | u872259176 | 1600565777 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8916 | 86 | s = input()
l = len(s)
if(s[l - 1]) == 's':
l.append(es)
else:
l.append(s)
print(s) |
s309293157 | p02546 | u872259176 | 1600565543 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 84 | s = input()
l = len(s)
if(s[l - 1]) == s:
l.append(es)
else:
l.append(s)
print(s) |
s785539412 | p02546 | u255438107 | 1600562217 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9012 | 82 | n = input()
if n[len(n - 1)] == 's':
print(n + 'es')
else:
print(n + 's') |
s938003711 | p02546 | u004353595 | 1600558481 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8900 | 99 | s=input()
if len(s)<=1:
print(s)
else:
if s[-1]='s':
print(s+'es')
else:
print(s+'s') |
s471007639 | p02546 | u470481460 | 1600557521 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9088 | 72 | s=sys.stdin
if s[len(s)-1] =="s":
print(s + "es")
else:
print(s + "s") |
s705893424 | p02546 | u101850722 | 1600555925 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8864 | 88 | s = input()
p = ""
if(s.endswith("s")){
p = s + "es"
}else{
p = s + "s"
}
print(s) |
s799935637 | p02546 | u573268031 | 1600555538 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9080 | 54 | S = input()
if S[-1] == s:
S += es
else:
S += s
|
s913736740 | p02546 | u715985689 | 1600553563 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8804 | 55 | print(input().strip()+('es' if s[-1] == 's' else 's'))
|
s069453263 | p02546 | u715985689 | 1600553519 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8956 | 46 | print(input()+('es' if s[-1] == 's' else 's')) |
s269786459 | p02546 | u463945054 | 1600551619 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9144 | 83 | N = int(input())
k=0
for s in range(1,N):
k = (N-1) // s
t += k
print (t) |
s070869098 | p02546 | u442636632 | 1600550964 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9156 | 245 | N = int(input())
A = 1
B = 1
C = 1
answer = 0
while C < N:
B = 1
while B < N:
A = 1
while A < N:
if (A * B) + C == N:
answer += 1
A += 1
B += 1
C += 1
print(answer)
|
s841151807 | p02546 | u956318161 | 1600550761 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9184 | 102 | n = int(input())
import math
ans = 0
for a in range(1, n):
ans += math.floor((n - 1) / a)
print(ans) |
s906238309 | p02546 | u774959455 | 1600549675 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9204 | 306 | N = int(input().strip())
a = []
c = []
f = 0
for i in range(N):
array = list(map(int, input().strip().split()))
a.append(array)
for i in range(N):
if(f == 0 or f == i-1):
if(a[i][0] == a[i][1]):
f=i
c.append(1)
else:
f=0
if(len(c) >= 3):
print("Yes")
else:
print("No") |
s920420565 | p02546 | u286422818 | 1600549651 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9208 | 405 | #!/usr/local/bin/python3
N, X, M = map(int, input().split())
def f(x, m):
return x**2 % m
check = [False for _ in range(M)]
d = [X]
max_x = 0
for _ in range(1, N+1):
X = f(X, M)
if check[X]:
break
else:
check[X] = True
d.append(X)
idx = d.index(X)
ans = sum(d[:idx])
N -= idx
d = ... |
s731246078 | p02546 | u401481862 | 1600549435 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9200 | 447 | n, x, m = map(int, input().split())
a = x
s = 0
h = []
h.append(a)
i = 0
fl = 0
while i < n:
s += a
a = (a*a) % m
if a == 0:
break
i += 1
if fl == 0 and a in h:
fl = 1
po = h.index(a)
ss = 0
for j in range(po):
ss += h[j]
s2 = s - ss
f = (n - po) // ... |
s309988739 | p02546 | u936988827 | 1600549277 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8892 | 91 | line = input()
if line[len(line)] == ("s"):
line += "es"
else:
line += "s"
print(line) |
s552207657 | p02546 | u021814034 | 1600549109 | Python | PyPy2 (7.3.0) | py | Runtime Error | 359 | 96700 | 6989 |
from __future__ import division, print_function
# import threading
# threading.stack_size(2**27)
# import sys
# sys.setrecursionlimit(10**7)
import sys
from sys import stdin, stdout
import bisect #c++ upperbound
import math
import heapq
##import numpy as np
##i_m=9223372036854775807
def modinv(n,p):
ret... |
s710156920 | p02546 | u146803137 | 1600548391 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9248 | 2239 | import math
ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while... |
s390127566 | p02546 | u617515020 | 1600548351 | Python | PyPy3 (7.3.0) | py | Runtime Error | 86 | 74740 | 287 | import numpy as np
P=998244353
N,K=map(int,input().split())
LR=[]
for _ in range(K):
l,r=map(int,input().split())
LR+=range(l,r+1)
LR=list(set(LR))
LR=np.array(LR)
c=[0]*N
c[0]=1
for k in range(N):
S=list(LR[LR<=k])
while len(S):
c[k]+=c[k-S[-1]]%P
S.pop()
print(c[-1]%P) |
s765174170 | p02546 | u617515020 | 1600548331 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 68732 | 282 | import numpy as np
P=998244353
N,K=map(int,input().split())
LR=[]
for _ in range(K):
l,r=map(int,input().split())
LR+=range(l,r+1)
LR=list(set(LR))
LR=np.array(LR)
c=[0]*N
c[0]=1
for k in range(N):
S=LR[LR<=k]
while len(S):
c[k]+=c[k-S[-1]]%P
S=S[:-1]
print(c[-1]%P) |
s264784307 | p02546 | u163528399 | 1600548288 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9152 | 115 | N=int(input())
y=0
for j in range(1,N):
for k in range(1,N):
if (N-k)%j==0:
y=y+1
print(y) |
s044669759 | p02546 | u945761460 | 1600548283 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9524 | 674 | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,x,m=map(int,input().split())
s=set()
l=[]
flag=False
cnt=1
ans=0
l.append(x)
for i in range(m):
if x not in s:
s.add(x)
x=(x**2)%m
l.append(x)
else:
break
h=len(l)
cnt=... |
s777065594 | p02546 | u146803137 | 1600548120 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9244 | 2239 | import math
ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while... |
s917170085 | p02546 | u610042046 | 1600548097 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 68716 | 472 | n, x, m = map(int, input().split())
a = [x]
if n == 1:
print(x)
exit()
for i in range(n-1):
ad = (a[-1]**2) % m
if ad in a:
roop_s = a.index(ad)
roop_e = len(a)
break
else:
a.append(ad)
if i == n-2:
print(sum(a))
exit()
roop_t = (n-roop_s) // (roop... |
s848448533 | p02546 | u774959455 | 1600548061 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9100 | 318 | N = int(input().strip())
a = []
c =0
f = 0
for i in range(N):
array = list(map(int, input().strip().split()))
a.append(array)
for i in range(N):
if(f == 0 or f == i-1):
if(a[i][0] == a[i][1]):
f=i
c+=1
else:
f=0
c=0
else :
f=0
c=0
if(c >= 3):
print("Yes")
else:
print("No") |
s790760346 | p02546 | u774959455 | 1600548013 | Python | Python (3.8.2) | py | Runtime Error | 31 | 8904 | 326 | N = int(input().strip())
a = []
c =0
f = 0
for i in range(N):
array = list(map(int, input().strip().split()))
a.append(array)
for i in range(N):
if(f == 0 or f == i-1):
if(a[i][0] == a[i][1]):
f=i
c+=1
else:
f=0
c=0
else :
f=0
c=0
if(c >= 3):
print("Yes")
else:
print... |
s119616299 | p02546 | u001689394 | 1600548011 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9116 | 522 | list = []
x = 0
y = 0
n = int(input())
for i in range(n):
a,b = map(int,input().split())
list.append(a)
list.append(b)
for _ in range(n):
if list[x] == list[x+1]:
n = n - 1
if not list[x+1] == list[-1]:
if list[x+2] == list[x+3]:
n = n - 1
if n... |
s441767902 | p02546 | u001689394 | 1600547983 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9228 | 522 | list = []
x = 0
y = 0
n = int(input())
for i in range(n):
a,b = map(int,input().split())
list.append(a)
list.append(b)
for _ in range(n):
if list[x] == list[x+1]:
n = n - 1
if not list[x+1] == list[-1]:
if list[x+2] == list[x+3]:
n = n - 1
if n... |
s897495143 | p02546 | u490253811 | 1600547983 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8936 | 71 | S = input()
if S[-1] = "s":
print(S + "es")
else:
print(S + "s") |
s998297782 | p02546 | u463945054 | 1600547931 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9112 | 264 | N = int(input())
count = 0
for i in range(N):
k, t = map(int, input().split())
if count == 3:
print ( "yes" )
break
if not k == t:
count *= 0
if k == t:
count += 1
if not count == 3:
print ("no")
|
s336500889 | p02546 | u592826944 | 1600547864 | Python | PyPy3 (7.3.0) | py | Runtime Error | 614 | 72668 | 2562 | import sys,math
try:sys.stdin,sys.stdout=open('input.txt','r'),open('out.txt','w')
except:pass
from sys import stdin,stdout;mod=int(1e9 + 7);from statistics import mode
from collections import *;from math import ceil,floor,inf,factorial,gcd,log2,sqrt,log
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readlin... |
s039487440 | p02546 | u001689394 | 1600547834 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8936 | 500 | list = []
x = 0
y = 0
n = int(input())
for i in range(n):
a,b = map(int,input().split())
list.append(a)
list.append(b)
for _ in range(n):
if not list[x-1] == list[-1]:
if list[x] == list[x+1]:
if not list[x+1] == list[-1]:
if list[x+2] == list[x+3]:
... |
s511520241 | p02546 | u729679908 | 1600547829 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9036 | 112 | N,X,M = map(int,input().split())
S = X
n = X
while i < N-1:
n = (n**2)%M
S = S + n
i = i+1
print(S)
|
s242175771 | p02546 | u511975155 | 1600547822 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9032 | 192 | n,x,m = map(int,input().split())
def jouken(a,waru):
return a**2%waru
ni = 0
num =0
for i in range(n-1):
ni = x
if i ==0:
num+=x
x = jouken(ni,m)
num+=x
print(num)
|
s679429607 | p02546 | u694536861 | 1600547784 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9164 | 152 | N = int(input())
count = 0
for a in range(1, N):
tmp = (N-1) // a
if a <= (N) // 2:
count += tmp
else:
count += 1
print(count) |
s307787772 | p02546 | u490253811 | 1600547781 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8920 | 71 | S = input()
if S[-1] = s:
print(S + "es")
else:
print(S + "s") |
s187412761 | p02546 | u354862173 | 1600547742 | Python | Python (3.8.2) | py | Runtime Error | 120 | 26624 | 1610 | import sys
import numpy as np
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ
class Heap:
def __init__(self, data, reverse=False):
self.reverse = -1 if reverse else 1
self.data = [self.reverse... |
s696179687 | p02546 | u092061507 | 1600547734 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9020 | 399 | import bisect
N, K = map(int, input().split())
LR = [list(map(int, input().split())) for i in range(K)]
S = set()
for i in LR:
for j in range(i[0], i[1]+1):
S.add(j)
L = sorted(list(S))
dp = [0 for i in range(N)]
dp[0] = 1
for i in range(1, N):
x = bisect.bisect(L, i)
t = L[:x]
for j in t:
... |
s100745551 | p02546 | u584153341 | 1600547677 | Python | PyPy3 (7.3.0) | py | Runtime Error | 114 | 68660 | 417 | import math
N = int(input())
cnt = 0
if N == 2:
cnt = 1
elif N == 3:
cnt = 3
elif N > 3:
cnt = 3
for i in range(1,N-1):
A = N-i
rA = math.sqrt(A)
intA = math.floor(rA)
if rA == intA:
cnt -= 1
if intA == 1:
cnt += 1
else:
... |
s492205887 | p02546 | u001689394 | 1600547606 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9084 | 474 | list = []
x = 0
y = 0
n = int(input())
for i in range(n):
a,b = map(int,input().split())
list.append(a)
list.append(b)
for _ in range(n):
if list[x] == list[x+1]:
if not list[x+1] == list[-1]:
if list[x+2] == list[x+3]:
if not list[x+3] == list[-1]:
... |
s443867741 | p02546 | u490253811 | 1600547568 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8868 | 60 | if S[-1] = "s":
print(S + "es")
else:
print(S + "s") |
s689129658 | p02546 | u490253811 | 1600547533 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9012 | 58 | if S[-1] = s:
print(S + "es")
else:
print(S + "s") |
s912792989 | p02546 | u584153341 | 1600547491 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9204 | 410 | import math
N = int(input())
if N == 2:
cnt = 1
elif N == 3:
cnt = 3
elif N > 3:
cnt = 3
for i in range(1,N-1):
A = N-i
rA = math.sqrt(A)
intA = math.floor(rA)
if rA == intA:
cnt -= 1
if intA == 1:
cnt += 1
else:
for j... |
s589359269 | p02546 | u809416266 | 1600547489 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8868 | 67 | S = list('')
if ('S'[-1]) = s:
print('S'+es)
else:
print('S'+s) |
s592552107 | p02546 | u728050879 | 1600547452 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9232 | 444 | N,X,M = map(int, input().split())
A = [-1]*(M+100)
A[0] = X
i = 0
tmpans = 0
flag = False
check = [-1]*(M+1)
slice = -1
while i< N-1:
newa = A[i]**2%M
i+= 1
if check[newa] != -1:
flag = True
slice = check[newa]
break
A[i] = newa
check[newa] = i
if not flag:
print(sum(A... |
s972145719 | p02546 | u774959455 | 1600547437 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9112 | 343 | import sys
N = int(input().strip())
if(N == 0):
sys.exit()
a = []
c =0
f = 0
for i in range(N):
array = list(map(int, input().strip().split()))
a.append(array)
#print(a[4][1])
for i in range(N):
if(f == 0 or f == i-1):
if(a[i][0] == a[i][1]):
f=i
c+=1
else:
f=0
c=0
if(c >= 3):
print("Ye... |
s971946817 | p02546 | u584153341 | 1600547416 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9036 | 403 | import math
N = int(input())
if N == 2:
cnt = 1
elif N == 3:
cnt = 3
elif N > 3:
for i in range(1,N-1):
A = N-i
rA = math.sqrt(A)
intA = math.floor(rA)
if rA == intA:
cnt -= 1
if intA == 1:
cnt += 1
else:
for j in ran... |
s644362401 | p02546 | u865520181 | 1600547415 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9012 | 95 | import sys
S=""
S=sys.argv[1]
len(S)<=1000
if S[-1] == 's':
S=S+'es'
else:
S=S+'s'
print(S) |
s788387603 | p02546 | u490253811 | 1600547368 | Python | Python (3.8.2) | py | Runtime Error | 32 | 8900 | 76 | S = input()
if S[-1] = "s":
print(S + "es")
else:
print(S + "s") |
s178857821 | p02546 | u253220242 | 1600547326 | Python | Python (3.8.2) | py | Runtime Error | 32 | 8984 | 97 | word = input()
if word[-1] == 's':
return ''.join(word, 'es')
else:
return ''.join(word, 's') |
s340858285 | p02546 | u865520181 | 1600547246 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9020 | 83 | import sys
S=""
S=sys.argv[1]
if S[-1] == 's':
S=S+'es'
else:
S=S+'s'
print(S)
|
s536145523 | p02546 | u865520181 | 1600547231 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9088 | 83 | import sys
S=""
S=sys.argv[1]
if S[-1] == 's':
S=S+'es'
else:
S=S+'s'
print(S)
|
s973527853 | p02546 | u589828039 | 1600547148 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9240 | 627 | n = int(input())
m = 2
z = 0
for i in range(n-2):
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.a... |
s581052279 | p02546 | u490253811 | 1600547144 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8984 | 76 | S = input()
if S[-1] = "s";
print(S + "es")
else;
print(S + "s") |
s776798358 | p02546 | u589828039 | 1600547111 | Python | PyPy3 (7.3.0) | py | Runtime Error | 111 | 68672 | 626 | n = int(input())
m = 2
z = 0
for i in range(n-2):
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.a... |
s642715440 | p02546 | u983367697 | 1600546989 | Python | PyPy3 (7.3.0) | py | Runtime Error | 133 | 68712 | 133 | n,x,m = map(int,input().split())
def f(x,m):
return x%m
ans = 0
for i in range(n):
ans += x
x = f(x**2,m)
print(ans)
|
s858188836 | p02546 | u133745933 | 1600546708 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9200 | 205 |
N = int(input())
cnt = 0
for a in range(1,N//2+1):
for b in range(a,N):
if N - a * b > 0:
if a == b:
cnt += 1
else:
cnt += 2
print(cnt) |
s869849782 | p02546 | u357147881 | 1600546548 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9020 | 95 | l=list(S.split(''))
if l[-1]=='s':
l.append('es')
else:
l.append('s')
a=''.join(l)
print(a) |
s967267890 | p02546 | u013227739 | 1600546547 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8960 | 61 | s = input()
if l[-1] == 's':
s += 'es'
else:
s += 's' |
s690885254 | p02546 | u842033632 | 1600546504 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8968 | 65 | S = input()
if S[-1] == s
print(S + 'es')
else:
print(S + 's') |
s024067745 | p02546 | u587370992 | 1600546466 | Python | PyPy3 (7.3.0) | py | Runtime Error | 80 | 68548 | 606 | import sys
N, K = list(map(int, input().split()))
MOD = 998244353
sys.setrecursionlimit(N * 3)
L = []
R = []
for _ in range(K):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
memo = [None] * (N + 1)
def f(x):
if x < 0:
return 0
if memo[x] is None:
memo[x] = _f(x)... |
s975185806 | p02546 | u754511616 | 1600546426 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9092 | 59 | a=input()
if a[-1]==s:
print(a+'es')
else:
print(a+'s') |
s572984912 | p02546 | u357147881 | 1600546370 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9040 | 162 | while(S.isalpha()):
if S.lower()==S:
l=list(S.split(''))
if l[-1]=='s':
l.append('es')
else:
l.append('s')
a=''.join(l)
print(a) |
s507890020 | p02546 | u910358825 | 1600546311 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9128 | 171 | N=int(input())
a=1
count=0
while a<N:
b=1
#print(a,b)
for i in range(N//a+1):
c=N-a*b
if c>0:
count+=1
#print(a,b,c)
b+=1
a+=1
print(count) |
s671205826 | p02546 | u244466744 | 1600546253 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9088 | 83 | s = input()
if s[-1] != "s":
s.append("s")
else:
s.append("es")
print(s) |
s987296588 | p02546 | u389530753 | 1600546244 | Python | PyPy3 (7.3.0) | py | Runtime Error | 94 | 68792 | 213 | from sys import stdin
input=stdin.readline
n=int(input().rstrip())
count=0
for i in range(1,n):
for t in range(1,n):
if n-i*t>0:
count +=1
else:
break
print(count)
|
s911398772 | p02546 | u777800738 | 1600546174 | Python | Python (3.8.2) | py | Runtime Error | 113 | 27108 | 489 | import numpy as np
num=input().split(' ')
count=0
plot=np.zeros([int(num[0]),int(num[0])])
t=[]
for a in range(int(num[1])):
tmp=input().split(' ')
t.append([int(tmp[0])+a for a in range(int(tmp[1])-int(tmp[0])+1)])
for a in range(int(num[0])):
if a==0:
plot[0,0]=1
else:
for posit in np.where(plot[a-1]>... |
s662094881 | p02546 | u390493770 | 1600545935 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8936 | 228 | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
if (s[s.size() - 1] == 's') {
cout << s << "es";
}
else {
cout << s << "s";
}
return 0;
}
|
s186305724 | p02546 | u179411549 | 1600545658 | Python | PyPy3 (7.3.0) | py | Runtime Error | 80 | 68628 | 66 | S = input()
if S.endswith('s'):
print(S+'es')
else
print(S+'s') |
s051227810 | p02546 | u221272125 | 1600545359 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9040 | 61 | s = input()
a = 's'
if s[-1] == 's':
a = 'es'
s.append(a) |
s302560849 | p02546 | u071920156 | 1600545349 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 74732 | 187 | n = int(input())
count = 0
for i in range(n - 1):
c = i + 1
a_b = n - c
for j in range(a_b):
a = j + 1
if a_b % a == 0:
count += 1
print(count)
|
s040781991 | p02546 | u187883751 | 1600545314 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9028 | 105 | s = input()
n = len(s)
for i in range(n):
if s[-1] == 's':
print(s+es)
else:
print(s+s)
|
s897330088 | p02546 | u111559399 | 1600545295 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9004 | 92 | x= str(input())
a=list(x)
l=len(a)
if a[l-1]=='s':
print(x+'es')
else:
print(x+'s') |
s553735161 | p02546 | u365416597 | 1600545213 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9092 | 76 | s = input()
if s[len(s)] == 's':
print(s+'es')
else:
print(s+'s') |
s998157104 | p02546 | u032625182 | 1600545213 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9164 | 178 | import os,sys
c=0
n=input()
for i in range(int(n)):
m=input()
one=m[0]
two=m[2]
if(one==two):
c+=1
if(c>=3):
print('Yes')
else:
print('No')
|
s931640186 | p02546 | u809416266 | 1600545181 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8948 | 61 | S = ''
if ('S'[-1]) = s:
print('S'+es)
else:
print('S'+s) |
s615698896 | p02546 | u802781234 | 1600545177 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 74804 | 489 | def N():
return int(input())
def L():
return list(map(int,input().split()))
def NL(n):
return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7
#import numpy
#import sympy
import math
def divisors(n):
num = 0
for i in range(1, int(math.sqrt(n) + 1)):
if n % i == 0:
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.