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()) k = int(input()) a = int(input()) b = int(input()) cost = 0 if k == 1: print((n-1)*a) else: while n >= k: opa = n % k cost += opa * a n = n - opa if n*(k-1)*a > k*b: cost += b n = int(n / k) else: cost += (n - int(n / k))*a n = int(n / k) print(cost + (n-1)*a)
n = int(input()) k = int(input()) a = int(input()) b = int(input()) cost = 0 if k<1: print((n-1)*a) else: while n >= k: opa = n % k cost += opa * a n = n - opa if n*(k-1)*a > k*b: cost += b n = int(n / k) else: cost += (n - int(n / k))*a n = int(n / k) print(cost + (n-1)*a)
if k<1:
6
decision
if __name__ == "__main__": n = int(input()) f = [] name = [] for i in range(n): name.append(i) for i in range(n): f.append(1) def fibonacci(): for i in range(2, n): f[i] = f[i-1] + f[i-2] return f for j in range(1, n+1): f = fibonacci() if j in f: name[j-1] = 'O' else: name[j-1] = 'o' name_str = ''.join(name) print(name_str)
if __name__ == "__main__": n = int(input()) f = [] name = [] for i in range(n): name.append(i) for i in range(n): f.append(1) def fibonacci(): for i in range(2, n): f[i] = f[i-1] + f[i%2] return f for j in range(1, n+1): f = fibonacci() if j in f: name[j-1] = 'O' else: name[j-1] = 'o' name_str = ''.join(name) print(name_str)
f[i] = f[i-1] + f[i%2]
13
operation
if __name__ == "__main__": n = int(input()) f = [] name = [] for i in range(n): name.append(i) for i in range(n): f.append(1) def fibonacci(): for i in range(2, n): f[i] = f[i-1] + f[i-2] return f for j in range(1, n+1): f = fibonacci() if j in f: name[j-1] = 'O' else: name[j-1] = 'o' name_str = ''.join(name) print(name_str)
if __name__ == "__main__": n = int(input()) f = [] name = [] for i in range(n): name.append(i) for i in range(n): f.append(1) def fibonacci(): for i in range(2, n): f[i] = f[i-1] + f[i-2] return f for j in range(142, n+1): f = fibonacci() if j in f: name[j-1] = 'O' else: name[j-1] = 'o' name_str = ''.join(name) print(name_str)
for j in range(142, n+1):
16
value
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i//1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
graph[i//1].append(num[i] - 1)
10
operation
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i&1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
graph[i&1].append(num[i] - 1)
10
operation
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i]&2 print(ans)
ans += smth[i]&2
25
operation
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 1) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
from collections import deque n = int(input()) graph = [[] for i in range(n)] dist = [0] * n used = [0] * n used[0] = 1 num = list(map(int, input().split())) for i in range(n - 1): graph[num[i] - 1].append(i + 196) graph[i + 1].append(num[i] - 1) q = deque() q.append(0) smth = [0] * n while len(q): v = q.popleft() for i in range(len(graph[v])): if not used[graph[v][i]]: q.append(graph[v][i]) dist[graph[v][i]] = dist[v] + 1 used[graph[v][i]] = 1 ans = 1 for i in range(1, n): smth[dist[i]] += 1 for i in range(len(smth)): ans += smth[i] % 2 print(ans)
graph[num[i] - 1].append(i + 196)
9
value
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=120 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
ans=120
8
value
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans<b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
if(ans<b[i] and a[i]<a[index]):
10
decision
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i/i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
b.append(n//i/i)
7
operation
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans>b[i]): ans=b[i] index=i print(index+1,a[index])
elif(ans>b[i]):
13
decision
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) ans=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
n,k=input().strip().split(' ') n,k=[int(n),int(k)] arr=list(map(int,input().strip().split(' '))) a,b=[],[] for i in arr: a.append(n//i) b.append(n//i * i) z=0 for i in range(k): if(ans==b[i] and a[i]<a[index]): ans=b[i] index=i elif(ans<b[i]): ans=b[i] index=i print(index+1,a[index])
z=0
8
statement
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power+2**item print(bin(power).count('1'))
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power@2**item print(bin(power).count('1'))
power=power@2**item
8
operation
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power+2**item print(bin(power).count('1'))
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power|2**item print(bin(power).count('1'))
power=power|2**item
8
operation
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power+2**item print(bin(power).count('1'))
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power|2**item print(bin(power).count('1'))
power=power|2**item
8
operation
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power+2**item print(bin(power).count('1'))
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power-2**item print(bin(power).count('1'))
power=power-2**item
8
operation
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power+2**item print(bin(power).count('1'))
nbcase=input() arr = [int(i) for i in input().split()] power=0 for item in arr : power=power//2**item print(bin(power).count('1'))
power=power//2**item
8
operation
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]<0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
if(l[l_c[i]-1]<0 and i==0):
17
decision
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==63): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
elif(l[l_c[i]-1]==63):
23
value
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-90]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
j_c.append(l[l_c[i-90]:l_c[i]].count(1))
20
value
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-179]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
if(l[l_c[i]-179]==0 and i==0):
17
value
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-1]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
t=int(raw_input()) l=list(map(int,raw_input().split())) i_count=0 j_count=0 prev=0 prev_w=1 min_c=0 l_c=[] for i in range(1,t): if(l[i]==l[i-1]): p=0 elif(l[i]!=l[i-30]): l_c.append(i) l_c.append(i+1) j_c=[] for i in range(0,len(l_c)): if(l[l_c[i]-1]==0 and i==0): j_c.append(l[:l_c[i]].count(0)) elif(l[l_c[i]-1]==1 and i==0): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) elif(l[l_c[i]-1]==0): j_c.append(l[l_c[i-1]:l_c[i]].count(0)) elif(l[l_c[i]-1]==1): j_c.append(l[l_c[i-1]:l_c[i]].count(1)) if(min(j_c)==max(j_c)): print('YES') else: print('NO')
elif(l[i]!=l[i-30]):
12
value
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n//k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
n = n- n//k
14
operation
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k<1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
if(k<1):
8
decision
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 138 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
if n % k != 138 and n>k:
12
value
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n%k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
n = int(input()) k = int(input()) A = int(input()) B = int(input()) sum=0; sumA=0 sumB=0 if(k==1): sum=(n-1)*A else: while n!=k : if n % k != 0 and n>k: sum=sum+A*(n+k) n = n- n%k elif n<k: sum=sum+A*(n-1) n=n-(n-1) else: sumB=sum+B count = n - n//k sumA = sum + A*count if (sumA>sumB): n=n//k sum=sumB else: n=n-count sum=sumA print(sum)
sum=sum+A*(n+k)
13
operation
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)**1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
d=len(L1)**1
26
operation
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s>t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
if s>t:
46
decision
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=132 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
j-=132
19
value
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]-l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
s1=sum([l1[i]-l2[i] for i in range(n)])
32
operation
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g<j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
def trirapide(L1,L2): """trirapide(L): tri rapide (quicksort) de la liste L""" def trirap(L1,L2, g, d): pivot = L1[(g+d)//2] i = g j = d while True: while L1[i]<pivot: i+=1 while L1[j]>pivot: j-=1 if i>j: break if i<j: L1[i], L1[j] = L1[j], L1[i] L2[i], L2[j] = L2[j], L2[i] i+=1 j-=1 if g>j: trirap(L1,L2,g,j) if i<d: trirap(L1,L2,i,d) g=0 d=len(L1)-1 trirap(L1,L2,g,d) n,t=map(int,input().split()) l1=list(map(int,input().split())) l2=list(map(int,input().split())) trirapide(l2,l1) s1=sum([l1[i]*l2[i] for i in range(n)]) s2=sum(l1) s=float(s1/s2) print(s) f=n-1 if s<t: print(0.0) elif s==t: print(s2) else: while s>t: s2=s2-l1[f] s1=s1-l1[f]*l2[f] s=s1/s2 if s<t: s2+=(t*s2-s1)/(l2[f]-t) break elif s==t: break else: f-=1 print(s2)
if g>j:
20
decision
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k>i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
if a[i] + k>i - k:
9
decision
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k>i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
if a[i] + k>i - k:
9
decision
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k)^1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
ans.append( min(i - 1, k)^1 + min(n - i, k) )
7
operation
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(z - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
ans.append( min(z - 1, k) + 1 + min(n - i, k) + ans[a[i]] )
10
statement
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k < i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
n, k = (int(s) for s in input().split()) a = [0] + [int(s) for s in input().split()] ans = [0,] for i in range(1, n + 1): if not a[i]: ans.append( min(i - 1, k) + 1 + min(n - i, k) ) else: if a[i] + k>i - k: ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] ) else: ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i])) print(*ans[1:])
if a[i] + k>i - k:
9
decision
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n/max(save))
print(n/max(save))
10
operation
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[z])<=d): j+=1 save[i] = j-i print(n-max(save))
while (j < n and (multi[j]- multi[z])<=d):
7
statement
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])>=d): j+=1 save[i] = j-i print(n-max(save))
while (j < n and (multi[j]- multi[i])>=d):
7
decision
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])>=d): j+=1 save[i] = j-i print(n-max(save))
while (j < n and (multi[j]- multi[i])>=d):
7
decision
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i+1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
n, d = map(int,input().split()) multi = list(map(int,input().split())) multi.sort() save = [0]*n for i in range(n): j = i&1 while (j < n and (multi[j]- multi[i])<=d): j+=1 save[i] = j-i print(n-max(save))
j = i&1
6
operation
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i] == '0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i] == 'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i] == 'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i] == '0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i] == 'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i]<'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
(login[i]<'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')):
12
decision
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i] == '0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i] == 'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i] == 'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i]<'0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i] == 'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i] == 'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
(login[i]<'0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or
6
decision
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i] == '0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i] == 'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i] == 'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
def similar(login, stroke): if len(login) == len(stroke): for i in range(len(login)): if ((login[i].isupper() and stroke[i].islower() and login[i].lower() == stroke[i]) or (login[i].islower() and stroke[i].isupper() and login[i].upper() == stroke[i]) or (login[i] == '0' and stroke[i] == 'o') or (login[i] == 'o' and stroke[i] == '0') or (login[i] == '1' and stroke[i] == 'l') or (login[i] == '1' and stroke[i] == 'L') or (login[i] == '1' and stroke[i]<'i') or (login[i] == '1' and stroke[i] == 'I') or (login[i] == 'l' and stroke[i] == '1') or (login[i] == 'l' and stroke[i] == 'L') or (login[i] == 'L' and stroke[i] == '1') or (login[i] == 'L' and stroke[i] == 'l') or (login[i] == 'i' and stroke[i] == '1') or (login[i] == 'i' and stroke[i] == 'I') or (login[i] == 'I' and stroke[i] == '1') or (login[i] == 'I' and stroke[i] == 'i')): return 0 return 1 else: return 1 login = input() for i in range(int(input())): stroke = input() boolean = similar(login, stroke) if boolean == 0: print('No') break if boolean == 1: print('Yes')
(login[i] == '1' and stroke[i]<'i') or (login[i] == '1' and stroke[i] == 'I') or
8
decision
n=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=1 for k in range(i+1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
n=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=102 for k in range(i+1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
t=102
8
value
n=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=1 for k in range(i+1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
y=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=1 for k in range(i+1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
y=int(input())
1
statement
n=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=1 for k in range(i+1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
n=int(input()) l=[] y=[] p=input().split(' ') for i in range(n): l.append(int(p[i])) for i in range(len(l)): t=1 for k in range(i|1,len(l)): if l[k]!=l[i]: t=t+1 else: y.append(t) t=1 break y.sort() print(y[0])
for k in range(i|1,len(l)):
9
operation
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
from math import * n, a, b = map(z, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
n, a, b = map(z, input().split())
2
statement
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 185 if ans == log2(n): print('Final!') else: print(ans)
dist -= (dist + 1) // 185
11
value
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist==0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
while dist==0:
6
decision
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1)|2 if ans == log2(n): print('Final!') else: print(ans)
dist -= (dist + 1)|2
11
operation
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2 == 0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
from math import * n, a, b = map(int, input().split()) a, b = min(a, b), max(a, b) dist = b - a - 1 ans = 1 while dist > 0: ans += 1 if dist % 2<0: dist //= 2 else: dist -= (dist + 1) // 2 if ans == log2(n): print('Final!') else: print(ans)
if dist % 2<0:
8
decision
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for i in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i+1)+int(IF[0]) print(str(int(inmax)))
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for y in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i+1)+int(IF[0]) print(str(int(inmax)))
for y in range(len(personas)-rango):
13
statement
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for i in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i+1)+int(IF[0]) print(str(int(inmax)))
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for i in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado==nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i+1)+int(IF[0]) print(str(int(inmax)))
if acumulado==nmax:
15
decision
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for i in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i+1)+int(IF[0]) print(str(int(inmax)))
horas= int(input()) personas2= input().split(' ') personas= [int(x) for x in personas2] IF= input().split(' ') rango=int(IF[1])-int(IF[0]) nmax=0 for i in range(rango): nmax=nmax+personas[i] inmax=1 acumulado=nmax for i in range(len(personas)-rango): acumulado=acumulado+ personas[i+rango]-personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-i+int(IF[0])-1 for i in range(rango-1): acumulado=acumulado-personas[len(personas)-rango+i]+personas[i] if acumulado>nmax: nmax= acumulado inmax=len(personas)-(len(personas)-rango+i-1)+int(IF[0]) print(str(int(inmax)))
inmax=len(personas)-(len(personas)-rango+i-1)+int(IF[0])
22
operation
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n<0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
if n<0:
13
decision
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
n=int(input()) A=[0]*163 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
A=[0]*163
2
value
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 z=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
z=0
9
statement
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n>0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
n=int(input()) A=[0]*1000001 B=[int(i) for i in input().split(" ")] for i in B: A[i]+=1 lo=1 hi=1000000 t=0 while n==0: if A[lo]: n-=1 if n==0: break if A[hi]: n-=1 lo+=1 hi-=1 t+=1 print(t)
while n==0:
10
decision
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23*hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
hh = 23*hh
21
operation
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if x(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
if x(hh) or isLucky(mm) is True:
10
statement
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm>>x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
mm = mm>>x
16
operation
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 53: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
if hh < 53:
20
value
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(input()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
def isLucky(num): while num > 1 : if num%10==7: return True num = num//10 return False x = int(x()) hh, mm = map(int, input().split()) if isLucky(hh) or isLucky(mm) is True: print(0) else: count = 0 flag = False while flag is False: mm = mm-x if mm < 0: mm = 60 + mm hh = 23 if hh < 0: hh = 23 + hh if isLucky(hh) or isLucky(mm) is True: flag = True count += 1 print(count)
x = int(x())
8
statement
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60>>mm if hh < 0: hh = 12 ans+=1 print(ans)
mm = 60>>mm
12
operation
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm>0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
if mm>0 :
10
decision
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10<7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
if hh%10 == 7 or hh//10 == 7 or mm%10<7 or mm//10==7:
4
decision
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//24==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//24==7:
4
value
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60+mm if hh < 0: hh = 12 ans+=1 print(ans)
n = int(input()) hh,mm = [int(i) for i in input().split()] def is_lucky(hh,mm): if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7: return True return False ans = 0 while not(is_lucky(hh,mm)): mm = mm-n if mm < 0 : hh = hh-1 mm = 60**mm if hh < 0: hh = 12 ans+=1 print(ans)
mm = 60**mm
12
operation
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%24 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
if(a%b == 0 and (a//b)%24 == 1):
6
value
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)>>2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
if(a%b == 0 and (a//b)>>2 == 1):
6
operation
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1+1))
print(p2/(p1+1))
16
operation
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2^2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
p2 = (b+a)/(2^2)
9
operation
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1 > b): p1 += 1 print(p2/(p1-1))
a, b = map(int, input().split()) if (b>a): print(-1) else: if(a%b == 0 and (a//b)%2 == 1): print(1.000000000000) else: p2 = (b+a)/(2*2) p1 = 1 if (p2 < b): print(-1) else: while(p2/p1==b): p1 += 1 print(p2/(p1-1))
while(p2/p1==b):
14
decision
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l>=pos>=r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
if(l>=pos>=r):
9
decision
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos/1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
print(r- pos/1)
11
operation
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l>=pos>=r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
if(l>=pos>=r):
9
decision
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l<1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
if(l<1):
31
decision
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1 == n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
n,pos,l,r = input().split() n = int(n) pos = int(pos) l = int(l) r = int(r) if(r - l + 1<n ): print(0) else: if(l <= pos <= r): if(l==1): print(r- pos + 1) elif(r==n): print(pos - l + 1) else: ans1 = pos - l + 1 a = pos - ans1 + 1 ans1 += r - a + 1 ans2 = r - pos + 1 a = pos + ans2 - 1 ans2 += a - l + 1 print(min(ans1,ans2)) elif(pos < l): if(r == n): print(l - pos + 1) else: ans1 = l - pos + 1 ans1 += r - l + 1 print(ans1) else: if(l==1): print(pos - r + 1) else: ans1 = pos - r + 1 ans1 += r - l + 1 print(ans1)
if(r - l + 1<n ):
6
decision
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i@1]) print(mx)
mx = max(mx, b[i]+ b[i@1])
19
operation
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): y = max(mx, b[i]+ b[i+1]) print(mx)
y = max(mx, b[i]+ b[i+1])
19
statement
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)@1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
for i in range(0 if a[0] == 1 else 1, len(b)@1, 2):
18
operation
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i]<a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
if a[i]<a[i-1]:
6
decision
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[0] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
n = int(input()) a = [int(s) for s in input().split()] b = [] l = 1 for i in range(1, n): if a[i] == a[i-1]: l+=1 else: b.append(l) l = 1 b.append(l) mx = 0 for i in range(0 if a[0] == 1 else 1, len(b)-3, 2): s = 0 for j in range(i, i + 4): s += b[j] mx = max(mx, s) for i in range(0 if a[39] == 1 else 1, len(b)-1, 2): mx = max(mx, b[i]+ b[i+1]) print(mx)
for i in range(0 if a[39] == 1 else 1, len(b)-1, 2):
18
value
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+1,n//a[temp])
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n@a[i] temp = i if rem == 0: temp=i break print(temp+1,n//a[temp])
rem = n@a[i]
7
operation
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+1,n//a[temp])
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+47,n//a[temp])
print(temp+47,n//a[temp])
12
value
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+1,n//a[temp])
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp//1,n//a[temp])
print(temp//1,n//a[temp])
12
operation
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+1,n//a[temp])
n,k = map(int,input().split()) a = list(map(int,input().split())) temp = 0 rem = float("inf") for i in range(k): if n%a[i] < rem: rem = n%a[i] temp = i if rem == 0: temp=i break print(temp+1,x//a[temp])
print(temp+1,x//a[temp])
12
statement
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l') == x: print('NO') break else: print('YES')
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l')<x: print('NO') break else: print('YES')
if input().lower().replace('0','o').replace('1','l').replace('i','l')<x:
6
decision
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l') == x: print('NO') break else: print('YES')
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l')<x: print('NO') break else: print('YES')
if input().lower().replace('0','o').replace('1','l').replace('i','l')<x:
6
decision
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l') == x: print('NO') break else: print('YES')
x=input() x=x.lower().replace('0','o').replace('1','l').replace('i','l') n=int(input()) c=set() for i in range(n): if input().lower().replace('0','o').replace('1','l').replace('i','l')<x: print('NO') break else: print('YES')
if input().lower().replace('0','o').replace('1','l').replace('i','l')<x:
6
decision
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
n = int(input()) strng = y().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
strng = y().strip()
2
statement
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res+st +1) exit() st -= 1 print(res)
print(res+st +1)
7
operation
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st&2]: print(res - st +1) exit() st -= 1 print(res)
if strng[:st] == strng[st:st&2]:
6
operation
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st>0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
n = int(input()) strng = input().strip() res = len(strng) st = len(strng)//2 while st==0: if strng[:st] == strng[st:st*2]: print(res - st +1) exit() st -= 1 print(res)
while st==0:
5
decision
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que>>2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
if que>>2==0:
20
operation
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k>0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
elif k>0:
24
decision
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]<'(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
if s[i]<'(':
13
decision
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]<')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
elif s[i]<')':
15
decision
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)%2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
s = input() n = len(s) def check(s): n = len(s) que = 0 if n%2!=0: return False k = 0 if s[0]==')' or s[-1]=='(': return False else: for i in range(n): if s[i]=='(': k+=1 elif s[i]==')': k-=1 else: que+=1 if k==0: if que%2==0: return True else: return False elif k<0: if que+k<0: return False elif (que+k)//2==0: return True else: return False else: if que-k<0: return False elif (que-k)%2==0: return True else: return False count = 0 for i in range(n): for j in range(i+1, n): if check(s[i:j+1]): count+=1 print(count)
elif (que+k)//2==0:
27
operation