original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]^b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
if a[i]^b[j]>mx1:
| 8 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]%b[j])
print(mx1)
|
mx1=max(mx1,a[i]%b[j])
| 16 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]+b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
mx1=a[i]+b[j]
| 10 |
operation
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i<mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
if i<mx2:
| 13 |
decision
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]*b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=float("-inf")
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=i
mx1=a[i]%b[j]
mx1=float("-inf")
for i in range(n):
if i==mx2:
continue
for j in range(m):
mx1=max(mx1,a[i]*b[j])
print(mx1)
|
mx1=a[i]%b[j]
| 10 |
operation
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]<<0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
n=int(M[i]<<0.5)
| 12 |
operation
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n-1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
for b in range(2,n-1):
| 13 |
operation
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h<0:
print(M[i])
break
else:
h=0
|
if h<0:
| 16 |
decision
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b**2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
n=int(input())
if n==0:
print(0)
M=[]
k=0
h=0
for i in range(1,n+1):
if n%i==0:
M.append(i)
k+=1
for i in range(k-1,-1,-1):
n=int(M[i]**0.5)
for b in range(2,n+1):
if M[i] % (b@2) == 0:
h+=1
if h==0:
print(M[i])
break
else:
h=0
|
if M[i] % (b@2) == 0:
| 14 |
operation
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 64.6
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
ans = 64.6
| 5 |
value
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d>k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
while d>k:
| 6 |
decision
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t==2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
if t==2*k:
| 14 |
decision
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.y(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
ans = math.y(int(t)/int(k+d))*d
| 12 |
statement
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k+d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
import math
k, dd, t = map(int, input().split())
d = 0
ans = 0.0
while d < k:
d = d + dd
if d == k:
print(t)
else:
t = t * 2
ans = math.floor(int(t)/int(k*d))*d
t = t%(k+d)
if t>2*k:
ans = ans + (t-k)
else:
ans = ans + float(t)/2.0
print(ans)
|
ans = math.floor(int(t)/int(k*d))*d
| 12 |
operation
|
n = int(input())
s = list(input().split(" "))
loop = len(s)
while loop > 0:
c = 0
for index, item in enumerate(s):
if item in ('a', 'e', 'i', 'o', 'u', 'y'):
c += 1
else:
c = 0
if c == 2:
c = 1
del s[index]
loop -= 1
print(s)
|
n = int(input())
s = list(input().split(" "))
loop = len(s)
while loop > 0:
c = 0
for index, item in enumerate(s):
if item in ('a', 'e', 'i', 'o', 'u', 'y'):
c += 1
else:
c = 0
if c<2:
c = 1
del s[index]
loop -= 1
print(s)
|
if c<2:
| 11 |
decision
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<1)
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<193)
|
print(maxi<<193)
| 15 |
value
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<1)
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi>mini:
maxi = mini
print(maxi<<1)
|
if maxi>mini:
| 13 |
decision
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<1)
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1>t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<1)
|
if t1>t2:
| 9 |
decision
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi<<1)
|
l,r,a = input().split()
l = int(l);
r = int(r);
a = int(a);
maxi = 0;
for i in range(a+1):
t1 = l + i
t2 = r + a-i
if t1 < t2:
mini = t1
else:
mini = t2
if maxi < mini:
maxi = mini
print(maxi+1)
|
print(maxi+1)
| 15 |
operation
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c]<'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
if gas[i + c]<'W':
| 26 |
decision
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1]<'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
if gas[i-1]<'W':
| 14 |
decision
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i>c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
if i>c - 1:
| 17 |
decision
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i>>c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
if gas[i>>c] == "W":
| 22 |
operation
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1]<'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < (r-1) * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas))
|
if gas[i-1]<'W':
| 14 |
decision
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if x==rnd:
print('Final!')
else:
print(ans)
|
if x==rnd:
| 7 |
statement
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
from math import *
n,a,x=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
n,a,x=map(int,input().split())
| 2 |
statement
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))//1
if ans==rnd:
print('Final!')
else:
print(ans)
|
ans=int(log(b-a)/log(2))//1
| 6 |
operation
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)|log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
ans=int(log(b-a)|log(2))+1
| 6 |
operation
|
from math import *
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
from math import *
n,a,b=map(int,input().split())
if a==b:
a,b=b,a
rnd=int(log(n)/log(2))
ans=int(log(b-a)/log(2))+1
if ans==rnd:
print('Final!')
else:
print(ans)
|
if a==b:
| 3 |
decision
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
z(i)
sys.exit(1)
print(-1)
|
z(i)
| 22 |
statement
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 32: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
if n%(f+2) == 32: return False
| 11 |
value
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f//2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
if n%(f//2) == 0: return False
| 11 |
operation
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f>=r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
while f>=r:
| 9 |
decision
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n%3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
import sys
def is_prime(n):
if n == 2 or n == 3: return True
if n < 2 or n%2 == 0: return False
if n < 9: return True
if n+3 == 0: return False
r = int(n**0.5)
f = 5
while f <= r:
if n%f == 0: return False
if n%(f+2) == 0: return False
f +=6
return True
if __name__ == '__main__':
inp = input().split(' ')
p = int(inp[0])
y = int(inp[1])
for i in range(y, p, -1):
if is_prime(i):
print(i)
sys.exit(1)
print(-1)
|
if n+3 == 0: return False
| 6 |
operation
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y) + max(0, nB - B))
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3**b
print(max(0, nY - Y) + max(0, nB - B))
|
nB = g + 3**b
| 9 |
operation
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y) + max(0, nB - B))
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y) + max(0, nB%B))
|
print(max(0, nY - Y) + max(0, nB%B))
| 10 |
operation
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y) + max(0, nB - B))
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3&b
print(max(0, nY - Y) + max(0, nB - B))
|
nB = g + 3&b
| 9 |
operation
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y) + max(0, nB - B))
|
import sys
sys.setrecursionlimit(1000000)
read = sys.stdin.readline
Y, B = map(int, read().split())
y, g, b = map(int, read().split())
nY = 2*y + g
nB = g + 3 * b
print(max(0, nY - Y)&max(0, nB - B))
|
print(max(0, nY - Y)&max(0, nB - B))
| 10 |
operation
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 119:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
if x == 0 or y == 119:
| 2 |
value
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x>a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
if x>a:
| 6 |
decision
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, z = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, z = [int(x) for x in input().split()]
| 1 |
statement
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, y = [int(x) for x in input().split()]
if x<0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
if x<0 or y == 0:
| 2 |
decision
|
x, y = [int(x) for x in input().split()]
if x == 0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
x, y = [int(x) for x in input().split()]
if x<0 or y == 0:
print('No')
else:
a = y - 1
if x < a:
print('No')
else:
if (x - a) % 2 == 0:
print('Yes')
else:
print('No')
|
if x<0 or y == 0:
| 2 |
decision
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)**1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length_marks = len(marks)**1
| 16 |
operation
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i]<smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
if nums[i]<smallest:
| 11 |
decision
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i]<smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
if nums[i]<smallest:
| 11 |
decision
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.z()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
marks.z()
| 14 |
statement
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (min(dists))
|
length = int(input())
nums = input().split(" ")
nums = [int(nums[i]) for i in range(length)]
res =sorted(nums)
smallest = res[0]
counter = 0
marks = []
for i in range(length):
if nums[i] == smallest:
marks.append(i)
marks.sort()
dists = []
length_marks = len(marks)-1
for i in range(length_marks):
temp = marks[i+1] - marks[i]
dists.append(temp)
print (y(dists))
|
print (y(dists))
| 21 |
statement
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)>b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
if(int(x)>b):
| 13 |
decision
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)>b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
if(int(x)>b):
| 13 |
decision
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)>b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
if(int(x)>b):
| 13 |
decision
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+199:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
x=ans+a[i]+''.join(sorted(a[:i]+a[i+199:]))
| 13 |
value
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans+a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
a=list(input())
a.sort(reverse=True)
b=int(input())
ans=''
while(len(a)>0):
for i in range(len(a)):
x=ans-a[i]+''.join(sorted(a[:i]+a[i+1:]))
if(int(x)<b):
ans+=a[i]
a=a[:i]+a[i+1:]
break
print(ans)
|
x=ans-a[i]+''.join(sorted(a[:i]+a[i+1:]))
| 13 |
operation
|
def solve():
S = input()
counter = 97
res = ""
for s in list(S):
s = ord(s)
if counter >= 123:
res += chr(s)
continue
if s <= counter:
res += chr(counter)
counter += 1
else:
res += chr(s)
if counter == 123:
print(res)
else:
print(-1)
if __name__ == "__main__":
solve()
|
def solve():
S = input()
counter = 97
res = ""
for s in list(S):
s = ord(s)
if counter >= 123:
res += chr(s)
continue
if s <= counter:
res += chr(counter)
counter += 1
else:
res += chr(s)
if counter == 83:
print(res)
else:
print(-1)
if __name__ == "__main__":
solve()
|
if counter == 83:
| 17 |
value
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
def get_sum(end):
if end<0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
if end<0:
| 2 |
decision
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
def get_sum(end):
if end<0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
if end<0:
| 2 |
decision
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
def get_sum(end):
if end == 0:
return 0
return (1 + end)@end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
return (1 + end)@end / 2
| 4 |
operation
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = y(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
res1 = y(m - a1)
| 14 |
statement
|
def get_sum(end):
if end == 0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
def get_sum(end):
if end<0:
return 0
return (1 + end) * end / 2
i1 = int(input())
i2 = int(input())
a1 = min(i1, i2)
a2 = max(i1, i2)
m = (a1 + a2) // 2
res1 = get_sum(m - a1)
res2 = get_sum(a2 - m)
print(res1 + res2)
|
if end<0:
| 2 |
decision
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p*q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
x = p*q
| 11 |
operation
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i@N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
while i@N<=n:
| 22 |
operation
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p>n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
return list(itertools.takewhile(lambda p: p>n, erat2()))
| 16 |
decision
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i-N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
a.append(i-N)
| 23 |
operation
|
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
import itertools
def x( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n+1)
a=[]
for i in x:
N=1
while i**N<=n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ')
|
def x( ):
| 2 |
statement
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*x
print('{} {}'.format(a, b))
|
b-=2*x
| 16 |
statement
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
y-=2*a
print('{} {}'.format(a, b))
|
y-=2*a
| 16 |
statement
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(x>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
while(x>=2*a):
| 15 |
statement
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2<<b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
if a>=2<<b:
| 6 |
operation
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b>=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
s = input().split()
a = int(s[0])
b = int(s[1])
while(a!=0 and b!=0):
if a>=2*b:
while(a>=2*b):
a-=2*b
if a==0:
break
else:
if b<2*a:
break
else:
while(b<=2*a):
b-=2*a
print('{} {}'.format(a, b))
|
while(b<=2*a):
| 15 |
decision
|
while True:
n=int(input())
s=input()
for i in range(0, n-1):
if s[i]==s[i+1] and s[i]!='?':
print('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
while True:
n=int(input())
s=input()
for i in range(0, n-1):
if s[i]==s[i//1] and s[i]!='?':
print('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
if s[i]==s[i//1] and s[i]!='?':
| 6 |
operation
|
while True:
n=int(input())
s=input()
for i in range(0, n-1):
if s[i]==s[i+1] and s[i]!='?':
print('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
while True:
n=int(input())
s=input()
for i in range(0, n^1):
if s[i]==s[i+1] and s[i]!='?':
print('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
for i in range(0, n^1):
| 5 |
operation
|
while True:
n=int(input())
s=input()
for i in range(0, n-1):
if s[i]==s[i+1] and s[i]!='?':
print('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
while True:
n=int(input())
s=input()
for i in range(0, n-1):
if s[i]==s[i+1] and s[i]!='?':
x('No')
break
else:
if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':
print('Yes')
else:
print('No')
break
|
x('No')
| 7 |
statement
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a**2 != 0:
print('No')
exit(0)
print('Yes')
|
if a**2 != 0:
| 18 |
operation
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
z('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
z('No')
| 14 |
statement
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().x()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().x()
| 1 |
statement
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a&2 != 0:
print('No')
exit(0)
print('Yes')
|
if a&2 != 0:
| 18 |
operation
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes')
|
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a&2 != 0:
print('No')
exit(0)
print('Yes')
|
if a&2 != 0:
| 18 |
operation
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+173):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
for j in range(i,n+173):
| 12 |
value
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k)<0 and i + j > k:
count += 1
print(count)
|
if xor(xor(i,j),k)<0 and i + j > k:
| 14 |
decision
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(x,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
for k in range(x,n+1):
| 13 |
statement
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i*j > k:
count += 1
print(count)
|
if xor(xor(i,j),k) == 0 and i*j > k:
| 14 |
operation
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k) == 0 and i + j > k:
count += 1
print(count)
|
import sys
import os
import math
import re
from operator import xor
n = int(input())
count = 0
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(j,n+1):
if xor(xor(i,j),k)<0 and i + j > k:
count += 1
print(count)
|
if xor(xor(i,j),k)<0 and i + j > k:
| 14 |
decision
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)+1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
while x<(len(s)+1):
| 5 |
operation
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x@2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
s=s[:x+1]+s[x@2:]
| 7 |
operation
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x^2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
s=s[:x+1]+s[x^2:]
| 7 |
operation
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s)
|
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except x:
print(s)
else:print(s)
|
except x:
| 9 |
statement
|
s=[]
for i in range(999):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s=[]
for i in range(28):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
for i in range(28):
| 2 |
value
|
s=[]
for i in range(999):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s=[]
for i in range(999):
s+=[i<<i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s+=[i<<i]
| 3 |
operation
|
s=[]
for i in range(999):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s=[]
for i in range(999):
s+=[i@i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s+=[i@i]
| 3 |
operation
|
s=[]
for i in range(999):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
s=[]
for i in range(109):
s+=[i*i]
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in a:
if i not in s:
ans=i
print(ans)
|
for i in range(109):
| 2 |
value
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)&1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
manacount += len(each)&1
| 28 |
operation
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[120], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
joints = [[lx[120], ly[0]]]
| 4 |
value
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-94
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
manacount += len(each)-94
| 28 |
value
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i-1])
|
n = int(input())
lx = list(input())
ly = list(input())
joints = [[lx[0], ly[0]]]
for i in range(0, n):
handlex = 27
handley = 27
x = lx[i]
y = ly[i]
for each in joints:
if (x in each) == True:
handlex = joints.index(each)
if (y in each) == True:
handley = joints.index(each)
if handlex == handley:
if handlex == 27:
joints.append([x,y])
else:
if handlex == 27:
joints[handley].append(x)
elif handley == 27:
joints[handlex].append(y)
else:
joints[handlex].extend(joints[handley])
joints.remove(joints[handley])
manacount = 0
for each in joints:
manacount += len(each)-1
print(manacount)
for each in joints:
for i in range(0, len(each)-1):
print(each[i],each[i%1])
|
print(each[i],each[i%1])
| 32 |
operation
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m*(n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
m = m*(n - 1)
| 15 |
operation
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, y, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
print(1, y, 1)
| 9 |
statement
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
n, m = map(int, input().split())
x = 100003 - (n-1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
x = 100003 - (n-1)
| 3 |
operation
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m==0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
while m==0:
| 19 |
decision
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = i + 1
m = m - 1
|
n, m = map(int, input().split())
x = 100003 - (n - 1)
print(2, 100003)
for i in range(2, n+1):
if i <= n - 2:
print(1, i, 1)
elif i == n - 1:
print(1, i, x)
else:
print(1, n, 2)
m = m - (n - 1)
i = 2
j = 3
while m > 0:
print(i, j, 1000000)
j = j + 1
if j == n + 1:
i = i + 1
j = y + 1
m = m - 1
|
j = y + 1
| 24 |
statement
|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n - positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1) / 2))
print(ans)
|
import math
t = int(input())
for i in range(t):
n, k = map(int, input().split())
positions = list(map(int, input().split()))
ans = max(positions[0], n-positions[-1] + 1)
for j in range(2, k):
ans = max(ans, math.ceil((positions[j] - positions[j - 1] + 1) / 2))
print(ans)
|
ans = max(positions[0], n-positions[-1] + 1)
| 8 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.