solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 310, MAXM = 50000 + 10;
vector<pair<pair<int, int>, int> > CC;
struct Graph {
int id, next;
} g[MAXN * 2];
int n, m, st[MAXN], a[MAXN], b[MAXN], v, f[MAXN], tot, cnt[MAXN];
pair<int, int> e[MAXM];
int getf(int first) {
if (f[first] == first) return first;
f[first] = getf(f[first]);
return f[first];
}
bool Union(int first, int second) {
int fx = getf(first), fy = getf(second);
if (fx == fy) return false;
f[fx] = fy;
return true;
}
void Add(int first, int second) {
g[tot].id = second, g[tot].next = st[first], st[first] = tot++;
g[tot].id = first, g[tot].next = st[second], st[second] = tot++;
}
void init() {
scanf("%d%d%d", &n, &v, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int j = 1; j <= n; ++j) scanf("%d", &b[j]);
for (int i = 1; i <= n; ++i) f[i] = i;
memset(st, -1, sizeof(st));
for (int i = 1; i <= m; ++i) {
int first, second;
scanf("%d%d", &first, &second);
e[i] = make_pair(first, second);
if (Union(first, second)) Add(first, second);
}
for (int i = 1; i <= n; ++i) cnt[getf(i)] += a[i] - b[i];
for (int i = 1; i <= n; ++i)
if (cnt[i] != 0) puts("NO"), exit(0);
}
int fa[MAXN];
bool used[MAXN];
int Gain(int first, int fx, int res) {
if (res == 0) return 0;
if (res > 0 && a[first] >= res) {
a[fx] += res, a[first] -= res;
CC.push_back(make_pair(make_pair(first, fx), res));
return -res;
}
if (res < 0 && v + res >= a[first]) {
a[fx] += res, a[first] -= res;
CC.push_back(make_pair(make_pair(fx, first), -res));
return -res;
}
int flow = (res > 0) ? (res - a[first]) : ((v + res) - a[first]);
for (int i = st[first]; i != -1; i = g[i].next)
if (g[i].id != fx && !used[g[i].id]) {
int F = Gain(g[i].id, first, flow);
flow += F;
if (flow == 0) break;
}
res -= flow;
a[fx] += res, a[first] -= res;
if (res + flow > 0) {
if (res != 0) CC.push_back(make_pair(make_pair(first, fx), res));
} else if (res != 0)
CC.push_back(make_pair(make_pair(fx, first), -res));
return -res;
}
void DFS(int first) {
for (int i = st[first]; i != -1; i = g[i].next)
if (g[i].id != fa[first]) fa[g[i].id] = first, DFS(g[i].id);
used[first] = true;
if (fa[first])
Gain(fa[first], first, b[first] - a[first]);
else if (a[first] != b[first])
puts("NO"), exit(0);
}
void solve() {
for (int i = 1; i <= n; ++i)
if (!used[i]) DFS(i);
cout << CC.size() << endl;
for (int i = 0; i < (int)CC.size(); ++i)
cout << CC[i].first.first << " " << CC[i].first.second << " "
<< CC[i].second << endl;
}
int main() {
init();
solve();
fclose(stdin);
fclose(stdout);
return 0;
}
| 2,500 |
CPP
|
#https://codeforces.com/problemset/problem/1175/A
tests = int(input())
for each in range(tests):
n , k = input().split(' ')
n=int(n)
k=int(k)
count=0
while n!=0:
if (n%k==0):
n=n//k
count+=1
else:
rest= n%k
n-=rest
count+=rest
print(int(count))
| 900 |
PYTHON3
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
diff = [x - y for x, y in zip(a, b)]
#print(k)
#print(a)
#print(b)
#print(diff)
index = sorted(range(len(diff)), key=lambda x: diff[x])
#print(index)
cheat = len([x for x in diff if x < 0])
#print(cheat)
k = max(k, cheat)
bnow = index[:k]
blater = index[k:]
bnow = [a[x] for x in bnow]
blater = [b[x] for x in blater]
#print(bnow)
#print(blater)
print(sum(bnow) + sum(blater))
| 1,200 |
PYTHON3
|
t = int(input())
for _ in range(t):
n, x = map(int, input().split())
arr = list(map(int, input().split()))
s = set(arr)
i = 1
while x != 0:
if i not in s:
x -= 1
i += 1
if (x == 0) and (i not in s):
i -= 1
if x == 0:
while (i + 1) in arr:
i += 1
print(i)
| 900 |
PYTHON3
|
n = int(input())
a = list(map(int, input().split()))
s1 = [i for i in a if i < 0]
s2 = [i for i in a if i > 0]
s3 = [i for i in a if i == 0]
def pr(x):
print(len(x), " ".join(map(str, x)))
if len(s2) == 0:
s2.append(s1.pop())
s2.append(s1.pop())
if len(s1) % 2 == 0:
s3.append(s1.pop())
pr(s1)
pr(s2)
pr(s3)
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int n = 0, m = 0, i = 1;
scanf("%d%d", &n, &m);
if (n < m) {
printf("-1");
} else if (n == m) {
printf("%d", n);
} else if (((n / 2) + (n % 2)) % m == 0) {
printf("%d", ((n / 2) + (n % 2)));
} else {
i = (n / 2) + (n % 2);
while (i % m != 0) {
i++;
}
printf("%d", i);
}
return 0;
}
| 1,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1E6 + 7;
vector<long long> pre[N], dis[N];
int t[N];
long long query(int s, long long h) {
if (h <= 0) return 0;
int p = upper_bound(begin(dis[s]), end(dis[s]), h) - begin(dis[s]);
return p * h - pre[s][p - 1];
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 2; i <= n; i++) cin >> t[i];
for (int i = n; i >= 1; i--) {
dis[i].emplace_back(0);
for (int c = 0; c < 2; c++) {
int x = 2 * i + c;
if (x > n) continue;
for (long long it : dis[x]) {
dis[i].emplace_back(it + t[x]);
}
}
sort(begin(dis[i]), end(dis[i]));
int tot = dis[i].size();
pre[i].resize(tot);
for (int j = 1; j < tot; j++) pre[i][j] = pre[i][j - 1] + dis[i][j];
}
while (m--) {
int a, h;
long long ans = 0;
cin >> a >> h;
ans += query(a, h);
while (a > 1) {
int b = a;
a >>= 1;
h -= t[b];
if (h <= 0) break;
ans += h;
int x = 2 * a == b ? 2 * a + 1 : 2 * a;
if (x <= n) ans += query(x, h - t[x]);
}
cout << ans << '\n';
}
return 0;
}
| 2,200 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int flag = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0') {
s.erase(s.begin() + i);
flag = 1;
break;
}
}
if (flag == 0) {
s.erase(s.begin() + 1);
}
cout << s;
}
| 1,100 |
CPP
|
count = 0
for i in range(int(input())):
p, q = map(int, input().split())
if q - p >= 2:
count += 1
print(count)
| 800 |
PYTHON3
|
n = int(input())
minus = plus = 0
for i in range(0, n):
a, b = map(int, input().split())
if a < 0:
minus += 1
else:
plus += 1
plus = min(plus, minus)
if plus < 2:
print("Yes")
else:
print("No")
| 800 |
PYTHON3
|
import os,sys
from io import BytesIO, IOBase
from collections import defaultdict,Counter
from copy import deepcopy
from heapq import *
class Node:
def __init__(self,val,occ):
self.val = val
self.occ = occ
self.dec = (val-val//2)*occ
def __lt__(self,other):
return self.dec > other.dec
def __str__(self):
return f'{self.val} {self.occ} {self.dec}'
def main():
for _ in range(int(input())):
n,s = map(int,input().split())
path = defaultdict(set)
cost = {}
for _ in range(n-1):
u,v,w = map(int,input().split())
path[u].add(v)
path[v].add(u)
cost[(u,v)] = w
path1 = deepcopy(path)
child = Counter()
st = [1]
while len(st):
if not len(path[st[-1]]):
if not child[st[-1]]:
child[st[-1]] = 1
if len(st) > 1:
child[st[-2]] += child[st[-1]]
st.pop()
continue
i = path[st[-1]].pop()
path[i].remove(st[-1])
st.append(i)
st,y = [1],[]
while len(st):
if not len(path1[st[-1]]):
st.pop()
continue
i = path1[st[-1]].pop()
path1[i].remove(st[-1])
st.append(i)
if cost.get((st[-1],st[-2])):
y.append(Node(cost[(st[-1],st[-2])],child[st[-1]]))
cost[(st[-1],st[-2])] *= child[st[-1]]
else:
y.append(Node(cost[(st[-2],st[-1])],child[st[-1]]))
cost[(st[-2],st[-1])] *= child[st[-1]]
x = sum(cost.values())
heapify(y)
ans = 0
while x > s:
z = heappop(y)
x -= z.dec
z = Node(z.val//2,z.occ)
if z.val:
heappush(y,z)
ans += 1
print(ans)
#Fast IO Region
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
if __name__ == '__main__':
main()
| 2,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> P, Q, q[200000],
D[8] = {make_pair(-1, -2), make_pair(-2, -1), make_pair(-2, 1),
make_pair(1, -2), make_pair(2, -1), make_pair(2, 1),
make_pair(1, 2), make_pair(-1, 2)};
int t, t1, t2, n, he, ta, x, y, v[300][300], f[300];
bool b[300][300];
long long k;
const long long MO = int(1e9) + 7;
void bfs() {
he = 0;
ta = 1;
q[1] = make_pair(100, 100);
memset(v, -1, sizeof(v));
v[100][100] = 0;
f[0] = 1;
while (he < ta) {
pair<int, int> P = q[++he];
for (int d = 0; d <= 7; d++) {
pair<int, int> Q =
make_pair(P.first + D[d].first, P.second + D[d].second);
if (Q.first < 0 || Q.first >= 200 || Q.second < 0 || Q.second >= 200)
continue;
if (b[Q.first][Q.second]) continue;
if (v[Q.first][Q.second] != -1) continue;
v[Q.first][Q.second] = v[P.first][P.second] + 1;
f[v[Q.first][Q.second]]++;
q[++ta] = Q;
}
}
}
int main() {
cin >> k >> n;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
x += 100;
y += 100;
b[x][y] = 1;
}
bfs();
for (int i = 1; i <= 41; i++) f[i] += f[i - 1];
if (k <= 40)
cout << f[k] << endl;
else if (f[40] == f[41])
cout << f[40] << endl;
else {
t1 = f[40];
t2 = f[41];
t = t2 - t1;
cout << ((k - 40) % MO * t % MO +
(k - 41) % MO * 14 % MO * ((k - 40) % MO) % MO + t1) %
MO
<< endl;
}
return 0;
}
| 3,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int q[32], qq[32], pos[32], n, p;
bool f[32][32][50005];
pair<bool, unsigned short> fr[32][32][50005];
int main() {
scanf("%d%d", &n, &p);
for (int i = (int)(1); i <= (int)(n); i++) {
int x;
scanf("%d", &x);
if (x <= 31) {
q[++*q] = x;
pos[*q] = i;
}
}
for (int i = (int)(1); i <= (int)(*q); i++) {
f[i][q[i]][q[i] % p] = 1;
fr[i][q[i]][q[i] % p] = pair<bool, unsigned short>(1, p + 1);
for (int j = (int)(0); j <= (int)(31); j++)
for (int k = (int)(0); k <= (int)(p - 1); k++)
if (f[i - 1][j][k]) {
f[i][j][k] = 1;
fr[i][j][k] = pair<bool, unsigned short>(0, 0);
int nv = (k * (q[i] <= 9 ? 10 : 100) + q[i]) % p;
f[i][j ^ q[i]][nv] = 1;
fr[i][j ^ q[i]][nv] = pair<bool, unsigned short>(1, k);
}
}
if (!f[*q][0][0]) return puts("No"), 0;
puts("Yes");
int px = 0, py = 0;
for (int i = (int)(*q); i >= (int)(1); i--) {
if (py < 0 || py >= p) break;
if (fr[i][px][py].first == 0) continue;
int v1 = fr[i][px][py].second;
px ^= q[i];
py = v1;
qq[++*qq] = pos[i];
}
reverse(qq + 1, qq + *qq + 1);
printf("%d\n", *qq);
for (int i = (int)(1); i <= (int)(*qq); i++) printf("%d ", qq[i]);
}
| 2,900 |
CPP
|
n=int(input())
if n%2==0:
print(str(n-4)+" 4")
else:
print(str(n-9)+" 9")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int f(int n, int m, int x) {
n -= 2 * (x - 1);
m -= 2 * (x - 1);
if (n <= 0 || m <= 0)
return 0;
else {
int ans = n * (m / 2);
if (m % 2) ans += n / 2 + n % 2;
return ans;
}
}
int main() {
int n, m, x;
cin >> n >> m >> x;
cout << f(n, m, x) - f(n, m, x + 1) << endl;
return 0;
}
| 1,600 |
CPP
|
if __name__ == '__main__':
l = int(input())
s = input()
now = ''
for i in range(l):
if s[i] < now:
print(f'YES\n{i} {i + 1}')
break
now = s[i]
else:
print('NO')
| 1,000 |
PYTHON3
|
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop,heapify
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
# mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def b(i):
# ord(i) -> Ascii value of i
return ord(i)-ord('a')
file = 1
def solve():
for _ in range(ii()):
n=ii()
s=si()
ans=0
z,o=[],[]
x=[0]*n
c=0
for i in range(n):
if s[i]=='0':
if len(o):
x[i]=o[-1]
o.pop()
z.append(x[i])
else:
c+=1
z.append(c)
x[i]=c
else:
if len(z):
x[i]=z[-1]
z.pop()
o.append(x[i])
else:
c+=1
o.append(c)
x[i]=c
print(len(set(x)))
print(*x)
if __name__ =="__main__":
if(file):
if path.exists('input.txt'):
sys.stdin=open('input.txt', 'r')
sys.stdout=open('output.txt','w')
else:
input=sys.stdin.readline
solve()
| 1,500 |
PYTHON3
|
import sys
input = sys.stdin.readline
def main():
Q = int(input())
UV = [[int(x) for x in input().split()] for _ in range(Q)]
for u, v in UV:
if u == v:
print("YES")
elif u > v:
print("NO")
else:
u_one = bin(u).count("1")
u_i = []
v_i = []
for i in range(32):
if u >> i & 1:
u_i.append(i)
if v >> i & 1:
v_i.append(i)
v_one = bin(v).count("1")
if u_one == v_one:
f = True
for a, b in zip(u_i, v_i):
if a > b:
f = False
break
if f:
print("YES")
else:
print("NO")
elif u_one > v_one:
f = True
for a, b in zip(u_i, v_i):
if a > b:
f = False
break
if f:
print("YES")
else:
print("NO")
else:
print("NO")
if __name__ == '__main__':
main()
| 1,800 |
PYTHON3
|
#include <bits/stdc++.h>
int main() {
int y = 999999, x, l, v, n, t, c = 0, d, e, f, i, j, dizi[100199],
dixi[100199], sizi[100199][2], say = 1;
scanf("%d %d %d %d", &l, &v, &n, &t);
for (i = 1; i <= l; i++) scanf("%d", &dizi[i]);
for (i = 1; i <= v; i++) {
scanf("%d", &dixi[i]);
}
i = 1;
j = 1;
while (y != 0) {
if (j > v || i > l) break;
if ((dizi[i] - n) <= dixi[j] && (dizi[i] + t) >= dixi[j]) {
sizi[say][0] = i;
sizi[say][1] = j;
i++;
j++;
say++;
continue;
}
if ((dizi[i] + t) < dixi[j]) i++;
if ((dizi[i] - n) > dixi[j]) j++;
}
printf("%d\n", say - 1);
for (i = 1; i <= say; i++) {
if (sizi[i][0] != 0 && sizi[i][1] != 0)
printf("%d %d\n", sizi[i][0], sizi[i][1]);
}
return 0;
}
| 1,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
void solve() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
long long dp[200005];
memset(dp, 0, sizeof(dp));
for (long long i = 0; i < n; i++) dp[a[i]] = 1;
long long ans = 1;
for (long long i = 0; i < n; i++) {
long long x = a[i];
vector<long long> divs;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0) {
dp[x] = max(dp[x], dp[i] + 1);
divs.push_back(i);
if (i != (x / i)) {
dp[x] = max(dp[x], dp[(x / i)] + 1);
divs.push_back((x / i));
}
}
}
for (auto i : divs) dp[i] = dp[x];
ans = max(ans, dp[x]);
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
t = 1;
for (long long i = 0; i < t; i++) {
solve();
}
}
| 1,500 |
CPP
|
n = int(input())
A = list(map(int, input().split()))
answer = 0
lol = 10**9
for i in range(n):
num_ = i + 1
for k in range(n):
y = 0
y += abs(num_ - (k + 1)) * A[k]
y += k * A[k]
y += (num_ - 1) * A[k]
y *= 2
answer += y
if answer < lol:
lol = answer
print(lol)
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b, long long M) {
long long t = 1;
for (a %= M; b; b >>= 1) {
if (b & 1) t = t * a % M;
a = a * a % M;
}
return t;
}
inline int getc() {
static const int N = 222;
static char buf[N];
static int n = 0, p = 0;
if (p == n) p = 0, n = fread(buf, 1, N, stdin);
if (p == n) exit(0);
return buf[p++];
}
inline int R(int& first) {
int f = 1, c = getc();
first = 0;
while (c <= 32) c = getc();
if (c == '-') f = -1, c = getc();
for (; '0' <= c && c <= '9'; c = getc()) first = first * 10 + c - '0';
first *= f;
}
static const int N = 5e6, M = N + 5;
struct Sieve {
int p[M], m, v[M];
Sieve() {
for (int i = 2; i <= int(N); i++) {
if (!v[i]) p[++m] = i;
for (int j = 1; j <= int(m); j++) {
int k = i * p[j];
if (k > N) break;
v[k] = 1;
if (i % p[j] == 0) break;
}
}
}
bool operator()(int i) { return !v[i]; }
} isprime;
int s[M];
map<long long, long long> q[M];
long long f(long long p, long long n) {
if (p <= 1) return n - 1;
if (q[p].count(n)) return q[p][n];
if (n <= N && p * p >= n) return s[n];
if (!isprime(p) || p * p > n)
return f(p - 1, n);
else
return f(p - 1, n) - (f(p - 1, n / p) - f(p - 1, p - 1));
}
int main() {
for (int i = 2; i <= int(N); i++) s[i] = s[i - 1] + isprime(i);
long long n;
cin >> n;
long long ans = s[(int)(powl(n, 1.0 / 3) + 1e-5)];
long long m = sqrt(n);
for (int i = 2; i <= int(m); i++)
if (isprime(i)) {
long long t = n / i;
ans += f(sqrt(t) + 1, t) - s[i];
}
cout << ans << endl;
}
| 2,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T;
cin >> T;
while (T) {
long long input[3];
long long sum = 0;
long long output = 0;
for (int i = 0; i < 3; i++) {
cin >> input[i];
sum += input[i];
}
output = sum / 2;
cout << output << endl;
T--;
}
}
| 800 |
CPP
|
import math
t = int(input())
for i in range(t):
n = int(input())
sum = n * (n + 1) // 2
sum = sum - 2 * (pow(2, math.floor(math.log2(n)) + 1) - 1)
print(sum)
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int a[105], b[105], print[105];
int main() {
int n, k, i, p;
int sum, count;
scanf("%d%d", &n, &k);
int j = 1;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[j] = a[i];
j++;
}
sort(a, a + i);
if (a[1] > k) {
printf("0\n");
} else {
sum = 0;
count = 0;
for (int i = 1; i <= n; i++) {
sum = sum + a[i];
count++;
if (sum >= k) {
if (sum == k) {
break;
} else {
sum = sum - a[i];
count--;
break;
}
}
}
p = 1;
for (int i = 1; i <= count; i++) {
for (int j = 1; j <= n; j++) {
if (a[i] == b[j]) {
print[p] = j;
b[j] = 0;
p++;
}
}
}
sort(print, print + p);
printf("%d\n", count);
for (p = 1; p <= count; p++) {
printf("%d ", print[p]);
}
printf("\n");
}
}
| 1,000 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int>::max();
const long long linf = numeric_limits<long long>::max();
const int max_n = 101;
int n, m, q;
bool g[max_n][max_n][max_n], visited[max_n];
bool dfs(int st, int end, int col, int par = -1) {
if (st == end) return true;
if (visited[st]) return false;
visited[st] = true;
bool ret = false;
for (int i = 0; i < (max_n); ++i) {
if (g[st][i][col] && i != par) ret |= dfs(i, end, col, st);
}
return ret;
}
int main() {
int u, v, c;
cin >> n;
cin >> m;
for (int i = 0; i < (m); ++i) {
cin >> u, cin >> v, cin >> c;
g[u][v][c] = true;
g[v][u][c] = true;
}
cin >> q;
for (int i = 0; i < (q); ++i) {
cin >> u, cin >> v;
c = 0;
for (int j = (1); j < (m + 1); ++j) {
fill(visited, visited + max_n, false);
c += dfs(u, v, j);
}
cout << c << endl;
}
return 0;
}
| 1,400 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int n, m, k, i, j, a[1002][1002], vis[12], col[1002][1002];
int read() {
char c = getchar();
int w = 0;
while (c < '0' || c > '9') c = getchar();
while (c <= '9' && c >= '0') {
w = w * 10 + c - '0';
c = getchar();
}
return w;
}
int count(int x) {
int ans = 0;
for (int i = 0; (1 << i) <= x; i++) {
if (x & (1 << i)) ans++;
}
return ans;
}
int dfs(int x, int y) {
if (y == m + 1) x++, y = 1;
if (x == n + 1) return 1;
int s = (col[x - 1][y] | col[x][y - 1]) ^ ((1 << k) - 1), ans = 0, tmp = -1;
if (n - x + m - y + 1 > count(s)) return 0;
for (int i = 0; (1 << i) <= s; i++) {
if (s & (1 << i) && (a[x][y] == 0 || a[x][y] == i + 1)) {
col[x][y] = (col[x][y - 1] | col[x - 1][y] | (1 << i));
vis[i + 1]++;
if (vis[i + 1] == 1) {
if (tmp == -1) tmp = dfs(x, y + 1);
ans = (ans + tmp) % mod;
} else
ans = (ans + dfs(x, y + 1)) % mod;
vis[i + 1]--;
}
}
return ans;
}
int main() {
n = read();
m = read();
k = read();
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
a[i][j] = read();
vis[a[i][j]]++;
}
}
if (n + m - 1 > k)
puts("0");
else
printf("%d\n", dfs(1, 1));
return 0;
}
| 2,700 |
CPP
|
import sys, itertools, math
def ia():
return [int(i) for i in sys.stdin.readline().strip().split(" ")]
def ii():
return int(sys.stdin.readline().strip())
def istr():
return sys.stdin.readline().strip()
###
n, x = ia()
t = 1
ans = 0
for _ in range(n):
l, r = ia()
s = (l-t)//x
t += s*x
ans += r - t + 1
t = r + 1
print(ans)
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int mult(int a, int b) { return (1LL * a * b) % mod; }
int sum(int a, int b) {
int s = a + b;
if (s >= mod) s -= mod;
return s;
}
int sub(int a, int b) {
int s = a - b;
if (s < 0) s += mod;
return s;
}
int pw(int a, int b) {
if (b == 0) return 1;
if (b & 1) return mult(a, pw(a, b - 1));
int res = pw(a, b / 2);
return mult(res, res);
}
const int maxN = 3605;
int c[maxN][maxN];
int h, w, n;
int dp[maxN][maxN];
int f[2][maxN];
void solve(vector<int>& X, int z) {
memset(dp, 0, sizeof dp);
sort(X.begin(), X.end());
int c = X.back() - 1;
vector<bool> bad(c + 2, false);
for (int v : X) bad[v] = true;
dp[0][0] = 1;
for (int i = 1; i <= c; i++) {
for (int cnt = 0; 2 * cnt <= i - 1; cnt++) {
dp[i][cnt] = sum(dp[i][cnt], dp[i - 1][cnt]);
if (i >= 2 && !bad[i] && !bad[i - 1]) {
dp[i][cnt + 1] = sum(dp[i][cnt + 1], dp[i - 2][cnt]);
}
}
}
for (int v = 0; v < maxN; v++) {
f[z][v] = dp[c][v];
}
}
int fact[maxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> h >> w >> n;
vector<int> badX, badY;
c[0][0] = 1;
fact[0] = 1;
for (int i = 1; i < maxN; i++) {
fact[i] = mult(fact[i - 1], i);
c[i][0] = 1;
for (int j = 1; j <= i; j++) c[i][j] = sum(c[i - 1][j], c[i - 1][j - 1]);
}
badX.emplace_back(0);
badX.emplace_back(h + 1);
badY.emplace_back(w + 1);
badY.emplace_back(0);
int freeX = h;
int freeY = w;
for (int i = 1; i <= n; i++) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2) {
badX.emplace_back(r1);
badY.emplace_back(c1);
badY.emplace_back(c2);
freeX -= 1;
freeY -= 2;
} else {
badX.emplace_back(r1);
badX.emplace_back(r2);
badY.emplace_back(c1);
freeX -= 2;
freeY -= 1;
}
}
for (int z = 0; z < 2; z++) {
solve(badX, z);
swap(badX, badY);
}
int ans = 0;
for (int takeX = 0; 2 * takeX <= freeX; takeX++) {
for (int takeY = 0; 2 * takeY <= freeY; takeY++) {
int z = mult(
c[freeX - 2 * takeX][takeY],
mult(c[freeY - 2 * takeY][takeX], mult(f[0][takeX], f[1][takeY])));
ans = sum(ans, mult(fact[takeX],
mult(fact[takeY],
mult(c[freeX - 2 * takeX][takeY],
mult(c[freeY - 2 * takeY][takeX],
mult(f[0][takeX], f[1][takeY]))))));
}
}
cout << ans;
}
| 2,600 |
CPP
|
n = int(input())
a = input() + '$'
b = input() + '$'
weight = 0
i = 0
while i < n:
if a[i] != b[i]:
weight += 1
if a[i] == b[i + 1] and a[i + 1] == b[i]:
i += 2
continue
i += 1
print(weight)
| 1,300 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long min(long long a, long long b) { return (a < b) ? a : b; }
long long max(long long a, long long b) { return (a > b) ? a : b; }
long long fp(long long a, long long b) {
if (b == 0) return 1;
long long x = fp(a, b / 2);
x = (x * x) % mod;
if (b & 1) x = (x * a) % mod;
return x;
}
auto random_add = [] {
char *p = new char;
delete p;
return uint64_t(p);
};
const uint64_t SEED =
chrono::steady_clock::now().time_since_epoch().count() * (random_add() | 1);
mt19937_64 rng(SEED);
const long long N = 2e5 + 5;
vector<array<long long, 6>> ans;
long long n, m;
string s[N], s2[N];
void mysolve(array<long long, 6> arr) {
for (long long i = 0; i < 6; i += 2) {
s[arr[i]][arr[i + 1]] ^= 1;
}
}
void solve(long long i, long long j) {}
void per(long long i, long long j) {
if (s[i][j] == '0') return;
vector<array<long long, 2>> v = {{0, 1}, {1, 0}, {1, 1}, {1, -1}};
array<long long, 6> x;
long long idx = 0;
long long count = 0;
for (auto k : v) {
long long nx = k[0] + i;
long long ny = k[1] + j;
if (nx >= 1 && nx <= n && ny >= 1 && ny <= m) {
x[idx] = nx;
idx++;
x[idx] = ny;
idx++;
if (s[nx][ny] == '1')
s[nx][ny] = '0';
else
s[nx][ny] = '1';
count++;
if (count == 2) break;
}
}
x[idx] = i;
idx++;
x[idx] = j;
idx++;
s[i][j] ^= 1;
ans.push_back(x);
}
void per2(long long i, long long j) {
if (s[i][j] == '0') return;
vector<array<long long, 2>> v;
if (i == n - 1) {
v = {{0, 1}, {1, 1}};
} else {
v = {{0, 1}, {-1, 1}};
}
array<long long, 6> x;
long long idx = 0;
long long count = 0;
for (auto k : v) {
long long nx = k[0] + i;
long long ny = k[1] + j;
if (nx >= 1 && nx <= n && ny >= 1 && ny <= m) {
x[idx] = nx;
idx++;
x[idx] = ny;
idx++;
if (s[nx][ny] == '1')
s[nx][ny] = '0';
else
s[nx][ny] = '1';
count++;
if (count == 2) break;
}
}
x[idx] = i;
idx++;
x[idx] = j;
idx++;
s[i][j] ^= 1;
ans.push_back(x);
}
void solve1() {
set<long long> st;
long long ct = 0;
for (long long i = n - 1; i <= n; i++) {
for (long long j = m - 1; j <= m; j++) {
st.insert(s[i][j]);
if (s[i][j] == '1') ct++;
}
}
if (st.size() == 1 && st.find('0') != st.end()) return;
array<long long, 6> arr;
long long idx = 0;
long long y = '1';
if (ct == 2) y = '0';
for (long long i = n - 1; i <= n; i++) {
for (long long j = m - 1; j <= m; j++) {
if (s[i][j] == y) {
if (idx != 6) {
arr[idx] = i;
idx++;
arr[idx] = j;
idx++;
}
}
}
}
for (long long i = n - 1; i <= n; i++) {
for (long long j = m - 1; j <= m; j++) {
if (s[i][j] == y ^ 1) {
if (idx != 6) {
arr[idx] = i;
idx++;
arr[idx] = j;
idx++;
}
}
}
}
mysolve(arr);
ans.push_back(arr);
solve1();
}
void solve3(array<long long, 6> a) {
for (long long i = 0; i < 6; i += 2) {
s2[a[i]][a[i + 1]] ^= 1;
}
}
void solve() {
ans.clear();
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
cin >> s[i];
s2[i] = '#' + s[i];
s[i] = '#' + s[i];
}
for (long long i = 1; i <= n - 2; i++) {
for (long long j = 1; j <= m; j++) {
per(i, j);
}
}
for (long long j = 1; j <= m - 2; j++) {
for (long long i = n - 1; i <= n; i++) {
per2(i, j);
}
}
solve1();
cout << ans.size() << "\n";
for (auto i : ans) {
set<array<long long, 2>> pp;
for (long long j = 0; j < 6; j += 2) pp.insert({i[j], i[j + 1]});
if (pp.size() != 3) {
cout << "Bug";
exit(0);
}
for (auto j : i) cout << j << " ";
cout << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0));
long long t = 1;
cin >> t;
for (long long i = 1; i <= t; i++) {
solve();
}
}
| 1,500 |
CPP
|
my_string = input().split(' ')
num = int(my_string[0])
k = int(my_string[1])
while (k > 0):
if (num % 10 == 0):
num = int(num/10)
else:
num -= 1
k -= 1
print(num)
| 800 |
PYTHON3
|
size = int(input())
string = input()
maxCycleSize = 1
i = 0
while i < len(string)//2 + 1:
if(string[0:i] == string[i: 2*i]):
maxCycleSize = i if i > 0 else 1
#print(maxCycleSize)
i += 1
print(size - maxCycleSize + 1)
| 1,400 |
PYTHON3
|
for _ in range(int(input())) :
n = int(input())
m = n
arr = list(map(int,input().split()))
n = n//2
small = arr.copy()
arr.sort(reverse=True)
small.sort()
result = []
for i in range(n) :
result.append(arr[i])
result.append(small[i])
if m%2==1 :
result.append(arr[n])
result = result[::-1]
print(*result)
# for i in range(len(result)-2) :
# if abs(result[i] - result[i+1]) > abs(result[i+1] - result[i+2]) :
# print('yes')
| 1,200 |
PYTHON3
|
# -*- coding: utf-8 -*-
"""
Created on Sun May 10 07:41:14 2020
@author: Kashem Pagla
"""
for _ in range(int(input())):
n=int(input())
even=[];odd=[]
if(n<4): print("-1")
else:
for i in range(1,n+1):
if(i%2==0): even.append(i)
else: odd.append(i)
print(*(sorted(odd, reverse=True)+sorted(even[:2], reverse=True)+even[2:]))
| 1,600 |
PYTHON3
|
for _ in range(int(input())):
n=int(input())
a=[int(x) for x in input().split()]
s=sum(a)
if(s==0):
print("NO")
elif(s>0):
a.sort(reverse=True)
print("YES")
print(*a)
else:
a.sort()
print("YES")
print(*a)
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
#define pii pair<int, int>
#define f first
#define s second
#define ll long long
#define oo 1000000000
#define piii pair<pii, int>
#define pb push_back
using namespace std;
void solve() {
int n;
cin >> n;
vector<int>p(n + 1), pos(n + 1);
for(int i = 1; i <= n; ++i) {
cin >> p[i];
pos[p[i]] = i;
}
vector<bool>visited(n + 1, false);
vector<vector<int>>cycles;
vector<pii>res;
for(int i = 1; i <= n; ++i) {
if(!visited[i]) {
vector<int>cycle;
int node = i;
while(!visited[node]) {
cycle.pb(node);
visited[node] = true;
node = p[node];
}
if((int)cycle.size() >= 2) {
cycles.pb(cycle);
}
}
}
while((int)cycles.size() > 1) {
vector<int>cycle1 = cycles.back();
cycles.pop_back();
vector<int>cycle2 = cycles.back();
cycles.pop_back();
if((int)cycle1.size() > (int)cycle2.size()) {
swap(cycle1, cycle2);
}
reverse(cycle2.begin(), cycle2.end());
for(int i = 0; i < (int)cycle1.size(); ++i) {
res.pb({cycle1[i], cycle2[i]});
swap(p[cycle1[i]], p[cycle2[i]]);
}
for(int i = 0; i < (int)cycle1.size(); ++i) {
while(p[cycle1[i]] != cycle1[i]) {
res.pb({cycle1[i], p[cycle1[i]]});
swap(p[cycle1[i]], p[p[cycle1[i]]]);
}
}
}
if(!cycles.empty()) {
int inpos = 0;
for(int i = 1; i <= n && inpos == 0; ++i) {
if(p[i] == i) {
inpos = i;
}
}
if(inpos) {
for(int i = 0; i < (int)cycles[0].size(); ++i) {
res.pb({inpos, cycles[0][i]});
swap(p[inpos], p[cycles[0][i]]);
}
res.pb({inpos, cycles[0][0]});
swap(p[inpos], p[cycles[0][0]]);
}else { /// cycle size > 2, otherwise there will be some i, where p[i] = i
int i = cycles[0][0];
int idx = p[i];
res.pb({pos[i], p[i]});
swap(p[pos[i]], p[p[i]]);
res.pb({i, pos[i]});
swap(p[i], p[pos[i]]);
while(p[idx] != idx) {
res.pb({p[idx], idx});
swap(p[p[idx]], p[idx]);
}
}
}
cout << res.size() << '\n';
for(pii pr : res) {
cout << pr.f << " " << pr.s << '\n';
}
}
int main()
{
int t = 1;
// cin >> t;
while(t--) {
solve();
}
return 0;
}
| 2,800 |
CPP
|
import sys
def main():
n = int(sys.stdin.readline().strip())
for i in range(n):
x = int(sys.stdin.readline().strip())
if x not in [1, 2, 4, 5, 8, 11]:
print("YES")
else:
print("NO")
main()
| 900 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int n, m, f[550][26][26], fx[550][26][26], fy[550][26][26];
char a[550][550];
int calc(int n, int x, int y) {
int s = 0;
for (int i = 0; i < m; i++) {
int v = int(a[n][i]) - int('a');
s += int((i % 2 == 0 ? x : y) != v);
}
return s;
}
int main() {
scanf("%d%d\n", &n, &m);
for (int i = 0; i < n; i++) gets(a[i]);
for (int r = 0; r < n; r++)
for (int i = 0; i < 26; i++)
for (int j = 0; j < 26; j++) {
int v = calc(r, i, j);
if (r == 0)
f[r][i][j] = v;
else {
int now = n * m;
for (int x = 0; x < 26; x++)
if (x != i)
for (int y = 0; y < 26; y++)
if (y != x && y != j && now > f[r - 1][x][y] + v) {
now = f[r - 1][x][y] + v;
fx[r][i][j] = x;
fy[r][i][j] = y;
}
f[r][i][j] = now;
}
}
int res = n * m, x, y;
for (int i = 0; i < 26; i++)
for (int j = 0; j < 26; j++)
if (i != j && res > f[n - 1][i][j]) {
res = f[n - 1][i][j];
x = i;
y = j;
}
printf("%d\n", res);
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j < m; j++)
a[i][j] = (j % 2 == 0 ? char(x + 97) : char(y + 97));
int xx = fx[i][x][y];
int yy = fy[i][x][y];
x = xx;
y = yy;
}
for (int i = 0; i < n; i++) puts(a[i]);
return 0;
}
| 2,000 |
CPP
|
for i in range(int(input())):
n = int(input())
a = [int(j) for j in input().split()]
dp = [10 ** 18 for j in range(n)]
dp[0] = a[0]
if (n > 1):
dp[1] = a[1] + a[0]
for j in range(2, n):
# 1 1
if (j >= 2):
dp[j] = min(dp[j], dp[j - 2] + a[j])
# 1 2
if (j >= 3):
dp[j] = min(dp[j], dp[j - 3] + a[j] + a[j - 1])
# 2 1
if (j >= 3):
dp[j] = min(dp[j], dp[j - 3] + a[j])
# 2 2
if (j >= 4):
dp[j] = min(dp[j], dp[j - 4] + a[j] + a[j - 1])
print(min(dp[max(0, n - 1)], dp[max(0, n - 2)], dp[max(0, n - 3)]))
| 1,500 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
inline long long add(long long a, long long b) {
return (a % 1000000007 + b % 1000000007) % 1000000007;
}
inline long long mul(long long a, long long b) {
return (a % 1000000007 * b % 1000000007) % 1000000007;
}
long long pwr(long long a, long long b) {
if (!b) return 1ll;
long long t = pwr(a, b / 2);
t = mul(t, t);
if (b & 1) t = mul(t, a);
return t;
}
long long modinv(long long a, long long b = 1000000007) {
return pwr(a, b - 2);
}
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
int x = a - b, y = a + b;
int p = c - d, q = c + d;
int mn = x * n, flag = 1;
for (int i = 1; i <= n; i++) {
if (mn <= q && mn >= p) {
flag = 0;
break;
}
if (mn < p) {
int diff = p - mn;
mn += min(diff, 2 * b);
}
}
if (mn <= q && mn >= p) {
flag = 0;
}
if (flag)
cout << "No\n";
else
cout << "Yes\n";
}
}
| 900 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
struct node {
int l, r, op;
bool operator<(node b) const { return r < b.r || (r == b.r && l < b.l); }
} a[N];
multiset<int> s[2];
int n, ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d%d", &a[i].l, &a[i].r, &a[i].op), a[i].op--;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
int t = a[i].op;
set<int>::iterator it = s[t ^ 1].lower_bound(a[i].l);
if (it == s[t ^ 1].end()) {
s[t].insert(a[i].r);
} else {
ans++;
s[t ^ 1].erase(it);
}
}
printf("%d\n", n - ans);
return 0;
}
| 2,600 |
CPP
|
#include <bits/stdc++.h>
int gcd(int a, int b) {
int tmp;
while (a % b) {
tmp = b;
b = a % b;
a = tmp;
}
return b;
}
int main() {
int n;
int l, l1, l2, tmp;
int num[1001], ans;
for (l = 2, num[1] = 0; l <= 1000; num[l] = 1, l++)
;
for (l = 2; l <= 1000; l++) {
for (l1 = 2; l1 < l; l1++) {
if (l % l1 == 0 && gcd(l1, l / l1) == 1) {
num[l] = 0;
break;
}
}
}
while (1 == scanf("%d", &n)) {
for (l = 2, ans = 0; l <= n; l++) {
if (num[l]) ans++;
}
printf("%d\n", ans);
for (l = 2; l <= n; l++) {
if (num[l]) printf("%d ", l);
}
putchar('\n');
}
return 0;
}
| 1,500 |
CPP
|
n = int(input())
pline = input().split(' ')
p = [int(i) for i in pline]
q = [0 for i in range(n)]
for i in range(n):
q[p[i]-1] = i+1
res = ''
for i in range(n-1):
res += str(q[i])+' '
res += str(q[-1])
print(res)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
long long int s = 0, x = (n + 1) / 2;
long long int a[n + 1][n + 1];
for (long long int i = 1; i < n + 1; i++) {
for (long long int j = 1; j < n + 1; j++) cin >> a[i][j];
}
for (long long int i = 1; i < n + 1; i++) {
for (long long int j = 1; j < n + 1; j++) {
if (i == j) s = s + a[i][j];
}
}
for (long long int i = 1; i < n + 1; i++) s = s + a[i][x];
for (long long int i = 1; i < n + 1; i++) s = s + a[x][i];
for (long long int i = 1, j = n; i < n + 1; i++, j--) s = s + a[i][j];
s = s - (3 * a[x][x]);
cout << s;
}
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
long long int t = 1;
while (t--) solve();
return 0;
}
| 800 |
CPP
|
n = int(input())
arr = [['' for _ in range(n)] for _ in range(n)]
for i in range(n):
for j in range(n):
if (i+j)%2>0:
arr[i][j] = 'W'
else:
arr[i][j] = 'B'
print(''.join(arr[i]))
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const int INF = 0x3f3f3f3f;
const int N = 1e7 + 10;
int phi[N], prime[N], Min[N], sum[N];
int pcnt = 0;
bitset<N> vis;
inline int read() {
int x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') flag = -1, ch = getchar();
while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch - '0'), ch = getchar();
return x * flag;
}
inline void init(int n) {
phi[1] = 1;
for (int i = (2), iend = (n); i <= iend; i++) {
if (!vis[i]) prime[++pcnt] = i, phi[i] = i - 1, sum[Min[i] = i]++;
for (int j = 1; j <= pcnt && i * prime[j] <= n; j++) {
vis[i * prime[j]] = true;
phi[i * prime[j]] = phi[i] * (prime[j] - 1);
sum[Min[i * prime[j]] = min(Min[i], prime[j])]++;
if (i % prime[j] == 0) {
phi[i * prime[j]] = phi[i] * prime[j];
break;
}
}
}
}
int main() {
int n = read();
long long cnt = 1;
if (n == 1) return puts("0"), 0;
init(n);
long long ans0 = 0, ans1 = 0, ans2 = 0, ans3 = 0;
for (int i = (n / 2 + 1), iend = (n); i <= iend; i++) cnt += !vis[i];
ans0 = 1ll * cnt * (n - 1) - 1ll * cnt * (cnt - 1) / 2, cnt = 0;
for (int i = (2), iend = (n); i <= iend; i++) cnt += phi[i];
ans1 = 1ll * n * (n - 1) / 2 - cnt, cnt = 0;
for (int i = (n), iend = (1); i >= iend; i--) sum[i] += sum[i + 1];
cnt += (n - 1);
for (int i = (1), iend = (pcnt); i <= iend; i++) cnt += sum[n / prime[i] + 1];
for (int i = (1), iend = (n); i <= iend; i++) sum[i] = sum[i + 1] + !vis[i];
for (int i = (1), iend = (pcnt); i <= iend; i++)
cnt -= sum[max(n / prime[i] + 1, prime[i])];
ans2 = 1ll * n * (n - 1) / 2 - ans1 - cnt;
ans3 = 1ll * n * (n - 1) / 2 - ans0 - ans1 - ans2;
printf("%lld\n", ans1 + 2 * ans2 + 3 * ans3);
return 0;
}
| 2,700 |
CPP
|
n,m=map(int,input().split())
l=[0]*(m)
for _ in range(n):
a,b=map(int,input().split())
for i in range(a,b+1):
l[i-1]=1
if(l.count(0)==0):
print(0)
else:
print(l.count(0))
for i in range(m):
if(l[i]==0):
print(i+1,end=" ")
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int k, vector<int> &arr, int mn) {
int MX = int(1e6);
if (k >= mn - 1) return mn;
int i, j;
for (i = mn; i >= k + 1; i--) {
int tot = 0;
for (j = 0; j <= MX; j += i) {
int mx = min(j + k, MX);
tot += (arr[mx] - (j > 0 ? arr[j - 1] : 0));
}
if (tot == n) return i;
}
return -33;
}
int main() {
int MX = (1e6) + 2;
vector<int> arr(MX - 1, 0);
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
int i, j;
int mn = MX;
for (i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
mn = min(mn, temp);
arr[temp]++;
}
for (i = 1; i < MX; i++) arr[i] += arr[i - 1];
printf("%d\n", solve(n, k, arr, mn));
}
| 2,100 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string str;
cin >> str;
long long ln = str.length();
long long le = -1, ri = -1;
for (long long i = 0; i < ln; ++i) {
if (str[i] == '1') {
le = i;
break;
}
}
for (long long i = ln - 1; i >= 0; i--) {
if (str[i] == '1') {
ri = i;
break;
}
}
if (le == -1 && ri == -1) {
cout << 0 << endl;
continue;
}
long long ans = 0;
for (long long i = le; i <= ri; ++i) {
if (str[i] == '0') ans++;
}
cout << ans << endl;
}
return 0;
}
| 800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char s[200005], to[128], ch;
set<int> p[3];
set<int>::iterator it;
int c[3][200005], a, n, q, i;
void add(int x, int y, int v) {
while (y < 200005) c[x][y] += v, y += (y & (-y));
}
int sum(int x, int y) {
int ret = 0;
while (y) ret += c[x][y], y -= (y & (-y));
return ret;
}
int F(int x, int y, int z) {
if (!p[x].size()) return 0;
if (!p[y].size()) return sum(x, n);
if (!p[z].size()) return 0;
int ret = sum(x, n), f1 = *p[y].begin(), f2 = *p[z].begin();
if (f2 > f1) ret -= sum(x, f2) - sum(x, f1);
it = p[y].end(), f1 = *--it;
it = p[z].end(), f2 = *--it;
if (f1 > f2) ret -= sum(x, f1) - sum(x, f2);
return ret;
}
int cal() { return F(0, 2, 1) + F(1, 0, 2) + F(2, 1, 0); }
int main() {
scanf("%d%d%s", &n, &q, s + 1);
to['R'] = 1;
to['S'] = 2;
for (i = 1; i <= n; ++i) p[to[s[i]]].insert(i), add(to[s[i]], i, 1);
cout << cal() << "\n";
while (q--) {
cin >> a >> ch;
add(to[s[a]], a, -1);
p[to[s[a]]].erase(a);
s[a] = ch;
add(to[s[a]], a, 1);
p[to[s[a]]].insert(a);
cout << cal() << "\n";
}
}
| 2,500 |
CPP
|
from sys import stdin as cin
from itertools import accumulate
lmap = lambda f, it: list(map(f, it))
def main():
t = int(next(cin).strip())
for i in range(t):
n, x = lmap(int, next(cin).strip().split())
nbrs = 0
for j in range(n-1):
u, v = lmap(int, next(cin).strip().split())
if u == x or v == x:
nbrs += 1
if nbrs <= 1:
print("Ayush")
else:
print("Ayush" if n % 2 == 0 else "Ashish")
main()
| 1,600 |
PYTHON3
|
n,k = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
minimum_score = arr[k-1]
count = 0
for i in arr:
if i<minimum_score or i==0:
break
else:
count+=1
print(count)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int solve();
int main() { solve(); }
const int inf = (int)1e9 + 7;
const int dd = (int)2e6 + 7;
int cnt[2 * dd], P[dd], S[dd], B[dd], n;
string s;
int mod, mod2, p = 3;
int P1[dd], H[dd];
int P2[dd], H2[dd];
struct MyHash {
string S;
MyHash(string s, int t, int t2) {
S = s;
mod = t, mod2 = t;
P1[0] = P2[0] = 1;
for (int i = 0; i < (int)s.size(); i++) P1[i + 1] = 1ll * P1[i] * p % mod;
for (int i = 0; i < (int)s.size(); i++) P2[i + 1] = 1ll * P2[i] * p % mod2;
for (int i = 0; i < (int)s.size(); i++)
H[i + 1] = (1ll * H[i] * p + get(s[i])) % mod;
for (int i = 0; i < (int)s.size(); i++)
H2[i + 1] = (1ll * H2[i] * p + get(s[i])) % mod2;
}
int get(char c) { return c == '(' ? 1 : 2; }
int get(int l, int len) {
return (H[l + len] + mod - 1ll * H[l] * P1[len] % mod) % mod;
}
int get2(int l, int len) {
return (H2[l + len] + mod - 1ll * H2[l] * P2[len] % mod) % mod;
}
int check(int i, int j) {
int l = 0, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (get(i, m) == get(j, m) && get2(i, m) == get2(j, m))
l = m;
else
r = m;
}
return S[i + l] < S[j + l];
}
};
int solve() {
cin >> s;
n = (int)s.size();
if (s.find(")") == -1 || s.find("(") == -1) {
cout << string(n, '(') + string(n, ')');
return 0;
}
s += s;
MyHash JJ(s, 1e8 + 13, 1e9 + 7);
n <<= 1;
for (int i = n - 1; i >= 0; i--) {
if (s[i] == ')')
cnt[i] = 0;
else
cnt[i] = cnt[i + 1] + 1;
}
n >>= 1;
int pos = -1, c = -1, len = inf, Q;
for (int i = 0; i < n; i++) {
B[i + 1] = B[i] + (s[i] == '(' ? 1 : -1);
P[i + 1] = min(P[i], B[i + 1]);
}
S[n] = B[n];
for (int i = n - 1; i >= 0; i--) {
S[i] = min(S[i + 1], B[i + 1]);
}
for (int i = 0; i < n; i++) {
if ((i ? s[i - 1] : s[n - 1]) == '(' || s[i] == ')') continue;
int cur = B[n] - B[i];
int q = min(S[i] - B[i], P[i] + cur);
q = min(q, 0);
q = -q;
int curlen = q + B[n] + q;
if (curlen == len ? (cnt[i] + q == c ? JJ.check(i, pos) : cnt[i] + q > c)
: curlen < len) {
pos = i;
c = cnt[i] + q;
len = curlen;
Q = q;
}
}
string ans = "";
for (int i = 0; i < Q; ++i) ans += '(';
for (int i = pos; i < pos + n; ++i) ans += s[i];
for (int i = 0; i < Q + B[n]; ++i) ans += ')';
cout << ans;
return 0;
}
| 2,700 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
struct edge {
int y, nxt, z;
} e[N * N];
int p[2 * N], deg[2 * N], ans[N * 2], fa[N * 2];
int eid, n, m;
char s[N][N];
int getf(int x) {
if (fa[x] == x)
return x;
else
return fa[x] = getf(fa[x]);
}
void merge(int x, int y) { fa[getf(x)] = getf(y); }
bool topo() {
queue<int> q;
int ct = 0, tot = 0;
for (int i = 1; i <= n + m; ++i)
if (fa[i] == i) {
tot++;
if (!deg[i]) q.push(i), ans[i] = 1, ct++;
}
while (q.size()) {
int x = q.front();
q.pop();
for (int i = p[x]; ~i; i = e[i].nxt) {
int y = e[i].y;
ans[y] = max(ans[y], ans[x] + e[i].z);
if (--deg[y] == 0) q.push(y), ct++;
}
}
if (ct == tot)
return 0;
else
return 1;
}
void add(int x, int y, int z) {
e[eid] = edge{y, p[x], z};
p[x] = eid++;
}
int main() {
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) fa[i] = i;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (s[i][j] == '=') merge(i, j + n);
memset(p, -1, sizeof(p));
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (s[i][j] != '=') {
if (getf(i) == getf(j + n)) {
puts("No");
return 0;
}
int x = getf(i), y = getf(j + n);
if (s[i][j] == '>')
add(y, x, 1), deg[x]++;
else
add(x, y, 1), deg[y]++;
}
if (topo()) {
puts("No");
return 0;
} else {
puts("Yes");
for (int i = 1; i <= n; ++i) printf("%d ", ans[getf(i)]);
puts("");
for (int i = n + 1; i <= n + m; ++i) printf("%d ", ans[getf(i)]);
puts("");
}
return 0;
}
| 2,000 |
CPP
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:500000000")
using namespace std;
long long K[100009], A[100009];
pair<long long, long long> S[100009];
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
scanf("%I64d %I64d", &S[i].first, &S[i].second);
}
sort(S, S + n);
for (i = 0; i < n; i++) {
A[i] = S[i].second;
K[i] = S[i].first;
}
for (i = 1; i < n; i++) {
if (K[i] - K[i - 1] > 20) continue;
long long one = 1LL << (2 * (K[i] - K[i - 1]));
if ((double)one * A[i] > A[i - 1] || one * A[i] >= A[i - 1]) continue;
A[i - 1] -= one * A[i];
A[i] += (A[i - 1] + one - 1) / one;
}
long long res = K[n - 1] + 1;
while (1) {
if (res - K[n - 1] > 20) {
cout << res << endl;
return 0;
}
long long one = 1LL << (2 * (res - K[n - 1]));
if (one >= A[n - 1]) {
cout << res << endl;
return 0;
}
res++;
}
}
| 1,600 |
CPP
|
x,y,m=map(int,input().split())
if x<=0 and y<=0:
if m<=max(x,y):
print(0)
else:
print(-1)
else:
if m<=max(x,y):
print(0)
exit()
if x>y:
x,y=y,x
op=0
if x<0:
ad=(abs(x)+y-1)//y
op+=ad
x+=y*ad
while max(x,y)<m:
x,y=max(x,y),x+y
op+=1
print(op)
| 1,600 |
PYTHON3
|
#include <bits/stdc++.h>
const int N = 1e5 + 5, M = N / 140 + 3;
int bel[N], f[N], g[N], tag[M], s[M][140 + 3 << 1];
inline int read() {
int now = 0;
register char c = getchar();
for (; !isdigit(c); c = getchar())
;
for (; isdigit(c); now = now * 10 + c - 48, c = getchar())
;
return now;
}
void Update(int p, int v) {
int *s = ::s[bel[p]];
for (int i = 140; i <= 140 << 1; ++i)
(s[i] += v) >= 998244353 && (s[i] -= 998244353);
}
void Modify(int p, int v) {
int bel = ::bel[p], *s = ::s[bel];
tag[bel] += v;
for (int i = bel * 140 + 1; i <= p; ++i) {
if (v == 1)
(s[g[i] + 140] += 998244353 - f[i - 1]) >= 998244353 &&
(s[g[i] + 140] -= 998244353);
else
(s[g[i] - 1 + 140] += f[i - 1]) >= 998244353 &&
(s[g[i] - 1 + 140] -= 998244353),
(s[g[i] - 2 + 140] += f[i - 1]) >= 998244353 &&
(s[g[i] - 2 + 140] -= 998244353);
g[i] += v;
}
}
int Query(int p, int K) {
int bel = ::bel[p], sum = tag[bel];
long long res = 0;
for (int i = bel * 140 + 1; i <= p; ++i) g[i] <= K && (res += f[i - 1]);
while (bel--) {
if (std::abs(sum - K) <= 140)
res += s[bel][K - sum + 140];
else if (sum < K)
res += s[bel][140 << 1];
sum += tag[bel];
}
return res % 998244353;
}
int main() {
static int las[N], pre[N];
int n = read(), K = read();
for (int i = 1; i <= n; ++i) bel[i] = (i - 1) / 140;
f[0] = 1;
for (int i = 1; i <= n; ++i) {
int a = read();
las[i] = pre[a], pre[a] = i;
Update(i, f[i - 1]), Modify(i, 1);
if (las[i]) {
Modify(las[i], -2);
if (las[las[i]]) Modify(las[las[i]], 1);
}
f[i] = Query(i, K);
}
printf("%d\n", f[n]);
return 0;
}
| 2,900 |
CPP
|
h,l = tuple([int(x) for x in input().split()])
x=(l**2-h**2)/(2*h)
print(x)
| 1,000 |
PYTHON3
|
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
if k%(n-1)!=0:
print((k//(n-1))*n+k%(n-1))
else:
print((k//(n-1))*n-1)
| 1,200 |
PYTHON3
|
#209A杨辉三角
n=int(input())
import math
if n>1:
a=math.factorial(2*n-2)/(math.factorial(n-1)**2)
else:
a=1
print(int(a))
| 800 |
PYTHON3
|
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
def gift():
for _ in range(t):
ina=int(input())
lst = list(map(int,input().split()))
ansp=[lst[0]]+[None]*(ina-1)
ansb=[None]*(ina-1)+[lst[ina-1]]
dic1={lst[0]:1}
dic2={}
for i in range(1,ina):
front=lst[i]
back=lst[ina-i-1]
currmaxf=ansp[i-1]
currmaxb=ansb[ina-i]
ansp[i]=max(front,currmaxf)
ansb[ina-i-1]=max(back,currmaxb)
freq=dic2.get(lst[i],0)
dic2[lst[i]]=freq+1
#print(ansp,ansb)
#print(dic1,dic2)
len1,len2=len(dic1),len(dic2)
ans=[]
if ansp[0]==1 and ansb[1]==len2 and ansb[1]==ina-1:
#print('kappa',lst)
ans.append([1,ina-1])
for i in range(1,ina-1):
front=ansp[i]
back=ansb[i+1]
ele=lst[i]
freq1=dic1.get(ele)
if freq1:
break
else:
len1+=1
dic1[ele]=1
freq2=dic2.get(ele)
dic2[ele]=freq2-1
#print(ele,dic1,dic2,len1,len2,front,back)
if freq2==1:
len2-=1
if front==i+1 and back==ina-i-1 and front==len1 and back==len2:
ans.append([i+1,ina-(i+1)])
yield len(ans)
for kap in ans:
yield str(kap[0])+" "+str(kap[1])
if __name__ == '__main__':
t= int(input())
ans = gift()
print(*ans,sep='\n')
| 1,400 |
PYTHON3
|
n = int(input())
num_list = list(map(int, input().split()))
# print(num_list)
max_ind = num_list.index(max(num_list))
# print(max_ind)
num_list.reverse()
min_ind = n - 1 - num_list.index(min(num_list))
num_list.reverse()
# print(min_ind)
swap_num = (n-min_ind-1) + (max_ind)
if max_ind > min_ind:
print(swap_num-1)
else:
print(swap_num)
| 800 |
PYTHON3
|
a, b, x, y = map(int, input().split())
import math
def reduce_fraction(x,y):
k = math.gcd(x,y)
return (x // k, y // k)
x, y = reduce_fraction(x,y)
print(min(a // x, b // y))
| 1,000 |
PYTHON3
|
s=input()
if(s.count('0'*7) or s.count('1'*7)):print('YES')
else:print('NO')
| 900 |
PYTHON3
|
t = int(input())
for zz in range(t):
n = int(input())
a = [int(i) for i in input().split()]
a.sort()
print(a[n] - a[n-1])
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 7;
const double EPS = 1e-8;
vector<pair<string, string> > res;
set<string> all;
void move(string s, string t) {
res.push_back({s, t});
all.erase(s);
all.insert(t);
}
string randomWord() {
string s = "lolkek";
while (all.find(s) != all.end()) {
s = "";
for (int i = 0; i < 6; i++) {
s += (char)(rand() % 26 + 'a');
}
}
return s;
}
string toS(int x) {
string s = "";
while (x) {
s += (char)(x % 10 + '0');
x /= 10;
}
reverse(s.begin(), s.end());
return s;
}
int toI(string s) {
int x = 0;
if (s[0] == '0') {
return 0;
}
for (char c : s) {
if (c < '0' || c > '9') {
return 0;
}
x = 10 * x + c - '0';
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
srand(time(NULL));
int n;
cin >> n;
vector<string> a(n);
vector<int> type(n, 0);
vector<string> bad1, bad2;
vector<string> free1, free2;
int e = 0;
for (int i = 0; i < n; i++) {
cin >> a[i] >> type[i];
if (type[i]) {
e++;
}
all.insert(a[i]);
}
vector<pair<string, int> > bad;
for (int i = 0; i < n; i++) {
int x = toI(a[i]);
if (type[i] == 1) {
if (x && x <= n) {
if (x > e) {
bad1.push_back(a[i]);
}
} else {
bad.push_back({a[i], 1});
}
} else if (x && x <= n) {
if (x <= e) {
bad2.push_back(a[i]);
}
} else {
bad.push_back({a[i], 2});
}
}
for (int i = 1; i <= n; i++) {
string s = toS(i);
if (all.find(s) == all.end()) {
if (i <= e) {
free1.push_back(s);
} else {
free2.push_back(s);
}
}
}
if (!free1.size() && !free2.size() && bad1.size() && bad2.size()) {
string s = randomWord();
string t = bad1.back();
bad1.pop_back();
free2.push_back(t);
move(t, s);
bad.push_back({s, 1});
}
while (true) {
bool fl = false;
while (bad1.size() && free1.size()) {
fl = true;
string s = bad1.back();
string t = free1.back();
bad1.pop_back();
free1.pop_back();
move(s, t);
free2.push_back(s);
}
while (bad2.size() && free2.size()) {
fl = true;
string s = bad2.back();
string t = free2.back();
bad2.pop_back();
free2.pop_back();
move(s, t);
free1.push_back(s);
}
if (!fl) {
break;
}
}
for (auto p : bad) {
int tp = p.second;
string s = p.first;
if (tp == 1) {
move(s, free1.back());
free1.pop_back();
} else {
move(s, free2.back());
free2.pop_back();
}
}
cout << res.size() << "\n";
for (auto p : res) {
cout << "move " << p.first << " " << p.second << "\n";
}
}
| 2,200 |
CPP
|
input()
arr1 = [int(i) for i in input().split()]
arr2 = [int(i) for i in input().split()]
index1 = 0
counter = 0
for i in arr1:
try:
if i <= arr2[index1]:
counter += 1
index1 += 1
except:
break
print(counter)
| 800 |
PYTHON3
|
x=input()
s=input()
count=0
for i in range(len(s)-1):
if s[i]!=s[i+1]:
count+=1
print(len(s)-count-1)
| 800 |
PYTHON3
|
n = int(input())
if n % 2 == 0:
print(int(n/2))
else:
v = (n-1)/2
print(int(v-n))
| 800 |
PYTHON3
|
t = int(input())
while t > 0:
# n = int(input())
# arr = list(map(int, input().split()))
x, y, z = map(int, input().split())
if x != y and y != z and x != z:
print("NO")
else:
if x == y and y == z:
print("YES")
print(x,y,z)
else:
l = [x,y,z]
l.sort()
if l[0] == l[1]:
print("NO")
else:
print("YES")
print(l[0], l[0], l[1])
t -= 1
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, l, c, d, p, nl, np;
cin >> n >> k >> l >> c >> d >> p >> nl >> np;
int drink = (int)k * l / nl;
int lime = c * d;
int salt = p / np;
int ans = min(min(drink, lime), salt);
cout << ans / n << endl;
return 0;
}
| 800 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100006;
int m;
double R, A[N];
void init() {
A[0] = 2, A[1] = 2 + sqrt(2.0);
for (int i = 2; i < m; i++) A[i] = 2 * (i - 1) + 2 * sqrt(2.0);
}
int main() {
scanf("%d%lf", &m, &R);
init();
double ans = 0;
for (int i = 0; i < m; i++) {
ans += A[i];
}
int p1 = 1, p2 = m - 1;
double last = ans;
for (int i = 1; i < m; i++) {
last = last - A[p2] + A[p1];
ans += last;
p1++, p2--;
}
printf("%lf\n", ans / m / m * R);
return 0;
}
| 1,900 |
CPP
|
from sys import stdin
import math
N, K = map(int, stdin.readline().split())
pebbles = list(map(int, stdin.readline().split()))
print(math.ceil(sum(math.ceil(p / K) for p in pebbles) / 2))
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int i, j;
const int M = 3e5 + 6;
const int MAX = 1e6 + 6;
long long arr[M];
long long bit[M];
long long D[MAX];
void add(int idx, long long val, int n) {
long long del = val - arr[idx];
for (; idx < n; idx = idx | (idx + 1)) {
bit[idx] += del;
}
}
long long sum(int r) {
long long ret = 0;
for (; r >= 0; r = (r & (r + 1)) - 1) {
ret += bit[r];
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
for (i = 1; i < MAX; i++) {
for (j = i; j < MAX; j += i) D[j]++;
}
int n, m;
cin >> n >> m;
set<int> ids;
for (i = 0; i < n; i++) {
cin >> arr[i];
add(i, 2 * arr[i], n);
if (arr[i] > 2) ids.insert(i);
}
while (m--) {
int t, l, r;
cin >> t >> l >> r;
l--, r--;
if (t == 2) {
cout << sum(r) - sum(l - 1) << "\n";
} else {
auto lo = ids.lower_bound(l);
auto hi = ids.upper_bound(r);
for (auto it = lo; it != hi;) {
int id = *it;
long long x = D[arr[id]];
add(id, x, n);
arr[id] = x;
if (x <= 2)
it = ids.erase(it);
else
it++;
}
}
}
}
| 2,000 |
CPP
|
# Description of the problem can be found at http://codeforces.com/problemset/problem/804/B
MOD = 1e9 + 7
s = input()
ans = 0
b = 0
for c in s[::-1]:
if c == 'a':
ans = (ans + b) % MOD
b = (2 * b) % MOD
else:
b = (b + 1) % MOD
print(int(ans))
| 1,400 |
PYTHON3
|
import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))#might need to remove the -1
def invr():
return(map(int,input().split()))
n = inp()
s = [1, 5, 10, 20, 100]
b = 0
while n != 0:
if n<100:
for i in range(1, 5):
if s[i]>n:
b += 1
n -= s[i-1]
break
else:
b += 1
n-= 100
print(b)
| 800 |
PYTHON3
|
a=input()
if(a[1::]==a[1::].upper()):
print(a.swapcase())
else:
print(a)
| 1,000 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
int a[maxn];
int cnt[maxn];
inline int sqr(int x) { return x * x; }
int main() {
int t, n;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cnt[a[i]]++;
}
int pre = -1;
int w = 0, h = 0;
for (int i = 1; i <= 10000; i++) {
if (cnt[i] == 0) continue;
if (cnt[i] >= 4) {
w = i;
h = i;
break;
}
if (pre != -1 && cnt[i] >= 2) {
if (w == 0 || h == 0) {
w = pre;
h = i;
pre = i;
continue;
}
if ((long long)sqr(w + h) * pre * i >=
(long long)sqr(pre + i) * w * h) {
w = pre;
h = i;
}
}
if (cnt[i] >= 2) pre = i;
}
for (int i = 1; i <= n; i++) cnt[a[i]]--;
printf("%d %d %d %d\n", w, w, h, h);
}
return 0;
}
| 1,600 |
CPP
|
n, bx = map(int, input().split())
X = list(map(int, input().split()))
m, by = map(int, input().split())
Y = list(map(int, input().split()))
def to_10(X, n, bx):
ten_base_n = 0
for i in range(len(X)):
ten_base_n += X[len(X) - i - 1] * bx ** i
return ten_base_n
if to_10(X, n, bx) == to_10(Y, m, by):
print("=")
elif to_10(X, n, bx) > to_10(Y, m, by):
print(">")
else:
print("<")
| 1,100 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n, a;
cin >> n;
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
cin >> a;
v.push_back({a, i + 1});
}
sort((v).begin(), (v).end());
for (long long i = 0; i < n / 2; i++)
cout << v[i].second << " " << v[n - i - 1].second << endl;
}
| 800 |
CPP
|
for _ in range(int(input())):
n,k=map(int,input().split())
a=[int(x) for x in input().split()]
su=0
flip=0
for i in range(0,n-1):
if(flip==0):
if(a[i+1]<a[i]):
su+=a[i]
flip=1
else:
if(a[i+1]>a[i]):
su-=a[i]
flip=0
if(flip==0):
su+=a[n-1]
print(su)
| 1,300 |
PYTHON3
|
##############--->>>>> Deepcoder Amit Kumar Bhuyan <<<<<---##############
"""
Perfection is achieved not when there is nothing more to add, but rather when there is nothing more to take away.
"""
from __future__ import division, print_function
import os,sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li(): return list(mi())
def dmain():
sys.setrecursionlimit(1000000)
threading.stack_size(1024000)
thread = threading.Thread(target=main)
thread.start()
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list m = [x[:] for x in mark] .. Avoid Using Deepcopy
import sys
input = sys.stdin.readline
scanner = lambda: int(input())
string = lambda: input().rstrip()
get_list = lambda: list(read())
read = lambda: map(int, input().split())
get_float = lambda: map(float, input().split())
# from bisect import bisect_left as lower_bound;
# from bisect import bisect_right as upper_bound;
# from math import ceil, factorial;
def ceil(x):
if x != int(x):
x = int(x) + 1
return x
def factorial(x, m):
val = 1
while x>0:
val = (val * x) % m
x -= 1
return val
def fact(x):
val = 1
while x > 0:
val *= x
x -= 1
return val
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
## gcd function
def gcd(a,b):
if b == 0:
return a;
return gcd(b, a % b);
## lcm function
def lcm(a, b):
return (a * b) // math.gcd(a, b)
def is_integer(n):
return math.ceil(n) == math.floor(n)
## nCr function efficient using Binomial Cofficient
def nCr(n, k):
if k > n:
return 0
if(k > n - k):
k = n - k
res = 1
for i in range(k):
res = res * (n - i)
res = res / (i + 1)
return int(res)
## upper bound function code -- such that e in a[:i] e < x;
## prime factorization
def primefs(n):
## if n == 1 ## calculating primes
primes = {}
while(n%2 == 0 and n > 0):
primes[2] = primes.get(2, 0) + 1
n = n//2
for i in range(3, int(n**0.5)+2, 2):
while(n%i == 0 and n > 0):
primes[i] = primes.get(i, 0) + 1
n = n//i
if n > 2:
primes[n] = primes.get(n, 0) + 1
## prime factoriazation of n is stored in dictionary
## primes and can be accesed. O(sqrt n)
return primes
## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p):
res = 1
x = x % p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) :
res = (res * x) % p
y = y >> 1
x = (x * x) % p
return res
## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
temp = a
a = b
b = temp
return a,b;
# find function with path compression included (recursive)
# def find(x, link):
# if link[x] == x:
# return x
# link[x] = find(link[x], link);
# return link[x];
# find function with path compression (ITERATIVE)
def find(x, link):
p = x;
while( p != link[p]):
p = link[p];
while( x != p):
nex = link[x];
link[x] = p;
x = nex;
return p;
# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
x = find(x, link)
y = find(y, link)
if size[x] < size[y]:
x,y = swap(x,y)
if x != y:
size[x] += size[y]
link[y] = x
## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n):
prime = [True for i in range(n+1)]
prime[0], prime[1] = False, False
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
return prime
# Euler's Toitent Function phi
def phi(n) :
result = n
p = 2
while(p * p<= n) :
if (n % p == 0) :
while (n % p == 0) :
n = n // p
result = result * (1.0 - (1.0 / (float) (p)))
p = p + 1
if (n > 1) :
result = result * (1.0 - (1.0 / (float)(n)))
return (int)(result)
def is_prime(n):
if n == 0:
return False
if n == 1:
return True
for i in range(2, int(n ** (1 / 2)) + 1):
if not n % i:
return False
return True
def next_prime(n, primes):
while primes[n] != True:
n += 1
return n
#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e5 + 5)
def spf_sieve():
spf[1] = 1;
for i in range(2, MAXN):
spf[i] = i;
for i in range(4, MAXN, 2):
spf[i] = 2;
for i in range(3, ceil(MAXN ** 0.5), 2):
if spf[i] == i:
for j in range(i*i, MAXN, i):
if spf[j] == j:
spf[j] = i;
## function for storing smallest prime factors (spf) in the array
################## un-comment below 2 lines when using factorization #################
spf = [0 for i in range(MAXN)]
# spf_sieve();
def factoriazation(x):
res = []
for i in range(2, int(x ** 0.5) + 1):
while x % i == 0:
res.append(i)
x //= i
if x != 1:
res.append(x)
return res
## this function is useful for multiple queries only, o/w use
## primefs function above. complexity O(log n)
def factors(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
res.append(n // i)
return list(set(res))
## taking integer array input
def int_array():
return list(map(int, input().strip().split()));
def float_array():
return list(map(float, input().strip().split()));
## taking string array input
def str_array():
return input().strip().split();
def binary_search(low, high, w, h, n):
while low < high:
mid = low + (high - low) // 2
# print(low, mid, high)
if check(mid, w, h, n):
low = mid + 1
else:
high = mid
return low
## for checking any conditions
def check(moves, n):
val = (moves + 1) // 2
rem = moves - val
sol = (val + 1) * (rem + 1)
return sol < n
## for sorting according to second position
def sortSecond(val):
return val[1]
#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');
alphs = "abcdefghijklmnopqrstuvwxyz"
################### ---------------- TEMPLATE ENDS HERE ---------------- ###################
from itertools import permutations
import math
import bisect as bis
import random
import sys
import collections as collect
import functools as fnt
# import numpy as np
def solve():
n, m = read()
ans = [["B" for x in range(m)] for y in range(n)]
for i in range(m - 1):
ans[0][i] = "W"
for x in ans:
for y in x:
print(y, end = "")
print()
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
#read()
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
t = scanner()
for i in range(t):
solve()
#dmain()
# Comment Read()
# fin_time = datetime.now()
# print("Execution time (for loop): ", (fin_time-init_time))
| 1,000 |
PYTHON3
|
q=int(input())
for qq in range(q):
n=int(input())
P=list(map(int, input().split()))
P.insert(0, 0)
root=list(range(n+1))
cnt=list(range(n+1))
for i in range(0, n+1):
cnt[i]=1
def getroot(u):
if (root[u]==u):
return u
else:
root[u]=getroot(root[u])
return root[u]
for i in range(1, n+1):
cnt[getroot(i)]=cnt[getroot(i)]+cnt[getroot(P[i])]
root[getroot(P[i])]=getroot(i)
#print(root)
for i in range(1, n+1):
print(cnt[getroot(i)]//2, end=" ")
print()
| 1,000 |
PYTHON3
|
n = input()
up, low = 0, 0
for i in n:
if i == i.upper():
up += 1
elif i == i.lower():
low += 1
if up > low:
print(n.upper())
else:
print(n.lower())
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long b[500000];
int a[500000];
int main() {
long long n;
map<int, int> m1, m2;
cin >> n;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
if (x % 2 == 0)
m1[x]++;
else
m2[x]++;
}
if (m1.size() > m2.size()) {
cout << m2.size() << endl;
} else if (m1.size() == m2.size())
cout << m1.size() << endl;
else {
long long p = m2.size() - m1.size();
p = p / 3;
p += m1.size();
cout << p << endl;
}
}
| 1,500 |
CPP
|
import os
import sys
def oki(s):
tm = min(s.count("0"),s.count("1"))
if tm %2 == 1:
print("DA")
else:
print("NET")
for _ in range(int(input())):
s = str(input())
oki(s)
| 900 |
PYTHON3
|
def main():
line = input().rstrip().split()
n1 = int(line[0])
n2 = int(line[1])
if n1 > n2:
print("First")
else:
print("Second")
main()
| 800 |
PYTHON3
|
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
count = 0
for i in range(1, d + 1):
if i % k == 0 \
or i % l == 0 \
or i % m == 0 \
or i % n == 0:
count += 1
print(count)
| 800 |
PYTHON3
|
n = int(input())
d = [0, 10, 20, 20, 14]
m = n % 4
if m == 0:
m = 4
print(d[m] % 5)
| 1,200 |
PYTHON3
|
T = int(input())
import itertools
import math
for _ in range(T):
n = int(input())
nn = int(math.log2(n))
s = input()
ans = 0
x = [[0]*(n+1) for _ in range(nn+1)]
for i in range(n):
r = ord(s[i]) - 97
if r <= nn:
x[r][i+1] = 1
for j in range(nn+1):
x[j][i+1] += x[j][i]
h_list = list(itertools.product([0,1], repeat=nn))
ans = n
for ll in h_list:
ss = n
l,r = 0,n
l2,r2 = 0,n
aa = 0
for i in range(nn):
ss //= 2
if ll[i] == 0:
r2 = r
r = l + ss
l2 = r
aa += ss - (x[i][r2] - x[i][l2])
else:
l2 = l
l = r - ss
r2 = l
aa += ss - (x[i][r2] - x[i][l2])
aa += 1 - (x[nn][r] - x[nn][l])
ans = min(aa,ans)
print(ans)
| 1,500 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long const MOD = 998244353;
int const MAXN = 100000;
vector<int> grav[MAXN];
int t_in[MAXN];
int t_out[MAXN];
string colors;
vector<pair<int, int>> dfs_order[MAXN];
vector<int> cnt[MAXN];
int depth[MAXN];
int parent[MAXN];
int up[MAXN][20];
int _t = 0;
int max_d = 0;
void dfs(int u, int p = -1, int d = 0) {
depth[u] = d;
parent[u] = p;
t_in[u] = _t++;
max_d = max(max_d, d);
dfs_order[d].emplace_back(t_in[u], u);
for (int v : grav[u]) {
dfs(v, u, d + 1);
}
t_out[u] = _t++;
}
long long dp[1000000][3];
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
long long a, b;
cin >> a >> b;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<int> ds;
auto f = [&ds](int n) {
ds.push_back(n);
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
ds.push_back(i);
while (n % i == 0) n /= i;
}
}
if (n != 1) ds.push_back(n);
};
f(v[0]);
f(v[0] - 1);
f(v[0] + 1);
f(v.back());
f(v.back() - 1);
f(v.back() + 1);
set<int> ds_s(ds.begin(), ds.end());
ds = vector<int>(ds_s.begin(), ds_s.end());
long long res = numeric_limits<long long>::max();
for (int d : ds) {
if (d == 1) continue;
memset(dp, -1, sizeof(dp));
if (v[0] % d == 0) {
dp[0][0] = 0;
} else if ((v[0] + 1) % d == 0 || (v[0] - 1) % d == 0) {
dp[0][0] = b;
}
dp[0][1] = a;
dp[0][2] = -1;
for (int i = 0; i + 1 < n; i++) {
int n = v[i + 1];
if (dp[i][0] != -1) {
if (n % d == 0) {
dp[i + 1][0] = dp[i][0];
} else if ((n + 1) % d == 0 || (n - 1) % d == 0) {
dp[i + 1][0] = dp[i][0] + b;
}
dp[i + 1][1] = dp[i][0] + a;
}
if (dp[i][1] != -1) {
if (dp[i + 1][1] == -1 || dp[i + 1][1] > dp[i][1] + a) {
dp[i + 1][1] = dp[i][1] + a;
}
if (n % d == 0) {
dp[i + 1][2] = dp[i][1];
} else if ((n + 1) % d == 0 || (n - 1) % d == 0) {
dp[i + 1][2] = dp[i][1] + b;
}
}
if (dp[i][2] != -1) {
if (n % d == 0) {
if (dp[i + 1][2] == -1 || dp[i + 1][2] > dp[i][2]) {
dp[i + 1][2] = dp[i][2];
}
} else if ((n + 1) % d == 0 || (n - 1) % d == 0) {
if (dp[i + 1][2] == -1 || dp[i + 1][2] > dp[i][2] + b) {
dp[i + 1][2] = dp[i][2] + b;
}
}
}
}
for (int i = 0; i < 3; i++)
if (dp[n - 1][i] != -1) res = min(res, dp[n - 1][i]);
}
cout << res << "\n";
return 0;
}
| 2,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
string int2string(int x) {
stringstream ss;
ss << x;
string tmp;
ss >> tmp;
return tmp;
}
int string2int(string s) {
stringstream ss;
ss << s;
int x;
ss >> x;
return x;
}
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
long long bigpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
long long int gcd(long long int a, long long int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
long long int r = a / gcd(a, b) * b;
return r;
}
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[2 * n];
for (int i = 0; i < 2 * n; i++) cin >> a[i];
set<int> s;
vector<int> v;
for (int i = 0; i < 2 * n; i++) {
if (s.find(a[i]) == s.end()) {
v.push_back(a[i]);
s.insert(a[i]);
}
}
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << "\n";
}
return 0;
}
| 800 |
CPP
|
import math
import collections
import sys
import math
def primeFactors(n):
l = []
count = 0
while n % 2 == 0:
count+=1
n = n // 2
if count > 0:
l.append([2, count])
count = 0
for i in range(3, int(math.sqrt(n))+1, 2):
while n % i == 0:
count+=1
n = n // i
if count > 0:
l.append([i, count])
count = 0
if n > 2:
l.append([n, 1])
return l
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
l = primeFactors(n)
if len(l) >= 3:
print("YES")
m1, m2, m3 = 1, 1, 1
m1 = l[0][0]**l[0][1]
m2 = l[1][0]**l[1][1]
for i in range(2, len(l)):
m3*=l[i][0]**l[i][1]
print(m1, m2, m3)
else:
if len(l) == 1:
if l[0][1] >= 6:
print("YES")
print(l[0][0]**1, l[0][0]**2, l[0][0]**(l[0][1]-3))
else:
print("NO")
else:
if l[0][1] + l[1][1] >= 4:
print("YES")
print(l[0][0], l[1][0], (l[0][0]**(l[0][1]-1))*(l[1][0]**(l[1][1]-1)))
else:
print("NO")
| 1,300 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
const long long L = 1e18 + 18;
int Z;
struct edge {
int s;
int t;
long long W;
int ind;
edge(int a, int b, long long c, int I) {
s = a;
t = b;
W = c;
ind = I;
}
};
struct cmp {
bool operator()(edge a, edge b) { return a.W > b.W; }
};
long long odl[N];
vector<edge> G[N];
vector<pair<long long, long long> > D[N];
void dfs(int v, int oj, int k);
int main() {
Z = 0;
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (long long i = 1; i <= n; i++) odl[i] = L;
for (long long i = 1; i <= m; i++) {
long long a, b, c;
scanf("%lld%lld%lld", &a, &b, &c);
G[a].push_back(edge(a, b, c, i));
G[b].push_back(edge(b, a, c, i));
}
priority_queue<edge, vector<edge>, cmp> kol;
odl[1] = 0;
for (auto z : G[1]) kol.push(z);
while (!kol.empty()) {
edge X = kol.top();
kol.pop();
if (odl[X.t] < L) continue;
odl[X.t] = X.W;
D[X.s].push_back(make_pair(X.t, X.ind));
for (auto z : G[X.t]) {
if (odl[z.t] > X.W + z.W) {
kol.push(edge(z.s, z.t, z.W + X.W, z.ind));
}
}
}
k = min(k, n - 1);
printf("%d\n", k);
dfs(1, 1, k);
if (k > 0) printf("\n");
}
void dfs(int v, int oj, int k) {
for (auto z : D[v]) {
if (z.first == oj) continue;
if (Z >= k) break;
printf("%lld ", z.second);
Z++;
dfs(z.first, v, k);
}
}
| 1,800 |
CPP
|
n, h = [int(s) for s in input().split()]
width = 0
h_s = [int(s) for s in input().split()]
for ele in h_s:
if ele>h:
width+=2
else:
width+=1
print(width)
| 800 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100001, h = 25;
long long t[2 * N], n, m, d[N], t2[2 * N], d2[N];
long long add(long long a, long long b) {
long long ans = a + b;
return ans;
}
void in_build() {
for (long long i = n - 1; i > 0; i--) {
t[i] = (t[i << 1] + t[i << 1 | 1]);
}
}
void apply(long long p, long long value) {
t[p] += value;
if (p < n) d[p] += value;
}
void build(long long p) {
while (p > 1) p >>= 1, t[p] = add(t[p << 1], t[p << 1 | 1]) + d[p];
}
void push(long long p) {
for (long long s = h; s > 0; --s) {
long long i = p >> s;
if (d[i] != 0) {
apply(i << 1, d[i]);
apply(i << 1 | 1, d[i]);
d[i] = 0;
}
}
}
void inc(long long l, long long r, long long value) {
l += n, r += n;
long long l0 = l, r0 = r;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) apply(l++, value);
if (r & 1) apply(--r, value);
}
build(l0);
build(r0 - 1);
}
long long query(long long l, long long r) {
l += n, r += n;
push(l);
push(r - 1);
long long res = 0;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) res = add(res, t[l++]);
if (r & 1) res = add(t[--r], res);
}
return res;
}
void in_build2() {
for (long long i = n - 1; i > 0; i--) t2[i] = add(t2[i << 1], t2[i << 1 | 1]);
}
void apply2(long long p, long long value) {
t2[p] += value;
if (p < n) d2[p] += value;
}
void build2(long long p) {
while (p > 1) p >>= 1, t2[p] = add(t2[p << 1], t2[p << 1 | 1]) + d2[p];
}
void push2(long long p) {
for (long long s = h; s > 0; --s) {
long long i = p >> s;
if (d2[i] != 0) {
apply2(i << 1, d2[i]);
apply2(i << 1 | 1, d2[i]);
d2[i] = 0;
}
}
}
void inc2(long long l, long long r, long long value) {
l += n, r += n;
long long l0 = l, r0 = r;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) apply2(l++, value);
if (r & 1) apply2(--r, value);
}
build2(l0);
build2(r0 - 1);
}
long long query2(long long l, long long r) {
l += n, r += n;
push2(l);
push2(r - 1);
long long res = 0;
for (; l < r; l >>= 1, r >>= 1) {
if (l & 1) res = add(res, t2[l++]);
if (r & 1) res = add(t2[--r], res);
}
return res;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long q, gg = 0;
cin >> n >> m >> q;
memset(t, 0, sizeof(t));
memset(d, 0, sizeof(d));
memset(d2, 0, sizeof(d2));
memset(t2, 0, sizeof(t2));
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
if (i % 2 == 0) {
t[n + gg] = x;
} else {
t2[n + gg] = x;
gg++;
}
}
long long b[m], tmp = 0, k = 0;
for (long long i = 0; i < m; i++) cin >> b[i];
for (long long i = 0; i < n; i++) {
if (i % 2)
tmp += b[i];
else
tmp -= b[i];
}
if (n % 2) k = 1;
vector<long long> v;
v.push_back(tmp);
for (long long i = n; i < m; i++) {
tmp += b[i - n];
tmp *= -1;
if (k % 2 == 0)
tmp += b[i];
else
tmp -= b[i];
v.push_back(tmp);
}
sort(v.begin(), v.end());
in_build();
in_build2();
long long zz = query(0, n) - query2(0, n);
long long lol = 1e18;
for (auto it : v) {
lol = min(lol, abs(zz + it));
}
cout << lol << "\n";
while (q--) {
long long l, r, val;
cin >> l >> r >> val;
if ((r - l + 1) % 2) {
if (l % 2)
zz += val;
else
zz -= val;
}
long long ans = zz, f = 1e18;
long long l0 = 0, r0 = v.size() - 1;
while (l0 < r0) {
long long mid = (l0 + r0) / 2;
tmp = ans + v[mid];
f = min(f, abs(tmp));
if ((v[mid] + ans) < 0)
l0 = mid + 1;
else
r0 = mid;
}
f = min(f, abs(ans + v[l0]));
cout << f << "\n";
}
return 0;
}
| 2,100 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int dim = 52;
char a[dim][dim];
int s[dim][dim];
int dp[dim][dim][dim][dim];
void compute(int i1, int j1, int i2, int j2) {
if (dp[i1][j1][i2][j2] != 0x3f3f3f3f) return;
int ans = max(i2 - i1 + 1, j2 - j1 + 1);
if (s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1] == 0) {
dp[i1][j1][i2][j2] = 0;
return;
}
if (s[i2][j2] - s[i1 - 1][j2] - s[i2][j1 - 1] + s[i1 - 1][j1 - 1] ==
(i2 - i1 + 1) * (j2 - j1 + 1)) {
dp[i1][j1][i2][j2] = ans;
return;
}
for (int i = i1; i < i2; ++i) {
compute(i1, j1, i, j2);
compute(i + 1, j1, i2, j2);
ans = min(ans, dp[i1][j1][i][j2] + dp[i + 1][j1][i2][j2]);
}
for (int j = j1; j < j2; ++j) {
compute(i1, j1, i2, j);
compute(i1, j + 1, i2, j2);
ans = min(ans, dp[i1][j1][i2][j] + dp[i1][j + 1][i2][j2]);
}
dp[i1][j1][i2][j2] = ans;
}
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i] + 1;
for (int j = 1; j <= n; ++j)
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (a[i][j] == '#');
}
memset(dp, 0x3f, sizeof dp);
compute(1, 1, n, n);
cout << dp[1][1][n][n];
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
solve();
return 0;
}
| 2,300 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, P = 998244353;
int n, k, m, ans, h[N], fac[N], inv[N];
int qpow(int B, int p) {
int R = 1;
for (; p; p >>= 1, B = 1LL * B * B % P)
if (p & 1) R = 1LL * R * B % P;
return R;
}
inline int C(int i, int j) {
return 1LL * fac[i] * inv[j] % P * inv[i - j] % P;
}
int main() {
scanf("%d%d", &n, &k);
fac[0] = 1;
for (int i = 1; i <= n; ++i)
scanf("%d", h + i), fac[i] = 1LL * fac[i - 1] * i % P;
h[n + 1] = h[1], inv[n] = qpow(fac[n], P - 2);
for (int i = 1; i <= n; ++i)
if (h[i] != h[i + 1]) ++m;
for (int i = n - 1; ~i; --i) inv[i] = 1LL * inv[i + 1] * (i + 1) % P;
for (int i = 0; i <= m >> 1; ++i)
ans = (ans + 1LL * C(m, i) * C(m - i, i) % P * qpow(k - 2, m - 2 * i) % P) %
P;
ans = 1LL * (qpow(k, m) - ans + P) % P * qpow(2, P - 2) % P;
printf("%lld\n", 1LL * ans * qpow(k, n - m) % P);
return 0;
}
| 2,200 |
CPP
|
import sys,bisect
input=sys.stdin.readline
mod=1
m=3
k=2
L=[]
mv=2*(10**5)+1
#mv=15
for i in range(2,mv+1):
val=(i*(i-1))//2
L.append(val)
T=int(input())
for _ in range(T):
n=int(input())
A=list(map(int,input().split()))
A.sort()
#print(L)
ans=0
for i in range(n):
mv=A[i]
ind=bisect.bisect_right(A,mv+k)
v=ind-i-m
#print(v,ind,i)
if (v>=0):
ans=(ans+L[v])
print(ans)
| 1,500 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.