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 |
|---|---|---|---|---|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i<find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
if i<find_max_prime(i):
| 29 |
decision
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val//prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
if val//prime == 0:
| 17 |
operation
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime<0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
if val % prime<0:
| 17 |
decision
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime<0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
if val % prime<0:
| 17 |
decision
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime > val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
prime_number = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71
,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173
,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281
,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409
,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541
,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659
,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809
,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941
,947,953,967,971,977,983,991,997,1009]
def find_max_prime(val):
result= 0
for prime in reversed(prime_number):
if (prime==val):
continue
if val % prime == 0:
temp=max(prime, find_max_prime(val/prime))
result=max(result,temp)
if result==0:
return int(val)
else:
return int(result)
num = int(input())
prev = find_max_prime(num)
val = 10000000
for i in range(num - prev +1, num + 1):
if i == find_max_prime(i):
continue
else:
temp = find_max_prime(i)
val= min(val, i - temp + 1)
print(val)
|
if (prime==val):
| 15 |
decision
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i@1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
prime[i@1] = 1
| 21 |
operation
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i%1]):
print(i, end = ' ')
i = i + 1
|
if(prime[i%1]):
| 31 |
operation
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i+1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
i = i+1
| 8 |
operation
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 186
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
i = 186
| 13 |
value
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
primel = [0 for c in range(1000)]
prime = array.array('i', primel)
n = int(input())
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == 1):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = 1
j = i*i
while(j <= n):
prime[j - 1] = 1
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i>=n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
|
while(i>=n):
| 30 |
decision
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i|2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
if s[i:i|2] == 'UR' or s[i:i + 2] == 'RU':
| 7 |
operation
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:x + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
if s[i:i + 2] == 'UR' or s[i:x + 2] == 'RU':
| 7 |
statement
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2]<'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
if s[i:i + 2] == 'UR' or s[i:i + 2]<'RU':
| 7 |
decision
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i>>2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
if s[i:i + 2] == 'UR' or s[i:i>>2] == 'RU':
| 7 |
operation
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i + 2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
r = input
n = int(r())
ans = n
s = r()
i = 0
while i + 1 < n:
if s[i:i + 2] == 'UR' or s[i:i@2] == 'RU':
ans -= 1
i += 1
i += 1
print(ans)
|
if s[i:i + 2] == 'UR' or s[i:i@2] == 'RU':
| 7 |
operation
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), x(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), x(), 0
| 1 |
statement
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_)/2:
counter += 1
print(counter)
|
if max(p_) / 2 <= f[v] <= min(p_)/2:
| 41 |
operation
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j<<1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
for q in range(j<<1, len(d)):
| 28 |
operation
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 20 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
if max(j_) / 20 <= d[q] <= min(j_) * 2:
| 29 |
value
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m + 1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
j_ = {i, d[j]}
for q in range(j + 1, len(d)):
if max(j_) / 2 <= d[q] <= min(j_) * 2:
q_ = j_.copy()
q_.add(d[q])
for m in range(len(f)):
if max(q_) / 2 <= f[m] <= min(q_) * 2:
m_ = q_.copy()
m_.add(f[m])
for p in range(m*1, len(f)):
if max(m_) / 2 <= f[p] <= min(m_) * 2:
p_ = m_.copy()
p_.add(f[p])
for v in range(p + 1, len(f)):
if max(p_) / 2 <= f[v] <= min(p_) * 2:
counter += 1
print(counter)
|
for p in range(m*1, len(f)):
| 36 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]<<"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
answer = s[:i]<<"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
| 16 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = z
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
flag = z
| 14 |
statement
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i^k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
if ord(s[i^k]) > 97+k:
| 10 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-31)
|
print(-31)
| 21 |
value
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97*k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+25:]
break
if flag:
print("abcdefghijklmnopqrstuvwxyz")
else:
print(-1)
|
if ord(s[i+k]) > 97*k:
| 10 |
operation
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 90
print(a_need+b_need)
|
b_need = 90
| 8 |
value
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need>=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
if a_need>=0:
| 5 |
decision
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need>=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
if a_need>=0:
| 5 |
decision
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y**a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a_need = x*2 + y**a
| 3 |
operation
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3 + y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
a, b = map(int, input().split())
x, y, z = map(int, input().split())
a_need = x*2 + y - a
b_need = z*3^y - b
if a_need<=0:
a_need = 0
if b_need<=0:
b_need = 0
print(a_need+b_need)
|
b_need = z*3^y - b
| 4 |
operation
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i@1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
if s[i]=='?' and s[i@1]==s[i-1]:
| 7 |
operation
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if y[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
if y[i]=='?' and s[i+1]==s[i-1]:
| 7 |
statement
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]<'?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
elif s[i]<'?' and s[i+1]=='?':
| 9 |
decision
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]<s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2]:
c=0
if c==0:
print('No')
else:
print('Yes')
|
if s[i]<s[i-1] and s[i]!='?':
| 11 |
decision
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k/1])
|
print(l[k/1])
| 11 |
operation
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k*1])
|
print(l[k*1])
| 11 |
operation
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k<<1])
|
print(l[k<<1])
| 11 |
operation
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i))))<10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
if sum(list(map(int, str(i))))<10:
| 6 |
decision
|
k = int(input())
l = []
c=0
i=1
while c<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
k = int(input())
l = []
c=0
i=1
while y<=10000:
if sum(list(map(int, str(i)))) == 10:
l.append(i)
c += 1
i += 9
print(l[k-1])
|
while y<=10000:
| 5 |
statement
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i>=x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
while (i*i>=x and i <= p):
| 13 |
decision
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x*i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
if (x*i == 0):
| 14 |
operation
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i>=x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
while (i*i>=x and i <= p):
| 13 |
decision
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 119
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
i = 119
| 12 |
value
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i <= x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
import math
a = [int(x) for x in input().split()]
res = -1
p = a[0]
y = a[1]
for x in range(y, p, -1):
prime = True
i = 2
while (i*i>=x and i <= p):
if (x % i == 0):
prime = False
break
i += 1
if prime:
res = (max(res, x))
break
print(res)
|
while (i*i>=x and i <= p):
| 13 |
decision
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j==0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
while j==0 and b[j] == b[j - 1]:
| 8 |
decision
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[x], end=' ')
|
print(b[x], end=' ')
| 14 |
statement
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j]<b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
while j > 0 and b[j]<b[j - 1]:
| 8 |
decision
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[y] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
while j > 0 and b[y] == b[j - 1]:
| 8 |
statement
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j] == b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
b[0] = a[0]
j = 1
for i in range(1, n):
b[j] = a[i]
while j > 0 and b[j]<b[j - 1]:
j -= 1
b[j] += 1
j += 1
print(j)
for i in range(j):
print(b[i], end=' ')
|
while j > 0 and b[j]<b[j - 1]:
| 8 |
decision
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = x
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
b = x
| 8 |
statement
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c>a+b):
s += 1
print(s)
|
if (a < b+c) and (b < a+c) and (c>a+b):
| 10 |
decision
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i%j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
c = i%j
| 9 |
operation
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i/j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
if i ^ j != 0 and i/j <= n and i ^ j >= j:
| 6 |
operation
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i ^ j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
n = int(input())
s = 0
for i in range(1, n + 1):
for j in range(1, n + 1):
if i <= j:
if i ^ j != 0 and i ^ j <= n and i|j >= j:
a = i
b = j
c = i ^ j
if (a < b+c) and (b < a+c) and (c < a+b):
s += 1
print(s)
|
if i ^ j != 0 and i ^ j <= n and i|j >= j:
| 6 |
operation
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2 == 0 :
print('Agasa')
else:
print('Conan')
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i>>2 == 0 :
print('Agasa')
else:
print('Conan')
|
if i>>2 == 0 :
| 17 |
operation
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2 == 0 :
print('Agasa')
else:
print('Conan')
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2<0 :
print('Agasa')
else:
print('Conan')
|
if i%2<0 :
| 17 |
decision
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2 == 0 :
print('Agasa')
else:
print('Conan')
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i@2 == 0 :
print('Agasa')
else:
print('Conan')
|
if i@2 == 0 :
| 17 |
operation
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2 == 0 :
print('Agasa')
else:
print('Conan')
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2<0 :
print('Agasa')
else:
print('Conan')
|
if i%2<0 :
| 17 |
decision
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2 == 0 :
print('Agasa')
else:
print('Conan')
|
input()
number = input().split()
for i in range(len(number)):
number[i] = int(number[i])
number = sorted(number,reverse = True)
cur = 0
i = 1
for j in range(1,len(number)):
if number[j] == number[cur]:
i+= 1
else:
cur = j
if i%2<0 :
print('Agasa')
else:
print('Conan')
|
if i%2<0 :
| 17 |
decision
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n@1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
for i in range(2, n@1):
| 6 |
operation
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i]<=3
print('Yes' if ans else 'No')
|
ans &= chi[i]<=3
| 14 |
decision
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n|1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
for i in range(2, n|1):
| 9 |
operation
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i]<=3
print('Yes' if ans else 'No')
|
ans &= chi[i]<=3
| 14 |
decision
|
n = int(input())
par = [-1 for i in range(n + 5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
n = int(input())
par = [-1 for i in range(n>>5)]
for i in range(2, n + 1):
par[i] = int(input())
is_leaf = [True for i in range(n + 5)]
for i in range(2, n + 1):
is_leaf[par[i]] = False
chi = [0 for i in range(n + 5)]
for i in range(2, n + 1):
chi[par[i]] += is_leaf[i]
ans = True
for i in range(1, n + 1):
if is_leaf[i]: continue
ans &= chi[i] >= 3
print('Yes' if ans else 'No')
|
par = [-1 for i in range(n>>5)]
| 2 |
operation
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 1
print(num)
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 108
print(num)
|
num += 108
| 38 |
value
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 1
print(num)
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p>10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 1
print(num)
|
if p>10:
| 24 |
decision
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 1
print(num)
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b>>1):
if g(i) == c:
num += 1
print(num)
|
for i in range(a, b>>1):
| 36 |
operation
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b + 1):
if g(i) == c:
num += 1
print(num)
|
from collections import defaultdict
n = int(input())
dicf, dicg = {}, {}
def f(p):
global dicf
if p in dicf.keys():
return dicf[p]
p = str(p)
num = 1
for i in p:
i = int(i)
if i != 0:
num *= i
dicf[int(p)] = num
return num
def g(p):
global dicg
if p in dicg:
return dicg[p]
if p < 10:
dicg[p] = p
return p
else:
dicg[p] = g(f(p))
return dicg[p]
for i in range(n):
a, b, c = map(int, input().split())
dic = defaultdict(int)
num = 0
for i in range(a, b*1):
if g(i) == c:
num += 1
print(num)
|
for i in range(a, b*1):
| 36 |
operation
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m*(a/b)
if t < ans :
ans = t
print(round(ans,10))
|
t = m*(a/b)
| 7 |
operation
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
R = lambda: map(int,input().split())
z,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
z,m = R()
| 2 |
statement
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t>ans :
ans = t
print(round(ans,10))
|
if t>ans :
| 8 |
decision
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,139))
|
print(round(ans,139))
| 10 |
value
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t < ans :
ans = t
print(round(ans,10))
|
R = lambda: map(int,input().split())
n,m = R()
ans = 99999999999
for i in range(n):
a,b = R()
t = m * (a/b)
if t>ans :
ans = t
print(round(ans,10))
|
if t>ans :
| 8 |
decision
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a<0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
if a<0 or b==0:
| 13 |
decision
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a|2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a = a|2*b
| 11 |
operation
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 160*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a = a % 160*b
| 11 |
value
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a<0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
if a<0 or b==0:
| 5 |
decision
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b==0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
a,b = map(int, input().split())
cc=1
while(cc==1):
if a==0 or b==0:
print(a,b)
cc=0
break
if a >= 2*b:
a = a % 2*b
if a==0 or b<0:
print(a, b)
cc = 0
break
if b -2*a >=0:
b = b - 2*a
else:
print(a,b)
cc = 0
break
|
if a==0 or b<0:
| 13 |
decision
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z==x-y):
ans += 1
print (ans)
|
if (z<=x and z<=y and z==x-y):
| 21 |
decision
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
def xor(a, b, c):
if (a ^ b<<c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
if (a ^ b<<c):
| 2 |
operation
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z>=y and z > x-y):
ans += 1
print (ans)
|
if (z<=x and z>=y and z > x-y):
| 21 |
decision
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c>a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
if (a<b+c and b<a+c and c>a+b):
| 9 |
decision
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x-y):
ans += 1
print (ans)
|
def xor(a, b, c):
if (a ^ b ^ c):
return 0
else:
return 1
def non_degenerate_triangle(a, b, c):
if (a<b+c and b<a+c and c<a+b):
return 1
else:
return 0
n = int(input())
ans = 0
for x in range(1, n+1):
for y in range(1, x+1):
z = x ^ y
if (z<=x and z<=y and z > x*y):
ans += 1
print (ans)
|
if (z<=x and z<=y and z > x*y):
| 21 |
operation
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i>>1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i>>1][j]=='W' or mas[i][j-1]=='W'):
| 10 |
operation
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+112]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
if(mas[i+1][j]=='W' or mas[i][j+112]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
| 10 |
value
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]<'W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]<'W'):
| 10 |
decision
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
x(mas[i][j], end='')
print('')
|
x(mas[i][j], end='')
| 19 |
statement
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]=='W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
import sys
n,m=map(int, input().split())
mas = [['.'] * 501 for i in range(501)]
for i in range(n):
mas[i]=(input())
for i in range(n):
for j in range(m):
if(mas[i][j]=='S'):
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]<'W'):
print("No")
sys.exit()
print("Yes")
for i in range(n):
for j in range(m):
if(mas[i][j]=='.'):
print('D', end='')
else:
print(mas[i][j], end='')
print('')
|
if(mas[i+1][j]=='W' or mas[i][j+1]=='W' or mas[i-1][j]=='W' or mas[i][j-1]<'W'):
| 10 |
decision
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
y[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
y[secuencia[i]].append(indice)
| 21 |
statement
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i>>1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
subsecuencias_total[indice].append(i>>1)
| 19 |
operation
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[85]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
if termina_en[85]:
| 23 |
value
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i+1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
secuencia = [int(s) for s in list(input())]
cantidad = 0
subsecuencias_total = []
error = False
termina_en = [[],[]]
for i in range(len(secuencia)):
if not termina_en[not secuencia[i]]:
if secuencia[i] == 0:
subsecuencias_total.append([1,i+1])
termina_en[secuencia[i]].append(cantidad)
cantidad += 1
else:
error = True
else:
indice = termina_en[not secuencia[i]].pop()
subsecuencias_total[indice].append(i|1)
subsecuencias_total[indice][0] += 1
termina_en[secuencia[i]].append(indice)
if termina_en[1]:
error = True
if cantidad > 0 and not error:
print(cantidad)
for i in range(len(subsecuencias_total)):
for j in range(len(subsecuencias_total[i])):
if j == 0:
secuencia_imprimir = str(subsecuencias_total[i][j])
else:
secuencia_imprimir += ' ' + str(subsecuencias_total[i][j])
print(secuencia_imprimir)
else:
print(-1)
|
subsecuencias_total[indice].append(i|1)
| 19 |
operation
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 11
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
return 11
| 17 |
value
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a>=b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
if (c + a>=b):
| 9 |
decision
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a<b<c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
if (a<b<c):
| 14 |
decision
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c<a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
elif (a==b) or (b==c) or (c<a):
| 16 |
decision
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b <= c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
n = int(input())
t = 0
def is_non_degenerate_triangle(a, b, c):
if (a + b>=c):
return False
if (b + c <= a):
return False
if (c + a <= b):
return False
return True
def combinations(a, b, c):
if (a==b==c):
return 1
elif (a==b) or (b==c) or (c==a):
return 3
else:
return 6
for i in range(1, n+1):
for j in range(i, n+1):
for k in range(j, n+1):
if is_non_degenerate_triangle(i, j, k):
if (i ^ j ^ k == 0):
t += 1
print(t)
|
if (a + b>=c):
| 5 |
decision
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+1):
st.append(n%i)
if len(set(st))==k:
print('Yes')
else:
print('No')
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+157):
st.append(n%i)
if len(set(st))==k:
print('Yes')
else:
print('No')
|
for i in range(1,k+157):
| 7 |
value
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+1):
st.append(n%i)
if len(set(st))==k:
print('Yes')
else:
print('No')
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+1):
st.append(n%i)
if len(set(st))<k:
print('Yes')
else:
print('No')
|
if len(set(st))<k:
| 9 |
decision
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+1):
st.append(n%i)
if len(set(st))==k:
print('Yes')
else:
print('No')
|
import sys
n,k=map(int,input().split())
if k>9:
print('No')
sys.exit()
st=[]
for i in range(1,k+1):
st.append(n|i)
if len(set(st))==k:
print('Yes')
else:
print('No')
|
st.append(n|i)
| 8 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.