solution
stringlengths
10
159k
difficulty
int64
0
3.5k
language
stringclasses
2 values
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; for (int i = 0; i < t; i++) { long x, y; double a, b; cin >> x >> y >> a >> b; double diff = y - x; double s = diff / (b + a); if (((long)s) == s) cout << ((long)s) << '\n'; else cout << -1 << '\n'; } }
800
CPP
#include <bits/stdc++.h> using namespace std; int main() { int n, a; vector<int> vec; cin >> n; vec.resize(n); for (int i = 0; i < n; i++) { cin >> a; vec[a - 1] = i + 1; } for (int i = 0; i < n; i++) { cout << vec[i] << " "; } return 0; }
800
CPP
#include <bits/stdc++.h> using namespace std; int len; int jj[1050]; char str[1050]; int rec[26]; bool judge(int x) { if (x == 2) return true; if (x == 1) return false; if (jj[x] == 1) return true; if (jj[x] == 0 && 2 * x <= len) return true; return false; } int main() { memset(jj, 0, sizeof(jj)); for (int i = 2; i <= 1000; i++) { if (!jj[i]) { for (int j = i + i; j <= 1000; j += i) jj[j] = 1; } } while (~scanf("%s", str)) { memset(rec, 0, sizeof(rec)); len = strlen(str); for (int i = 0; i < len; i++) { rec[str[i] - 'a']++; } int M = 0, Mnum = rec[0]; for (int i = 1; i < 26; i++) { if (Mnum < rec[i]) { Mnum = rec[i]; M = i; } } char haha = M + 'a'; int ok = 1; for (int i = 0; i < len; i++) { if (!judge(i + 1)) continue; else { if (str[i] == haha) continue; else { ok = 0; for (int j = 0; j < len; j++) { if (!judge(j + 1) && str[j] == haha) { ok = 1; char tmp = str[i]; str[i] = str[j]; str[j] = tmp; break; } } if (ok == 0) break; } } } if (ok == 0) printf("NO\n"); else { printf("YES\n"); printf("%s\n", str); } } return 0; }
1,300
CPP
#CodeForces #Beautiful Year #Python 3.6.5 def isBeautiful(year): numberSet = set() for i in year: if i in numberSet: return isBeautiful( str(int(year) + 1)) else: numberSet.add(i) print(year) import sys year = int(input()) isBeautiful(str(year + 1))
800
PYTHON3
""" Author : co_devil Chirag Garg Institute : JIIT """ from math import * from sys import stdin, stdout import itertools import os import sys import threading from collections import deque, Counter, OrderedDict, defaultdict from heapq import * #from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd # from bisect import bisect_left,bisect_right # from decimal import *,threading from fractions import Fraction mod = int(pow(10, 9)+7) def ii(): return int(input()) def si(): return str(input()) def mi(): return map(int, input().split()) def li(): return list(mi()) def fii(): return int(stdin.readline()) def fsi(): return str(stdin.readline()) def fmi(): return map(int, stdin.readline().split()) def fli(): return list(fmi()) abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25} def getKey(item): return item[0] def sort2(l): return sorted(l, key=getKey) def d2(n, m, num): return [[num for x in range(m)] for y in range(n)] def isPowerOfTwo(x): return (x and (not (x & (x - 1)))) def decimalToBinary(n): return bin(n).replace("0b", "") def ntl(n): return [int(i) for i in str(n)] def powerMod(x, y, p): res = 1 x %= p while y > 0: if y & 1: res = (res * x) % p y = y >> 1 x = (x * x) % p return res graph = defaultdict(list) visited = [0] * 1000000 col = [-1] * 1000000 def bfs(d, v): q = [] q.append(v) visited[v] = 1 while len(q) != 0: x = q[0] q.pop(0) for i in d[x]: if visited[i] != 1: visited[i] = 1 q.append(i) print(x) def make_graph(e): d = {} for i in range(e): x, y = mi() if x not in d: d[x] = [y] else: d[x].append(y) if y not in d: d[y] = [x] else: d[y].append(x) return d def gr2(n): d = defaultdict(list) for i in range(n): x, y = mi() d[x].append(y) return d def connected_components(graph): seen = set() def dfs(v): vs = set([v]) component = [] while vs: v = vs.pop() seen.add(v) vs |= set(graph[v]) - seen component.append(v) return component ans = [] for v in graph: if v not in seen: d = dfs(v) ans.append(d) return ans def primeFactors(n): s = set() while n % 2 == 0: s.add(2) n = n // 2 for i in range(3, int(sqrt(n)) + 1, 2): while n % i == 0: s.add(i) n = n // i if n > 2: s.add(n) return s def find_all(a_str, sub): start = 0 while True: start = a_str.find(sub, start) if start == -1: return yield start start += len(sub) def SieveOfEratosthenes(n, isPrime): isPrime[0] = isPrime[1] = False for i in range(2, n): isPrime[i] = True p = 2 while (p * p <= n): if (isPrime[p] == True): i = p * p while (i <= n): isPrime[i] = False i += p p += 1 return isPrime def dijkstra(edges, f, t): g = defaultdict(list) for l, r, c in edges: g[l].append((c, r)) q, seen, mins = [(0, f, ())], set(), {f: 0} while q: (cost, v1, path) = heappop(q) if v1 not in seen: seen.add(v1) path = (v1, path) if v1 == t: return (cost, path) for c, v2 in g.get(v1, ()): if v2 in seen: continue prev = mins.get(v2, None) next = cost + c if prev is None or next < prev: mins[v2] = next heappush(q, (next, v2, path)) return float("inf") def binsearch(a, l, r, x): while l <= r: mid = l + (r-1)//2 print(mid) if a[mid]: return mid elif a[mid] > x: l = mid-1 else: r = mid+1 return -1 x, y = mi() n = ii() a = x b = y c = y-x n -= 1 if n % 6 == 0: print(a % mod) if n % 6 == 1: print(b % mod) if n % 6 == 2: print(c % mod) if n % 6 == 3: print(-a % mod) if n % 6 == 4: print(-b % mod) if n % 6 == 5: print(-c % mod)
1,300
PYTHON3
""" Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob. Right now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight. Limak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year. After how many full years will Limak become strictly larger (strictly heavier) than Bob? Input The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10) — the weight of Limak and the weight of Bob respectively. Output Print one integer, denoting the integer number of years after which Limak will become strictly larger than Bob. """ limak, bob = [int(x) for x in input().split(' ')] year = 0 while 1: if limak > bob: break else: limak = limak * 3 bob = bob * 2 year = year + 1 print(year)
800
PYTHON3
# -*- coding: utf-8 -*- """ Created on Tue Sep 17 01:53:39 2019 @author: Aaditya """ n = int(input()) print(n ** 2 + (n - 1) ** 2)
800
PYTHON3
for _ in range(int(input())): n=int(input()) a=list(map(int,input().split())) x=max(a) print(x+(sum(a)-x)/(n-1))
800
PYTHON3
#import sys #sys.stdin = open("input.in","r") #sys.stdout = open("test.out","w") n=int(input()) l=list() for i in range(n): l.append(input()) m=a=0 for i in range(n): for j in l[i]: if(j=='C'): a+=1 m+=round(a*(a-1)/2) a=0 for i in range(n): for j in range(n): if(l[j][i]=='C'): a+=1 m+=round(a*(a-1)/2) a=0 print(m)
800
PYTHON3
for _ in range(int(input())): a, b = tuple(map(int, input().split())) if (a == b) or (a == 2 and b < 4) or (a == 3 and b < 4) or a > 3: print("YES") else: print("NO")
1,000
PYTHON3
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 33; int cnt[N + 1]; int main() { int n; scanf("%d", &n); int x; for (int i = 0; i < n; i++) { scanf("%d", &x); cnt[x]++; } int ans = 0; for (int i = 0; i < N; i++) { if (cnt[i] % 2) { ans++; } cnt[i + 1] += cnt[i] / 2; } printf("%d\n", ans); return 0; }
1,500
CPP
n, m = [int(x) for x in input().split()] flip = False for i in range(1,n+1): if i % 2 != 0: print(m * "#") else: if flip == False: print("." * (m-1) + "#") flip = True elif flip == True: print("#" + "." * (m - 1)) flip = False
800
PYTHON3
n=int(input()) sa=set(map(int,input().split())) if len(sa)>3: print(-1) elif len(sa)==1: print(0) else: sa=sorted(sa) if len(sa)==2: diff=sa[1]-sa[0] if diff%2==0: print(diff//2) else: print(diff) else: if sa[1]-sa[0]==sa[2]-sa[1]: print(sa[1]-sa[0]) else: print(-1)
1,200
PYTHON3
#include <bits/stdc++.h> using namespace std; const int N = 500010; int n, a[N], m, ans[N]; struct P { int l, r, id; }; P q[N], A[N]; struct Base { int ba[20]; void clr() { for (int i = (0), ied = (19); i <= ied; i++) ba[i] = 0; } void ins(int x) { for (int i = (19), ied = (0); i >= ied; i--) if (x & (1 << i)) { if (!ba[i]) { ba[i] = x; return; } x ^= ba[i]; } } int qry() { int res = 0; for (int i = (19), ied = (0); i >= ied; i--) if ((res ^ ba[i]) > res) res ^= ba[i]; return res; } }; Base lx[N], rx[N]; Base merge(Base x, Base y) { Base res; for (int i = (0), ied = (19); i <= ied; i++) res.ba[i] = x.ba[i]; for (int i = (19), ied = (0); i >= ied; i--) if (y.ba[i]) res.ins(y.ba[i]); return res; } void solve(int l, int r, int L, int R) { if (L > R) return; if (l >= r) { for (int i = (L), ied = (R); i <= ied; i++) ans[q[i].id] = a[l]; return; } int mid = (l + r) >> 1; Base u; lx[mid].clr(), rx[mid + 1].clr(); lx[mid].ins(a[mid]), rx[mid + 1].ins(a[mid + 1]); for (int i = (mid - 1), ied = (l); i >= ied; i--) lx[i] = lx[i + 1], lx[i].ins(a[i]); for (int i = (mid + 2), ied = (r); i <= ied; i++) rx[i] = rx[i - 1], rx[i].ins(a[i]); for (int i = (L), ied = (R); i <= ied; i++) if ((q[i].l <= mid) & (q[i].r > mid)) u = merge(lx[q[i].l], rx[q[i].r]), ans[q[i].id] = u.qry(); int lb = L, rb = R; for (int i = (L), ied = (R); i <= ied; i++) if ((q[i].l <= mid) ^ (q[i].r > mid)) { if (q[i].l <= mid) A[lb++] = q[i]; else A[rb--] = q[i]; } for (int i = (L), ied = (R); i <= ied; i++) q[i] = A[i]; solve(l, mid, L, lb - 1), solve(mid + 1, r, rb + 1, R); } int main() { scanf("%d", &n); for (int i = (1), ied = (n); i <= ied; i++) scanf("%d", &a[i]); scanf("%d", &m); for (int i = (1), ied = (m); i <= ied; i++) scanf("%d%d", &q[i].l, &q[i].r), q[i].id = i; solve(1, n, 1, m); for (int i = (1), ied = (m); i <= ied; i++) printf("%d\n", ans[i]); return 0; }
2,500
CPP
#include <bits/stdc++.h> using namespace std; long long int a[2 * 100005]; long long int last[2 * 100005]; int main() { std::ios::sync_with_stdio(false); long long int n, q; cin >> n >> q; for (long long int i = 1; i <= n; i++) { cin >> a[i]; last[a[i]] = i; } map<long long int, long long int> ma; long long int mx = 0; long long int las = 1; long long int ans = 0; long long int freq = 0; for (long long int i = 1; i <= n; i++) { if (i > mx) { ans += ((i - las) - freq); ma.clear(); las = i; freq = 0; } ma[a[i]]++; mx = max(mx, last[a[i]]); freq = max(freq, ma[a[i]]); } ans += (n + 1 - las) - freq; cout << ans; return 0; }
2,000
CPP
#include <bits/stdc++.h> using namespace std; int main() { int i, n, j; double ans1 = 0, ans3 = 0, ans2, d = 1; cin >> n; double ara[n]; for (i = 0; i < n; i++) { cin >> ara[i]; ans1 = max(ara[i], ans1); } sort(ara, ara + n); ans2 = ara[n - 1]; for (i = n - 1; i > -1; i--) { ans3 = ans3 * (1 - ara[i]) + d * ara[i]; d = d * (1 - ara[i]); if (ans3 > ans2) ans2 = ans3; } printf("%.12lf\n", ans2); return 0; }
1,800
CPP
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { int n; cin >> n; pair<long long, long long> arr[n]; for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second; sort(arr, arr + n); vector<pair<long long, long long> > taken; int cur = 0; for (int i = 0; i < n; i++) { pair<long long, long long> x = arr[i]; if (x.first <= i) { long long maxV = 0; for (int j = 0; j < (long long)taken.size(); j++) { maxV = max(maxV, taken[j].second); } if (x.second < maxV) { for (int j = 0; j < (long long)taken.size(); j++) { if (taken[j].second == maxV) { taken[j] = x; break; } } } } else { long long maxV = 0; bool replaced = false; for (int j = 0; j < (long long)taken.size(); j++) { if (taken[j].first <= i) maxV = max(maxV, taken[j].second); } for (int j = 0; j < (long long)taken.size(); j++) { if (taken[j].second == maxV && taken[j].first <= i) { taken[j] = x; replaced = true; break; } } if (!replaced) { taken.push_back(x); } } } long long ans = 0; for (pair<long long, long long> x : taken) ans += x.second; cout << ans << "\n"; } }
2,300
CPP
import math n, a, b = map(int, input().strip().split()) min_sq = n * 6 if a * b >= min_sq: print('{}\n{} {}'.format(a * b, a, b)) else: max_sq = math.inf swap = False if a > b: a, b = b, a swap = True a_n, b_n = a, b for i in range(a, int(math.ceil(math.sqrt(min_sq))) + 1): n_b = int(math.ceil(min_sq / i)) if n_b < b: continue new_sq = n_b * i if new_sq < max_sq: max_sq = new_sq a_n = i b_n = n_b if swap: a_n, b_n = b_n, a_n print('{}\n{} {}'.format(max_sq, a_n, b_n))
2,000
PYTHON3
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; while (t--) { int n; cin >> n; string s; cin >> s; int count = 0; for (int i = 0; i < n - 1; i++) { if (s[i] == 'R' && s[i + 1] == 'U' || s[i] == 'U' && s[i + 1] == 'R') { count++; i++; } } cout << n - count; cout << endl; } return 0; }
800
CPP
t = int(input()) for i in range(t): a, diff = map(int, input().split()) if diff>a: print(diff-a) else: if(diff%2==0 and a%2==1) or (diff%2==1 and a%2==0): print(1) else: print(0)
900
PYTHON3
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10, LOG = 60; int n, go[maxn * LOG][2], cnt[maxn * LOG], sz; vector<long long> ans; int newNode() { go[sz][0] = go[sz][1] = -1; return sz++; } void Add(long long x) { int v = 0; cnt[v]++; for (int i = LOG - 1; i >= 0; i--) { int y = x >> i & 1; if (go[v][y] == -1) go[v][y] = newNode(); v = go[v][y]; cnt[v]++; } } long long Solve(int cur, bool dec) { int v = 0; long long ret = 0; if (dec) cnt[v]--; for (int i = LOG - 1; i >= 0; i--) { if (i > cur) { if (cnt[go[v][0]] == 0) return -1; v = go[v][0]; } else if (i == cur) { if (cnt[go[v][1]] == 0) return -1; v = go[v][1]; ret += 1LL << i; } else { if (cnt[go[v][0]]) { v = go[v][0]; } else { v = go[v][1]; ret += 1LL << i; } } if (dec) cnt[v]--; } return ret; } long long Query(long long x) { for (int i = 0; i < LOG; i++) { int y = x >> i & 1; if (!y && Solve(i, false) != -1) { return Solve(i, true); } } return -1; } int main() { newNode(); scanf("%d", &n); for (int i = 0; i < n; i++) { long long x; scanf("%lld", &x); Add(x); } long long cur = 0; for (int i = 0; i < n; i++) { long long t = Query(cur); if (t != -1) ans.push_back(t), cur ^= t; else return !printf("No"); } puts("Yes"); for (int i = 0; i < n; i++) printf("%lld ", ans[i]); return 0; }
2,200
CPP
#include <bits/stdc++.h> using namespace std; long long int a[1000006]; int main() { long long int mod, t, k = 0, i, m, n, x, j = 0, l, c = 0, r = 0, w, s = 0, d = 0, f = 0, sum = 0, mul, mx1, mx, s1 = 10000000, s2 = 0; cin >> n; for (i = 1; i <= n; i++) { cin >> a[i]; } k = 1e5 + 1; c = 0; cout << n + 1 << endl; for (i = n; i >= 1; i--) { d = a[i] + c; d %= k; cout << "1 " << i << " "; if (d <= i) { f = i - d; cout << f << endl; c += f; } else { f = (k - d) + i; cout << f << endl; c += f; } a[i] += c; } cout << endl << "2 " << n << " " << k << endl; return 0; }
1,400
CPP
#include <bits/stdc++.h> using namespace std; int main() { int t, arr[1001], ans = 0, x = 0, y = 0; cin >> t >> arr[0]; for (int i = 1; i < t; i++) { cin >> arr[i]; for (int j = 0; j < i; j++) { if (arr[j] < arr[i]) x = 1; else if (arr[j] > arr[i]) y = 1; else if (arr[j] == arr[i]) { y = 0; x = 0; j = i; } } if ((x == 1 && y == 0) || (x == 0 && y == 1)) ans++; x = 0; y = 0; } cout << ans << endl; return 0; }
800
CPP
y = input() n = int(y) + 1 while True: s = set() for i in str(n): s.add(i) if len(s) == len(str(n)): print(n) break else: n += 1
800
PYTHON3
ar=input().lower() br=input().lower() if ar==br: print(0) else: ar=[str(i) for i in ar] br=[str(i) for i in br] for x in range(len(ar)): if ar[x]>br[x]: print(1) break elif br[x]>ar[x]: print(-1) break else: pass
800
PYTHON3
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; string s; cin >> s; string pref; int l = 0; while (l < n && s[l] == '0') pref += '0', l++; s = s.substr(l); int r = s.size() - 1; string suf; while (r > -1) { suf += s[r]; if (s[r] == '0') break; r--; } reverse(suf.begin(), suf.end()); cout << pref + suf << "\n"; } }
1,200
CPP
st = input() n = eval(st) st = input() nums = st.split(' ') num = [int]*n sum = 0 for i in range(0,n): num[i] = eval(nums[i]) sum = sum + num[i] for i in range(0,n-1): for j in range(0,n-i-1): if num[j]<num[j+1]: tmp = num[j] num[j] = num[j+1] num[j+1] = tmp count = 0 i = 0 while (count*2 <= sum)and(i<n): count=count+num[i] i = i + 1 print(i)
900
PYTHON3
n = int(input()) ans = 0 for i in range(1, (n//2)+1): if (n-i)/i == int((n-i)/i): ans+=1 print(ans)
800
PYTHON3
#include <bits/stdc++.h> using namespace std; void solve() { int64_t a, b, k, m; cin >> a >> b >> k >> m; vector<int64_t> v1(a), v2(b); for (int64_t i = 0; i < a; i++) cin >> v1[i]; for (int64_t i = 0; i < b; i++) cin >> v2[i]; bool posible = false; for (int64_t i = 0; i < b; i++) { if (v1[k - 1] < v2[i]) { if (b - (i + 1) + 1 >= m) posible = true; break; } } if (posible) cout << "YES\n"; else cout << "NO\n"; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int64_t test = 1; while (test--) { solve(); } return 0; }
900
CPP
#include <bits/stdc++.h> using namespace std; const int dx[6] = {-1, -2, -1, 1, 2, 1}, dy[6] = {-2, 0, 2, 2, 0, -2}; int main() { long long n; cin >> n; long long k = max(0LL, (long long)sqrt(n / 3.0) - 1); while (!(3 * k * (k + 1) >= n)) k++; long long ind = 3 * k * (k + 1) - n; long long nowx = 2 * k, nowy = 0; for (int i = 0; i < 6; i++) if (ind < k) { nowx += ind * dx[i]; nowy += ind * dy[i]; break; } else { nowx += k * dx[i]; nowy += k * dy[i]; ind -= k; } cout << nowx << ' ' << nowy << endl; return 0; }
2,100
CPP
# -*- coding: utf-8 -*- import sys from collections import Counter def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') # sys.setrecursionlimit(10 ** 9) INF = 10 ** 18 MOD = 10 ** 9 + 7 Q, X = MAP() A = [a%X for a in LIST(Q)] A = A[::-1] C = Counter(A) mn = min([C[a] for a in range(X)]) add = 0 for a in range(X): if C[a] == mn: add = a break base = mn * X ans = [] for a in A: ans.append(base + add) C[a] -= 1 if C[a] == mn: add = min(add, a) elif C[a] < mn: mn -= 1 base -= X add = a [print(a) for a in ans[::-1]]
1,600
PYTHON3
n = int(input()) a = [int(bin(i).replace("0b", "")) for i in range(1, 518)] for i in range(len(a)): if a[i]>n: print(i) break elif a[i]==n: print(i+1) break
1,200
PYTHON3
#include <bits/stdc++.h> using namespace std; long long n, m, s, r; long long ans = 0; long long f(long long h, long long w) { return (n - h + 1) * (m - w + 1); } int main() { cin >> n >> m >> s; for (int i = 1; i <= n; i += 2) for (int j = 1; j <= m && (r = s - i * j) >= 0; j += 2) { if (r == 0) ans += ((i + 1) * (j + 1) / 2 - 1) * f(i, j); else for (int k = 1; k < j; k += 2) if (r % (2 * k) == 0 && i + r / k <= n) ans += 2 * f(i + r / k, j); } cout << ans << endl; return 0; }
2,100
CPP
import math,string,itertools,fractions,heapq,collections,re,array,bisect from itertools import chain, dropwhile, permutations, combinations from collections import defaultdict def main2(a,b): if a==0: print(-b**2) print("x"*b) return if b==0: print(a**2) print("o"*a) return if 2*a>=b: ans = a**2 - (b//2)**2 - (b-b//2)**2 print(ans) print("x"*(b//2),end="") print("o"*a,end="") print("x"*(b-b//2)) else: x = b//(a+1) m = b % x bb = [x+1]*m + [x]*(a+1-m) ans = -m*(x+1)**2 - (a+1-m)*x**2 + a print(ans) bbb = ["x"*j for j in bb] print("o".join(bbb)) def main(a,b): if a==0: print(-b**2) print("x"*b) return if b<=1: print(a**2-b**2) print("o"*a + "x"*b) return ans = None for p in range(1,a+1): q = p+1 curr = (a-p+1)**2 + (p-1) - ((b//q+1)**2*(b%q)+(b//q)**2*(q-(b%q))) #print(p,q,curr) if ans is None or curr > ans: ans = curr best_p = p print(ans) p = best_p q = p+1 x = b//q m = b-x*q bb = [x+1]*m + [x]*(q-m) bbb = ["x"*j for j in bb] aaa = ["o"*j for j in ([a-p+1]+[1]*(p-1))] #print("o".join(bbb)) #print(p,q,aaa,bbb,x,m,bb) print(bbb[0],end="") for i in range(p): print(aaa[i],end="") print(bbb[i+1],end="") print() def main_input(info=0): a,b = map(int,input().split()) #t = [(int(x)-1,i+1) for i,x in enumerate(input().split())] #l,r = list(range(n)), list(range(n)) #for i in range(n): # l[i],r[i] = map(int,input().split()) # t = [map(int,input().split()) for x in range(n)] main(a,b) if __name__ == "__main__": main_input()
0
PYTHON3
for _ in range(int(input())): n, k = map(int, input().split()) if(k==1): s = 'a'*(n-2)+'bb' else: x = int((2*k)**(0.5))+1 y =x - 1 N_lower = ((y*(y+1))//2) #1,3,6,10 if(N_lower>=k): x = y y -=1 N_lower = ((y*(y+1))//2) s = 'a'*(n-x-1) + 'b' y = k - N_lower s += 'a'*(x-y) + 'b' + 'a'*(y-1) print(s)
1,300
PYTHON3
#include <bits/stdc++.h> using namespace std; const int MAXN = 400010; long long sm[MAXN], mx[MAXN]; long long N, M, A[100010]; void push_up(long long o) { sm[o] = sm[o << 1] + sm[(o << 1) + 1]; mx[o] = max(mx[o << 1], mx[(o << 1) + 1]); } void bul(long long l, long long r, long long o) { if (l == r) { mx[o] = sm[o] = A[l]; return; } long long m = (l + r) >> 1; bul(l, m, o << 1); bul(m + 1, r, (o << 1) + 1); push_up(o); } void md(long long ms, long long ll, long long rr, long long l, long long r, long long o) { if (mx[o] < ms) return; if (l == r) { sm[o] %= ms; mx[o] = sm[o]; return; } long long m = (l + r) >> 1; if (ll <= m) md(ms, ll, rr, l, m, o << 1); if (rr > m) md(ms, ll, rr, m + 1, r, (o << 1) + 1); push_up(o); } void cng(long long loc, long long k, long long l, long long r, long long o) { if (l == r) { mx[o] = sm[o] = k; return; } long long m = (l + r) >> 1; if (loc <= m) cng(loc, k, l, m, o << 1); else cng(loc, k, m + 1, r, (o << 1) + 1); push_up(o); } long long qs(long long ll, long long rr, long long l, long long r, long long o) { if (ll <= l && r <= rr) return sm[o]; long long m = (l + r) >> 1; long long ans = 0; if (ll <= m) ans += qs(ll, rr, l, m, o << 1); if (rr > m) ans += qs(ll, rr, m + 1, r, (o << 1) + 1); return ans; } int main() { scanf("%lld%lld", &N, &M); for (int i = 1; i <= N; i++) scanf("%lld", &A[i]); bul(1, N, 1); for (int i = 1; i <= M; i++) { long long a, b, c, d; scanf("%lld", &a); if (a == 1) { scanf("%lld%lld", &b, &c); printf("%lld\n", qs(b, c, 1, N, 1)); } else if (a == 2) { scanf("%lld%lld%lld", &b, &c, &d); md(d, b, c, 1, N, 1); } else if (a == 3) { scanf("%lld%lld", &b, &c); cng(b, c, 1, N, 1); } } return 0; }
2,300
CPP
#include <bits/stdc++.h> using namespace std; int main() { string s; cin >> s; s += "WUB"; int l = s.length(); int i = 0, flag = 0; while (i < l - 2) { if (s[i] == 'W' && s[i + 1] == 'U' && s[i + 2] == 'B') { s.erase(i, 3); if (i != 0 && flag == 1) cout << " "; flag = 0; } else { flag = 1; cout << s[i]; i++; } l = s.length(); } return 0; }
900
CPP
s = input().strip() n = len(s) for i in range(n - 2): t = list(s[i:i+3]) t.sort() t = ''.join(map(str, t)) if t == 'ABC': print('Yes') exit(0) print('No')
900
PYTHON3
#include <bits/stdc++.h> struct Node { int k; int v; int ni; } node[200009]; int nl = 1; struct Node h[1005]; void hash_init() { memset(h, 0, sizeof(h)); nl = 1; } int hash_exist(int k) { int kk = ((k) % 1005); int *ni = &h[kk].ni; while (*ni) { if (node[*ni].k == k) return 1; ni = &node[*ni].ni; } return 0; } int hash_query(int k) { int kk = ((k) % 1005); int *ni = &h[kk].ni; while (*ni) { if (node[*ni].k == k) { return node[*ni].v; } ni = &node[*ni].ni; } return 0; } void hash_modify(int k, int v) { int kk = ((k) % 1005); int *ni = &h[kk].ni; update: while (*ni) { if (node[*ni].k == k) { node[*ni].v = v; return; } ni = &node[*ni].ni; } node[nl].k = k; node[nl].v = v; node[nl].ni = 0; *ni = nl; nl++; goto update; } void hash_print() { for (int i = 0; i < 1005; i++) { int ni = h[i].ni; while (ni) { printf("hi: %d, k: %d, v: %d\n", i, node[ni].k, node[ni].v); ni = node[ni].ni; } } } int main() { int t; scanf("%d", &t); while (t--) { int n; long long ans = 0; scanf("%d", &n); hash_init(); for (int i = 0; i < n; i++) { int a; scanf("%d", &a); int d = 0; while ((a & 1) == 0) { d++; a = a >> 1; } if (!hash_exist(a)) { hash_modify(a, 0); } int m = hash_query(a); if (m < d) { hash_modify(a, d); ans += (long long)(d - m); } } printf("%lld\n", ans); } return 0; }
1,200
CPP
n = int(input()) count = [] names = list() for i in range(n): names.append(input()) count = dict() for i in names: if not i in count: print('OK') count[i] = 1 else: print(i + str(count[i])) count[i] += 1
1,300
PYTHON3
#Mamma don't raises quitter................................................. from collections import deque as de import math from math import sqrt as sq from math import floor as fl from math import ceil as ce from sys import stdin, stdout import re from collections import Counter as cnt from functools import reduce from itertools import groupby as gb #from fractions import Fraction as fr from bisect import bisect_left as bl, bisect_right as br def factors(n): return set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))) class My_stack(): def __init__(self): self.data = [] def my_push(self, x): return (self.data.append(x)) def my_pop(self): return (self.data.pop()) def my_peak(self): return (self.data[-1]) def my_contains(self, x): return (self.data.count(x)) def my_show_all(self): return (self.data) def isEmpty(self): return len(self.data)==0 arrStack = My_stack() #decimal to binary def decimalToBinary(n): return bin(n).replace("0b", "") #binary to decimal def binarytodecimal(n): return int(n,2) def isPrime(n) : if (n <= 1) : return False if (n <= 3) : return True if (n % 2 == 0 or n % 3 == 0) : return False i = 5 while(i * i <= n) : if (n % i == 0 or n % (i + 2) == 0) : return False i = i + 6 return True def get_prime_factors(number): prime_factors = [] while number % 2 == 0: prime_factors.append(2) number = number / 2 for i in range(3, int(math.sqrt(number)) + 1, 2): while number % i == 0: prime_factors.append(int(i)) number = number / i if number > 2: prime_factors.append(int(number)) return prime_factors def get_frequency(list): dic={} for ele in list: if ele in dic: dic[ele] += 1 else: dic[ele] = 1 return dic def Log2(x): return (math.log10(x) / math.log10(2)); # Function to get product of digits def getProduct(n): product = 1 while (n != 0): product = product * (n % 10) n = n // 10 return product #function to find LCM of two numbers def lcm(x,y): lcm = (x*y)//math.gcd(x,y) return lcm def isPowerOfTwo(n): return (math.ceil(Log2(n)) == math.floor(Log2(n))); #to check whether the given sorted sequnce is forming an AP or not.... def checkisap(list): d=list[1]-list[0] for i in range(2,len(list)): temp=list[i]-list[i-1] if temp !=d: return False return True #seive of erathanos def primes_method5(n): out ={} sieve = [True] * (n+1) for p in range(2, n+1): if (sieve[p]): out[p]=1 for i in range(p, n+1, p): sieve[i] = False return out #function to get the sum of digits def getSum(n): strr = str(n) list_of_number = list(map(int, strr.strip())) return sum(list_of_number) #ceil function gives wrong answer after 10^17 so i have to create my own :) # because i don't want to doubt on my solution of 900-1000 problem set. def ceildiv(x,y): return (x+y-1)//y def di():return map(int, input().split()) def ii():return int(input()) def li():return list(map(int, input().split())) def si():return list(map(str, input())) def indict(): dic = {} for index, value in enumerate(input().split()): dic[int(value)] = int(index)+1 return dic def frqdict(): # by default it is for integer input. :) dic={} for index, value in enumerate(input()): if value not in dic: dic[value] =1 else: dic[value] +=1 return dic #inp = open("input.txt","r") #out = open("output.txt","w") #Here we go...................... #practice like your never won #perform like you never lost s=si() if len(s) < 26: print(-1) else: ans=1 for i in range(len(s)-26+1): temp=s[i:i+26] if "?" not in temp: dictemp={} ch=1 for ele in temp: if ele not in dictemp: dictemp[ele]=1 else: ch=0 break if ch: ans=0 break else: checker={'A': 1, 'B': 1, 'C': 1, 'D': 1, 'E': 1, 'F': 1, 'G': 1, 'H': 1, 'I': 1, 'J': 1, 'K': 1, 'L': 1, 'M': 1, 'N': 1, 'O': 1, 'P': 1, 'Q': 1, 'R': 1, 'S': 1, 'T': 1, 'U': 1, 'V': 1, 'W': 1, 'X': 1, 'Y': 1, 'Z': 1} dictemp={} questioncount=0 for ele in temp: if ele=="?": questioncount+=1 else: if ele in checker: del checker[ele] if len(checker)==questioncount: ans=0 tempchecker="" for key in checker: tempchecker+=key j=0 for i in range(i,i+26): if s[i]=="?": s[i]=tempchecker[j] j+=1 break if ans: print(-1) else: for i in range(len(s)): if s[i]=="?": s[i]="A" print(s[i], end="")
1,300
PYTHON3
#include <bits/stdc++.h> using namespace std; const int INF = (1 << 30) - 1; const long long LINF = (1LL << 60) - 1; template <class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else return false; } template <class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else return false; } long long mod_pow(long long a, long long n, long long p) { long long ans = 1, tmp = a % p; while (n > 0) { if (n & 1) ans = ans * tmp % p; tmp = tmp * tmp % p; n = (n >> 1); } return ans; } int main() { int n; cin >> n; vector<long long> a(n), kai(n + 1, 1); for (int i = 0; i < n; i++) cin >> a[i]; long long mod = 1e9 + 7, ans = 0; for (long long x = 1; x <= n; x++) kai[x] = kai[x - 1] * x % mod; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { int j = upper_bound(a.begin(), a.end(), a[i]) - a.begin(); if (a[i] == a[n - 1]) break; long long S = i, L = n - 1 - i; ans = (ans + a[i] * kai[n] % mod * mod_pow(L + 1, mod - 2, mod) % mod * (j - i) % mod) % mod; i = j - 1; } cout << ans << endl; return 0; }
2,300
CPP
def isSolved(x,k): for i in range(k-1, len(x)-1): if(x[i] != x[i+1]): return False return True def main(): inps = list(map(int, input().rstrip().split())) n,k,total = inps[0], inps[1],0 l = list(map(int, input().rstrip().split())) # if(isSolved(l,k) == False): # total = -1 # else: for i in range(len(l)-1, 0, -1): if(l[len(l)-1] != l[i-1]): total = i break if total > k-1: total = -1 print(total) main()
1,200
PYTHON3
I = input x =0 y = 0 for _ in [0]*int(I()): s = list(map(int,I().split())) n = list(map(int,I().split())) k = list(map(int,I().split())) if max(n)>max(k): print('YES') else: print("NO")
800
PYTHON3
#include <bits/stdc++.h> using namespace std; int ara[200002]; queue<char> q; int main() { int n, i, l, r, j, res, cnt, cnt1; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d", &ara[i]); } res = -1; l = 0; r = n - 1; while (l <= r) { if (ara[l] < ara[r] && res < ara[l]) { q.push('L'); res = ara[l]; l++; } else if (ara[l] > ara[r] && res < ara[r]) { q.push('R'); res = ara[r]; r--; } else if (ara[l] == ara[r] && ara[l] > res) { j = l; i = l + 1; cnt = 1; while (i < r && ara[j] < ara[i]) { cnt++; j++; i++; } j = r; i = r - 1; cnt1 = 1; while (i > l && ara[j] < ara[i]) { cnt1++; j--; i--; } if (cnt > cnt1) { while (cnt--) q.push('L'); } else { while (cnt1--) q.push('R'); } break; } else if (res < ara[r]) { res = ara[r]; q.push('R'); r--; } else if (res < ara[l]) { res = ara[l]; q.push('L'); l++; } else break; } cout << q.size() << endl; while (!q.empty()) { cout << q.front(); q.pop(); } cout << endl; return 0; }
1,300
CPP
#include <bits/stdc++.h> using namespace std; template <typename T> inline T qmin(const T a, const T b) { return a < b ? a : b; } template <typename T> inline T qmax(const T a, const T b) { return a > b ? a : b; } template <typename T> inline void getmin(T &a, const T b) { if (a > b) a = b; } template <typename T> inline void getmax(T &a, const T b) { if (a < b) a = b; } inline void fileio(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } const int inf = 1e9 + 7; const long long linf = 1e17 + 7; const int N = 1e5 + 7; int tmp[N], a[N], n; long long sum[N]; priority_queue<long long, vector<long long>, greater<long long> > q; int main() { scanf("%d", &n); for (int i = 1; i <= n; ++i) { scanf("%d", tmp + i); if (i == 1) continue; a[i - 1] = abs(tmp[i] - tmp[i - 1]); sum[i - 1] = sum[i - 2] + (i & 1 ? -1 : 1) * a[i - 1]; } long long ans = 0; q.push(0); for (int i = 1; i < n; ++i) { if (!(i & 1)) q.push(sum[i]); getmax(ans, sum[i] - q.top()); } while (!q.empty()) q.pop(); for (int i = 1; i < n; ++i) { sum[i] = -sum[i]; if (i & 1) q.push(sum[i]); if (q.empty()) continue; getmax(ans, sum[i] - q.top()); } printf("%I64d\n", ans); return 0; }
1,600
CPP
#include <bits/stdc++.h> using namespace std; char a[3010][3010], b[3010][3010]; long long n, m, f1[3010], f2[3010]; long long tmp, sum; void Hsh(char c) { tmp = (tmp * 127 + (c - 'a')) % 99873309; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) cin >> b[i][j]; for (int i = 0; i <= n - m; i++) { sum = 0; for (int j = i + 1; j <= i + m; j++) { tmp = 0; for (int k = 1; k <= m; k++) Hsh(a[j][k]); sum = (sum * 107 + tmp) % 99873309; } f1[i] = sum; } for (int i = 0; i <= n - m; i++) { sum = 0; for (int j = 1; j <= m; j++) { tmp = 0; for (int k = i + 1; k <= i + m; k++) Hsh(b[j][k]); sum = (sum * 107 + tmp) % 99873309; } f2[i] = sum; } for (int i = 0; i <= n - m; i++) for (int j = 0; j <= n - m; j++) if (f1[i] == f2[j]) { printf("%d %d", i + 1, j + 1); return 0; } }
2,000
CPP
q=int(input()) while q: q-=1 s=input() n=len(s) oddpre=[[0,0] for x in range(n)] ###max|min evenpre=[[0,0] for x in range(n)] if s[0]=="1": evenpre[0]=[1,1] elif s[0]=="0": evenpre[0]=[0,0] else: evenpre[0]=[1,0] for i in range(1,n): if i%2==0: oddpre[i]=oddpre[i-1].copy() if s[i]=="1": evenpre[i]=[evenpre[i-1][0]+1,evenpre[i-1][1]+1] elif s[i]=="0": evenpre[i]=[evenpre[i-1][0],evenpre[i-1][1]] else: evenpre[i]=[evenpre[i-1][0]+1,evenpre[i-1][1]] else: evenpre[i]=evenpre[i-1].copy() if s[i]=="1": oddpre[i]=[oddpre[i-1][0]+1,oddpre[i-1][1]+1] elif s[i]=="0": oddpre[i]=[oddpre[i-1][0],oddpre[i-1][1]] else: oddpre[i]=[oddpre[i-1][0]+1,oddpre[i-1][1]] oddsufix=[[0,0] for x in range(n)] evensufix=[[0,0] for x in range(n)] oddsufix[-1]=[1,1] for i in reversed(range(len(s)-1)): if i%2==0: oddsufix[i]=oddsufix[i+1].copy() evensufix[i]=[evensufix[i+1][0]+1,evensufix[i+1][1]+1] else: evensufix[i]=evensufix[i+1].copy() oddsufix[i]=[oddsufix[i+1][0]+1,oddsufix[i+1][1]+1] for i in range(len(s)-1): if oddpre[i][0]-evenpre[i][1]>evensufix[i+1][0]: print(i+1) break elif evenpre[i][0]-oddpre[i][1]>oddsufix[i+1][0]: print(i+1) break else: print(10)
1,200
PYTHON3
for _ in[0]*int(input()): s=input();a=[0,*s];i=0 if any(x*2in s for x in'abc'):print(-1);continue for x in s: i+=1 if x=='?':a[i]=(set('abc')-set(a[i-1:i+2])).pop() print(''.join(a[1:]))
1,000
PYTHON3
n=int(input()); l=[]; while(n>0): l.append(int(input())); n=n-1; s=set(l); if(len(s)!=2): print("NO"); exit(); s=list(s); x=l.count(s[0]); y=l.count(s[1]); if(x!=y): print("NO"); exit(); print("YES"); print(s[0],s[1]);
1,000
PYTHON3
t = int(input()) for _ in range(t): r, g, b = map(int, input().split()) if r > b+g+1 or g > r+b+1 or b > r+g+1: print("No") else: print("Yes")
900
PYTHON3
n, k = map(int, input().split()) a = list(map(int, input().split())) m = 0 for i in range(0, len(a)): if (a[i] >= a[k - 1]) and (a[i] != 0): m += 1 print(m)
800
PYTHON3
n = int(input()) days = [int(x) for x in input().split()] if days[-1] == 15: print ("DOWN") elif days[-1] == 0: print ("UP") elif n == 1: print (-1) elif days[-2] > days[-1]: print ("DOWN") else: print ("UP")
1,100
PYTHON3
#include <bits/stdc++.h> using namespace std; int main() { long long int n, x, y, u = 998244353, i; cin >> n; string a; cin >> a; x = 0; for (i = 0; i < n; i++) { if (a[i] != a[0]) break; x++; } y = 0; for (i = n - 1; i >= 0; i--) { if (a[i] != a[n - 1]) break; y++; } x++; y++; if (a[0] != a[n - 1]) { cout << x + y - 1; } else { x = (x * y) % u; cout << x; } return 0; }
1,300
CPP
# The same file will be used throughout Problem Set by saving after writing different codes A = list(map(int, input().split())); A.sort(); a = A[0] + A[1] - A[-1]; b = A[1] + A[2] - A[-1]; c = A[0] + A[2] - A[-1]; print(a,b,c);
800
PYTHON3
lat='qwertyuiopasdfghjklzxcvbnm' lats=[] lats+=lat c=str(input()) for i in lats: c=c.replace(i,' ') c=c.split() #print(c) k=0 for i in c: j=int(i.replace('.','')) i=i.replace('.',' ') i=i.split() if len(i[len(i)-1])!=2 or len(i)==1: j*=100 #print(j) k+=j #print(k) print(format(k//100,',d').replace(',','.'),end='') if k%100!=0: print(".%02d" % (k%100))
1,600
PYTHON3
#include <bits/stdc++.h> using namespace std; bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); } long long C(long long n, long long k) { if (k > n) return 0; if (k * 2 > n) k = n - k; if (k == 0) return 1; long long result = n; for (long long i = 2; i <= k; ++i) { result *= (n - i + 1); result /= i; } return result; } long long power(long long x, unsigned long long y) { long long res = 1; while (y > 0) { if (y & 1) res = res * x; y = y >> 1; x = x * x; } return res; } const long long Nmax = 1e5 + 2; vector<long long> adj[Nmax]; bool v[Nmax]; signed main() { ios::sync_with_stdio(false); cin.tie(0); string s; cin >> s; long long n = s.size(); cout << "3\n"; cout << "R " << n - 1 << '\n'; n++; cout << "L " << n - 1 << '\n'; cout << "L 2\n"; return 0; }
1,400
CPP
#include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long a[n]; for (long long i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); long long mn = a[0]; cout << mn << endl; long long ct = 1; for (long long i = 0; i < n; i++) { if (ct == k) break; if (a[i] - mn) { cout << a[i] - mn << endl; mn += a[i] - mn; ct++; } } if (ct < k) { for (long long i = ct; i < k; i++) cout << 0 << endl; } cout << "\n"; return 0; }
1,000
CPP
n=int(input()) for i in range (1,9000): p="" q="" c=0 p=str(n+i) for j in range(0,len(p)): q=p[j+1:]+p[:j] if (p[j] in q): break else: c+=1 if(c==len(p)): print(p) break
800
PYTHON3
#include <bits/stdc++.h> using namespace std; bool debug_cerr = 1; const long long mod = 1000000007; template <typename T> void printarr(T arr[], int n) { if (!debug_cerr) { } else cerr << "Array "; for (int i = 0; i < n; i++) { if (!debug_cerr) { } else cerr << arr[i] << " "; } if (!debug_cerr) { } else cerr << endl; } template <typename T> void printarr(T arr) { if (!debug_cerr) { } else cerr << "AnyList "; for (auto it = arr.begin(); it != arr.end(); it++) { if (!debug_cerr) { } else cerr << *it << " "; } if (!debug_cerr) { } else cerr << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long long test, ti, i, j, n, m, k; string s; cin >> n >> k; cin >> s; s = '1' + s + '1'; int cnt = 0; if (k == 2) { int codd = 0, ceven = 0; bool odd = 0; string sodd = s, seven = s; for (i = (1); i <= (n); i++) { char c = 'A' + (i % 2 == 0); if (s[i] != c) { codd++; sodd[i] = c; } } for (i = (1); i <= (n); i++) { char c = 'A' + (i % 2 == 1); if (s[i] != c) { ceven++; seven[i] = c; } } if (codd < ceven) odd = 1, cnt = codd, s = sodd; else odd = 0, cnt = ceven, s = seven; goto fin; } for (i = (1); i <= (n); i++) { if (s[i - 1] == s[i]) { cnt++; while (s[i] == s[i - 1] || s[i] == s[i + 1]) { s[i] = (s[i] - 'A' + 1) % k + 'A'; } } } fin: cout << cnt << "\n"; for (i = (1); i <= (n); i++) { cout << s[i]; } cout << "\n"; return 0; }
1,600
CPP
n=int(input()) l=list(map(int,input().split())) b=max(l)-min(l)+1 print(b-n)
800
PYTHON3
import sys, os.path if(os.path.exists('input.txt')): sys.stdin = open("input.txt","r") n = input() st = str(input()).strip() chars = ['o','n','e','z','r'] d = dict() for ch in st: ind = chars.index(ch) if ind not in d: d[ind] = 1 else: d[ind]+=1 zero = 0 while 3 in d and d[3] > 0: zero+=1 d[3]-=1 d[2]-=1 d[4]-=1 d[0]-=1 one = 0 while 0 in d and d[0] > 0: one+=1 d[0]-=1 s1 = " ".join(['1']*one) s2 = " ".join(['0']*zero) print(s1 + (" " if s2 else "") + s2)
800
PYTHON3
a = int(input()) B = [] for i in range(a): x = int(input()) A = list(map(int, input().split())) A.sort(reverse=True) if A[-1] >= len(A): B.append(len(A)) else: j = 0 while A[j] >= j + 1: j += 1 B.append(j) for b in B: print(b)
800
PYTHON3
inp=input li=list iinp=lambda : int(inp()) ent=lambda : map(int,inp().split()) lient=lambda : li(ent()) s=inp() a=0 for i in s: if i=='a': a+=1 if a>len(s)/2: print(len(s)) else: lon=len(s)-a while lon>=a: lon-=1 print(lon+a)
800
PYTHON3
x=int(input()) a=[int(num) for num in input().split()] a.sort(reverse=True) d=sum(a) c=(d//2)+1 count=0 sum1=0 for i in a: sum1+=i count+=1 if sum1>=c: break print(count)
900
PYTHON3
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int b[2][N]; char p[N], t[N]; int n, m, k; int dp[2][N]; void pre(bool pos) { b[pos][0] = -1; for (int i = 1; i <= m; ++i) { int j = b[pos][i - 1]; while (j != -1 and t[j] != t[i - 1]) j = b[pos][j]; b[pos][i] = j + 1; } } void kmp(bool pos) { int match = 0; for (int i = 0; i < n; ++i) { while (match != -1 and p[i] != t[match]) match = b[pos][match]; match += 1; dp[pos][i] = match; if (match == m) match = b[pos][match]; } } int vis[N]; void add(int pos, int w) { while (not vis[w]) { vis[w] = pos + 1; if (w == 0) break; w = b[0][w]; } } int memo[N]; bool vm[N]; int down(int w) { if (w <= k) return w; if (vm[w]) return memo[w]; vm[w] = 1; return memo[w] = down(b[1][w]); } int main() { scanf("%d %d %d", &n, &m, &k); scanf("%s", p); scanf("%s", t); pre(0); kmp(0); reverse(t, t + m); reverse(p, p + n); pre(1); kmp(1); int Max = dp[0][k - 1]; add(k, Max); for (int i = k; i + k - 1 < n; ++i) { int need = m - down(dp[1][n - 1 - i]); if (vis[need] and need <= k) { puts("Yes"); printf("%d %d\n", vis[need] - k, i + 1); return 0; } add(i + 1, dp[0][i]); } if (m <= k) { for (int i = 0; i < n; ++i) { if (dp[0][i] == m) { int l = max(i - k + 2, 1); if (l + 2 * k - 1 <= n) { puts("Yes"); printf("%d %d\n", l, l + k); return 0; } } if (dp[1][n - i - 1] == m) { int r = min(n, i + k); if (r - 2 * k + 1 >= 1) { puts("Yes"); printf("%d %d\n", r - 2 * k + 1, r - k + 1); return 0; } } } } puts("No"); return 0; }
2,600
CPP
#!/usr/bin/python # -*- coding: UTF-8 -*- a=int(input()) x=[] y=[] while a>0: d=[] aa=(int(i) for i in input().split(" ")) for i in aa: d.append(i) x.append(d[0]) y.append(d[1]) a-=1 flagx=0 for i in x: if i >= 0: flagx+=1 if flagx >= 2 and (len(x)-flagx) >= 2: print("No") else: print("Yes")
800
PYTHON3
#include <bits/stdc++.h> using namespace std; const long long mod = 1000000007; const int maxn = 1e5 + 100; const int INF = 0x3f3f3f3f; const double PI = acos(-1.0); char s[101][101]; int dp[maxn]; int find(int x) { if (dp[x] != x) return dp[x] = find(dp[x]); return x; } int main() { int n, m; scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1); for (int i = 1; i <= n + m; i++) dp[i] = i; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (s[i][j] == '#') { int u = find(i), v = find(j + n); dp[v] = u; } } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { if (s[i][j] != '#') { int u = find(i), v = find(j + n); if (u == v) { printf("No\n"); return 0; } } } printf("Yes\n"); return 0; }
1,300
CPP
# -*- coding: utf-8 -*- samples = [] n = int(input()) for i in range(n): st = input() length = len(st) if length <= 10: samples.append(st) if length > 10: fir = 0 + 1 last = length - 1 n = last - fir result2 = ("".join([st[0], str(n),st[last]] )) samples.append(result2) for j in range(len(samples)): print(samples[j])
800
PYTHON3
#include <bits/stdc++.h> using namespace std; int N, P; int val[4003], cost[4003]; int h[4003], c[4003], t[4003]; int len[20003]; int f[20003]; int up[4003][4003]; int down[4003][4003]; vector<pair<int, int> > st; int main() { int u, v, w; scanf("%d%d", &N, &P); for (int i = 0; i < N; ++i) { scanf("%d%d%d", &u, &v, &w); cost[i] = u; val[i] = v; st.push_back(make_pair(w, i)); } sort(st.begin(), st.end()); memset(f, -1, sizeof f); for (int i = 0; i < N; ++i) { len[st[i].first]++; len[st[i].first + P]--; h[i] = val[st[i].second]; c[i] = cost[st[i].second]; t[i] = st[i].first; f[st[i].first] = i; } for (int i = 0; i < N; ++i) { } for (int i = 1; i <= 20000; ++i) { len[i] += len[i - 1]; f[i] = (f[i] == -1 && len[i] != 0 ? f[i - 1] : f[i]); } for (int T = 1; T <= 20000; T += P) { if (f[T] == -1) continue; for (int b = 0; b <= 4000; ++b) { for (int i = f[T]; i > f[T] - len[T]; --i) { if (b - c[i] >= 0) { if (i == f[T]) up[b][i] = max(up[b][i], h[i]); else up[b][i] = max(up[b][i], up[b - c[i]][i + 1] + h[i]); } if (i < f[T]) up[b][i] = max(up[b][i], up[b][i + 1]); } for (int i = f[T] - len[T] + 1; i <= f[T]; ++i) { if (b - c[i] >= 0) { if (i == f[T] - len[T] + 1) down[b][i] = max(down[b][i], h[i]); else down[b][i] = max(down[b][i], down[b - c[i]][i - 1] + h[i]); } if (i > f[T] - len[T] + 1) down[b][i] = max(down[b][i], down[b][i - 1]); } } } int Q; scanf("%d", &Q); for (int qq = 0; qq < Q; ++qq) { scanf("%d%d", &u, &v); int prev = ((u - 1) / P) * P + 1; int ans = 0; if (len[u] > 0) { for (int b = 0; b <= v; ++b) { int tmp = 0; if (f[prev] >= f[u] - len[u] + 1) tmp += up[b][f[u] - len[u] + 1]; if (f[prev] < f[u]) tmp += down[v - b][f[u]]; ans = max(ans, tmp); } } printf("%d\n", ans); } return 0; }
2,700
CPP
#include <bits/stdc++.h> using namespace std; int main() { int n, m, x, y, ptr1, ptr2; long long res = 0, t; pair<int, int> p[100001]; scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { scanf("%d %d", &x, &y); p[i] = make_pair(x, y); } sort(p, p + n); res = t = p[0].second; ptr1 = 0; for (ptr2 = 1; ptr2 < n;) { if (p[ptr2].first - p[ptr1].first < m) t += p[ptr2++].second; else while (p[ptr2].first - p[ptr1].first >= m) t -= p[ptr1].second, ptr1++; res = max(res, t); } printf("%I64d\n", res); return 0; }
1,500
CPP
#include <bits/stdc++.h> using namespace std; const int maxn = 1e3 + 9; int a[maxn][maxn], g[maxn][maxn], vis[maxn][maxn]; struct snode { int x, y; snode(int a = 0, int b = 0) { x = a, y = b; } } s[maxn]; int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int n, m, t; bool check(int x, int y) { for (int i = 0; i < 4; i++) { int nx = x + dir[i][0]; int ny = y + dir[i][1]; if (nx <= 0 || nx > n || ny <= 0 || ny > m) continue; if (a[nx][ny] == a[x][y]) return true; } return false; } void bfs() { queue<snode> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { vis[i][j] = 0; if (check(i, j)) { q.push(snode(i, j)); g[i][j] = 1; vis[i][j] = 1; } } } while (!q.empty()) { snode now = q.front(); q.pop(); for (int i = 0; i < 4; i++) { snode nex; nex.x = now.x + dir[i][0]; nex.y = now.y + dir[i][1]; if (nex.x <= 0 || nex.x > n || nex.y <= 0 || nex.y > m) continue; if (vis[nex.x][nex.y]) continue; q.push(nex); g[nex.x][nex.y] = g[now.x][now.y] + 1; vis[nex.x][nex.y] = 1; } } } int main() { scanf("%d%d%d", &n, &m, &t); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf("%1d", &a[i][j]); } } bfs(); while (t--) { int x, y; long long q; scanf("%d%d%lld", &x, &y, &q); if (q < g[x][y] || vis[x][y] == 0) { printf("%d\n", a[x][y]); continue; } if ((q - g[x][y]) % 2 == 0) { printf("%d\n", a[x][y] ^ 1); } else { printf("%d\n", a[x][y]); } } return 0; }
2,000
CPP
#include <bits/stdc++.h> using namespace std; static const int mod = 1e9 + 7, m1 = 1e9 + 123, p = 1e9 + 7; string s, t; int pref1[500500], mx; long long pref2[500500]; vector<int> v1 = {1}; vector<long long> v2 = {1}; bool check(int len) { int need1 = 1ll * pref1[len] * v1[mx - (len - 1)] % m1; long long need2 = pref2[len] * v2[mx - (len - 1)]; int j = (int)t.size() - len; int hash1 = pref1[len + j] - pref1[j]; if (hash1 < 0) hash1 += m1; hash1 = 1ll * hash1 * v1[mx - (j + len - 1)] % m1; long long hash2 = (pref2[len + j] - pref2[j]) * v2[mx - (j + len - 1)]; return (hash1 == need1 && hash2 == need2); } int main() { cin >> s >> t; int pa = 0, z = 0, o = 0; mx = (int)t.size(); for (int i = 1; i <= mx; i++) { v1.push_back(1ll * v1[i - 1] * p % m1); v2.push_back(v2[i - 1] * p); } for (int i = 0; i < s.size(); i++) { z += (s[i] == '0'); o += (s[i] == '1'); if (i < t.size()) { pref1[i + 1] = (pref1[i] + 1ll * t[i] * v1[i]) % m1; pref2[i + 1] = pref2[i] + t[i] * v2[i]; } } for (int i = 1; i <= (int)t.size() / 2; i++) { if (check(i)) pa = i; } bool bo = 0; while (1) { int i = 0; if (bo) i = pa; for (; i < t.size(); i++) { if (t[i] == '0' && z) printf("0"), z--; else if (t[i] == '1' && o) printf("1"), o--; else if (z) printf("0"), z--; else if (o) printf("1"), o--; else break; } if (z + o == 0) break; bo = 1; } printf("\n"); return 0; }
1,600
CPP
#!/usr/bin/env python3 # -*- coding: utf-8 -*- """ Mislove has lost an array """ def sum_of_table_of_2(index): table = [1] for i in range(index - 1): table.append(2 * table[i]) return table def max_min_sum(number_of_elements, not_less_than, not_more_than): Minimum = number_of_elements - not_less_than + sum(sum_of_table_of_2(not_less_than)) Maximum = (number_of_elements - not_more_than) * sum_of_table_of_2(not_more_than)[-1] + sum(sum_of_table_of_2(not_more_than)) return str(Minimum) + " " + str(Maximum) n, l, r = map(int, input().split()) print(max_min_sum(n, l, r))
900
PYTHON3
s = input() a = (len(s) + 19) // 20 b = (len(s) + a - 1) // a print(a, b) li = 0 for i in range(a): if len(s) % a == 0 or i < len(s) % a: print(s[li:li+b]) li += b else: print('*{}'.format(s[li:li+b-1])) li += b - 1
1,200
PYTHON3
for _ in range(int(input())): N=int(input()) orange=[int(x) for x in input().split()] candy=[int(x) for x in input().split()] min_orange=min(orange) min_candy=min(candy) counter=0 for i in range(N): if orange[i]!=min_orange and candy[i]!=min_candy: minimum=min(orange[i]-min_orange,candy[i]-min_candy) orange[i]-=minimum candy[i]-=minimum counter+=minimum if orange[i]!=min_orange: counter+=(orange[i]-min_orange) orange[i]-=(orange[i]-min_orange) if candy[i]!=min_candy: counter+=(candy[i]-min_candy) candy[i]-=(candy[i]-min_candy) print(counter)
800
PYTHON3
#include <bits/stdc++.h> using namespace std; using ulli = unsigned long long int; using lli = long long int; using ld = long double; using ll = long long; void solve() { lli n, k; cin >> n >> k; vector<lli> v(n); for (int i = 0; i < (int)(n); ++i) cin >> v[i]; sort((v).begin(), (v).end()); lli ans{0}; lli t = k; for (lli i{n - 1}; i >= 0 && t > 0; i--) { ans += v[i - k] / v[i]; t--; } lli p = n - 2 * k; for (int i = 0; i < (int)(p); ++i) { ans += v[i]; } cout << ans << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); int T{1}; cin >> T; while (T--) { solve(); } }
1,300
CPP
#include <bits/stdc++.h> using namespace std; const long long n[11] = {1ll, 10ll, 190ll, 2890ll, 38890ll, 488890ll, 5888890ll, 68888890ll, 788888890ll, 8888888890ll, 98888888890ll}; const long long t[11] = {1ll, 10ll, 100ll, 1000ll, 10000ll, 100000ll, 1000000ll, 10000000ll, 100000000ll, 1000000000ll, 10000000000ll}; int main() { ios::sync_with_stdio(0); cin.tie(0); long long k; cin >> k; const int d = upper_bound(n, n + 11, k) - n; k -= n[d - 1]; cout << (t[d - 1] + k / d) / t[d - 1 - k % d] % 10; }
1,000
CPP
import math n = int(input()) a = input().split(' ') a[0] = int(a[0]) gmax = a[0] gmin = a[0] count = 0 for i in range(1,n): a[i] = int(a[i]) if gmin > a[i]: count = count + 1 gmin = a[i] elif gmax < a[i]: count = count + 1 gmax = a[i] print(count)
800
PYTHON3
#include <bits/stdc++.h> using namespace std; long long mf(long long x, long long mod); long long mi(long long x, long long mod); long long C(long long x, long long y, long long mod); long long bpow(long long x, long long y, long long mod); long long mf(long long x, long long mod = 1000000007) { if (x < 2) return 1; return (x * mf(x - 1)) % mod; } long long mi(long long x, long long mod = 1000000007) { return bpow(x, mod - 2, mod); } long long C(long long x, long long y, long long mod = 1000000007) { if (x < y) return 0; return (((mf(x) * mi(mf(y))) % mod) * mi(mf(x - y))) % mod; } long long bpow(long long x, long long y, long long mod = 1000000007) { x %= mod; long long res = 1; while (y > 0) { if (y & 1) { res = res * x % mod; } x = x * x % mod; y >>= 1; } return res; } const long long N = 1000005; long long BITree[N], n, q; long long getSum(long long index) { long long sum = 0; while (index > 0) { sum += BITree[index]; index -= (index & (-index)); } return sum; } void updateBIT(long long index, long long val) { while (index <= n) { BITree[index] += val; index += (index & (-index)); } } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ; cin >> n >> q; long long x, k; for (long long i = 0; i < n; i++) { cin >> x; updateBIT(x, 1); } for (long long _ = 0; _ < q; _++) { cin >> k; if (k > 0) { updateBIT(k, 1); } else { k = abs(k); long long l = 1, r = n, pos = -1; while (l <= r) { long long mid = (l + r) / 2; if (getSum(mid) >= k) { pos = mid; r = pos - 1; } else { l = mid + 1; } } updateBIT(pos, -1); } } long long ok = 0; for (long long i = 1; i <= n; i++) { if (getSum(i)) { ok = 1; cout << i; break; } } if (!ok) cout << 0; }
1,900
CPP
from math import sqrt k = int(input()) n, m = 0, 0 for i in range(5, int(sqrt(k)) + 1): if k % i == 0: n = k // i m = i if n >= 5 and m >= 5: break if n == 0: print(-1) else: vowel = "aoiueaoiue" ans = "" for i in range(n): t = m while t > 0: c = min(t, 5) ans += vowel[i % 5:i % 5 + c] t -= c print(ans)
1,100
PYTHON3
#include <bits/stdc++.h> using namespace std; long long int binary_exp(long long int a, long long int n) { long long int i = 1; while (n > 0) { if (n % 2 == 1) i = (i * a) % 1000000007; a = (a * a) % 1000000007; n /= 2; } return i; } long long int IsPrime(long long int n) { if (n == 0 || n == 1) return n; if (n % 2 == 0) return (long long int)2; if (n % 3 == 0) return (long long int)3; else { for (long long int i = 5; i * i <= n; i += 6) { if (n % i == 0) return i; if (n % (i + 2) == 0) return (i + 2); } return n; } } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); ; long long int n, i, j, k, a, b, x, ans = 1; cin >> x >> n; vector<long long int> prime; k = 0; while (x % 2 == 0) { k++; x /= 2; } if (k > 0) prime.push_back(2); for (i = 3; i <= sqrt(x); i += 2) { k = 0; while (x % i == 0) { k++; x /= i; } if (k > 0) prime.push_back(i); } if (x > 2) prime.push_back(x); for (i = 0; i < prime.size(); i++) { k = 0; j = n; while (j > 0) { k += (j / prime[i]); j /= prime[i]; } ans = (ans * binary_exp(prime[i], k)) % 1000000007; } cout << ans; }
1,700
CPP
#include <bits/stdc++.h> using namespace std; const int N = 502; int t, n, a[N], b[N]; vector<int> ans; void op(int i) { ans.push_back(i); int tmp = a[i + 2]; a[i + 2] = a[i + 1], a[i + 1] = a[i]; a[i] = tmp; } void solve(int l, int r) { int mn = 1000000; for (int i = l; i <= r; i++) mn = min(mn, a[i]); if (a[l] == mn) return; int pos = 0; for (int i = l; i <= r; i++) if (a[i] == mn) pos = i; if ((pos - l) % 2 == 1) { if (pos == r) op(pos - 2), pos = pos - 2; op(pos - 1); pos++; } for (int i = pos - 2; i >= l; i -= 2) { op(i); } } int main() { scanf("%d", &t); while (t--) { scanf("%d", &n); ans.clear(); for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i], a[i] *= 1000; int inv = 0; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (a[i] > a[j]) inv++; for (int i = 1; i <= n; i++) { int cnt = 0; for (int j = 1; j < i; j++) if (b[i] == b[j]) a[i]++; } if (inv % 2) { bool fg = 0; for (int i = 1; i <= n; i++) { if (fg) break; for (int j = i + 1; j <= n; j++) { if (fg) break; if (b[i] == b[j]) { swap(a[i], a[j]); fg = 1; } } } if (!fg) { printf("-1\n"); continue; } } for (int i = 1; i <= n; i++) { solve(i, n); } bool fg = 1; for (int i = 1; i < n; i++) if (a[i] > a[i + 1]) fg = 0; if (!fg) { printf("-1\n"); continue; } printf("%d\n", ans.size()); for (auto x : ans) printf("%d ", x); printf("\n"); for (int i = 1; i < n; i++) assert(a[i] <= a[i + 1]); } }
1,700
CPP
#include <bits/stdc++.h> using namespace std; inline int read() { int x = 0, f = 1, c = getchar(); while (c < 48) c == '-' && (f = -1), c = getchar(); while (c > 47) x = x * 10 + c - '0', c = getchar(); return x * f; } const int MAXN = 2005; const int MOD = 1000000007; int a[MAXN][MAXN], c[MAXN]; int bin[MAXN], s[MAXN][MAXN]; int n, m, k; inline long long dfs(int x, int y) { if (y == m + 1) x++, y = 1; if (x == n + 1) return 1; int t = s[x - 1][y] | s[x][y - 1]; int res = 0, f = -1; for (int i = (1 << k) - 1 - t; i; i -= i & -i) { int u = bin[i & -i]; if (a[x][y] != 0 && a[x][y] != u + 1) continue; s[x][y] = t | (1 << u); c[u]++; if (c[u] == 1) { if (f == -1) f = dfs(x, y + 1); res += f; } else res += dfs(x, y + 1); res >= MOD && (res -= MOD); c[u]--; } return res; } int main(int argc, char const *argv[]) { n = read(); m = read(); k = read(); if (n + m - 1 > k) { puts("0"); return 0; } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { a[i][j] = read(); c[a[i][j] - 1]++; } for (int i = 0; i < k; i++) bin[1 << i] = i; printf("%lld\n", dfs(1, 1)); return 0; }
2,700
CPP
#include <bits/stdc++.h> using namespace std; const int N = 1005; map<string, int> score; int n; pair<string, int> a[N]; int main() { cin >> n; string name; int sco, m = 0; for (int i = 0; i < n; i++) { cin >> name >> sco; if (score.count(name) == 0) score.insert(make_pair(name, sco)), a[m++] = make_pair(name, sco); else score[name] = max(score[name], sco); } for (int i = 0; i < n; i++) a[i].second = max(a[i].second, score[a[i].first]); n = m; int cnt1, cnt2; cout << n << endl; for (int i = 0; i < n; i++) { cout << a[i].first << " "; cnt1 = cnt2 = 0; for (int j = 0; j < n; j++) { if (a[j].second <= a[i].second) cnt1++; if (a[j].second > a[i].second) cnt2++; } if (cnt1 * 100 >= n * 99) cout << "pro"; else if (cnt1 * 100 >= n * 90 && cnt2 * 100 > n) cout << "hardcore"; else if (cnt1 * 100 >= n * 80 && cnt2 * 100 > n * 10) cout << "average"; else if (cnt1 * 100 >= n * 50 && cnt2 * 100 > n * 20) cout << "random"; else if (cnt2 * 100 > n * 50) cout << "noob"; cout << endl; } return 0; }
1,400
CPP
def main(): def f(m): m = 2 * m + 1 return 4 * m - 4 n = int(input()) ans = 0 for i in range(1, n // 2 + 1): ans += i * f(i) return ans if __name__ == '__main__': t = int(input()) while t > 0: t -= 1 print(main())
1,000
PYTHON3
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1); const double eps = 1e-9; bool compfunc(const pair<int, int> &a, const pair<int, int> &b) { if (a.first < b.first) return true; if (a.first == b.first) return a.second > b.second; else return false; } template <typename T> T sqr(T x) { return x * x; } double sind(double x) { return sin(x * PI / 180); } double cosd(double x) { return cos(x * PI / 180); } double tand(double x) { return tan(x * PI / 180); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t, n, i, j, x; cin >> t; while (t--) { cin >> n; vector<int> a, indx; int odd = 0, even, ans; bool f = false; for (i = 0; i < n; i++) { cin >> x; a.push_back(x); if (x % 2 != 0) odd++; } for (i = 0; i < n; i++) { if (abs(a[i] - i) % 2 != 0) indx.push_back(i); } if (odd != n - ((n + 1) / 2) || (int)indx.size() % 2 != 0) ans = -1; else if ((int)indx.size() == 0) ans = 0; else { ans = (int)indx.size() / 2; } cout << ans << "\n"; } return 0; }
800
CPP
n,t=map(int,input().split()) s=input() l=[] for i in s: l.append(i) for i in range(t): a=0 while(a<n-1): if(l[a]=="B" and l[a+1]=="G"): l[a]="G" l[a+1]="B" a+=2 else: a+=1 print("".join(l))
800
PYTHON3
from itertools import permutations m,n=map(int,input().split()) sum=0 for i in range(1,m+1): sum+=int(str(i)+str(i)[::-1]) print(sum%n)
1,300
PYTHON3
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("-O2") const int MAX = 1e5; long long l[MAX + 1], r[MAX + 1], a[MAX + 1], n, ans = 0; vector<long long> rr; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (l[a[i]] == 0) { l[a[i]] = i; } r[a[i]] = i; } for (int i = 1; i <= MAX; i++) if (r[i] != 0) rr.push_back(r[i]); sort(rr.begin(), rr.end()); for (int i = 1; i <= MAX; i++) { if (l[i] != 0) { auto it = upper_bound(rr.begin(), rr.end(), l[i]); ans += (rr.end() - it); } } cout << ans << endl; return 0; }
1,400
CPP
#include <bits/stdc++.h> using namespace std; const int MAXN = 4005; int t, n; vector<int> v; int p[MAXN], dp[MAXN][MAXN]; void solve(int len) { int mx = 0, ind = -1; for (int i = 1; i <= len; i++) { if (p[i] > mx) { mx = p[i]; ind = i; } } v.push_back(len + 1 - ind); if (ind > 1) solve(ind - 1); } bool calc(int pos, int ost) { if (pos == v.size()) return (ost == 0); if (dp[pos][ost] != -1) return dp[pos][ost]; bool res = 0; res |= calc(pos + 1, ost); if (ost >= v[pos]) res |= calc(pos + 1, ost - v[pos]); return dp[pos][ost] = res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> t; while (t--) { cin >> n; for (int i = 1; i <= 2 * n; i++) cin >> p[i]; v.clear(); solve(2 * n); for (int pos = 0; pos < v.size(); pos++) { for (int val = 0; val <= n; val++) { dp[pos][val] = -1; } } if (calc(0, n)) cout << "YES\n"; else cout << "NO\n"; } return 0; }
1,800
CPP
#include <bits/stdc++.h> using namespace std; using ll = long long; int n, m; int a[26] = {}; int res; char ans[100100]; void solve1() { for (int l = 1; l <= m; l++) { if (m % l) continue; int c = m / l; int fc = -1; bool f = false; for (int i = 0; i < n; i++) { if (a[i] % (2 * c) == 0) continue; if (fc >= 0 || a[i] % c) { f = true; break; } fc = i; } if (f || fc == -1) continue; res = c; int idx = 0; for (int i = 0; i < n; i++) { if (i == fc) { for (int j = 0; j < c; j++) { for (int k = 0; k < c; k++) { ans[k * l + l / 2] = 'a' + i; } } } for (int j = 0; j < a[i] / (2 * c); j++) { for (int k = 0; k < c; k++) { ans[k * l + idx] = 'a' + i; ans[k * l + (l - 1 - idx)] = 'a' + i; } idx++; } } return; } res = 0; int idx = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < a[i]; j++) { ans[idx] = 'a' + i; idx++; } } } void solve2() { for (int l = 1; l <= m; l++) { if (m % l) continue; int c = m / l; if (c % 2) { bool f = false; for (int i = 0; i < n; i++) { if (a[i] % (2 * c) == 0) continue; f = true; break; } if (f) continue; res = c; int idx = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < a[i] / (2 * c); j++) { for (int k = 0; k < c; k++) { ans[k * l + idx] = 'a' + i; ans[k * l + (l - 1 - idx)] = 'a' + i; } idx++; } } return; } else { bool f = false; for (int i = 0; i < n; i++) { if (a[i] % c == 0) continue; f = true; break; } if (f) continue; res = c; int idx = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < a[i] / c; j++) { for (int k = 0; k < c; k++) { if (k % 2 == 0) { ans[k * l + idx] = 'a' + i; } else { ans[k * l + (l - 1 - idx)] = 'a' + i; } } idx++; } } return; } } res = 0; int idx = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < a[i]; j++) { ans[idx] = 'a' + i; idx++; } } } int main() { scanf("%d", &n); m = 0; for (int i = 0; i < n; i++) { scanf("%d", a + i); m += a[i]; } if (m % 2) { solve1(); } else { solve2(); } printf("%d\n", res); for (int i = 0; i < m; i++) { printf("%c", ans[i]); } printf("\n"); return 0; }
2,500
CPP
#include <bits/stdc++.h> using namespace std; const int oo = 1 << 30; const double PI = M_PI; const double EPS = 1e-15; int n; string s; int main() { cin.sync_with_stdio(false); cin >> n; cin >> s; bool ok = false; for (int i = 0; i < n; i++) { if (s[i] != '*') continue; for (int j = i + 1; j < n; j++) if (s[j] == '*') { int d = j - i; if (j + d * 1 < n && s[j + d * 1] == '*') if (j + d * 2 < n && s[j + d * 2] == '*') if (j + d * 3 < n && s[j + d * 3] == '*') ok = true; } } cout << (ok ? "yes" : "no") << endl; return 0; }
1,300
CPP
input() ns = [int(x) for x in input().split()] ns = [1]+ns+[1000000] tt = 2000000 for i in range(len(ns)-1): t1 = ns[i]-1 t2 = 1000000 - ns[i+1] t = max(t1,t2) if t < tt: tt=t print(tt)
1,100
PYTHON3
#include <bits/stdc++.h> using namespace std; long long cry_doc[10666], confidence[10666], cry_hall[10666]; bool just_left[10666]; vector<int> result; int main() { long long n, i, j; cin >> n; for (i = 1; i <= n; ++i) cin >> cry_doc[i] >> cry_hall[i] >> confidence[i]; for (i = 1; i <= n; ++i) if (just_left[i] == false) { result.push_back(i); long long v = 0; for (j = i + 1; j <= n; ++j) if (just_left[j] == false) { confidence[j] -= max((long long)0, cry_doc[i] - v); ++v; } just_left[i] = true; while (true) { bool okz = false; int pos = 0; for (j = 1; j <= n; ++j) if (confidence[j] < 0 && just_left[j] == false) { okz = true, pos = j; break; } if (okz == false) break; just_left[pos] = true; for (j = pos; j <= n; ++j) confidence[j] -= cry_hall[pos]; } } int N = result.size(); cout << N << '\n'; for (i = 0; i < N; ++i) cout << result[i] << " "; return 0; }
1,800
CPP
#include <bits/stdc++.h> using namespace std; void solve() { string str; cin >> str; long long len = str.size(); long long k = (str[0] - '0' - 1) * 10 + len * (len + 1) / 2; cout << k << endl; } int32_t main() { ios_base ::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long test, tc = 0; cin >> test; while (test--) { solve(); } }
800
CPP
import re t = int(input()) for i in range(t): s = input() a = re.split("0+", s) a.sort(reverse=True) count = 0 for j in range(0, len(a), 2): count = count + len(a[j]) print(count)
800
PYTHON3
# Python program to print prime factors import math def solution(n): a = 0 b = 0 for i in range(2, int(math.sqrt(n))+1): if n % i == 0: a = i n //= i break if a: for j in range(a + 1, int(math.sqrt(n))+1): if n % j == 0: b = j n //= j break if a and b and b != n: print('YES') print(f'{a} {b} {n}') else: print('NO') t = int(input()) kls = [int(input()) for _ in range(t)] for k in kls: solution(k)
1,300
PYTHON3
#include <bits/stdc++.h> const int MOD = 1e9 + 7; using namespace std; vector<pair<int, int>> sur = {{1, 0}, {0, -1}, {0, 1}, {-1, 0}, {-1, -1}, {1, 1}, {1, -1}, {-1, 1}}; bool bounds(int i, int j, int n, int m) { return i >= 0 && i <= n && j >= 0 && j <= m; } vector<long long> a; vector<vector<long long>> g; vector<bool> visited; int dfs(int c, int length, int origin) { visited[c] = true; for (auto x : g[c]) { if (visited[x]) { if (x == origin) { return length + 1; } else { return 0; } } else { return dfs(x, length + 1, origin); } } } int main() { ios_base::sync_with_stdio(false); long long t, n, r; cin >> n; a = vector<long long>(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; } visited = vector<bool>(n + 1); g = vector<vector<long long>>(n + 1); for (int i = 1; i <= n; i++) { g[i].push_back(a[i]); } bool poss = false; for (int i = 1; i <= n; i++) { visited.assign(visited.size(), false); if (dfs(i, 0, i) == 3) { poss = true; break; } } if (poss) { cout << "YES" << endl; } else { cout << "NO" << endl; } return 0; }
800
CPP
#include <bits/stdc++.h> using namespace std; int INF = 1e9; int d[550][550], n; char a[550]; int dp(int i, int j) { int& ans = d[i][j]; if (ans > 0) return ans; if (i > j) return 0; if (i == j) return ans = 1; ans = min(dp(i + 1, j), dp(i, j - 1)) + 1; for (int k = i + 1; k <= j; k++) if (a[i] == a[k]) ans = min(ans, dp(i + 1, k - 1) + dp(k, j)); return ans; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> a; cout << dp(0, n - 1); return 0; }
2,000
CPP