solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
gene = input()
dict = {'A': int(n/4) - gene.count("A"),
'G': int(n/4) - gene.count("G"),
'C': int(n/4) - gene.count("C"),
'T': int(n/4) - gene.count("T"),
'?': gene.count("?")}
if n % 4 != 0:
print("===")
else:
dict.pop("?")
for a in dict:
if dict[a] < 0:
gene = "==="
break
while dict[a] > 0:
gene = gene.replace("?", a, 1)
dict[a] -= 1
print(gene)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char a[4];
int ans[10050];
for (int i = 0; i < 10050; i++) ans[i] = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != '!') a[i % 4] = s[i];
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '!') {
ans[a[i % 4]]++;
}
}
cout << ans['R'] << " " << ans['B'] << " " << ans['Y'] << " " << ans['G'];
}
| 8 | CPP |
import sys
import math
input=sys.stdin.readline
from collections import defaultdict as dc
for _ in range(int(input())):
n=int(input())
p=list(map(int,input().split()))
m=int(input())
q=list(map(int,input().split()))
o1=0
e1=0
o2=0
e2=0
for i in p:
if i%2:
o1+=1
else:
e1+=1
for i in q:
if i%2:
o2+=1
else:
e2+=1
print(o1*o2+e1*e2) | 7 | PYTHON3 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
while(getline(cin, s)) {
for(int i=0; i<s.size(); i++) {
if(s[i]>='a'&&s[i]<='z')
s[i]+=('A'-'a');
}
cout << s << endl;
}
return 0;
} | 0 | CPP |
import math
for _ in range(int(input())):
arr = list(map(int,input().split()))
if(arr[0] >= arr[1]):
print("YES")
else:
f = 0
n = arr[0]//2
for i in range(1,n+1):
d = i + math.ceil(arr[1]/(i+1))
#print(d)
if(d <= arr[0]):
f = 1
break
if f == 1:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int N;
int posi[maxn];
int p[maxn];
int main() {
int x;
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &x);
posi[x] = i;
}
for (int i = 1; i <= N; i++) {
scanf("%d", &x);
p[i] = posi[x];
}
for (int i = 1; i <= N; i++) printf("%d ", p[i]);
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
while ((a / 1000 % 10 + a / 100 % 10 + a / 10 % 10 + a % 10) % 4) {
a++;
}
cout << a;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
string o,e; cin >>o>>e;
for(int i=0; i<e.size(); i++){
cout << o[i] << e[i];
}
if(o.size()!=e.size())
cout << o[o.size()-1];
cout << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long b, long long m = 1000000007) {
a %= m;
long long res = 1;
while (b) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
long long bpow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
long long modinv(long long a) { return modpow(a, 1000000007 - 2, 1000000007); }
void graph(vector<vector<int> > &adj, int m) {
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x - 1].push_back(y - 1);
adj[y - 1].push_back(x - 1);
}
}
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
const int mxN = 2e5 + 5;
struct comp {
bool operator()(const pair<int, int> &x, const pair<int, int> &y) const {
int lena = x.second - x.first + 1;
int lenb = y.second - y.first + 1;
if (lena > lenb) {
return true;
} else if (lena < lenb) {
return false;
} else {
return x.first < y.first;
}
}
};
long long int a[100001] = {0};
void solve() {
long long int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
a[x]++;
}
a[1] = a[1];
a[2] = max(a[1], 2 * a[2]);
for (long long i = 3; i < 100001; i++) {
a[i] = max(i * a[i] + a[i - 2], a[i - 1]);
}
cout << a[100000] << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
}
| 9 | CPP |
nv, ne, r = map(int, input().split())
edges = set(tuple(map(int, input().split())) for _ in range(ne))
costs = [None] * nv
costs[r] = 0
for _ in range(nv - 1):
for s, t, d in edges:
if costs[s] is None:
continue
cost = costs[s] + d
if costs[t] is None or costs[t] > cost:
costs[t] = cost
for s, t, d in edges:
if costs[s] is None:
continue
if costs[s] + d < costs[t]:
print('NEGATIVE CYCLE')
break
else:
for cost in costs:
print('INF' if cost is None else cost) | 0 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 11 14:47:59 2020
@author: A2B
"""
n = int(input())
if n % 4 ==0 or n % 7 ==0 or n % 47 ==0 or n % 477 ==0:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
template <class T = int>
T gcd(T a, T b) {
if (b == 0) {
return (a < 0 ? -a : a);
}
return gcd(b, a % b);
}
int main() {
long long n, m;
int q;
scanf("%lld %lld %d", &n, &m, &q);
long long g = gcd(n, m);
long long nd = n / g;
long long md = m / g;
for (int i = 0; i < q; i++) {
long long sx, sy, ex, ey;
scanf("%lld %lld %lld %lld", &sx, &sy, &ex, &ey);
long long s1, s2;
if (sx == 1) {
s1 = (sy - 1) / nd;
} else {
s1 = (sy - 1) / md;
}
if (ex == 1) {
s2 = (ey - 1) / nd;
} else {
s2 = (ey - 1) / md;
}
printf("%s\n", s1 == s2 ? "YES" : "NO");
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename _Tp>
inline void red(_Tp &x) {
x = 0;
bool fg = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') fg ^= 1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + (_Tp)(ch ^ 48), ch = getchar();
if (fg) x = -x;
}
template <typename _Tp>
bool umax(_Tp &x, _Tp y) {
return (x < y) ? (x = y, true) : (false);
}
template <typename _Tp>
bool umin(_Tp &x, _Tp y) {
return (x > y) ? (x = y, true) : (false);
}
const int N = 105;
int T, n, m, c[N][N];
char s[N][N];
struct dat {
int a, b, c, d, e, f;
} ans[N * N * 3];
int tot;
void doit(int x, int y, int id) {
if (id == 0) {
ans[++tot] = {x + 1, y, x + 1, y + 1, x, y + 1};
}
if (id == 1) {
ans[++tot] = {x, y, x + 1, y, x + 1, y + 1};
}
if (id == 2) {
ans[++tot] = {x, y, x, y + 1, x + 1, y + 1};
}
if (id == 3) {
ans[++tot] = {x, y, x + 1, y, x, y + 1};
}
c[ans[tot].a][ans[tot].b] ^= 1;
c[ans[tot].c][ans[tot].d] ^= 1;
c[ans[tot].e][ans[tot].f] ^= 1;
}
void print() {
printf("----\n");
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
printf("%d ", c[i][j]);
}
printf("\n");
}
}
void work(int x, int y) {
int w = (c[x][y] << 3) | (c[x][y + 1] << 2) | (c[x + 1][y] << 1) |
c[x + 1][y + 1];
switch (w) {
case 0:
break;
case 1:
doit(x, y, 0);
doit(x, y, 1);
doit(x, y, 2);
break;
case 2:
doit(x, y, 0);
doit(x, y, 1);
doit(x, y, 3);
break;
case 3:
doit(x, y, 3);
doit(x, y, 2);
break;
case 4:
doit(x, y, 0);
doit(x, y, 3);
doit(x, y, 2);
break;
case 5:
doit(x, y, 1);
doit(x, y, 3);
break;
case 6:
doit(x, y, 1);
doit(x, y, 2);
break;
case 7:
doit(x, y, 0);
break;
case 8:
doit(x, y, 3);
doit(x, y, 1);
doit(x, y, 2);
break;
case 9:
doit(x, y, 0);
doit(x, y, 3);
break;
case 10:
doit(x, y, 0);
doit(x, y, 2);
break;
case 11:
doit(x, y, 1);
break;
case 12:
doit(x, y, 0);
doit(x, y, 1);
break;
case 13:
doit(x, y, 2);
break;
case 14:
doit(x, y, 3);
break;
case 15:
doit(x, y, 0);
doit(x, y, 1);
doit(x, y, 2);
doit(x, y, 3);
break;
}
}
int main() {
red(T);
while (T--) {
red(n);
red(m);
tot = 0;
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
for (int j = 1; j <= m; ++j) c[i][j] = (s[i][j] - '0');
}
if (m & 1) {
for (int i = 1; i + 1 <= n; i += 2) {
if (c[i][m] && c[i + 1][m])
doit(i, m - 1, 0);
else if (c[i][m] && c[i + 1][m] == 0)
doit(i, m - 1, 3);
else if (c[i][m] == 0 && c[i + 1][m])
doit(i, m - 1, 1);
}
if ((n & 1) && c[n][m] == 1) doit(n - 1, m - 1, 1);
}
if (n & 1) {
for (int i = 1; i + 1 <= m; i += 2) {
if (c[n][i] && c[n][i + 1])
doit(n - 1, i, 1);
else if (c[n][i] && c[n][i + 1] == 0)
doit(n - 1, i, 3);
else if (c[n][i] == 0 && c[n][i + 1])
doit(n - 1, i, 2);
}
}
for (int i = 1; i + 1 <= n; i += 2) {
for (int j = 1; j + 1 <= m; j += 2) {
work(i, j);
}
}
printf("%d\n", tot);
for (int i = 1; i <= tot; ++i) {
printf("%d %d %d %d %d %d\n", ans[i].a, ans[i].b, ans[i].c, ans[i].d,
ans[i].e, ans[i].f);
}
}
return 0;
}
| 7 | CPP |
n=input()
s,l=n.split(" ")
s=3*int(s)
l=2*int(l)
i=1
while True:
if s<l:
i+=1
s*=3
l*=2
elif s==l:
i+=1
break
else:
break
print(i)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i, time = 0;
scanf("%d", &n);
int arr[n];
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
arr[i] = 90;
if (arr[0] > 15) {
time = 15;
printf("\n%d", time);
} else {
time = arr[0];
for (i = 0; i < n; i++) {
if ((arr[i + 1] - arr[i]) > 15) {
time = time + 15;
break;
} else {
time = time + arr[i + 1] - arr[i];
}
}
printf("\n%d", time);
}
}
| 7 | CPP |
for _ in range(int(input())):
n,m=map(int,input().split())
a=[int(x) for x in input().split()]
s=sum(a)
if s>m:
print(m)
else:
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 103;
const int mod = 1e9 + 7;
const int inf = (int)1e9;
const long long infll = (long long)1e18;
const long double PI = 3.1415926535897932384626433832795;
vector<int> gr[nax];
vector<bool> vis(nax), spoken(nax);
void Dfs(int node) {
vis[node] = true;
for (int& it : gr[node]) {
if (!vis[it]) {
Dfs(it);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
int ans = 0;
for (int i = 0; i < n; ++i) {
int nr;
cin >> nr;
if (!nr) {
++ans;
continue;
}
int x, y;
cin >> x;
spoken[x] = true;
while (--nr) {
cin >> y;
spoken[y] = true;
gr[x].push_back(y);
gr[y].push_back(x);
x = y;
}
}
int cnt = 0;
for (int i = 1; i < m + 1; ++i) {
if (!vis[i] && spoken[i]) {
++cnt;
Dfs(i);
}
}
ans += max(0, cnt - 1);
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 600005;
const int inf = 1 << 30;
bool ban[maxn];
int col[maxn];
int n, m, c[maxn], go[maxn], tot;
int ehead[maxn], ecnt, lcnt = 1;
struct edge {
int u, v, next;
} edg[maxn];
void add(int u, int v) {
edg[++ecnt] = (edge){u, v, ehead[u]};
ehead[u] = ecnt;
edg[++ecnt] = (edge){v, u, ehead[v]};
ehead[v] = ecnt;
}
int cnt[maxn], sz[maxn], sum, vis[maxn], rt;
void getsize(int u, int par) {
sz[u] = 1;
cnt[u] = 0;
for (int v, j = ehead[u]; j; j = edg[j].next)
if (!vis[v = edg[j].v] && v != par) {
getsize(v, u);
sz[u] += sz[v];
cnt[u] = max(cnt[u], sz[v]);
}
}
void getroot(int u, int par) {
for (int v, j = ehead[u]; j; j = edg[j].next)
if (!vis[v = edg[j].v] && v != par) getroot(v, u);
cnt[u] = max(cnt[u], sum - sz[u]);
if (cnt[u] < cnt[rt]) rt = u;
}
void solve(int u, int c) {
vis[u] = true;
col[u] = c;
for (int v, j = ehead[u]; j; j = edg[j].next)
if (!vis[v = edg[j].v]) {
cnt[rt = 0] = inf;
getsize(v, u);
sum = sz[v];
getroot(v, u);
solve(rt, c + 1);
}
}
struct line {
int u, v, sub;
} l[maxn];
vector<int> e[maxn];
bool comp(int e1, int e2) {
return l[e1].v > l[e2].v;
int v1 = l[e1].v > l[e1].u ? l[e1].v : l[e1].v + n;
int v2 = l[e2].v > l[e2].u ? l[e2].v : l[e2].v + n;
return v1 < v2;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
l[++lcnt] = (line){i, i % n + 1, 0};
l[++lcnt] = (line){i % n + 1, i, 0};
e[i].push_back(lcnt - 1);
e[i % n + 1].push_back(lcnt);
ban[lcnt] = true;
}
for (int x, y, i = 1; i <= m; i++) {
scanf("%d %d", &x, &y);
l[++lcnt] = (line){x, y, 0};
l[++lcnt] = (line){y, x, 0};
e[x].push_back(lcnt - 1);
e[y].push_back(lcnt);
}
for (int i = 1; i <= n; i++) {
sort(e[i].begin(), e[i].end(), comp);
int sz = e[i].size();
for (int j = 0; j < sz; j++) go[e[i][j] ^ 1] = e[i][(j + 1 + sz) % sz];
}
for (int i = n; i >= 1; i--) {
int sz = e[i].size();
for (int v, j = 0; j < sz; j++)
if (!ban[v = e[i][j]] && !l[v].sub) {
int sub = ++tot;
for (int k = v; !l[k].sub; k = go[k]) l[k].sub = sub;
}
}
for (int i = 2; i <= lcnt; i += 2)
if (!ban[i] && !ban[i ^ 1]) add(l[i].sub, l[i ^ 1].sub);
solve(1, 1);
for (int i = tot; i >= 1; i--) printf("%d ", col[i]);
return 0;
}
| 12 | CPP |
n = int(input())
ans = 0
x = y = 0
for _ in range(n):
a,b = map(int,input().split())
ans += max(0,min(a,b)-max(x,y)+(x!=y))
x,y = a,b
print(ans+1) | 8 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split(" ")))[:n]
arr.sort()
print(*arr,sep = " ") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int M = 3e5 + 5;
const int LN = 19;
struct edge {
int a, b;
int len;
int idx;
bool operator<(const edge &b) const {
return make_pair(len, idx) < make_pair(b.len, b.idx);
}
};
int n, m;
edge arr[M];
int comp[M];
int preparent[N];
int presizes[N];
int prefind(int node) {
if (preparent[node] == node) {
return node;
}
return preparent[node] = prefind(preparent[node]);
}
int presolve() {
for (int i = 1; i <= n; ++i) {
preparent[i] = i;
presizes[i] = 1;
}
int oddcnt = n;
for (int i = 1; i <= m; ++i) {
int x = prefind(arr[i].a);
int y = prefind(arr[i].b);
if (x != y) {
oddcnt -= (presizes[x] & 1);
oddcnt -= (presizes[y] & 1);
presizes[x] += presizes[y];
preparent[y] = x;
oddcnt += (presizes[x] & 1);
}
if (!oddcnt) {
return i;
}
}
return m + 1;
}
int ans[M];
int parent[N];
int sizes[N];
int oddcnt;
pair<int, int> rollback[M * LN];
int cur;
inline int find(int node) {
while (parent[node] != node) {
node = parent[node];
}
return node;
}
bool join(int a, int b) {
int x = find(a);
int y = find(b);
if (x == y) {
return 0;
}
oddcnt -= sizes[x] & 1;
oddcnt -= sizes[y] & 1;
if (sizes[x] < sizes[y]) {
swap(x, y);
}
rollback[++cur] = make_pair(y, x);
sizes[x] += sizes[y];
parent[y] = x;
oddcnt += sizes[x] & 1;
return 1;
}
void solve(int l, int r, int ql, int qr) {
if (r < l) {
return;
}
int before = cur;
int mid = l + r >> 1;
int res;
for (int i = l; i <= mid; ++i) {
if (comp[i] < ql) {
if (join(arr[comp[i]].a, arr[comp[i]].b)) {
if (!oddcnt) {
res = comp[i];
break;
}
}
}
}
for (int i = ql; i <= qr; ++i) {
if (arr[i].idx <= mid) {
if (join(arr[i].a, arr[i].b)) {
if (!oddcnt) {
res = i;
break;
}
}
}
}
ans[mid] = arr[res].len;
while (cur > before) {
auto data = rollback[cur--];
oddcnt -= sizes[data.second] & 1;
parent[data.first] = data.first;
sizes[data.second] -= sizes[data.first];
oddcnt += sizes[data.first] & 1;
oddcnt += sizes[data.second] & 1;
}
for (int i = ql; i < res; ++i) {
if (arr[i].idx < l) {
join(arr[i].a, arr[i].b);
}
}
solve(l, mid - 1, res, qr);
while (cur > before) {
auto data = rollback[cur--];
oddcnt -= sizes[data.second] & 1;
parent[data.first] = data.first;
sizes[data.second] -= sizes[data.first];
oddcnt += sizes[data.first] & 1;
oddcnt += sizes[data.second] & 1;
}
for (int i = l; i <= mid; ++i) {
if (comp[i] < ql) {
join(arr[comp[i]].a, arr[comp[i]].b);
}
}
solve(mid + 1, r, ql, res);
while (cur > before) {
auto data = rollback[cur--];
oddcnt -= sizes[data.second] & 1;
parent[data.first] = data.first;
sizes[data.second] -= sizes[data.first];
oddcnt += sizes[data.first] & 1;
oddcnt += sizes[data.second] & 1;
}
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; ++i) {
scanf("%d %d %d", &arr[i].a, &arr[i].b, &arr[i].len);
arr[i].idx = i;
}
int start = presolve();
sort(arr + 1, arr + 1 + m);
for (int i = 1; i <= m; ++i) {
comp[arr[i].idx] = i;
}
for (int i = 1; i < start; ++i) {
ans[i] = -1;
}
for (int i = 1; i <= n; ++i) {
parent[i] = i;
sizes[i] = 1;
}
cur = 0;
oddcnt = n;
solve(start, m, 1, m);
for (int i = 1; i <= m; ++i) {
printf("%d\n", ans[i]);
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void sci(T& t) {
cin >> t;
}
template <typename T, typename... Ts>
void sci(T& t, Ts&... ts) {
sci(t);
sci(ts...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
sci(n, m, k);
--k;
int r = k / (2 * m);
k %= 2 * m;
int d = k / 2;
k -= 2 * d;
cout << r + 1 << " " << d + 1 << " "
<< "LR"[k];
return 0;
}
| 7 | CPP |
n=int(input())
a=[int(x) for x in input().split()]
a.sort()
b=[]
c=1
b.append(a[0])
for i in range(1,n):
if(a[i]!=a[i-1]):
f=0
for j in b:
if(a[i]%j==0):
f=1
break
if(f==0):
c+=1
b.append(a[i])
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int dis, pos;
} b[3050000], now;
int a[310][310];
int dp[310][310];
bool cmp(node a, node b) { return a.dis < b.dis; }
vector<node> mp[310 * 310];
int main() {
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) dp[i][j] = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
if (a[i][j] == 1) {
dp[i][j] = i + j - 2;
now.dis = dp[i][j];
}
now.pos = (i - 1) * m + j;
mp[a[i][j]].push_back(now);
}
}
sort(mp[1].begin(), mp[1].end(), cmp);
for (int i = 2; i <= p; i++) {
int sz1 = mp[i].size();
int sz2 = mp[i - 1].size();
for (int j = 0; j < sz1; j++) {
int x = mp[i][j].pos / m + 1;
int y = mp[i][j].pos % m;
if (y == 0) y = m, x--;
for (int k = 0; k < sz2 && k < 1000; k++) {
int xx = mp[i - 1][k].pos / m + 1;
int yy = mp[i - 1][k].pos % m;
if (yy == 0) yy = m, xx--;
dp[x][y] = min(dp[x][y], dp[xx][yy] + abs(x - xx) + abs(y - yy));
}
mp[i][j].dis = dp[x][y];
}
sort(mp[i].begin(), mp[i].end(), cmp);
}
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (a[i][j] == p) ans = min(dp[i][j], ans);
}
printf("%d\n", ans);
return 0;
}
| 10 | CPP |
n, k = map(int, input().split())
for i in range(k):
if str(n)[-1] != "0":
n -= 1
elif str(n)[-1] == "0":
n = n // 10
print(n) | 7 | PYTHON3 |
n,m,s = map(int,input().split())
part = (s+1)//2
r = part / m if part % m == 0 else part // m + 1
p = m if part % m == 0 else part % m
b = "R" if s%2 == 0 else "L"
print (int(r),int(p),b) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1050, maxv = 2e6 + 50;
int n, N, cnt, tot, a[maxn], b[maxn];
unordered_map<int, int> mp[30];
int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + (c ^ 48), c = getchar();
return x;
}
void dfs(int x, int p) {
if (x == N + 1) {
int s = 0;
for (int i = 1; i <= cnt; i++) s += b[i];
if (mp[cnt].count(s)) {
int q = mp[cnt][s];
int t = p & q;
p ^= t, q ^= t;
int r = 0, c[30], d[30];
for (int i = 1; i <= 26; i++)
if (p >> (i - 1) & 1) c[++r] = a[i];
r = 0;
for (int i = 1; i <= 26; i++)
if (q >> (i - 1) & 1) d[++r] = a[i];
printf("YES\n");
int x = 0;
printf("0 ");
for (int i = 1; i <= r; i++) {
x = c[i] - x;
printf("%d ", x);
x = d[i] - x;
if (i != r) printf("%d ", x);
}
for (int i = 1; i <= n; i++) {
bool flag = 1;
for (int j = 1; j <= r; j++) {
if (c[j] == a[i] || d[j] == a[i]) {
flag = 0;
break;
}
}
if (flag) printf("%d ", a[i]);
}
exit(0);
}
mp[cnt][s] = p;
return;
}
if ((cnt + 1) * 2 <= N) {
b[++cnt] = a[x];
dfs(x + 1, p | (1 << (x - 1)));
cnt--;
}
dfs(x + 1, p);
}
int main() {
n = read();
for (int i = 1; i <= n; i++) a[i] = read();
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (a[i] == a[j]) {
printf("YES\n");
printf("0 ");
for (int k = 1; k <= n; k++)
if (k != i) printf("%d ", a[k]);
return 0;
}
}
}
if (n == 2) {
printf("NO\n");
return 0;
} else if (n == 3) {
if ((a[1] + a[2] + a[3]) & 1)
printf("NO\n");
else {
int t = (a[1] + a[2] + a[3]) >> 1;
printf("YES\n");
printf("%d %d %d\n", t - a[1], t - a[2], t - a[3]);
}
return 0;
}
int t = 0;
for (int i = 1; i <= n; i++)
if ((a[i] & 1) ^ 1) t = i;
if (t) {
int e1 = 0, e2 = 0, o1 = 0, o2 = 0;
for (int i = 1; i <= n; i++) {
if (i == t) continue;
if (a[i] & 1) {
if (!o1)
o1 = i;
else if (!o2)
o2 = i;
} else {
if (!e1)
e1 = i;
else if (!e2)
e2 = i;
}
}
if (e1 && e2) {
int tmp = (a[e1] + a[e2] - a[t]) / 2;
printf("YES\n");
printf("%d ", tmp);
for (int i = 1; i <= n; i++)
if (i != t) printf("%d ", a[i] - tmp);
} else {
int tmp = (a[o1] + a[o2] - a[t]) / 2;
printf("YES\n");
printf("%d ", tmp);
for (int i = 1; i <= n; i++)
if (i != t) printf("%d ", a[i] - tmp);
}
return 0;
}
N = min(n, 26);
dfs(1, 0);
printf("NO\n");
return 0;
}
| 16 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k;
long double f[1 << 20];
double p[1 << 20], ans[20];
int g[1 << 20];
int main() {
f[0] = 1;
cin >> n >> k;
int cnt = n;
for (int i = 0; i < n; i++) {
cin >> p[1 << i];
if (p[1 << i] == 0) cnt--;
}
if (cnt < k) k = cnt;
int lim = 1 << n;
for (int i = 1; i < lim; i++) {
p[i] = p[i & (-i)] + p[i ^ (i & (-i))];
g[i] = (i & 1) + g[i >> 1];
}
for (int i = 0; i < lim; i++) {
for (int j = 0; j < n; j++) {
if (i & (1 << j)) continue;
if (p[i] != 1) f[i ^ (1 << j)] += f[i] * p[1 << j] / (1 - p[i]);
}
if (g[i] == k)
for (int j = 0; j < n; j++)
if (i & (1 << j)) ans[j] += f[i];
}
for (int i = 0; i < n; i++) printf("%.10f ", ans[i]);
puts("");
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, t;
int main() {
scanf("%lld%lld", &n, &m);
if (m == 2 && n == 1)
printf("Yes\n");
else if (m == 1)
printf("Yes\n");
else if (n <= m)
printf("No\n");
else {
for (i = 2; i <= min(m, 1000000LL); i++) {
if (n % i == i - 1)
continue;
else
break;
}
if (i == min(m, 1000000LL) + 1)
printf("Yes\n");
else
printf("No\n");
}
}
| 9 | CPP |
a=input().split()
n=int(a[0])
m=int(a[1])
z=0
p=1
b=input().split()
for i in range(m):
b[i]=int(b[i])
while p<m:
q=b[p]
w=b[p-1]
if q>=w:
z=z+q-w
else:
z=z+n+q-w
p=p+1
print(z+b[0]-1)
| 8 | PYTHON3 |
def minv(a, b):
m = 0
for i in range(3):
m = max(m, b[i] - a[i] - a[(i+1)%3])
return m
def maxv(a, b):
total = 0
for i in range(3):
total += min(a[i], b[(i+1)%3])
return total
n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
print(minv(a, b), maxv(a, b))
| 11 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e18;
struct edge{int from;int to;ll cost;};
int main(){
int n,m;cin >> n >> m;
vector<edge> g(m);
vector<ll> d(n,INF);
for(int i=0;i<m;i++){
int a,b;ll c;
cin >> a >> b >> c;
a--,b--;
g[i]=(edge{a,b,-c});
}
d[0]=0;
for(int i=0;i<2*n;i++){
for(int j=0;j<m;j++){
if(d[g[j].from]!=INF&&d[g[j].to]>d[g[j].from]+g[j].cost){
d[g[j].to]=d[g[j].from]+g[j].cost;
if(i>=n-1&&g[j].to==n-1){
cout << "inf" << endl;
return 0;
}
}
}
}
cout << -d[n-1] << endl;
} | 0 | CPP |
n,h = map(int,input().split())
a = list(map(int,input().split()))
cont = 0
for i in a:
if i > h:
cont += 2
else:
cont += 1
print(cont)
| 7 | PYTHON3 |
for i in range(int(input())):
l= (input())
if l.isdigit():
pass
if len(l) > 10:
abb = (l[0])+(str(len(l[1:-1])))+(l[-1])
print(abb)
else:
print(l)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 250005;
vector<pair<int, int> > V[N];
vector<int> D[N], Ext[N];
multiset<long long> s[N];
long long sum[N], f[N][2], t, ans;
int n, x, y, z, deg[N], pos[N], size[N];
bool vis[N];
inline void addedge(const int& x, const int& y, const int& z) {
V[x].push_back(make_pair(y, z));
++deg[x];
V[y].push_back(make_pair(x, z));
++deg[y];
}
inline bool cmp(const pair<int, int>& x, const pair<int, int>& y) {
return deg[x.first] < deg[y.first];
}
inline int max(const int& a, const int& b) { return a > b ? a : b; }
inline void insert(const int& x, long long y) {
s[x].insert(y);
++size[x];
sum[x] += y;
}
inline void remove(const int& x, long long y) {
s[x].erase(s[x].find(y));
--size[x];
sum[x] -= y;
}
inline void DFS(const int& now, const int& lim) {
if (now == 5) {
bool D = 1;
}
int td = deg[now] - lim;
vis[now] = 1;
while (size[now] > max(td, 0)) remove(now, *s[now].rbegin());
while (pos[now] < deg[now] && deg[V[now][pos[now]].first] <= lim) ++pos[now];
long long ret = 0;
vector<long long> TA, TB;
for (register int i = pos[now]; i < deg[now]; ++i) {
int to = V[now][i].first, val = V[now][i].second;
if (vis[to]) continue;
DFS(to, lim);
if ((t = f[to][1] + val - f[to][0]) <= 0)
--td, ret += f[to][1] + val;
else
ret += f[to][0], TA.push_back(t), insert(now, t);
}
while (size[now] > max(td, 0))
TB.push_back(t = *s[now].rbegin()), remove(now, t);
f[now][0] = ret + sum[now];
while (size[now] > max(td - 1, 0))
TB.push_back(t = *s[now].rbegin()), remove(now, t);
f[now][1] = ret + sum[now];
while (!TB.empty()) insert(now, TB.back()), TB.pop_back();
while (!TA.empty()) remove(now, TA.back()), TA.pop_back();
}
int main() {
register int i, j;
for (scanf("%d", &n), i = 1; i < n; ++i)
scanf("%d%d%d", &x, &y, &z), addedge(x, y, z), ans += z;
for (i = 1; i <= n; ++i) sort(V[i].begin(), V[i].end(), cmp);
for (i = 1; i <= n; ++i) D[deg[i]].push_back(i);
for (i = 1; i <= n; ++i)
for (j = 1; j < deg[i]; ++j) Ext[j].push_back(i);
for (printf("%I64d ", ans), i = 1; i < n; ++i) {
for (int x : D[i]) {
vis[x] = 1;
for (pair<int, int> it : V[x])
if (!vis[it.first]) insert(it.first, it.second);
}
ans = 0;
for (int x : Ext[i])
if (!vis[x]) DFS(x, i), ans += f[x][0];
printf("%I64d ", ans);
for (int x : Ext[i]) vis[x] = 0;
}
return 0;
}
| 12 | CPP |
n, m = map(int, input().split())
a = sum(list(map(int, input().split())))
print(max(n-a, -1)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T>
void dprintln(const T &t) {
cout << t << endl;
}
template <typename T, typename... Args>
void dprintln(const T &t, const Args &...rest) {
cout << t << ' ';
dprintln(rest...);
}
template <typename T>
void println(const T &t) {
cout << t << '\n';
}
template <typename T, typename... Args>
void println(const T &t, const Args &...rest) {
cout << t << ' ';
println(rest...);
}
template <typename T>
void print(const T &t) {
cout << t << ' ';
}
template <typename T, typename... Args>
void print(const T &t, const Args &...rest) {
cout << t << ' ';
print(rest...);
}
template <class T>
void scan(T &t) {
cin >> t;
}
template <class T, class... Args>
void scan(T &a, Args &...rest) {
cin >> a;
scan(rest...);
}
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
using pii = pair<int, int>;
using vb = vector<bool>;
using vpii = vector<pii>;
auto bet = [](const ll x, const ll y, const ll i) { return x <= i && i <= y; };
template <typename T1, typename T2>
T1 ceil(T1 x, T2 y) {
return (x + y - 1) / y;
}
inline int h_bit(unsigned int x) { return 31 - __builtin_clz(x); }
inline int h_bitll(unsigned long long x) { return 63 - __builtin_clzll(x); }
template <typename T>
struct bit {
vector<T> a;
explicit bit(int n, int v = 0) {
a.resize(n + 1);
if (v != 0) {
for (int i = 1; i <= n; ++i) a[i] = v;
}
}
T sum(T x) {
T res = 0;
while (x) {
res += a[x];
x -= x & -x;
}
return res;
}
T sum(int l, int r) {
if (l > r) return 0;
return sum(r) - sum(l - 1);
}
void add(int x, T v) {
while (x < a.size()) {
a[x] += v;
x += x & -x;
}
}
void clear() { fill(a.begin(), a.end(), 0); }
};
vi get_prime(int n) {
vi minp(n + 1), p;
for (int i = 2; i <= n; i++) {
if (!minp[i]) {
minp[i] = i;
p.push_back(i);
}
for (auto &x : p) {
if (x <= minp[i] && x * i <= n)
minp[x * i] = x;
else
break;
}
}
return p;
}
const int mod = 998244353;
inline void add_mod(ll &x, const ll &y) {
x += y;
if (x >= mod) x -= mod;
}
inline ll submod(ll x, ll y) { return x >= y ? x - y : x - y + mod; }
void sub_mod(ll &x, const ll y) {
x -= y;
if (x < 0) x += mod;
}
template <typename T>
using vv = vector<vector<T>>;
template <typename T1, typename T2 = T1>
using vp = vector<pair<T1, T2>>;
template <typename T, int n>
using va = vector<array<T, n>>;
struct UF {
vi par;
explicit UF(int n) {
par.assign(n + 1, 0);
for (int i = (1); i < (n + 1); ++i) par[i] = i;
}
int find(int x) { return x == par[x] ? x : par[x] = find(par[x]); }
void unite(int x, int y) { par[find(x)] = find(y); }
};
vi get_popcnt(int n) {
vi res(n + 1);
for (int i = (0); i < (n); ++i) {
if (i * 2 <= n) res[i * 2] = res[i];
if ((i & 1) == 0) res[i + 1] = res[i] + 1;
}
return res;
}
const int N = 30, M = 1005;
int l1 = 0, l2 = 0;
int c1, c2;
void dfs(int a, int h) {
if (a == 0) return;
if (h == 1 || a == 1) {
if (l1 == 0) {
l1 = a;
++c1;
} else if (a == l1)
++c1;
else {
if (l2 == 0) l2 = a;
++c2;
}
return;
}
dfs(a / 2, h - 1), dfs(a - a / 2, h - 1);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, q;
scan(n, k, q);
vl inv(max(4, n) + 1);
inv[1] = 1;
for (int i = (2); i < (max(4, n) + 1); ++i)
inv[i] = q - ll(q / i) * inv[q % i] % q;
dfs(n, k);
ll ans = 0;
if (c1 > 0) ans += 1LL * c1 * (l1 - 1) % q * l1 % q * inv[4] % q;
if (c2 > 0) ans += 1LL * c2 * (l2 - 1) % q * l2 % q * inv[4] % q;
if (c1 > 1) {
ll sum = 0;
for (int i = (2); i < (2 * l1 + 1); ++i) {
int mi = max(1, i - l1);
int ma = min(l1, i - 1);
sum += 1LL * (ma - mi + 1) * (inv[2] - inv[i] + q) % q;
}
ans += 1LL * c1 * (c1 - 1) / 2 % q * sum % q;
}
if (c2 > 1) {
ll sum = 0;
for (int i = (2); i < (2 * l2 + 1); ++i) {
int mi = max(1, i - l2);
int ma = min(l2, i - 1);
sum += 1LL * (ma - mi + 1) * (inv[2] - inv[i] + q) % q;
}
ans += 1LL * c2 * (c2 - 1) / 2 % q * sum % q;
}
if (c1 > 0 && c2 > 0) {
ll sum = 0;
for (int i = (2); i < (l1 + l2 + 1); ++i) {
int mi = max(1, i - l2);
int ma = min(l1, i - 1);
sum += 1LL * (ma - mi + 1) * (inv[2] - inv[i] + q) % q;
}
ans += 1LL * c1 * c2 % q * sum % q;
}
println(ans % q);
return 0;
}
| 13 | CPP |
n = int(input())
m = n
offmin = offmax = 0
while 1:
if n <= 2:
offmax += n
break
else:
offmax += 2
n -= 2
if n <= 5:
break
else:
n -= 5
while 1:
if m <= 5:
break
else:
m -= 5
if m <= 2:
offmin += m
break
else:
offmin += 2
m -= 2
print(offmin , offmax)
| 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n=int(input())
if(n%4==0):
print("YES")
it=n//2
even=2
odd=1
ans=[]
for i in range(it):
ans.append(even)
even+=2
it=n//2
for j in range(it):
ans.append(odd)
odd+=2
ans[-1]+=n//2
print(" ".join(map(str,ans)))
else:
print("NO") | 8 | PYTHON3 |
from math import ceil
a=input()
b=len(a)
g=a[b-1]
if int(g)<=5:
print(int(a)-int(g))
else:
print(int(a)+10-int(g))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#ifdef NeverBeRed
#include "debug.h"
#else
#define debug(...) 9715
#endif
typedef long long ll;
typedef long double ld;
typedef complex<ld> point;
#define F first
#define S second
int main()
{
#ifdef TurnRed
freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0);
int n, m; ll k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (auto &i : a) cin >> i;
for (auto &i : b) cin >> i;
vector<int> pv(2 * max(n, m) + 1, m), wv = pv, c(m);
for (int i = 0; i < m; ++i)
if (pv[b[i]] == m)
{
int x = i;
while (pv[b[x]] == m)
{
pv[b[x]] = c[i]++;
wv[b[x]] = i;
x = (x + n) % m;
}
}
auto f = [&](ll s)
{
int to = min((ll)n, s);
ll ss = s;
for (int i = 0, mi = -1; i < to; ++i)
{
if (++mi == m)
mi = 0;
int x = wv[b[mi]];
if (wv[a[i]] != x) continue;
int p = pv[b[mi]]; // <
int sz = c[x];
int pos = pv[a[i]];
s += pos < p;
ll t = ((ss - 1) - i) / n + 1 + p;
ll v = t / sz;
int r = t - v * sz;
if (pos < sz)
s -= v;
s -= pos < r;
}
return s;
};
ll l = 1, r = 1e18;
while (l < r)
{
ll md = (l + r) >> 1;
if (f(md) < k)
l = md + 1;
else
r = md;
}
cout << l << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long A, B, x, y, z, ans = 0;
;
int main() {
cin >> A >> B >> x >> y >> z;
if (A < (2 * x + 1 * y)) {
ans += (2 * x + 1 * y) - A;
}
if (B < (1 * y + 3 * z)) {
ans += (1 * y + 3 * z) - B;
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
'''input
3
??
1?
1?
'''
from sys import stdin
def input():
return stdin.readline()[:-1]
for _ in range(int(input())):
s = list(input())
for i in range(0, len(s)):
if s[i] == '?':
if i > 0:
prev = s[i-1]
else:
prev = 'x'
if i < len(s) - 1:
post = s[i+1]
else:
post = 'x'
for ch in list('abc'):
if ch != prev and ch != post:
s[i] = ch
break
correct = True
for i in range(0, len(s) - 1):
if s[i+1] == s[i]:
correct = False
print(''.join(s)) if correct else print(-1)
| 7 | PYTHON3 |
n=int(input())
s=input().split()
s=[int(i) for i in s]
s=list(s)
one=[]
two=[]
thr=[]
for i in range(n):
if s[i]==1:
one.append(i+1)
if s[i]==2:
two.append(i+1)
if s[i]==3:
thr.append(i+1)
m=min(len(one),len(two),len(thr))
print(m)
for i in range(m):
print(one[i],two[i],thr[i])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct node {
int sum, rmx, lmx, mn, mx, d;
node(int sum = 0, int rmx = 0, int lmx = 0, int mn = 0, int mx = 0, int d = 0)
: sum(sum), rmx(rmx), lmx(lmx), mn(mn), mx(mx), d(d) {}
} t[4 * N];
char s[N];
int n, k;
void update(int k) {
t[k].sum = t[k << 1].sum + t[k << 1 | 1].sum;
t[k].rmx = max(t[k << 1].rmx,
max(t[k << 1 | 1].rmx - t[k << 1].sum,
t[k << 1 | 1].mx + t[k << 1].sum - 2 * t[k << 1].mn));
t[k].lmx = max(t[k << 1].lmx,
max(t[k << 1 | 1].lmx - t[k << 1].sum,
t[k << 1].mx - 2 * (t[k << 1 | 1].mn + t[k << 1].sum)));
t[k].mn = min(t[k << 1].mn, t[k << 1 | 1].mn + t[k << 1].sum);
t[k].mx = max(t[k << 1].mx, t[k << 1 | 1].mx + t[k << 1].sum);
t[k].d = max(max(t[k << 1].d, t[k << 1 | 1].d),
max(t[k << 1 | 1].rmx - t[k << 1].sum + t[k << 1].mx,
t[k << 1].lmx + t[k << 1 | 1].mx + t[k << 1].sum));
}
void build(int l, int r, int k) {
if (l == r) {
int x = s[l] == '(' ? 1 : -1;
t[k] = node(x, -x, -x, x, x, 0);
return;
}
int m = l + r >> 1;
build(l, m, k << 1);
build(m + 1, r, k << 1 | 1);
update(k);
}
void fix(int l, int r, int k, int x) {
if (l == r) {
build(l, r, k);
return;
}
int m = l + r >> 1;
if (x <= m)
fix(l, m, k << 1, x);
else
fix(m + 1, r, k << 1 | 1, x);
update(k);
}
int main() {
scanf("%d%d", &n, &k);
scanf("%s", s + 1);
n = n * 2 - 2;
build(1, n, 1);
printf("%d\n", t[1].d);
for (int i = 1; i <= k; i++) {
int l, r;
scanf("%d%d", &l, &r);
swap(s[l], s[r]);
fix(1, n, 1, l);
fix(1, n, 1, r);
printf("%d\n", t[1].d);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int getint(char s) {
if (s >= '0' && s <= '9') {
return (s - '0');
}
if (s >= 'A' && s <= 'Z') {
return (s - 'A') + 10;
}
if (s >= 'a' && s <= 'z') {
return (s - 'a') + 36;
}
if (s == '-') {
return 62;
}
return 63;
}
int get0(int num) {
int i = 6;
int count = 0;
while (i != 0) {
if (!(num & 1)) {
count++;
}
num >>= 1;
i--;
}
return count;
}
int getans(string s) {
long long count = 1;
int n = s.size();
for (int i = 0; i < n; i++) {
int num = getint(s[i]);
int num0 = get0(num);
count = (count * pow(3, num0));
count = count % mod;
}
return count;
}
int main() {
string s;
cin >> s;
cout << getans(s);
return 0;
}
| 9 | CPP |
n, h = map(int, input().split())
a = [0 for x in input().split() if int(x) <= h]
print(len(a)+(n-len(a))*2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, m, c = 0, no, i, d = 0;
scanf("%d %d", &n, &m);
while (++n <= m) {
for (i = 2; i <= n / 2; i++)
if (n % i != 0) c++;
if (c == n / 2 - 1) {
d = n;
break;
}
c = 0;
}
d == m ? printf("YES") : printf("NO");
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int p[100010];
long long d[100010][2];
int main() {
int n, xi;
scanf("%d", &n);
for (int i = 0; i < n - 1; ++i) {
scanf("%d", &p[i + 1]);
}
for (int i = 0; i < n; ++i) {
scanf("%d", &xi);
d[i][xi] = 1;
}
for (int i = n - 1; i > 0; --i) {
d[p[i]][1] =
(d[p[i]][1] * (d[i][0] + d[i][1]) + d[p[i]][0] * d[i][1]) % 1000000007;
d[p[i]][0] = (d[p[i]][0] * (d[i][0] + d[i][1])) % 1000000007;
}
printf("%I64d\n", d[0][1]);
return 0;
}
| 8 | CPP |
mod = int(1e9+7)
for _ in range(int(input())):
n, k = map(int, input().split())
if k == 1:
print(1)
continue
if n == 1:
print(2)
continue
ans = 1
n -= 1
a = [1 for _ in range(n)]
while True:
cursum = 0
for i in range(n):
a[i] += cursum
cursum = a[i]
ans += cursum
k -= 1
if k == 1:
break
cursum = 0
for i in range(n-1, -1, -1):
a[i] += cursum
cursum = a[i]
ans += cursum
k -= 1
if k == 1:
break
print((ans+1)%mod)
| 9 | PYTHON3 |
# Made By Mostafa_Khaled
bot = True
t = input()
k = t.find('=')
n = 2 * k - len(t)
if n == 2:
if t[1] != '+': t = t[1: ] + '|'
else: t = t[: k - 1] + t[k: ] + '|'
elif n == -2: t = '|' + t[: -1]
elif n != 0: t = 'Impossible'
print(t)
# Made By Mostafa_Khaled | 7 | PYTHON3 |
n = int(input())
ans = 0
for i in range(0,n):
x = input().split()
x = int(x[0]) + int(x[1]) + int(x[2])
if x>=2:
ans = ans + 1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int l[100005], dp1[100005], dp2[100005], a[100005];
int main() {
int i, n;
while (~scanf("%d", &n)) {
l[0] = 0;
for (i = 1; i <= n; i++) scanf("%d", &a[i]), l[i] = l[i - 1] + a[i];
int sum = l[n];
dp1[0] = 0;
for (i = 1; i <= n; i++) {
dp1[i] = max(dp1[i - 1] + a[i], -l[i]);
}
dp2[n + 1] = 0;
for (i = n; i >= 1; i--) {
dp2[i] = max(dp2[i + 1] + a[i], l[i - 1] - sum);
}
int ans = -0xfffffff;
for (i = 1; i <= n; i++) ans = max(ans, dp1[i - 1] + dp2[i]);
printf("%d\n", ans);
}
return 0;
}
| 9 | CPP |
n=int(input())
print((n*(1+n))//2) | 0 | PYTHON3 |
x=0
y=0
g=0
def extendedEuclid(a,b):
global x
global y
global g
if (b == 0):
x = 1
y = 0
g = a
return
extendedEuclid(b, a % b)
CX = y
CY = x - (a // b) * y
x = CX
y = CY
n,p,w,d=map(int,input().split())
extendedEuclid(w, d)
#print(" ",x," ",y)
if (p % g != 0):
print("-1")
else:
x = x * p // g
y = y * p // g
k = p // g
#print(x,y)
lower1 = int((-1) * x * g / d)
if(lower1 > 0):
lower1+=1
lower2 = int(g * (x + y - n) /(w - d))
if(lower2 > 0):
lower2+=1
upper = (g * abs(y)) // w
if(y<0):
upper=upper*(-1)
if (upper < 0):
upper-=1
lower = max(lower1, lower2)
#print("a ",lower1," ",lower2," ",upper)
if(lower > upper):
t=lower
x = x + ((d * t) // g)
y = y - ((w * t) // g)
z = n - x - y
if(x>=0 and y>=0 and z>=0):
print(x,y,z)
else:
print("-1")
else:
t=lower
f1 = x + ((d * t) // g)
f2= y - ((w * t) // g)
f3= n - f1 - f2
if(f1>=0 and f2>=0 and f3>=0):
print(f1," ",f2," ",f3)
elif(upper>lower):
t=lower+1
x = x + ((d * t) // g)
y = y - ((w * t) // g)
z = n - x - y
if(x>=0 and y>=0 and z>=0):
print(x," ",y," ",z)
else:
print("-1")
else:
print("-1")
#print(y)
#print(z) | 9 | PYTHON3 |
# @author Matheus Alves dos Santos
n_values, n_tests = map(int, input().split())
values = list(map(int, input().split()))
distinct_values = [0] * 100010
found_values = [False] * 100010
for i in range(n_values - 1, -1, -1):
value = values[i]
if not found_values[value]:
distinct_values[i + 1] += 1
found_values[value] = True
for i in range(n_values, -1, -1):
distinct_values[i] += distinct_values[i + 1]
for i in range(n_tests):
target_index = int(input())
print(distinct_values[target_index])
| 8 | PYTHON3 |
import io
import os
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def main():
n = int(input())
a = list(map(lambda x:bin(int(x))[2:], input().split()))
b=[["0" for i in range(20)] for j in range(n)]
c=[0 for i in range(20)]
for i in range(n):
for j in range(len(a[i])):
if a[i][-(j+1)]=="1":
b[c[j]][-(j+1)]="1"
c[j]+=1
su=0
for i in range(n):
su+=pow(int("".join(b[i]),2),2)
print(su)
if __name__ == "__main__":
main() | 10 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll; // 小さい順に取り出し
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll; // 大きい順に取り出し
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define TS to_string
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
ll INF = 1e9;
ll MOD = 1000000007;
ll LINF = 1e18;
ld EPS = 1e-9;
ld PI = M_PI;
vll dx = {1, 0, -1, 0, 1, -1, -1, 1};
vll dy = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a;} //最大公約数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b;} //最小公倍数
void yes(){ cout << "Yes" << endl;}
void no(){ cout << "No" << endl;}
//-----------------------------------------
//-----------------------------------------
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
set<ll> s;
ll x;
REP(i,n) { cin >> x; s.insert(x);}
IREP(i,s){
if(i != s.begin()) cout << " ";
cout << (*i);
}
cout << endl;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
int d, l;
char s;
cin >> n >> m >> k;
l = (k - 1) / (2 * m);
d = ((k - 1) % (2 * m)) / 2;
if (k % 2) {
s = 'L';
} else {
s = 'R';
}
cout << l + 1 << ' ' << d + 1 << ' ' << s;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200];
int pr[3][2];
vector<pair<int, int> > v[3][2];
bool get(int i, int j, int k, int l) {
if ((a[i] == a[j]) && (a[j] == a[k]) && (a[k] == a[l])) {
return 1;
} else {
return 0;
}
}
int main() {
int i;
for (i = 1; i < 25; i++) {
cin >> a[i];
}
pr[0][0] = 1;
pr[0][1] = 9;
pr[1][0] = 5;
pr[1][1] = 21;
pr[2][0] = 13;
pr[2][1] = 17;
v[0][0].push_back(make_pair(13, 14));
v[0][0].push_back(make_pair(5, 6));
v[0][0].push_back(make_pair(17, 18));
v[0][0].push_back(make_pair(21, 22));
v[0][1].push_back(make_pair(15, 16));
v[0][1].push_back(make_pair(7, 8));
v[0][1].push_back(make_pair(19, 20));
v[0][1].push_back(make_pair(23, 24));
v[1][0].push_back(make_pair(1, 2));
v[1][0].push_back(make_pair(18, 20));
v[1][0].push_back(make_pair(12, 11));
v[1][0].push_back(make_pair(15, 13));
v[1][1].push_back(make_pair(3, 4));
v[1][1].push_back(make_pair(17, 19));
v[1][1].push_back(make_pair(10, 9));
v[1][1].push_back(make_pair(16, 14));
v[2][0].push_back(make_pair(1, 3));
v[2][0].push_back(make_pair(5, 7));
v[2][0].push_back(make_pair(9, 11));
v[2][0].push_back(make_pair(22, 24));
v[2][1].push_back(make_pair(2, 4));
v[2][1].push_back(make_pair(6, 8));
v[2][1].push_back(make_pair(10, 12));
v[2][1].push_back(make_pair(21, 23));
bool f = 0, a, b, c, d;
for (i = 0; i < 3 && f == 0; i++) {
if (get(pr[i][0], pr[i][0] + 1, pr[i][0] + 2, pr[i][0] + 3) &&
get(pr[i][1], pr[i][1] + 1, pr[i][1] + 2, pr[i][1] + 3)) {
a = get(v[i][0][0].first, v[i][0][0].second, v[i][1][1].first,
v[i][1][1].second);
b = get(v[i][0][1].first, v[i][0][1].second, v[i][1][2].first,
v[i][1][2].second);
c = get(v[i][0][2].first, v[i][0][2].second, v[i][1][3].first,
v[i][1][3].second);
d = get(v[i][0][3].first, v[i][0][3].second, v[i][1][0].first,
v[i][1][0].second);
a = a & b & c & d;
f = f | a;
a = get(v[i][0][1].first, v[i][0][1].second, v[i][1][0].first,
v[i][1][0].second);
b = get(v[i][0][2].first, v[i][0][2].second, v[i][1][1].first,
v[i][1][1].second);
c = get(v[i][0][0].first, v[i][0][0].second, v[i][1][3].first,
v[i][1][3].second);
d = get(v[i][0][3].first, v[i][0][3].second, v[i][1][2].first,
v[i][1][2].second);
a = a & b & c & d;
f = f | a;
}
}
if (f == 0) {
cout << "NO";
} else {
cout << "YES";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10;
const int M = 5e4 + 10;
int n;
struct bian {
int from, to;
long long w, val;
} eg[M << 1];
int front[N], num;
void add(int x, int y, long long w, long long val) {
eg[++num].to = y;
eg[num].from = front[x];
front[x] = num;
eg[num].w = w;
eg[num].val = val;
eg[++num].to = x;
eg[num].from = front[y];
front[y] = num;
eg[num].val = -val;
}
long long dis[N];
int _front[N];
int s, t;
int vis[N];
bool bfs() {
queue<int> q;
q.push(s);
for (int i = 1; i <= t; ++i) {
dis[i] = 1e18;
}
dis[s] = 0;
while (!q.empty()) {
int o = q.front();
q.pop();
vis[o] = 0;
for (int i = front[o]; i; i = eg[i].from) {
int to = eg[i].to;
if (eg[i].w && dis[to] > dis[o] + eg[i].val) {
dis[to] = dis[o] + eg[i].val;
if (vis[to] == 0) {
vis[to] = 1;
q.push(to);
}
}
}
}
return dis[t] != 1e18;
}
long long cost;
long long dfs(int o, long long lim) {
if (o == t) return lim;
vis[o] = 1;
long long mins = 0;
for (int &i = _front[o]; i; i = eg[i].from) {
int to = eg[i].to;
if (vis[to] == 1 || dis[to] != dis[o] + eg[i].val || eg[i].w == 0) continue;
long long now = dfs(to, min(lim - mins, eg[i].w));
if (now) {
cost += now * eg[i].val;
eg[i].w -= now;
eg[((i - 1) ^ 1) + 1].w += now;
mins += now;
if (mins == lim) break;
}
}
vis[o] = 0;
return mins;
}
long long dinic() {
long long re = 0;
while (bfs()) {
memcpy(_front, front, sizeof(front));
long long gu;
while (gu = dfs(s, 1e18)) {
re += gu;
}
}
return re;
}
int k;
int a[N], c[N], be[N];
int main() {
scanf("%d%d", &n, &k);
s = 2 * n + 1;
t = s + 1;
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i) scanf("%d", &c[i]);
for (int i = 1; i <= n; ++i) {
add(s, i, 1, c[a[i]]);
add(i, i + n, 1, 0);
add(i + n, t, 1, 0);
if (i < n) add(i, i + 1, k - 1, 0);
if (be[a[i]] != 0 && i != 1) add(i - 1, be[a[i]] + n, 1, -c[a[i]]);
be[a[i]] = i;
}
dinic();
printf("%lld\n", cost);
}
| 9 | CPP |
input(); print(len(set(filter(lambda x:int(x), input().split())))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma G++ optimize(2)
using namespace std;
unsigned int dp[100010];
int s;
int n;
char buf[100010];
int main() {
scanf("%d", &n);
scanf("%s", buf + 1);
if (n & 1) {
printf("0");
return 0;
}
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (buf[i] != '?') {
s++;
continue;
}
int mn = max(0, i - n / 2), mx = i / 2;
for (int j = mx; j >= mn; j--)
if (j) dp[j] += dp[j - 1];
}
unsigned int ans = dp[n / 2];
for (int i = 1; i <= n / 2 - s; i++) ans = ans * 25;
cout << ans;
}
| 11 | CPP |
string = str(input())
substring = str(input())
len_string = len(string)
len_substring = len(substring)
minimal_string_pos = []
max_string_pos = []
sub_flag = 0
for i in range(len_string):
if string[i] == substring[sub_flag]:
minimal_string_pos.append(i)
sub_flag += 1
if sub_flag > len_substring - 1:
break
sub_flag = len(substring) - 1
for i in range(len_string - 1, -1, -1):
if string[i] == substring[sub_flag]:
max_string_pos.append(i)
sub_flag -= 1
if sub_flag < 0:
break
max_string_pos = max_string_pos[::-1]
digit_max_1 = max(max_string_pos[0], len_string - (minimal_string_pos[len(minimal_string_pos) - 1]) - 1)
digit_max_2 = 0
for i in range(len(substring) - 1):
digit_max_2 = (max_string_pos[i + 1] - minimal_string_pos[i] - 1 if (max_string_pos[i + 1] - minimal_string_pos[i] - 1) > digit_max_2 else digit_max_2)
print(max(digit_max_1, digit_max_2))
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int d;
cin >> d;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int move = 0;
for (int i = 1; i < n; i++) {
while (move < d) {
if (a[i] > 0 && move + i <= d) {
--a[i];
++a[0];
move += i;
} else {
break;
}
}
}
cout << a[0] << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int N;
while( cin >> N )
{
int count = 0;
bool f = true;
while( N )
{
if( N % 2 )
{
if( f )
{
f = false;
} else
{
cout << " ";
}
cout << (int) pow ( 2 , count );
}
N >>= 1;
count++;
}
cout << endl;
}
} | 0 | CPP |
q = int(input())
k = n = 0
for i in range(q):
n = int(input())
while n % 5 == 0:
n = 4 * n // 5
k += 1
while n % 3 == 0:
n = 2 * n // 3
k += 1
while n % 2 == 0:
n = n//2
k += 1
if n != 1: print('-1')
else: print(k)
k = 0 | 7 | PYTHON3 |
note={}
n = int(input())
for i in range(n):
q=input()
if q in note:
note[q]+=1
print(q+str(note[q]))
else:
print('OK')
note[q]=0 | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) { for (; b; a %= b, swap(a, b)); return a; }
int n;
pll a[200001];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--)
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i].first;
for (int i = 0; i < n; i++)
cin >> a[i].second;
sort(a, a + n);
ll cx = 1, cy = 1;
ll ans = 0;
for (int i = 0; i < n; i++)
{
ll nx = a[i].first, ny = a[i].second;
ll cur = cx - cy;
ll nxt = nx - ny;
if (cur % 2 == 0)
{
if (cur == nxt) ans += ny - cy;
else ans += (nxt - cur) / 2;
}
else
{
ans += (nxt - cur + 1) / 2;
}
cx = nx, cy = ny;
}
cout << ans << '\n';
}
}
| 12 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s >> s;
while(cin >> s){
cout << s << "\n" << s << "\n";
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n, m;
int w = 0, b[10000];
cin >> n;
for (int i = 0; i < n.length(); i++) {
if (n.substr(i, 1) == "r") cout << i + 1 << endl;
}
for (int i = n.length() - 1; i >= 0; i--) {
if (n.substr(i, 1) == "l") cout << i + 1 << endl;
}
cin >> n;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 0};
int dy[] = {0, 1, -1};
long long mo = 1e9;
const long double P = 3.141592653589793238L;
void trust_your_self() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long gcd(long long x, long long y) {
if (x == 0) return y;
return gcd(y % x, x);
}
long long fast_power(long long x, long long y) {
long long p = 1;
while (y) {
if (y % 2 != 0) p = (p * x);
y /= 2;
x = (x * x);
}
return p;
}
long long com(long long n, long long x) {
long long p = 1, p1 = 1;
for (int i = n; i > n - x; i--) p = p * i;
for (int i = 1; i <= x; i++) p1 = p1 * i;
return (p / p1);
}
int main() {
trust_your_self();
int t;
cin >> t;
while (t--) {
string s;
set<char> s1;
cin >> s;
if (s.size() == 1)
cout << s << '\n';
else {
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[i + 1])
s1.insert(s[i]);
else {
i++;
}
}
for (auto it : s1) cout << it;
cout << '\n';
}
}
return 0;
}
| 7 | CPP |
next = {'ABC':'ARC','ARC':'ABC'}
print (next[input()]) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long h, w;
cin >> h >> w;
if(h!=1 && w!=1) cout << (h*w+1)/2 << endl;
else cout<<1<<endl;
}
| 0 | CPP |
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int a[2000];
int main() {
int i,j;
int t,n;
cin >> t;
while (t--) {
cin >> n;
int x;
for (i = 0; i < n; i++) {
cout << "? " << 1 << " " << n-i-1 << endl;
cout << i+1 << endl;
for (j = i+1; j < n; j++) cout << j+1 << " ";
cout << endl;
cin >> x;
a[i] = x;
if (x != 0) break;
}
int p = i;
vi d;
for (i = p+1; i < n-1; i++) {
cout << "? " << 1 << " " << n-i-1 << endl;
cout << p+1 << endl;
for (j = i+1; j < n; j++) cout << j+1 << " ";
cout << endl;
cin >> x;
a[i] = x;
}
a[n-1] = 0;
for (i = p+1; i < n; i++) {
if (a[i-1] == a[i]) d.pb(i);
}
int l = 0,r = p;
while (l < r) {
int m = (l+r) / 2;
cout << "? " << 1 << " " << m+1 << endl;
cout << p+1 << endl;
for (i = 0; i <= m; i++) cout << i+1 << " ";
cout << endl;
cin >> x;
if (x != 0) r = m;
else l = m+1;
}
for (i = 0; i < p; i++) {
if (i != l) d.pb(i);
}
cout << "! " << d.size();
for (i = 0; i < d.size(); i++) cout << " " << d[i]+1;
cout << endl;
}
return 0;
}
| 12 | CPP |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
const int N = 100;
const LL inf = 1e11;
struct node{
int to,rev;
LL flow;
};
vector<node> g[N+10];
queue<int > q;
int n,m,s,t;
int level[N+10],cur[N+10];
bool bfs() {
memset(level,0,sizeof(level));
while(!q.empty()) q.pop();
q.push(s); level[s]=1;
while(!q.empty()) {
int u=q.front(); q.pop();
//printf("%d\n",u);
if(u==t) return 1;
for(int i=0;i<(int)g[u].size();i++) {
int v=g[u][i].to;
LL f=g[u][i].flow;
if(level[v]==0 && f!=0) {
level[v]=level[u]+1;
q.push(v);
}
}
}
return 0;
}
LL dfs(int u,int t,LL maxf) {
if(u==t) return maxf;
LL ret=0;
for(int i=cur[u];i<(int)g[u].size();i++) {
int v=g[u][i].to;
LL f=g[u][i].flow;
if(level[u]+1==level[v] && f) {
LL Min=min(maxf-ret,f);
f=dfs(v,t,Min);
if(f>0) {
g[u][i].flow-=f;
g[v][g[u][i].rev].flow+=f;
ret+=f;
cur[u]=i;
}
if(maxf==ret) return ret;
}
}
return ret;
}
void addedge(int u,int v,LL f) {
node e; e.to=v; e.flow=f; e.rev=(int)g[v].size();
g[u].push_back(e);
e.to=u; e.flow=0; e.rev=(int)g[u].size()-1;
g[v].push_back(e);
}
int main() {
scanf("%d",&n);
s=0,t=n+1;
LL ans=0;
for(int i=1;i<=n;i++) {
int aa;
scanf("%d",&aa);
if(aa>0) ans+=aa;
if(aa==0) continue;
if(aa>0) addedge(s,i,aa);
if(aa<0) addedge(i,t,-aa);
}
for(int i=1;i<=n;i++)
for(int j=i+i;j<=n;j+=i)
addedge(j,i,inf);
while(bfs()) {
memset(cur,0,sizeof(cur));
ans-=dfs(s,t,inf);
}
printf("%lld\n",ans);
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<ll,ll> p[200005];
ll n,d,a,ans=0;
int main(){
cin>>n>>d>>a;
for(int i=1;i<=n;i++){
cin>>p[i].first>>p[i].second;
p[i].second=(p[i].second+a-1)/a;
}
sort(p+1,p+1+n);
ll pos=1,mx=p[pos].second;ans+=mx;
for(int i=2;i<=n;i++){
while(p[i].first-p[pos].first>2*d){
mx-=p[pos].second;
pos++;
}
if(p[i].second<=mx) p[i].second=0;
else p[i].second-=mx,mx+=p[i].second;
ans+=p[i].second;
}
cout<<ans<<endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, Q, ans;
int mx[200005];
int a[200005];
int cnt[200005];
bool vis[200005];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> a[i];
mx[a[i]] = max(mx[a[i]], i);
cnt[a[i]]++;
}
int l = 1;
while (l <= N) {
vector<int> vals;
vals.push_back(a[l]);
vis[a[l]] = 1;
int R = mx[a[l]];
int r = l;
while (r + 1 <= R) {
r++;
R = max(R, mx[a[r]]);
if (!vis[a[r]]) {
vis[a[r]] = 1;
vals.push_back(a[r]);
}
}
int tot = R - l + 1;
int maxi = 0;
for (auto v : vals) maxi = max(maxi, cnt[v]);
ans += tot - maxi;
l = r + 1;
}
cout << ans;
return 0;
}
| 13 | CPP |
import os
import sys
from io import BytesIO, IOBase
def solution(s):
coords = set()
res = 0
i, j = 0, 0
prev = (i, j)
for c in s:
x, y = prev
if c == "N":
y += 1
elif c == "E":
x += 1
elif c == "W":
x -= 1
else:
y -= 1
if (prev, (x, y)) in coords or ((x,y), prev) in coords:
res += 1
else:
coords.add((prev, (x, y)))
res += 5
prev = x, y
write(res)
def main():
for _ in range(r_int()):
s = input()
solution(s)
# 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)
def input():
return sys.stdin.readline().rstrip("\r\n")
def write(*args, end='\n'):
for x in args[:-1]:
sys.stdout.write(str(x) + ' ')
sys.stdout.write(str(args[-1]))
sys.stdout.write(end)
def r_array():
return [int(x) for x in input().split()]
def r_int():
return int(input())
if __name__ == "__main__":
main()
| 9 | PYTHON3 |
n=int(input())
c=0
l=[100,20,10,5,1]
for i in range(5):
c+=int(n/l[i])
n=n%l[i]
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (1e9) + 7, MAXN = (1e3) + 5;
int n, m;
bool g[MAXN][MAXN];
bool f[MAXN][MAXN];
bool gg[MAXN];
bool ff[MAXN];
bool mark[MAXN][MAXN];
int ans = 0;
bool qs = true;
bool bs = true;
int con = 0, com = 0;
int X[4] = {0, 0, 1, -1};
int Y[4] = {1, -1, 0, 0};
bool ch(int x, int y) { return (x >= 0 && y >= 0 && x < m && y < n); }
void dfs(int x, int y) {
mark[y][x] = true;
for (int i = 0; i < 4; i++) {
int xx = x + X[i];
int yy = y + Y[i];
if (ch(xx, yy) && (!mark[yy][xx])) {
dfs(xx, yy);
}
}
}
void ser1() {
for (int qq = 0; qq < n; qq++) {
int t, s;
bool sss = false;
for (int i = 0; i < m; i++) {
if (g[qq][i]) {
t = i;
sss = true;
break;
}
}
for (int i = m - 1; i >= 0; i--) {
if (g[qq][i]) {
s = i;
break;
}
}
if (!sss) {
con++;
continue;
}
if (t == s) {
continue;
}
for (int i = t + 1; i < s; i++) {
if (!g[qq][i]) {
qs = false;
}
}
}
}
void ser2() {
for (int qq = 0; qq < m; qq++) {
int t, s;
bool sss = false;
for (int i = 0; i < n; i++) {
if (f[qq][i]) {
t = i;
sss = true;
break;
}
}
for (int i = n - 1; i >= 0; i--) {
if (f[qq][i]) {
s = i;
break;
}
}
if (!sss) {
com++;
continue;
}
if (t == s) {
continue;
}
for (int i = t + 1; i < s; i++) {
if (!f[qq][i]) {
qs = false;
}
}
}
}
void ser3() {
bs = ((com > 0 && con > 0) || (com == 0 && con == 0));
qs = (qs && bs);
}
int main() {
cin >> n >> m;
bool q = true;
for (int qq = 0; qq < n; qq++) {
for (int j = 0; j < m; j++) {
char z;
cin >> z;
if (z == '#') {
g[qq][j] = true;
f[j][qq] = true;
mark[qq][j] = false;
} else {
g[qq][j] = false;
f[j][qq] = false;
mark[qq][j] = true;
}
}
}
ser1();
ser2();
ser3();
if (!qs) {
cout << "-1\n";
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (!mark[i][j]) {
ans++;
dfs(j, i);
}
}
}
cout << ans;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string m;
cin >> n >> m;
int mi = 1;
for (int i = 0; i < m.length(); i++) {
n += (m[i] - '0') * mi;
mi *= 10;
}
cout << n << endl;
return 0;
}
| 8 | CPP |
n=int(input())
a=[int(x) for x in input().split()]
m=int(input())
b=[int(x) for x in input().split()]
a1={}
for i in range(n):
if a[i] in a1.keys():
a1[a[i]][1]=n-i
else:
a1[a[i]]=[i+1,n-i]
v=0
p=0
for i in range(m):
v+=a1[b[i]][0]
p+=a1[b[i]][1]
print(v,p) | 8 | PYTHON3 |
n=int(input())
k=0
for i in range(n):
line=list(map(int,input().split()))
p=line[0]
q=line[1]
if q-p>=2:
k+=1
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1E9 + 7;
template <class C>
void mini(C& a4, C b4) {
a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
a4 = max(a4, b4);
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
out << "(" << pair.first << ", " << pair.second << ")";
return out;
}
const long long mod = 1E9 + 7;
int sil[12];
int newton(int n, int k) { return sil[n] / (sil[n - k] * sil[k]); }
int h, w, k;
int z[12][12];
int co[12][12];
int mapa[12];
long long S = 0;
int jest = 0;
int s[12];
int bad[12][12][11];
bool taken[12];
void add(int x, int y, int color, int v) {
for (int ii = (x); ii <= (h); ++ii)
for (int jj = (y); jj <= (w); ++jj) bad[ii][jj][color] += v;
}
void go(int x, int y, int colors) {
if (y > w) {
go(x + 1, 1, colors);
return;
}
if (x > h) {
s[colors]++;
return;
}
if (co[x][y]) {
if (mapa[co[x][y]]) {
int color = mapa[co[x][y]];
if (!bad[x][y][color]) {
add(x, y, color, 1);
go(x, y + 1, colors);
add(x, y, color, -1);
}
} else {
for (int c = (1); c <= (min(k, colors + 1)); ++c)
if (!bad[x][y][c] && !taken[c]) {
mapa[co[x][y]] = c;
taken[c] = 1;
add(x, y, c, 1);
z[x][y] = c;
go(x, y + 1, max(colors, c));
mapa[co[x][y]] = 0;
taken[c] = 0;
add(x, y, c, -1);
}
}
} else {
for (int c = (1); c <= (min(k, colors + 1)); ++c)
if (!bad[x][y][c]) {
z[x][y] = c;
add(x, y, c, 1);
go(x, y + 1, max(colors, c));
add(x, y, c, -1);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
sil[0] = 1;
set<int> u;
for (int i = (1); i <= (10); ++i) sil[i] = sil[i - 1] * i;
cin >> h >> w >> k;
if (h + w - 1 > k) {
cout << 0 << endl;
return 0;
}
for (int i = (1); i <= (h); ++i)
for (int j = (1); j <= (w); ++j) {
cin >> co[i][j];
if (co[i][j]) u.insert(co[i][j]);
}
jest = ((int)(u).size());
go(1, 1, 0);
for (int colors = (jest); colors <= (k); ++colors) {
int nn = k - jest;
int il = colors - jest;
S += s[colors] * (long long)sil[il] * (long long)newton(nn, il);
S %= mod;
}
cout << S << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int rev[100005], ar[100005], track[100005], cnt, ans[100005];
vector<pair<pair<int, int>, pair<int, int> > > v;
map<int, int> save;
void reduce(int val, int actual) {
track[val]--;
if (track[val] == actual - 1)
cnt--;
else if (track[val] == actual)
cnt++;
}
void add(int val, int actual) {
track[val]++;
if (track[val] == actual)
cnt++;
else if (track[val] == actual + 1)
cnt--;
}
int main() {
int tc, t, n, q, i, j, l, r;
set<int> st;
scanf("%d %d", &n, &q);
for (i = 1; i <= n; i++) {
scanf("%d", &ar[i]);
st.insert(ar[i]);
}
i = 1;
for (auto it = st.begin(); it != st.end(); it++, i++) {
save[*it] = i;
rev[i] = *it;
}
for (i = 1; i <= n; i++) {
ar[i] = save[ar[i]];
}
int blk = sqrt(n);
for (i = 0; i < q; i++) {
scanf("%d%d", &l, &r);
v.push_back(make_pair(make_pair(l / blk, r), make_pair(l, i)));
}
sort(v.begin(), v.end());
int lp = 0, rp = 0;
for (i = 0; i < q; i++) {
l = v[i].second.first;
r = v[i].first.second;
while (lp < l) {
int val = ar[lp];
lp++;
reduce(val, rev[val]);
}
while (lp > l) {
lp--;
int val = ar[lp];
add(val, rev[val]);
}
while (rp <= r) {
int val = ar[rp];
rp++;
add(val, rev[val]);
}
while (rp > r + 1) {
rp--;
int val = ar[rp];
reduce(val, rev[val]);
}
ans[v[i].second.second] = cnt;
}
for (i = 0; i < q; i++) {
printf("%d\n", ans[i]);
}
return 0;
}
| 8 | CPP |
n = int(input())
r = ['popStack', 'popQueue', 'popFront' ]
r2 = ['pushStack', 'pushQueue', 'pushFront' ]
_ = 0
while _ < n:
x = []
i = 0
while _ < n:
z = int(input())
_ += 1
if z == 0: break
x.append([z, i])
i+=1
if len(x) <= 3:
if len(x) > 0:
print('\n'.join(r2[:len(x)]))
if z == 0:
print(' '.join([str(len(x))] + r[:len(x)]))
else:
a = ['pushBack']*len(x)
x.sort(reverse=True)
for j in range(3):
a[x[j][1]] = r2[j]
print('\n'.join(a))
if z == 0:
print('3 ' + ' '.join(r))
| 9 | PYTHON3 |
distance = int(input())
steps = 0
steps = distance // 5
if distance % 5 != 0:
steps += 1
print(steps) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
if len(set(a))==1:
if a[0]==1:
for i in range(1,n+1,1):
print(str(i), end = ' ')
elif a[0]==-1:
for i in range(n, 0, -1):
print(str(i), end = ' ')
else: print(str(-1))
else:
s = a[0]
for i in range(1, n-1):
a[i]+=a[i-1]
s+=a[i]
if len(set(a)) < n-1: print(str(-1))
else:
n_sum = (n*(n+1))/2
x = (n_sum-s)
if x%n==0:
x = int(x/n)
print(str(x), end = ' ')
for i in a:
print(str(i+x), end = ' ')
else:
print(str(-1)) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main() {
int n;
scanf("%d", &n);
int a[n];
int mi = INT_MAX, ma = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
mi = min(mi, a[i]);
ma = max(ma, a[i]);
}
for (int i = 0; i < n; i++) {
if (a[i] > mi && a[i] < ma) ans++;
}
printf("%d\n", ans);
}
| 7 | CPP |
a=input().split();print('First' if int(a[0])>int(a[1]) else 'Second') | 7 | PYTHON3 |
s=list(input())
k=len(s)
r=[]
k=97
c=0
f=0
for i in range(len(s)):
if(ord(s[i])<=(k)):
c=c+1
r.append(ord(s[i]))
elif(ord(s[i])==(k+1)):
if k in r:
k=k+1
r.append(ord(s[i]))
else:
f=1
break
else:
f=1
break
if(f==1):
print('NO')
else:
print('YES') | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,x,y;
cin>>a>>b>>c>>x>>y;
int ans=0;
ans+=min(x,y)*min(a+b,2*c);
int n=abs(x-y);
ans+=min(n*(x<y?b:a),2*n*c);
cout<<ans<<endl;
return 0;
}
| 0 | CPP |
for _ in range(int(input())):
_ = input()
dict = list(map(int,input().split()))
u = [0,0]
for i,v in enumerate(dict):
u[i & 1] += (i & 1) != (v & 1)
print(u[i & 1] if u[0] == u[1] else -1)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, raod, p[100002], bst[100002], sz[100002], mod = 1000000007, x, y, z, t,
ad;
long long ans, kl[100002];
vector<pair<int, pair<int, int> > > g;
map<int, int> mp[100002];
vector<int> v[100002];
int find(int x) {
if (p[x] == 0) return x;
return p[x] = find(p[x]);
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
g.clear();
scanf("%d", &raod);
if (raod == 0) {
bst[i] = i;
v[i].push_back(i);
sz[i] = 1;
continue;
}
for (int j = 1; j <= raod; j++) {
scanf("%d%d", &x, &y);
z = find(x);
g.push_back(make_pair(sz[z], make_pair(x, y)));
}
sort(g.begin(), g.end());
reverse(g.begin(), g.end());
int x = find(g[0].second.first);
bst[i] = bst[x];
v[bst[x]].push_back(i);
ans +=
(mp[bst[x]][g[0].second.first] + kl[bst[x]]) % mod + g[0].second.second;
kl[bst[x]] +=
mp[bst[x]][g[0].second.first] + kl[bst[x]] + g[0].second.second;
ans %= mod;
kl[bst[x]] %= mod;
mp[bst[x]][i] = -kl[bst[x]];
for (int j = 1; j < g.size(); j++) {
t = bst[find(g[j].second.first)],
ad =
((mp[t][g[j].second.first] + kl[t]) % mod + g[j].second.second) % mod;
ans += ad;
ans %= mod;
for (int l = 0; l < v[t].size(); l++) {
mp[bst[x]][v[t][l]] =
((mp[t][v[t][l]] + ad) % mod + kl[t]) % mod - kl[bst[x]];
mp[bst[x]][v[t][l]] %= mod;
v[bst[x]].push_back(v[t][l]);
}
v[t].clear();
}
for (int j = 0; j < g.size(); j++) {
sz[i] += sz[find(g[j].second.first)];
p[find(g[j].second.first)] = i;
}
}
cout << (ans + mod) % mod << '\n';
return 0;
}
| 11 | CPP |
#include <iostream>
int main(){
int h,w,a,b;
std::cin>>h>>w>>a>>b;
std::cout<<h*w-(a*w+b*h-a*b)<<std::endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool a = false, b = false, c = false, d = false;
for (char x : s) {
a |= (x == 'N');
b |= (x == 'E');
c |= (x == 'W');
d |= (x == 'S');
}
cout << ((a != d || b != c) ? "No" : "Yes") << '\n';
return 0;
}
| 0 | CPP |
n = int(input())
color = input()
res = 0
for i in range(1, n):
if color[i - 1] == color[i]:
res += 1
print(res)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve(void) {
int n, m = -1, in;
vector<int> vet;
cin >> n;
vet.push_back(1e9 + 7);
for (int i = 0; i < n; i++) {
cin >> in;
m = max(m, in);
vet.push_back(in);
}
vet.push_back(1e9 + 7);
for (int i = 1; i <= n; i++) {
if (vet[i] == m && (vet[i - 1] < vet[i] || vet[i + 1] < vet[i])) {
cout << i << endl;
return;
}
}
cout << -1 << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) solve();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, ans = 0, cant = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
if (s[i] == '1') ans = max({ans, 2 * (i + 1), 2 * (n - i)}), cant++;
if (!cant) ans = n;
cout << ans << "\n";
}
return 0;
}
| 8 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.