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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s861982488 | p02547 | u302789073 | 1600543191 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9168 | 243 | n=int(input())
count=0
c_list=[]
for i in range(n):
d1, d2=map(int, input().split())
if d1==d2:
count+=1
c_list.append(count)
else:
count=0
if max(c_list)>=3:
print("Yes")
else:
print("No") |
s466627417 | p02547 | u965937045 | 1600543176 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9188 | 259 | N=int(input())
sum=0
for _ in range(N):
a,b=map(int,input().split())
if(a==b):
sum+=1
if(sum==3):
name=[]
name.append("Yes")
else:
sum=0
if name[0]=="Yes":
print("Yes")
else:
print("No") |
s929466088 | p02547 | u847075829 | 1600543111 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9100 | 207 | n = int(input)
count = 0
ans = 'No'
for i in range(n):
a , b = map(int,input().split(' '))
if a!=b:
count = 0
else:
count += 1
if count == 3:
ans = 'Yes'
print(ans) |
s537442087 | p02547 | u813042907 | 1600543100 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9016 | 211 | n=int(input())
count=0
ren=0
for i in range(n):
a,b=map(int,input().split())
if a==b:
if count<3:
count+=1
ren=1
else if count<3:
count=0
if count>=3:
print("Yes")
else:
print("No") |
s468772613 | p02547 | u087590461 | 1600543100 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9012 | 180 | N= int(input())
count=0
for i in range(N):
p,q=list(map(int,input().split(' ')))
if p==q:
count+=1
else:
count=0
if count>=3:
print('Yes')
else:
print('No')
|
s798180989 | p02547 | u438070303 | 1600543088 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8932 | 361 | doubletCount = 0
cases = int(input())
for roll in range(cases):
d1, d2 = map(int, input().split())
if d1 == d2:
doubletCount += 1
else:
doubletCount = 0
if doubletCount >= 3:
print("Yes")
break
if r... |
s373866091 | p02547 | u936988827 | 1600543075 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9200 | 263 | n = int(input())
z = []
y = 0
for i in range(n):
line = input().split(" ")
if int(line[0])==int(line[1]):
z.append(int(line[0]))
for i in range(n-3):
if z[i]==z[i+1]-1:
if z[i+1]==z[i+2]-1:
y += 1
if y > 0:
print("Yes")
else:
print("No")
|
s879214783 | p02547 | u790867486 | 1600543075 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8932 | 257 | n =int(input())
l1 = []
for i in range(n):
l2=[]
k = int(input())
l = int(input())
l2.append(k)
l2.append(l)
l1.append(l2)
for i in range(n):
if l1[i][0]==l1[i][1]:
res+=1
if res>=3:
print("Yes")
else:
print("No")
|
s914511718 | p02547 | u235792800 | 1600543073 | Python | PyPy3 (7.3.0) | py | Runtime Error | 103 | 68664 | 337 | from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]
n = int(input())
row = False
cnt = 0
for _ in range(n):
x,y = ip()
if x == y: cnt += 1
else:
cnt += 1
if cnt == 3:
row = True
if row: print("Yes")
... |
s349488142 | p02547 | u847075829 | 1600543054 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8960 | 205 | n = int(input)
count = 0
ans = 'No'
for i in range(n):
a , b = map(int,input().split(' '))
if a!=b:
count = 0
else:
count += 1
if count == 3:
ans = 'Yes'
print(ans)
|
s888406669 | p02547 | u817247382 | 1600543038 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9192 | 206 | n = int(input())
num_of_double = 0
for i in range(n):
d1 = int(input())
d2 = int(input())
if d1 == d2:
num_of_double += 1
if num_of_double >= 3:
print("Yes")
else:
print("No") |
s816939799 | p02547 | u087590461 | 1600543031 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9016 | 173 | N= int(input())
count=0
for i in range(N):
p,q=map(int,input().split(' '))
if p==q:
count+=1
else:
count=0
if count>=3:
print('Yes')
else:
print('No')
|
s280242050 | p02547 | u461480622 | 1600543004 | Python | PyPy3 (7.3.0) | py | Runtime Error | 97 | 74556 | 201 | n=int(input())
a = 0
for i in range(n):
li = input().split()
a+=1
elif(a<3):
a=0
else:
print("Yes")
exit()
if(a>2):
print("Yes")
exit()
print("No") |
s470572297 | p02547 | u657818166 | 1600542989 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9172 | 238 | n = int(input())
t = []
i = 0
for _ in range(n):
x, y = map(int, input().split())
if x == y:
i += 1
else:
i = 0
t.append(i)
if(len(filter(lambda x: x >= 3, t)) == 0):
print("No")
else:
print("Yes")
|
s381430888 | p02547 | u239228953 | 1600542986 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9036 | 266 | n = int(input())
l=[]
for i in range(n):
a,b = list(map(int,list(input().split())))
l.append([a,b])
def fn(n,l):
for i in range(n-2):
if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] andl[i+2][0]==l[i+2][1]:
return 'Yes'
return 'No'
print(fn(n,l))
|
s290773496 | p02547 | u207582576 | 1600542980 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9200 | 271 | N = int(input())
xy = [map(int, input().split()) for _ in range(5)]
x, y = [list(i) for i in zip(*xy)]
flag = 0
for i in range(N-3):
if x[i] == y[i]:
if x[i+1] == y[i+1]:
if x[i+2] == y[i+2]:
flag = 1
if flag == 1:
print('Yes')
else:
print('No') |
s885753119 | p02547 | u889405092 | 1600542980 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9072 | 275 | N=int(input())
x = [list(map(int, input().split())) for i in range(N)]
count=0
for i in range(N-2):
if x[i][0]==x[i][1] and x[i+1][0]==x[i+1][1] and x[i+2][0]==x[i+2][1]:
count=count+1
else:
count=count
else:
if count>0 :
print'Yes'
else :
print'No' |
s092480990 | p02547 | u936988827 | 1600542970 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9148 | 252 | n = int(input())
z = []
y = 0
for i in range(n):
line = input().split(" ")
if int(line[0])==int(line[1]):
z.append(i)
for i in range(n-3):
if z[i]==z[i+1]-1:
if z[i+1]==z[i+2]-1:
y += 1
if y > 0:
print("Yes")
else:
print("No")
|
s109840446 | p02547 | u050103839 | 1600542959 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9016 | 224 | i = input()
idx = 0
while idx < i:
cnt = 0
for _ in range(3):
d1, d2 = list(map(int, input.split(' ')))
if d1 == d2:
cnt += 1
if cnt == 3:
print('Yes')
else:
idx += 1
print('No') |
s573536776 | p02547 | u958482966 | 1600542939 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9192 | 309 | n = int(input())
a = []
for i in n:
x,y = map(int,input().split())
a.append([x,y])
count = 0
flag = True
for x in a:
if x[0] == x[1]:
count += 1
if count == 3:
print('Yes')
flag = False
break
else:
count = 0
if flag:
print('No') |
s152497573 | p02547 | u847075829 | 1600542920 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9012 | 202 | n = int(input)
count = 0
ans = 'No'
for _ in range(n):
a , b = map(int,input().split(' '))
if a!=b:
count = 0
else:
count += 1
if count == 3:
ans = 'Yes'
print(ans)
|
s682250507 | p02547 | u207582576 | 1600542920 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9192 | 270 | N = int(input())
xy = [map(int, input().split()) for _ in range(5)]
x, y = [list(i) for i in zip(*xy)]
flag = 0
for i in range(N-2):
if x[i] == y[i]:
if x[i+1] == y[i+1]:
if x[i+2] == y[i+2]:
flag = 1
if flag == 1:
print('Yes')
else:
print('No') |
s423648781 | p02547 | u936988827 | 1600542916 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9180 | 252 | n = int(input())
z = []
y = 0
for i in range(n):
line = input().split(" ")
if int(line[0])==int(line[1]):
z.append(i)
for i in range(n-3):
if z[i]==z[i+1]-1:
if z[i+1]==z[i+2]-1:
y += 1
if y > 0:
print("yes")
else:
print("no")
|
s678131774 | p02547 | u050103839 | 1600542900 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9004 | 224 | i = input()
idx = 0
while idx < i:
cnt = 0
for _ in range(3):
d1, d2 = list(map(int, input.split(' ')))
if d1 == d2:
cnt += 1
if cnt == 3:
return 'Yes'
else:
idx += 3
print('No') |
s772585196 | p02547 | u414050834 | 1600542900 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9224 | 252 | n=int(input())
l=[]
j=0
for i in range(n):
a=list(map(int,input().split()))
l.append(a)
for k in range(n-2):
if l[k+2][0]==l[k+2][1] and l[k+3][0]==l[k+1][1] and l[k+4][0]==l[k+4][1]:
j+=1
break
if j==1:
print('Yes')
else:
print('No') |
s793073670 | p02547 | u958482966 | 1600542897 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9212 | 301 | n = int(input())
a = []
for i in n:
x,y = map(int,input())
a.append([x,y])
count = 0
flag = True
for x in a:
if x[0] == x[1]:
count += 1
if count == 3:
print('Yes')
flag = False
break
else:
count = 0
if flag:
print('No') |
s350680684 | p02547 | u224392054 | 1600542842 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8984 | 501 | import math
from fractions import Fraction as frac
MOD = 1e9 + 7
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
return a * b // gcd(a, b)
def solve(case_no):
n = int(input())
cnt=0
for i in range(n):
a,b = map(int,input().split()) if a==b:
... |
s563895843 | p02547 | u936988827 | 1600542831 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9184 | 248 | n = int(input())
z = []
y = o
for i in range(n):
line = input().split(" ")
if int(line[0])==int(line[1]):
z.append(i)
for i in range(n-3):
if z[i]==z[i+1]:
if z[i+1]==z[i+2]:
y += 1
if y > 0:
print("yes")
else:
print("no")
|
s611207506 | p02547 | u070257479 | 1600542828 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8948 | 142 | n=int(input())
c=0
for i in range(n):
a,b=[(int x) for x in input().split()]
if a==b:
c+=1
if c>=3:
print('Yes')
else:
print('No') |
s749715068 | p02547 | u865119809 | 1600542737 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9192 | 359 | n = int(input())
a = []
for i in range(n):
d,e = map(int,input().split())
a.append([d,e])
b = []
for i in range(n):
if a[i][0] == a[i][1]:
b.append(1)
else:
b.append(0)
c = 0
for i in range(n):
if b[i] == 1 and b[i+1] == 1 and b[i+2] == 1:
c = 1
break
if c == 1:
... |
s649740467 | p02547 | u790867486 | 1600542727 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9168 | 155 | n = int(input())
res =0
for i in range(n):
p = int(input())
k = int(input())
if p==k:
res+=1
if res>=3:
print("Yes")
else:
print("No") |
s286164768 | p02547 | u304612256 | 1600542710 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9112 | 274 | input = stdin.readline
N = int(input())
b = False
cnt = 0
for i in range(N):
D1, D2 = map(int, input().split())
if D1 == D2:
cnt += 1
if cnt == 3:
b = True
else:
cnt = 0
if b == False:
print('No')
else:
print('Yes') |
s730970932 | p02547 | u882950355 | 1600542707 | Python | PyPy3 (7.3.0) | py | Runtime Error | 156 | 68680 | 281 | n = int(input())
d = [map(int, input().split()) for _ in range(5)]
d1, d2 = [list(i) for i in zip(*d)]
count = 0
flag = 0
for i in range(n):
if d1[i]==d2[i]:
count += 1
else:
count = 0
if count == 3:
flag = 1
print('Yes')
break
if flag==0:
print('No') |
s004635820 | p02547 | u847075829 | 1600542693 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 193 | n = int(input)
count = 0
ans = 'No'
for _ in range(n):
a,b = map(int,input().split(' '))
if a!=b:
count = 0
else:
count+=1
if count ==3:
ans = 'Yes'
print(ans) |
s306110661 | p02547 | u953855545 | 1600542691 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9164 | 210 | n = int(input())
count = 0
result = "No"
for i in range(n):
d1, d2 = " ".split(input())
if d1 == d2:
count = count + 1
if count >= 3:
result = "Yes"
else:
count = 0
print(result) |
s748079814 | p02547 | u845847173 | 1600542688 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9176 | 326 | n = int(input())
xy = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*xy)]
for i in range(n - 1):
if x[i] == y[i]:
ans += 1
if ans == 3:
print("Yes")
break
else:
ans = 0
if ans == 0 or ans == 1 or ans == 2:
print("N... |
s584333239 | p02547 | u793981991 | 1600542683 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9184 | 278 | rolls = int(input())
dices = []
for _ in range(rolls):
dices.append(list(map(int, input().split())))
doubles = [d1 == d2 for d1,d2 in dices]
for i in range(1,rolls):
doubles[i] *= (doubles[i] + doubles[i-1])
if double[i] == 3:
print('Yes')
exit()
print('No')
|
s775836976 | p02547 | u968431218 | 1600542675 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9156 | 169 | #python
for _ in range(int(input())):
n1,n2=map(int,input().split())
if n1==n2:
c+=1
m=max(m,c)
else:
m=max(m,c)
c=0
if m>=3:
print('Yes')
else:
print('No') |
s418009639 | p02547 | u060505280 | 1600542673 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8888 | 251 | N = int(input())
cnt = 0
ans = False
for i in range(N):
a, b = input().split()
print(a, b)
if a == b:
cnt += 1
else:
cnt = 0
if cnt == 3:
ans True
break
print(cnt)
print('Yes' if ans else 'No')
|
s495170981 | p02547 | u953855545 | 1600542649 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9040 | 212 | n = input()
count = 0
result = "No"
for i in range(n):
d1, d2 = " ".split(input())
if d1 == d2:
count = count + 1
if count >= 3:
result = "Yes"
else:
count = 0
print(result)
|
s735585649 | p02547 | u092061507 | 1600542645 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9196 | 266 | N = int(input())
D = [map(int, input().split()) for i in range(N)]
seq = 0
for i in range(len(D)):
if D[i][0] == D[i][1]:
if D[i+1][0] == D[i+1][1]:
if D[i+2][0] == D[i+2][1]:
print('Yes')
exit()
print('No')
|
s214552704 | p02547 | u742260762 | 1600542639 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9104 | 170 | N == int(input())
count = 0
for i in range(N-1):
s = list(map(int, input().split()))
if s[0] == s[1]:
count += 1
if count >= 3:
print("Yes")
else:
print("No") |
s888229858 | p02547 | u968431218 | 1600542634 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9196 | 161 | for _ in range(int(input())):
n1,n2=map(int,input().split())
if n1==n2:
c+=1
m=max(m,c)
else:
m=max(m,c)
c=0
if m>=3:
print('Yes')
else:
print('No') |
s443399241 | p02547 | u987846648 | 1600542623 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 68688 | 275 | n = int(input())
cnt =0
def dice():
for i in range(n):
d = list(map(int, input().split()))
if d[0] == d[1]:
cnt += 1
if cnt == 3:
return "Yes"
else:
cnt = 0
ans = dice()
print(ans) |
s441138587 | p02547 | u847075829 | 1600542622 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9016 | 196 | n = int(input)
count = 0
ans = 'No'
for _ in range(n):
a,b = map(int,input().split(' ')
if a!=b:
count = 0
else:
count+=1
if count ==3:
ans = 'Yes'
print(ans)
|
s000345555 | p02547 | u054471580 | 1600542620 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 189 | n=input()
c=0
flag=0
for i in range(n):
a,b = map(int(),input().split())
if(a==b):
c+=1
else:
c=0
if(c==3):
print("Yes")
flag=1
break
if(flag==0):
print("No") |
s223687760 | p02547 | u739843002 | 1600542601 | Python | Python (3.8.2) | py | Runtime Error | 33 | 9224 | 493 | def main():
N = int(input())
z = []
for i in range(N):
d1, d2 = [int(d) for d in input().split(" ")]
if d1 == d2:
z.append(1)
else:
z.append(0)
zc = []
now = 2
c = 0
for i in range(len(z)):
if i == 0:
now = z[i]
c += 1
elif now == z[i]:
c += 1
elif now == 1 and z[i] == 0:
zc.append(... |
s087516435 | p02547 | u955248595 | 1600542600 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9200 | 380 | N = int(input())
Flag = False
MAXC = 0
Cont = 0
for TN in range(0,N):
D1,D2 = (int(T) for T in input().split())
if Flag==False and D1==D2:
Flag = True
Cout = 1
elif Flag==True and D1==D2:
Cout += 1
elif Flag==True and D1!=D2:
Flag = False
MAXC = max(MAXC,Cout)
MAX... |
s310223412 | p02547 | u473234868 | 1600542591 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9168 | 210 | n = int(input())
total = 0
for i in range(n):
a,b = map(int,split().input())
if a == b:
total += 1
if total == 3:
break
else:
total = 0
if total == 3:
print('Yes')
else:
print('No') |
s875149161 | p02547 | u813590793 | 1600542587 | Python | PyPy3 (7.3.0) | py | Runtime Error | 132 | 68772 | 200 | n=int(input())
count=0
counts=[]
for i in range(n):
i,j=list(map(int,input().split()))
if i==j:
count+=1
else:
counts.append(count)
count=0
if max(counts)>=3:
print('Yes')
else:
print('No') |
s217908966 | p02547 | u054471580 | 1600542569 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9112 | 187 | n=input()
c=0
flag=0
for i in range(n):
a,b = map(int,input().split())
if(a==b):
c+=1
else:
c=0
if(c==3):
print("Yes")
flag=1
break
if(flag==0):
print("No") |
s962381708 | p02547 | u440608859 | 1600542560 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9164 | 210 | n=int(input())
c=1
for i in range(n):
a,b=map(int,input().split())
if a==b:
count+=1
else:
count=0
if count==3:
c=1
if c==1:
print("Yes")
else:
print("No")
|
s452135815 | p02547 | u955248595 | 1600542553 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9200 | 371 | N = int(input())
Flag = False
MAXC = 0
for TN in range(0,N):
D1,D2 = (int(T) for T in input().split())
if Flag==False and D1==D2:
Flag = True
Cout = 1
elif Flag==True and D1==D2:
Cout += 1
elif Flag==True and D1!=D2:
Flag = False
MAXC = max(MAXC,Cout)
MAXC = [MAXC... |
s252824291 | p02547 | u847075829 | 1600542552 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8956 | 193 | n = int(input)
count = 0
ans = 'No'
for _ in range(n):
a,b = map(int,input().split(' ')
if a!=b:
ans = 0
else:
count+=1
if count ==3:
ans = 'Yes'
print(ans) |
s019844052 | p02547 | u380791283 | 1600542550 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9020 | 304 | #B
n = int(input())
count=0
mcount=0
for i in range(n):
a,b = list(map(int, input().split()))
if a==b:
count+=1
if mcount<count:
mcount = count
if mcount=3:
break
else:
count=0
if mcount=3:
print("Yes")
else:
print("No") |
s782264588 | p02547 | u968431218 | 1600542528 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9104 | 172 | for _ in range(int(input())):
n1,n2=map(int,input().split())
if n1==n2:
c+=1
m=max(m,c)
else:
m=max(m,c)
c=0
#print(c)
if m>=3:
print('Yes')
else:
print('No') |
s130229687 | p02547 | u077948085 | 1600542518 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9016 | 138 | i = int(input())
count = 0
for i in range(i):
a, b = input().split(' ')
if a == b:
count += 1
print('Yes' if count >= 3 else 'No'
|
s245651080 | p02547 | u627600101 | 1600542506 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9256 | 1458 | #from collections import deque
#from heapq import heapify, heappop, heappush
#from bisect import insort
#from math import gcd
#mod = 10**9 + 7
N = int(input())
#N, K = map(int, input().split())
#A = list(map(int, input().split()))
flag1 = False
flag2 = False
flag3 = False
c, d = map(int, input().split())
if c == d:
fl... |
s269542089 | p02547 | u856636328 | 1600542493 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 203 | n = int(input())
c = 0
c1=0
for x in range(n):
a,b = map(int,input().split())
if a==b:
c+=1
if c==3:
c1 = 1
print('Yes')
break
else:
c=0
if c1==0:
print('No')
|
s308624300 | p02547 | u947664173 | 1600542459 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9188 | 264 | n=int(input())
xy = [map(int, input().split()) for _ in range(5)]
x, y = [list(i) for i in zip(*xy)]
zoro=0
for i in range(n):
if x[i]==y[i]:
zoro+=1
if zoro==3:
print("Yes")
exit()
else:
zoro=0
print("No") |
s103832121 | p02547 | u769095634 | 1600542453 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9172 | 268 | n = int(input())
count = 0
flag = False
for i in range(n):
a, b = map(int, input().split())
if a == b:
if count == 2:
flag = True
else:
count += 1
else:
count = 0
if flag:
print(Yes)
else:
print("No") |
s753076228 | p02547 | u062691227 | 1600542444 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 68672 | 195 | cnt = 0
ans = False
for i in range(n):
a,b = dd[i]
if a == b:
cnt += 1
else:
cnt = 0
if cnt >= 3:
ans = True
if ans:
print('Yes')
else:
print('No') |
s179232316 | p02547 | u879866069 | 1600542433 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9164 | 205 | N = int(input())
count = 0
for i in range(N):
di_1, di_2 = int(input().split())
if di_1 == di_2:
count += 1
else:
count = 0
if count >= 3:
print("Yes")
else:
print("No") |
s920940101 | p02547 | u856636328 | 1600542432 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8956 | 200 | n = int(input())
c = 0
c1=0
for x in range(n):
a,b = map(int,input().split())
if a==b:
c+=1
if c==3:
c1 = 1
print('Yes')
break
else:
c=0
if c1==0:
print('No') |
s881639224 | p02547 | u408148811 | 1600542431 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9024 | 237 | n=int(input())
a=[]
for i in range(n):
x,y=map(int,input().split())
a.append([x,y])
f=0;
for i in range(n-2):
if (a[i][0]=a[i][1]and a[i+1][0]=a[i+1][1] and a[i+2][0]=a[i+2][1]):
f=1
if f:
print("Yes")
else :
print("No")
|
s593452277 | p02547 | u106778233 | 1600542417 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9032 | 199 | n = input()
temp = 0
for i in range(n):
d,w = map(int,input().split())
if d==w:
temp += 1
if temp == 3 :
print("Yes")
exit()
else:
temp = 0
print("No")
|
s603673593 | p02547 | u546853743 | 1600542402 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9180 | 198 | n=int(input())
for i in range(n):
a,b=list(map(int,input().split()))
for i in range(n-2):
if a[i]==b[i] and a[i+1]==b[i+1] and a[i+2]==b[i+2]:
print('Yes')
exit()
print('No') |
s982393423 | p02547 | u693048766 | 1600542394 | Python | Python (3.8.2) | py | Runtime Error | 40 | 9928 | 242 | import re
n=int(input())
s = ""
for _ in range(n):
d1,d2 = input().split()
if d1==d2:
s+="1"
else:
s+="0"
#print(s)
a = max([len(x) for x in re.findall(r"1+", s)])
if a >= 3:
print("Yes")
else:
print("No") |
s361741315 | p02547 | u330728443 | 1600542390 | Python | PyPy3 (7.3.0) | py | Runtime Error | 151 | 68600 | 232 | #B
N=int(input())
cnt=0
flag=False
for i in range(N):
a,b=map(int,input().split())
if a==b:
cnt+=1
else:
cnt=0
if cnt=3:
flag=True
break
if flag:
print("Yes")
else:
print("No") |
s292695457 | p02547 | u145915236 | 1600542384 | Python | PyPy3 (7.3.0) | py | Runtime Error | 160 | 68520 | 260 | from sys import exit
N = int(input())
cnt = 0
for i in range(N):
x,y = map(int,input().split())
if cnt == 3:
print("Yes")
exit(0)
if x == y:
cnt += 1
else:
cnt = 0
if cnt == 3:
print("Yes"
print("No") |
s355570326 | p02547 | u458967973 | 1600542379 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9004 | 289 | num = input()
d = []
for n in range(num):
t, s = input().split()
d.append([t,s])
flag = 0
for n in range(num):
if(n<num-2):
if(d[n][0]==d[n][1] and d[n+1][0]==d[n+1][1] and d[n+2][0]==d[n+2][1]):
flag = 1
if flag == 1:
print('Yes')
else:
print('No') |
s631553109 | p02547 | u766734191 | 1600542309 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9176 | 264 | N = int(input())
nums = []
for a in range(N):
ci = []
ci.append(int(input()))
ci.append(int(input()))
nums.append(ci)
zoro = maximum = 0
for a in range(N):
if nums[a][0] == nums[a][1]:
zoro += 1
maximum = max(maximum, zoro)
else:
zoro = 0 |
s667253307 | p02547 | u760961723 | 1600542252 | Python | Python (3.8.2) | py | Runtime Error | 35 | 9480 | 700 | import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split(... |
s748286396 | p02547 | u860829879 | 1600542221 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 68728 | 162 | n=int(input())
*a,=map(int,open(0).read().split())
for i in range(2,2*n):
if a[i-2]==a[i-1]==a[i]:
print('Yes')
break
else:
print('No') |
s691202308 | p02547 | u297651868 | 1600542206 | Python | Python (3.8.2) | py | Runtime Error | 35 | 9112 | 200 | s=int(input())
for i in range(s):
p= list(map(int, input().split()))
if p[0]==p[1]:
z+=1
if z==3:
print("Yes")
exit()
else:
z=0
print("No") |
s635204165 | p02547 | u693974737 | 1600542138 | Python | PyPy3 (7.3.0) | py | Runtime Error | 145 | 68500 | 216 | n = int(input())
cur = 0
best = 0
for _ in range(n):
a, b = input().split()
if a == b:
cur += 1
best = max(best, cur)
else:
cur = 0
if best >= 3:
print("Yes")
else:
print("No") |
s346714890 | p02547 | u667024514 | 1600542110 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9148 | 197 | n = int(input())
lis = list(map(int,input().split()))
ans = 0
for i in range(n):
if lis[i][0] == lis[i][1]:
ans += 1
else:
ans = 0
if ans == 3:
print("Yes")
exit()
print("No") |
s588509049 | p02548 | u653041271 | 1600727695 | Python | PyPy3 (7.3.0) | py | Runtime Error | 97 | 75236 | 1325 | import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(in... |
s024855028 | p02548 | u175590965 | 1600724283 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9096 | 75 | n = int(input())
ans =0
for i in range(1,n):
ans +=(n-1)//a
print(ans) |
s759306023 | p02548 | u740157634 | 1600724251 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9016 | 127 | import sympy
N = int(input())
K = 0
cnt = 0
for i in range(1, N):
K = N - i
cnt += sympy.divisor_count(K)
print(cnt)
|
s254355354 | p02548 | u345356200 | 1600702534 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8860 | 80 | import math
n=int(intput())
sum=0
for i in range(1,n):
sum+=(n-1)/i
print(sum) |
s576525054 | p02548 | u509150616 | 1600700690 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 74632 | 119 | N = int(input())
nd = [0] * (N+1)
for i in range(1, N):
for j in range(i, N, i):
nd[j] += 1
print(sum(nd)) |
s369022746 | p02548 | u654571388 | 1600697151 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9108 | 139 | import sympy
val=int(input())
sum=0
newval=val-1
for i in range(val-1):
sum+=sympy.divisor_count(newval)
newval=newval-1
print(sum) |
s631913820 | p02548 | u654571388 | 1600696733 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9068 | 91 | import sympy
val=input()
sum=0
for i in (val-1):
sum+=sympy.divisor_count(val)
print(sum) |
s019768627 | p02548 | u921156673 | 1600683519 | Python | PyPy3 (7.3.0) | py | Runtime Error | 102 | 74700 | 104 | N = int(input())
count = 0
for a in range(1,N+1):
for b in range(a,N/a+1):
count += 2
print(count) |
s953038727 | p02548 | u921156673 | 1600683468 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 74788 | 104 | N = int(input())
count = 0
for a in range(1,N+1):
for b in range(a,N/a+1):
count += 1
print(count) |
s640562019 | p02548 | u543000780 | 1600646934 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8972 | 203 | N = int(input())
ls = [0]*(N)
n = 1
while n <= N-1:
k = 1
tmp = 0
while k**2 <= n:
if n % k == 0:
if k ** 2 = n:
tmp += 1
else:
tmp += 2
ls[n] = tmp
print(sum(ls)) |
s464903189 | p02548 | u762469320 | 1600639972 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8956 | 116 | import sympy
n = int(input())
cnt = 0
for c in range(1,n):
x = n - c
cnt += len(sympy.divisors(x))
print(cnt)
|
s190714668 | p02548 | u762469320 | 1600639769 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9076 | 139 | import sympy
#sympy.divisors(10**9)
n = int(input())
cnt = 0
for c in range(1,n):
x = n - c
cnt += len(sympy.divisors(x))
print(cnt)
|
s085000348 | p02548 | u492660436 | 1600638975 | Python | Python (3.8.2) | py | Runtime Error | 32 | 8880 | 5315 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi=3.14159265358979323846;
const long long inf = 1LL << 60;
typedef pair<int, int> P;
const int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
const int ... |
s858148401 | p02548 | u797550216 | 1600637608 | Python | PyPy3 (7.3.0) | py | Runtime Error | 95 | 74444 | 138 | n = int(input())
c = 0
for i in range(n):
for j in range(n):
for k in range(n):
if i*J+k == n:
c += 1
print(c)
|
s701186702 | p02548 | u797550216 | 1600637567 | Python | PyPy3 (7.3.0) | py | Runtime Error | 94 | 74492 | 136 | n = int(input())
c = 0
for i i range(n):
for j in range(n):
for k in range(n):
if i*J+k == n:
c += 1
print(c) |
s069908134 | p02548 | u556571816 | 1600637532 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9108 | 68 | n = int(input())
for i in range(1,n):
ans += (n-1)//i
print(ans) |
s718878380 | p02548 | u556571816 | 1600637437 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9148 | 67 | n = int(input())
for i in range(1,n):
ans += (n-1)//a
print(ans) |
s325525138 | p02548 | u945065638 | 1600636158 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8960 | 109 | = int(input())
ans = 0
for i in range(1,n):
s = (n-1)//i
if 0< s < n:
ans += s
print(ans) |
s983821669 | p02548 | u167908302 | 1600631504 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9128 | 96 | # coding:utf-8
n = int(input())
ans = 0
for a in range(n):
ans += (n - 1) // a
print(ans)
|
s872276698 | p02548 | u738831737 | 1600631162 | Python | PyPy3 (7.3.0) | py | Runtime Error | 100 | 74488 | 389 | import collections
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
s=input()
for i in r... |
s672055488 | p02548 | u016302627 | 1600630054 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9088 | 117 | import sympy
n = int(input())
ans = 0
for c in range(1, n):
ab = n - c
ans += sympy.divisor_count(ab)
print(ans) |
s490266791 | p02548 | u303711501 | 1600626981 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8976 | 318 |
n=int(input())
#d = [list(map(int,input().split())) for _ in range(s)]
def p(val):
print(val)
count = 0
#cは1以上で、問題文からN-1 a*b <=N-1のものをもとめる
#aを1からふやしてく、cはaとbが決まれば自動歴に決まるので、
for i in range(1,n):
p(count) |
s448566517 | p02548 | u123756661 | 1600620336 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74696 | 219 | #include<bits/stdc++.h>
using namespace std;
#define sl1(a) scanf("%lld",&a)
int main(){
long long n,ans=0ll;
sl1(n);
for (long long i=1;i<=n;i++) ans+=(n-1)/a;
printf("%lld\n",ans);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.