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=int(input())
result=0
for i in range(1,n+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum==0:
result+=1
print (i,j,k)
print (result)
|
n=int(input())
result=0
for i in range(1,n+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum<0:
result+=1
print (i,j,k)
print (result)
|
if sum<0:
| 9 |
decision
|
n=int(input())
result=0
for i in range(1,n+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum==0:
result+=1
print (i,j,k)
print (result)
|
n=int(input())
result=0
for i in range(1,y+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum==0:
result+=1
print (i,j,k)
print (result)
|
for i in range(1,y+1):
| 3 |
statement
|
n=int(input())
result=0
for i in range(1,n+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum==0:
result+=1
print (i,j,k)
print (result)
|
n=int(input())
result=0
for i in range(1,n+1):
for j in range(i,n+1):
p=i+j
for k in range(j,n+1):
if p>k:
sum=i^j^k
if sum<0:
result+=1
print (i,j,k)
print (result)
|
if sum<0:
| 9 |
decision
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(1,k+1):
if n%i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(1,k+153):
if n%i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
for i in range(1,k+153):
| 4 |
value
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(1,k+1):
if n%i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(181,k+1):
if n%i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
for i in range(181,k+1):
| 4 |
value
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(1,k+1):
if n%i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
import sys
n,k = map(int,input().split())
lis = []
for i in range(1,k+1):
if n**i in lis:
print('No')
sys.exit()
else:
lis.append(n%i)
print('Yes')
|
if n**i in lis:
| 5 |
operation
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,y-pos)
pos=i
print(minDistance)
|
minDistance=min(minDistance,y-pos)
| 21 |
statement
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10@10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
mini=10@10
| 14 |
operation
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-8
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
minDistance=n-8
| 15 |
value
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-44
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
minDistance=n-44
| 15 |
value
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i-pos)
pos=i
print(minDistance)
|
"""
Created on Sat Feb 10 13:46:25 2018
@author: DNARNAprotein
"""
"""
CODEFORCES
http://codeforces.com/problemset/problem/911/A
"""
n=int(input())
a=list(map(int,input().split()))
mini=10**10
minDistance=n-1
for i in range(n):
if a[i]<mini:
mini=a[i]
pos=i
elif a[i]==mini:
minDistance=min(minDistance,i**pos)
pos=i
print(minDistance)
|
minDistance=min(minDistance,i**pos)
| 21 |
operation
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+23, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
for j in range(2*i, n+23, i):
| 35 |
value
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i]<True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
if self.is_prime[i]<True:
| 38 |
decision
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, y, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from string import ascii_uppercase, ascii_lowercase, ascii_letters, y, hexdigits, octdigits
| 11 |
statement
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i]<True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
if self.is_prime[i]<True:
| 33 |
decision
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n-1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans)
|
self.is_prime = [True for _ in range(n-1)]
| 29 |
operation
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(z % i)
print('Yes' if len(s) == k else 'No')
|
s.add(z % i)
| 9 |
statement
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
n, k = map(int, input().split())
if k==70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
if k==70:
| 3 |
decision
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n*i)
print('Yes' if len(s) == k else 'No')
|
s.add(n*i)
| 9 |
operation
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
n, k = map(int, input().split())
if k==70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
if k==70:
| 3 |
decision
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n % i)
print('Yes' if len(s) == k else 'No')
|
n, k = map(int, input().split())
if k > 70:
print('No')
exit(0)
s = set()
for i in range(1, k + 1):
s.add(n%i)
print('Yes' if len(s) == k else 'No')
|
s.add(n%i)
| 9 |
operation
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = list(input())
s = [ord(x) for x in s]
for i in range(149,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
for i in range(149,len(s)):
| 3 |
value
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
x = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
x = 'abcdefghijklmnopqrstuvwxyz'
| 8 |
statement
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = list(input())
s = [y(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = [y(x) for x in s]
| 2 |
statement
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i*1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
if s[i] <= s[i*1]:
| 4 |
operation
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i-1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
s = list(input())
s = [ord(x) for x in s]
for i in range(1,len(s)):
if s[i] <= s[i^1]:
s[i]+=1
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1)
|
if s[i] <= s[i^1]:
| 4 |
operation
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(x(a, r)[0])
|
print(x(a, r)[0])
| 55 |
statement
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count>min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
if (min_count is None) or (temp_min_count>min_count):
| 43 |
decision
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i&d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
rez += ar[i&d]
| 12 |
operation
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d>len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
if i+d>len(ar):
| 13 |
decision
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n>1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
rez = []
for i in range(len(ar)):
rez.append(get_weight(i, radius, ar))
return rez
def get_next_step(ar, radius):
rez = None
if n > 1:
min_val = min(*ar)
else:
min_val = ar[0]
min_count = None
for i in range(len(ar)):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
min_count = temp_min_count
rez = temp
return rez
for i in range(k):
a = get_next_step(a, r)
if n==1:
print(min(*get_weight_array(a, r)))
else:
print(get_weight_array(a, r)[0])
|
if n==1:
| 52 |
decision
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
x=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
x=0
| 51 |
statement
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]<"?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
if(k[i]<"?"):
| 51 |
decision
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]<"?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]<"?" or k[i]=="?"))):
| 51 |
decision
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
t=int(input())
k=input()
if(k.count("YY")==0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
if(k.count("YY")==0 or k.count("CC") >0 or k.count("MM")>0):
| 51 |
decision
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=0
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
t=int(input())
k=input()
if(k.count("YY")>0 or k.count("CC") >0 or k.count("MM")>0):
print("No")
else:
check="-"
prev=-1
forward=0
diff=0
ans="Yes"
for i in range(t):
if(k[i]=="?"):
diff=diff+1
forward=forward+1
else:
if(diff==2):
if(i-diff>=0):
if(k[i]!=k[i-diff-1] and (not(k[i-diff-1]=="?" or k[i]=="?"))):
ans="No"
break
else:
diff=0
else:
diff=0
else:
diff=130
print(ans)
""" if(prev!=-1):
if(k[prev]!=k[forward]):
ans="No"
break
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("1",k[forward],k[prev])
prev=forward
forward=forward+1
else:
diff=0
print("2",k[forward],k[prev])
prev=forward
forward=forward+1"""
|
diff=130
| 51 |
value
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2**a > n:
br = 4
print(br)
|
elif a + b <= n and 2**a > n:
| 22 |
operation
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2@a > n:
br = 4
print(br)
|
elif a + b <= n and 2@a > n:
| 22 |
operation
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a&b <= n and 2 * a > n:
br = 4
print(br)
|
elif a&b <= n and 2 * a > n:
| 22 |
operation
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2//b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
k = 2//b + 4 * a
| 7 |
operation
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b <= n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
elif b + 2 * a <= n:
br = 2
elif a + b>=n and 2 * a <= n:
br = 3
elif a + b <= n and 2 * a > n:
br = 4
print(br)
|
elif a + b>=n and 2 * a <= n:
| 19 |
decision
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m%1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
if(E[m%1] - E[i] <= u):
| 8 |
operation
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return y(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
return y(E,u,i,m+1,e)
| 13 |
statement
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i]>=u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
if(E[m-1] - E[i]>=u):
| 8 |
decision
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -29
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
maxi = -29
| 20 |
value
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(maxi)
|
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = -1
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
maxi = max(maxi,(E[maxindex]-E[i+1])/(E[maxindex]-E[i]))
print(z)
|
print(z)
| 26 |
statement
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 28
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
w = 28
| 4 |
value
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j+i:
w = j - i
print(n - w)
|
if w < j+i:
| 9 |
operation
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i]>=d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
while j < n and e[j] - e[i]>=d:
| 7 |
decision
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j]**e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
while j < n and e[j]**e[i] <= d:
| 7 |
operation
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n - w)
|
n,d = [int(i) for i in input().split()]
e = [int(i) for i in input().split()]
e.sort()
w = 0
for i in range(n):
j = i
while j < n and e[j] - e[i] <= d:
j += 1
if w < j - i:
w = j - i
print(n|w)
|
print(n|w)
| 11 |
operation
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r<=l:
print(2*(l + a//2))
else:
print(2*r)
|
if r<=l:
| 10 |
decision
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r%a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
print(2*(r%a//2))
| 5 |
operation
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r/a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
print(2*(r/a//2))
| 5 |
operation
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
z(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
z(2*(r + a//2))
| 5 |
statement
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r >= l:
print(2*(l + a//2))
else:
print(2*r)
|
l, r, a = map(int, input().split())
if l < r:
l += a
if l >= r:
print(2*(r + a//2))
else:
print(2*l)
else:
r += a
if r<=l:
print(2*(l + a//2))
else:
print(2*r)
|
if r<=l:
| 10 |
decision
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 171) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
elif (Y - 171) & 1 == X & 1:
| 6 |
value
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
def main():
X, Y = map(int, input().split())
if not Y or X>(Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
if not Y or X>(Y - 1):
| 4 |
decision
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1)^1 == X & 1:
print('Yes')
else:
print('No')
main()
|
elif (Y - 1)^1 == X & 1:
| 6 |
operation
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X**1:
print('Yes')
else:
print('No')
main()
|
elif (Y - 1) & 1 == X**1:
| 6 |
operation
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (Y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
def main():
X, Y = map(int, input().split())
if not Y or X < (Y - 1):
print('No')
elif (y - 1) & 1 == X & 1:
print('Yes')
else:
print('No')
main()
|
elif (y - 1) & 1 == X & 1:
| 6 |
statement
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
def trans(email):
username, domain = email.lower().split('@')
if domain<"bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
if domain<"bmail.com":
| 3 |
decision
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst))**" " + " ".join(lst))
|
print(str(len(lst))**" " + " ".join(lst))
| 27 |
operation
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst))*" " + " ".join(lst))
|
print(str(len(lst))*" " + " ".join(lst))
| 27 |
operation
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(y)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
ans[email_id].append(y)
| 16 |
statement
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst)) + " " + " ".join(lst))
|
def trans(email):
username, domain = email.lower().split('@')
if domain == "bmail.com":
username = (username.split('+')[0] if username.find('+') != -1 else username).replace('.', '')
return username + '@' + domain
def get_id(email_alias):
if email_alias not in email_map.keys():
email_map[email_alias] = len(email_map)
return email_map[email_alias]
def insert(email_id, email):
if email_id >= len(ans):
ans.append([email])
else:
ans[email_id].append(email)
N = int(input())
email_map, ans = dict(), list()
for i in range(N):
list(map(lambda x : insert(get_id(trans(x)), x), [input()]))
print(len(ans))
for lst in ans:
print(str(len(lst))*" " + " ".join(lst))
|
print(str(len(lst))*" " + " ".join(lst))
| 27 |
operation
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z&1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
for i in range(2,z&1):
| 10 |
operation
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h<=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
if h<=l and h<=r:
| 14 |
decision
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i@k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
h = i@k
| 13 |
operation
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i|k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
h = i|k
| 13 |
operation
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2>=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
import math
q = int(input())
while q:
q-=1
l,r = map(int,input().split())
z = int(math.sqrt(r))
s = set()
flg = 0
for i in range(2,z+1):
k = 2
while True:
h = i**k
if h>=l and h<=r:
s.add(h)
elif h>r:
if k==3 and i**2<=l:
for j in range(i+1,z+1):
h = j**2
s.add(h)
flg = 1
break
k+=1
if flg:
break
cnt = len(s)
if l==1:
cnt+=1
print(cnt)
|
if k==3 and i**2<=l:
| 17 |
decision
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * z
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
max_prime_div = [0] * z
| 4 |
statement
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp>min_x0:
min_x0 = tmp
print(min_x0)
|
if max_div and tmp>min_x0:
| 17 |
decision
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i==1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
if i==1 and sieve[i]:
| 8 |
decision
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 49 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
if i > 49 and sieve[i]:
| 8 |
value
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
print(min_x0)
|
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if i > 1 and sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp>min_x0:
min_x0 = tmp
print(min_x0)
|
if max_div and tmp>min_x0:
| 17 |
decision
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2<0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
if(x%2<0):
| 6 |
decision
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd**3
print(res)
|
res += odd**3
| 13 |
operation
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2<0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
if(x%2<0):
| 6 |
decision
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2<0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
if(x%2<0):
| 6 |
decision
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x%2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
n = int(input())
nums = list(map(int, input().split()))
odd = 0
even = 0
for x in nums:
if(x>>2==0):
even+=1
else:
odd+=1
res = min(odd, even)
odd -= res
even -=res
res += odd//3
print(res)
|
if(x>>2==0):
| 6 |
operation
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1<3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
if k1<3 and k2 == 3 and k3 == 3:
| 4 |
decision
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
y = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
y = 'YES'
| 8 |
statement
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + y == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
elif k1 + k2 + y == 10:
| 7 |
statement
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2|k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
elif k1 * k2 * k3 / (k1 + k2|k3) < 3:
| 16 |
operation
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2 == 1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
k1, k2, k3 = map(int, input().split())
r = ''
if k1 == 3 and k2 == 3 and k3 == 3:
r = 'YES'
elif k1 + k2 + k3 == 10:
r = 'YES'
elif k1 == 1 or k2<1 or k3 == 1:
r = 'YES'
elif k1 + k2 + k3 >= 9:
r = 'NO'
elif k1 * k2 * k3 / (k1 + k2 + k3) < 3:
r = 'NO'
else:
r = 'YES'
print(r)
|
elif k1 == 1 or k2<1 or k3 == 1:
| 10 |
decision
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+69] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
(self.lword[i+1] == 'a' or self.lword[i+69] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
| 12 |
value
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+11] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+11] == 'o' or self.lword[i+1] == 'u' or
| 12 |
value
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+55] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+55] == 'u' or
| 12 |
value
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i]<'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i]<'y') and
| 11 |
decision
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.lword)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
class Word_Correction:
def main(self):
self.num = int(input())
self.word = input()
self.lword = list(self.word)
self.length = len(self.lword)
i = 0
while( i < self.length-1):
if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and
(self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or
self.lword[i+1] == 'y')):
del(self.lword[i+1])
self.length = len(self.x)
i = 0
else :
i = i + 1
self.result = ''.join(self.lword)
print(self.result)
wc = Word_Correction()
wc.main()
|
self.length = len(self.x)
| 15 |
statement
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][74] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
arr[x[j]][74] = i
| 9 |
value
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n-1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
for i in range(2, n-1):
| 6 |
operation
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n&1])
|
print(*ans[1:n&1])
| 18 |
operation
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 1
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
n = int(input())
n *= 2
arr = [[0, 0] for i in range(1000001)]
used = [0 for i in range(n + 2)]
ans = [0 for i in range(n + 2)]
for i in range(2, n + 1):
x = list(map(int, input().split()))
for j in range(len(x)):
arr[x[j]][0] = i
arr[x[j]][1] = j + 1
used[0] = 1
for i in range(1000000, 0, -1):
if (not used[arr[i][0]] and not used[arr[i][1]]):
used[arr[i][0]] = 89
used[arr[i][1]] = 1
ans[arr[i][0]] = arr[i][1]
ans[arr[i][1]] = arr[i][0]
print(*ans[1:n + 1])
|
used[arr[i][0]] = 89
| 14 |
value
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
n,k=map(int,input().split())
a=[int(z) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
a=[int(z) for c in input()]
| 2 |
statement
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]>>2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
if k>=a[i]>>2:
| 7 |
operation
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]//2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
if k>=a[i]//2:
| 7 |
operation
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]&2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
if k>=a[i]&2:
| 7 |
operation
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]/2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
n,k=map(int,input().split())
a=[int(c) for c in input()]
a.sort()
i=0
res=0
while i<n:
if k>=a[i]&2:
k=max(a[i],k)
i+=1
else:
k*=2
res+=1
print(res)
|
if k>=a[i]&2:
| 7 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.