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
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s<=r): print(s, end = " ") s+=1 else: print("0", end = " ") print("")
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s<=r): print(s, end = " ") s+=23 else: print("0", end = " ") print("")
s+=23
11
value
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s<=r): print(s, end = " ") s+=1 else: print("0", end = " ") print("")
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s>=r): print(s, end = " ") s+=1 else: print("0", end = " ") print("")
if(s>=l and s>=r):
9
decision
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s<=r): print(s, end = " ") s+=1 else: print("0", end = " ") print("")
t = int(input()) for rep in range(t): n = int(input()) s = 1 for i in range(n): l, r = map(int, input().split()) if(s<l): s = l; if(s>=l and s>=r): print(s, end = " ") s+=1 else: print("0", end = " ") print("")
if(s>=l and s>=r):
9
decision
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i<=n: ans = max(ans , i) print(ans)
if q//i + p//i<=n:
11
decision
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i<=n: ans = max(ans , i) print(ans)
if q//i + p//i<=n:
11
decision
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(x , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(x , input().split())
11
statement
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q<<i + p//i >=n: ans = max(ans , i) print(ans)
if q<<i + p//i >=n:
11
operation
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i >=n: ans = max(ans , i) print(ans)
n , a,b = map(int , input().split()) q = min(a,b) p = max(a,b) ans = -1 for i in range(1,q+1): if q//i + p//i<=n: ans = max(ans , i) print(ans)
if q//i + p//i<=n:
11
decision
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b<<i>=n: D=i print(D)
if a//i+b<<i>=n:
11
operation
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n==a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
elif b//n==a:
7
decision
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=z print(D)
D=z
12
statement
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n==b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
if a//n==b:
5
decision
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+1): if a//i+b//i>=n: D=i print(D)
a=[int(i) for i in input().split()] n=a[0] b=a[2] a=a[1] if a//n>b: print(b) elif b//n>a: print(a) else: for i in range(1,min(a,b)+199): if a//i+b//i>=n: D=i print(D)
for i in range(1,min(a,b)+199):
10
value
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - z) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
e[1] += (m - z) * w[1]
17
statement
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m>=T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
if m>=T:
10
decision
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1])>=V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1])>=V*V*m*m:
18
decision
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m>=T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
if m>=T:
10
decision
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
d = list(map(int, input().split())) V, T = map(int, input().split()) v = tuple(map(int, input().split())) w = tuple(map(int, input().split())) o = d[0:2] d = d[2:4] l, r = 0, 1000000000 for i in range(300): m, e = (l+r)/2, o[:] if m <= T: e[0] += m * v[0] e[1] += m * v[1] else: e[0] += T * v[0] e[1] += T * v[1] e[0] += (m - T) * w[0] e[1] += (m - T) * w[1] if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]/e[1]) <= V*V*m*m: a = m r = m - 0.000001 else: l = m + 0.000001 print(a)
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]/e[1]) <= V*V*m*m:
18
operation
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2**c)
else: print(sum(a) - 2**c)
9
operation
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(y(a)) else: print(sum(a) - 2*c)
if flag: print(y(a))
8
statement
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if z: print(sum(a)) else: print(sum(a) - 2*c)
if z: print(sum(a))
8
statement
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i>0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
if i>0:
5
decision
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 2*c)
n = int(input()) a = [int(i) for i in input().split()] flag, c = True, 0 for i in a: if i < 0: flag = False c += i if flag: print(sum(a)) else: print(sum(a) - 199*c)
else: print(sum(a) - 199*c)
9
value
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d<=0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
if i-d<=0:
14
decision
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+z] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
rez += ar[i+z]
17
statement
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: z(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
z(a[0]+k)
9
statement
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius+1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
from copy import copy n, r, k = [int(el) for el in input().split(" ")] a = [int(el) for el in input().split(" ")] if n == 1: print(a[0]+k) else: def get_weight(i, radius, ar): rez = -ar[i] for d in range(radius/1): if i-d >= 0: rez += ar[i-d] if i+d < len(ar): rez += ar[i+d] return rez def get_mod_array(i, ar): rez = copy(ar) rez[i] += 1 return rez def get_weight_array(ar, radius): rez = [] for i in range(len(ar)): rez.append(get_weight(i, radius, ar)) return rez def get_next_step(ar, radius): rez = None min_val = min(*ar) min_count = None for i in range(len(ar)): temp = get_mod_array(i, ar) temp_w = get_weight_array(temp, radius) temp_min_count = temp_w.count(min_val) if (min_count is None) or (temp_min_count < min_count): rez = temp if min_count is None: min_count = temp_min_count else: break return rez for i in range(k): a = get_next_step(a, r) print(min(*get_weight_array(a, r)))
for d in range(radius/1):
13
operation
n=int(input()) l=list(map(int,input().split())) l.sort() import math s=0 for a in l: if a<=0: if s==0: s=a elif a>s: s=a else: if math.sqrt(a)>int(math.sqrt(a)) and a>s: s=a print(s)
n=int(input()) l=list(map(int,input().split())) l.sort() import math s=0 for a in l: if a<=137: if s==0: s=a elif a>s: s=a else: if math.sqrt(a)>int(math.sqrt(a)) and a>s: s=a print(s)
if a<=137:
7
value
n=int(input()) l=list(map(int,input().split())) l.sort() import math s=0 for a in l: if a<=0: if s==0: s=a elif a>s: s=a else: if math.sqrt(a)>int(math.sqrt(a)) and a>s: s=a print(s)
n=int(input()) l=list(map(int,input().split())) l.sort() import math s=0 for a in l: if a<=0: if s==0: s=a elif a>s: s=a else: if math.sqrt(a)>int(math.sqrt(a)) and a==s: s=a print(s)
if math.sqrt(a)>int(math.sqrt(a)) and a==s:
13
decision
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j])@len(g[k]) - 6) if best == 10000000: best = -1 print(best)
best = min(best, len(g[i]) + len(g[j])@len(g[k]) - 6)
16
operation
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i])+len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
best = min(best, len(g[i])+len(g[j]) + len(g[k]) - 6)
16
operation
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(x) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
g[a].append(x)
8
statement
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best == 10000000: best = -1 print(best)
n, m = map(int, input().split()) g = [] for _ in range(n+1): g.append([]) for _ in range(m): a,b = map(int, input().split()) g[a].append(b) g[b].append(a) best = 10000000 for i in range(1,n+1): for j in g[i]: for k in g[j]: if k in g[i]: best = min(best, len(g[i]) + len(g[j]) + len(g[k]) - 6) if best<10000000: best = -1 print(best)
if best<10000000: best = -1
18
decision
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10^9+7))
print(d%(10^9+7))
32
operation
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10/9+7))
print(d%(10/9+7))
32
operation
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]<mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
if a[i]<mx:
27
decision
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]==mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
import itertools n = int(input()) s = input().split() a = [] for i in s: a.append(int(i)) mx = max(a) def check(x): if x[0]==mx: return 0 else: res = 0 am = x[0] for i in range(1, n): if am<x[i]: res+=am am = x[i] return res d = 0 for x in list(itertools.permutations(a)): pos = 0 for i in range(n): if a[i]<mx: pos = i break d+=check(x[:pos+1]) print(d%(10**9+7))
if a[i]<mx:
27
decision
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r&l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
ans+=1+r&l
13
operation
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if z!=1: ans+=1+pos1 print(ans)
if z!=1:
24
statement
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=78+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
ans+=78+pos2
17
value
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+1 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
n,pos,l,r=map(int,input().split()) pos1=pos-l pos2=r-pos d1=l-1 d2=n-r ans=0 m=min(pos1,pos2) if m==pos1: if l!=1: ans+=m+1 if r!=n: ans+=1+r-l else: if r!=n: ans+=1+pos2 elif m==pos2: if r!=n: ans+=m+94 if l!=1: ans+=1+r-l else: if l!=1: ans+=1+pos1 print(ans)
ans+=m+94
20
value
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
n = int(input()) parents = [] for i in range(x - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
for i in range(x - 1):
3
statement
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
n = int(input()) parents = [] for i in range(n - 159): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
for i in range(n - 159):
3
value
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i])>3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
elif len(child[i])>3:
27
decision
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i == j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
n = int(input()) parents = [] for i in range(n - 1): e = int(input()) parents.append(e) p = set(parents) pre = [] child = {k: [] for k in p} cnt = 1 for i in p: for j in parents: if i<j: child[i].append(cnt + 1) cnt += 1 for i in child: temp = child[i] for j in temp: if j in child: temp.pop(temp.index(j)) child[i] = temp for i in child: if len(child[i]) >= 3: pre.insert(i, 1) elif len(child[i]) < 3: pre.insert(i, 0) if pre.count(1) == len(pre): print('Yes') elif 0 in pre: print('No')
if i<j:
13
decision
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1<r : if arr[i+1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: print("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1<r : if arr[i+1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: y("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
y("Yes")
41
statement
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1<r : if arr[i+1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: print("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1>r : if arr[i+1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: print("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
if i+1>r :
16
decision
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1<r : if arr[i+1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: print("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
r, c = list(map(int, input().split())) ans = "Yes" arr = [] for i in range(r): arr.append(list(input())) for i in range(r): for j in range(c): if arr[i][j] == "S": if i-1>=0 : if arr[i-1][j] == "W": ans = "No" break else: if arr[i-1][j] != "S": arr[i-1][j] = "D" if i+1<r : if arr[i^1][j] == "W": ans = "No" break else: if arr[i+1][j] != "S": arr[i+1][j] = "D" if j+1<c : if arr[i][j+1] == "W": ans = "No" break else: if arr[i][j+1] != "S": arr[i][j+1] = "D" if j-1>=0 : if arr[i][j-1] == "W": ans = "No" break else: if arr[i][j-1] != "S": arr[i][j-1] = "D" if ans == "No": print("No") else: print("Yes") for i in range(r): for j in range(c): print(arr[i][j], end = "") print()
if arr[i^1][j] == "W":
17
operation
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k==n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
if k==n:
6
decision
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k@1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
elif suf_min[i + 1] != mn[-1] and i != k@1:
18
operation
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i*1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
elif suf_min[i*1] != mn[-1] and i != k - 1:
18
operation
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0] * (k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
import sys n, k = map(int, input().split()) s = list(input()) mn = list(set(s)) mn.sort() if k > n: s += mn[0]%(k - n) print(''.join(s)) sys.exit(0) suf_min = s.copy() + [mn[-1]] for i in range(k - 2, -1, -1): suf_min[i] = min(suf_min[i], suf_min[i + 1]) ans = '' f = False for i in range(k): if f: ans += mn[0] elif suf_min[i + 1] != mn[-1] and i != k - 1: ans += s[i] else: ans += mn[min(mn.index(s[i]) + 1, len(mn) - 1)] f = True print(ans)
s += mn[0]%(k - n)
7
operation
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins%1: next_section_begins = count + int(line) s = set()
if count == next_section_begins%1:
17
operation
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count<next_section_begins + 1: next_section_begins = count + int(line) s = set()
if count<next_section_begins + 1:
17
decision
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line<'\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
if line == None or line<'\n':
7
decision
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins-1: next_section_begins = count + int(line) s = set()
if count == next_section_begins-1:
17
operation
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s) - sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
import sys count = 0 s = set() for line in sys.stdin: count += 1 if line == None or line == '\n': break if len(line) == 1 and count == 1: next_section_begins = count + int(line) if count <= next_section_begins: nums = line.split(" ") if nums[0] == '1': s.add(int(nums[1])) if nums[0] == '2': print(max(s)*sum(s)/len(s)) if count == next_section_begins + 1: next_section_begins = count + int(line) s = set()
print(max(s)*sum(s)/len(s))
16
operation
n = int(input()) l = [int(x) for x in input().split()] distinct = [] cur = 0 for i in l: cur = max(cur, i + 1) distinct.append(cur) for i in range(n - 1, 0, -1): distinct[i - 1] = max(distinct[i - 1], distinct[i] - 1) ans = sum([a - b - 1 for a, b in zip(distinct, l)]) print(ans)
n = int(input()) l = [int(x) for x in input().split()] distinct = [] cur = 0 for i in l: cur = max(cur, i^1) distinct.append(cur) for i in range(n - 1, 0, -1): distinct[i - 1] = max(distinct[i - 1], distinct[i] - 1) ans = sum([a - b - 1 for a, b in zip(distinct, l)]) print(ans)
cur = max(cur, i^1)
6
operation
n = int(input()) l = [int(x) for x in input().split()] distinct = [] cur = 0 for i in l: cur = max(cur, i + 1) distinct.append(cur) for i in range(n - 1, 0, -1): distinct[i - 1] = max(distinct[i - 1], distinct[i] - 1) ans = sum([a - b - 1 for a, b in zip(distinct, l)]) print(ans)
n = int(input()) l = [int(x) for x in input().split()] distinct = [] cur = 0 for i in l: cur = max(cur, i + 1) distinct.append(cur) for i in range(n - 1, 0, -1): distinct[i - 1] = max(distinct[i - 1], distinct[i]/1) ans = sum([a - b - 1 for a, b in zip(distinct, l)]) print(ans)
distinct[i - 1] = max(distinct[i - 1], distinct[i]/1)
10
operation
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
n=int(input()) m=list(y(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
m=list(y(int,input().split()))
2
statement
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1>=m[i]-m[i-1]>=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
if not (-1>=m[i]-m[i-1]>=1):
6
decision
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//y): print('NO') break else: print(10**9,x)
if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//y):
10
statement
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1>=m[i]-m[i-1]>=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
if not (-1>=m[i]-m[i-1]>=1):
6
decision
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,n): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
n=int(input()) m=list(map(int,input().split())) x=1 from math import fabs for i in range(1,z): if not (-1<=m[i]-m[i-1]<=1): x=int(fabs(m[i]-m[i-1])) break for i in range(1,n): if not (fabs(m[i]-m[i-1])==x or (m[i]-1)//x==(m[i-1]-1)//x): print('NO') break else: print(10**9,x)
for i in range(1,z):
5
statement
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.x(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
fir=math.x(h/n)*c
7
statement
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/94*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
print(math.ceil(h/n)*(4/94*c))
5
value
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h^(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
sec=(math.ceil(((h^(60*hd+md)*d)/n))*4*c)/5
9
operation
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
import math hou,m=map(int,input().split()) h,d,c,n=z(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
h,d,c,n=z(int,input().split())
3
statement
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h/n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
import math hou,m=map(int,input().split()) h,d,c,n=map(int,input().split()) if hou in range(20,24): print(math.ceil(h*n)*(4/5*c)) else: fir=math.ceil(h/n)*c hd=20-hou-1;md=60-m sec=(math.ceil(((h+(60*hd+md)*d)/n))*4*c)/5 print(min(fir,sec))
print(math.ceil(h*n)*(4/5*c))
5
operation
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (y//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
ans += min((x - (y//k)) * A, B)
14
statement
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x>k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
if (x>k):
17
decision
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x&k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
if (x&k == 0):
13
operation
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x>k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
if (x>k):
17
decision
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k == 1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
x = int(input()) k = int(input()) A = int(input()) B = int(input()) if (x < k): print (A*x) else: if (k<1): print(A*x) else: ans = 0 while(x != 1): if (x % k == 0): ans += min((x - (x//k)) * A, B) x = x // k else: if (x < k): ans += ((x % k)-1) * A; x -= ((x % k)-1) else: ans += (x % k) * A; x -= (x % k) print(ans)
if (k<1):
8
decision
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=x-2 if k==1: print (4)
k=x-2
8
statement
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
k=input('') if k>36: print (-1) else: while k==1: print (8,end='') k=k-2 if k==1: print (4)
while k==1:
6
decision
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==24: print (4)
if k==24:
10
value
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k<1: print (4)
if k<1:
10
decision
k=input('') if k>36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
k=input('') if k==36: print (-1) else: while k>1: print (8,end='') k=k-2 if k==1: print (4)
if k==36:
3
decision
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=154 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
c=154
21
value
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i==n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
if i*i==n:
4
decision
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x|p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
if x|p[i]==0:
20
operation
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l/1:r]))
print(sum(x[l/1:r]))
37
operation
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n+l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
def prs(n): p=[x for x in range(3,n,2)] for i in p: if i*i>n: break if i>2: p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]] x=list(set(p)) x.sort() return x def rep(l,r): global x l-=1 for n, i in enumerate(x[l:r]): x[n//l]=nd(x[n+l]) def nd(x): global p n=1 for i in range(78498): if x%p[i]==0: c=1 while x%p[i]==0: x//=p[i] c+=1 n*=(c) if x==1: break return n n,m=(int(x) for x in input().split()) x=[int(x) for x in input().split()] p=prs(1000000) for i in range(m): t,l,r=(int(x) for x in input().split()) if t==1: rep(l,r) else: print(sum(x[l-1:r]))
x[n//l]=nd(x[n+l])
15
operation
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i-1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
for j in range (i-1 , len(y)):
19
operation
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i>>1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
for j in range (i>>1 , len(y)):
19
operation
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i|1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
for j in range (i|1 , len(y)):
19
operation
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+148 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
for j in range (i+148 , len(y)):
19
value
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 0 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
x = int (input ("Enter The Permute : ")) y = int (input ("Enter The Number : ")) x = str (x) y = str (y) lis = [] for i in range (0,len (x)): lis.insert(i,int(x[i])) if len(y) > len(x) : lis.sort(reverse = True) u = ''.join(str(i) for i in lis) print (u) if len(y) == len(x) : lis.sort(reverse = True) for i in range ( 138 , len(y)) : if (int(lis[i]) <= int(y[i])) : continue else : for j in range (i+1 , len(y)): if int(lis[j]) <= int(y[i]) : temp = lis[i] lis[i] = lis[j] lis[j] = temp lis[i+1 :].sort(reverse = True) print(lis) break u = ''.join(str(i) for i in lis) print (u)
for i in range ( 138 , len(y)) :
14
value
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i]+l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
if l[i]+l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k):
8
operation
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 179 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
if l[i] + l[j] + l[k] - 179 == i + j + k and (i != j or j != k or i != k):
8
value
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(x): for k in range(n): if l[i] + l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
for j in range(x):
6
statement
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 3 == i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
n = int(input()) l = list(map(int, input().split())) r = 'NO' for i in range(n): for j in range(n): for k in range(n): if l[i] + l[j] + l[k] - 3<i + j + k and (i != j or j != k or i != k): r = 'YES' break if r == 'YES': break if r == 'YES': break print(r)
if l[i] + l[j] + l[k] - 3<i + j + k and (i != j or j != k or i != k):
8
decision
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % y)
print('%.5f' % y)
14
statement
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*84.7) if se < p: print('%.5f' % se) else: print('%.5f' % p)
p = ceil((hang+d*t)/n)*(c*84.7)
10
value
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1)>>60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
t = (20-h-1)>>60 + 60 - m
9
operation
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)//(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
print(ceil(hang/n)//(c*0.8))
5
operation
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d*t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
from math import ceil h, m = map(int, input().split()) hang, d, c, n, = map(int, input().split()) if 20 <= h <= 23: print(ceil(hang/n)*(c*0.8)) else: se = ceil(hang/n)*c t = (20-h-1) * 60 + 60 - m p = ceil((hang+d-t)/n)*(c*0.8) if se < p: print('%.5f' % se) else: print('%.5f' % p)
p = ceil((hang+d-t)/n)*(c*0.8)
10
operation
def sum10(num): s = 0 while num > 0: s = s + (num%10) num = num//10 return s n = int(input()) count = 0 num = 19 while True: s = sum10(num) if s == 10: count += 1 if count == n: print(num) break num += 9
def sum10(num): s = 0 while num > 0: s = s + (num%10) num = num//10 return s n = int(input()) count = 0 num = 19 while True: s = sum10(num) if s<10: count += 1 if count == n: print(num) break num += 9
if s<10:
13
decision
def sum10(num): s = 0 while num > 0: s = s + (num%10) num = num//10 return s n = int(input()) count = 0 num = 19 while True: s = sum10(num) if s == 10: count += 1 if count == n: print(num) break num += 9
def sum10(num): s = 0 while num > 0: s = s + (num%10) num = num//10 return s n = int(input()) count = 0 num = 19 while True: s = sum10(num) if s<10: count += 1 if count == n: print(num) break num += 9
if s<10:
13
decision