solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
T = int(input())
for t in range(T):
n, a, b = list(map(int, input().split()))
l = [chr(ord("a") + i) for i in range(b)]
while len(l) != a:
l.append(l[-1])
while len(l) != n:
l.append(l[-a])
print("".join(l)) | 8 | PYTHON3 |
for _ in range(int(input())):
n,k=map(int,input().split())
if n%2==0:
if k==0:
print(0)
elif k<n:
if k%2==0:
print(0)
else:
print(1)
else:
print(abs(k-n))
else:
if k==0:
print(1)
elif k<n:
if k%2==1:
print(0)
else:
print(1)
else:
print(abs(k-n))
| 7 | PYTHON3 |
n,I = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
k = 2**(I*8//n)
b = [0] * len(set(a))
be = a[0]
i = 0
t = 0
ma = 0
if k > len(b):
print(0)
else:
for x in a:
if x != be:
t += b[i]
if i-k >= 0:
t -= b[i-k]
ma = max(ma,t)
i += 1
b[i] += 1
be =x
else:
b[i] += 1
if b[i] > 0:
t += b[i]
if i-k >= 0:
t -= b[i-k]
ma = max(ma,t)
print(n-ma)
#print(n - max([sum(b[i:i+k]) for i in range(len(b)-k+1)])) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 60;
const int IN = 0;
const int AND = 1;
const int OR = 2;
const int XOR = 3;
const int NOT = 4;
struct Node {
int val, p1, p2;
int op;
} node[maxn];
int n, p1, p2;
string op;
bool change[maxn];
int eval(int cur) {
if (node[cur].op == IN) {
return node[cur].val;
}
if (node[cur].op == AND) {
return node[cur].val = (eval(node[cur].p1) & eval(node[cur].p2));
}
if (node[cur].op == OR) {
return node[cur].val = (eval(node[cur].p1) | eval(node[cur].p2));
}
if (node[cur].op == XOR) {
return node[cur].val = (eval(node[cur].p1) ^ eval(node[cur].p2));
}
if (node[cur].op == NOT) {
return node[cur].val = (!eval(node[cur].p1));
}
}
void process(int cur, int now) {
int l = node[cur].p1;
int r = node[cur].p2;
int vl = node[l].val;
int vr = node[r].val;
if (node[cur].op == IN) {
return;
} else if (node[cur].op == AND) {
if (vl == 0 && vr == 0) {
process(l, change[l] = 0);
process(r, change[r] = 0);
} else if (vl == 0 && vr == 1) {
process(l, change[l] = (now & 1));
process(r, change[r] = 0);
} else if (vl == 1 && vr == 0) {
process(l, change[l] = 0);
process(r, change[r] = (now & 1));
} else if (vl == 1 && vr == 1) {
process(l, change[l] = (now & 1));
process(r, change[r] = (now & 1));
}
} else if (node[cur].op == OR) {
if (vl == 0 && vr == 0) {
process(l, change[l] = (now & 1));
process(r, change[r] = (now & 1));
} else if (vl == 0 && vr == 1) {
process(l, change[l] = 0);
process(r, change[r] = (now & 1));
} else if (vl == 1 && vr == 0) {
process(l, change[l] = (now & 1));
process(r, change[r] = 0);
} else if (vl == 1 && vr == 1) {
process(l, change[l] = 0);
process(r, change[r] = 0);
}
} else if (node[cur].op == XOR) {
process(l, change[l] = (now & 1));
process(r, change[r] = (now & 1));
} else if (node[cur].op == NOT) {
process(l, change[l] = (now & 1));
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> op;
if (op == "IN") {
scanf("%d", &p1);
node[i] = {p1, 0, 0, IN};
} else if (op == "NOT") {
scanf("%d", &p1);
node[i] = {0, p1, 0, NOT};
} else if (op == "AND") {
scanf("%d%d", &p1, &p2);
node[i] = {0, p1, p2, AND};
} else if (op == "OR") {
scanf("%d%d", &p1, &p2);
node[i] = {0, p1, p2, OR};
} else if (op == "XOR") {
scanf("%d%d", &p1, &p2);
node[i] = {0, p1, p2, XOR};
}
}
eval(1);
process(1, 1);
for (int i = 1; i <= n; i++) {
if (node[i].op == IN) printf("%d", change[i] ^ node[1].val);
}
}
| 10 | CPP |
n = int(input())
a = [int(i) for i in input().split()]
a.sort()
maxCount = 0
j = 0
for i in range(n):
while j < n and a[j] - a[i] <= 5:
j += 1
maxCount = max(maxCount, j - i)
print(maxCount)
| 9 | PYTHON3 |
a = [*map(int, input().split())]
l = [0, 1, 2, 0, 2, 1, 0]
s = [3, 2, 2]
res = 0
for i in range(7):
ans = [0] * 3
b = [*a]
for j in range(i, 7):
if b[l[j]] == 0: break
ans[l[j]] += 1
b[l[j]] -= 1
m = min(b[k] // s[k] for k in range(3))
for k in range(3):
b[k] -= m * s[k]
for j in range(7):
if b[l[j]] == 0: break
ans[l[j]] += 1
b[l[j]] -= 1
res = max(res, 7 * m + sum(ans))
print(res)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, m, tmp[5], h[N], nxt[N], adj[N], x[N], y[N], t, w[N], d[N];
unsigned long long A, B, C, ans;
vector<int> g[N];
inline void add(const int u, const int v) {
nxt[++t] = h[u], h[u] = t, adj[t] = v;
}
int main() {
scanf("%d%d%llu%llu%llu", &n, &m, &A, &B, &C);
register int i;
for (i = 1; i <= n; ++i)
ans += (unsigned long long)A * (n - i) * (n - i - 1) / 2 * (i - 1);
for (i = 1; i <= n; ++i)
ans += (unsigned long long)B * (i - 1) * (n - i) * (i - 1);
for (i = 1; i <= n; ++i)
ans += (unsigned long long)C * (i - 1) * (i - 2) / 2 * (i - 1);
for (i = 1; i <= m; ++i)
scanf("%d%d", &x[i], &y[i]), ++x[i], ++y[i], ++d[x[i]], ++d[y[i]],
x[i] > y[i] ? std::swap(x[i], y[i]), 0 : 0, g[x[i]].push_back(y[i] - 1),
g[y[i]].push_back(x[i] - 1),
ans -= ((A * (x[i] - 1) + B * (y[i] - 1)) * (n - y[i]) +
C * (n - y[i]) * (n + y[i] - 1) / 2),
ans -= ((A * (x[i] - 1) + C * (y[i] - 1)) * (y[i] - x[i] - 1) +
B * (y[i] - x[i] - 1) * (x[i] + y[i] - 2) / 2),
ans -= ((B * (x[i] - 1) + C * (y[i] - 1)) * (x[i] - 1) +
A * (x[i] - 1) * (x[i] - 2) / 2);
for (i = 1; i <= n; ++i) {
std::sort(g[i].begin(), g[i].end());
register unsigned long long cn1, cn2, s1, s2;
cn1 = cn2 = s1 = s2 = 0;
for (const int &j : g[i])
j + 1 < i ? ans += A * s1 + B * j * cn1, ++cn1,
s1 += j : (ans += B * s2 + C * j * cn2, ++cn2, s2 += j);
--i, ans += (unsigned long long)A * s1 * cn2 + C * s2 * cn1,
ans += (unsigned long long)B * cn1 * cn2 * i,
ans += (unsigned long long)C * cn1 * (cn1 - 1) / 2 * i,
ans += (unsigned long long)A * cn2 * (cn2 - 1) / 2 * i, ++i;
}
for (i = 1; i <= m; ++i)
d[x[i]] < d[y[i]] || (d[x[i]] == d[y[i]] && x[i] < y[i]) ? add(x[i], y[i])
: add(y[i], x[i]);
for (i = 1; i <= n; ++i) {
for (register int j = h[i]; j; j = nxt[j]) w[adj[j]] = i;
for (register int j = h[i]; j; j = nxt[j])
for (register int k = h[adj[j]]; k; k = nxt[k])
if (w[adj[k]] == i)
tmp[1] = i - 1, tmp[2] = adj[j] - 1, tmp[3] = adj[k] - 1,
std::sort(tmp + 1, tmp + 1 + 3),
ans = ans - A * tmp[1] - B * tmp[2] - C * tmp[3];
}
printf("%llu", ans);
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, n;
string s;
cin >> T;
while (T--) {
cin >> n >> s;
vector<int> v;
for (int i = 0; i < s.length(); i++)
if ((s[i] - '0') % 2 == 1) v.push_back(s[i] - '0');
if (v.size() < 2)
cout << -1 << endl;
else
cout << v[0] << v[1] << endl;
}
return 0;
}
| 7 | CPP |
for _ in range(int(input())):
s=input()
a=b=c=0
for i in s:
if i=='A':
a+=1
elif i=='B':
b+=1
else:
c+=1
d=a+c
if d==b:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
import sys
for _ in range(int(input())):
n = int(sys.stdin.readline())
li = list(map(int, sys.stdin.readline().split()))
s = [0] * n
for i in li:
s[i - 1] =s[i - 1]+ 1
s.sort(reverse=True)
m = 2 * (10 ** 6) + 1
max_gs = 0
for i in s:
m = max(min(m - 1, i), 0)
max_gs =max_gs+ m
print(max_gs)
| 10 | PYTHON3 |
t = int(input())
a = []
for i in range(t):
h,m = map(int,input().split())
ans = (23-h)*60 + (60-m)
a.append(ans)
for i in range(t):
print(a[i]) | 7 | PYTHON3 |
import math
t = int(input())
for _ in range(t):
n = int(input())
for k in range(2, 100):
tmp = (2**k - 1)
if n % tmp == 0:
print(n//tmp)
break
| 7 | PYTHON3 |
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().rstrip().split())
inl = lambda: list(map(int, input().split()))
out = lambda x, s='\n': print(s.join(map(str, x)))
t = ini()
for _ in range(t):
n, x, y = inm()
dif = y - x
for i in range(1, dif+1):
if dif % i != 0:
continue
count = n - 1
start = y
ok = False
while count > 0 and start > 0:
start -= i
count -= 1
if start == x:
ok = True
start += i if start <= 0 else 0
if ok:
break
ans = []
for j in range(n):
ans.append(start + i*j)
out(ans, " ") | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long base, long long exp, long long MOD) {
long long res = 1;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return (res % MOD);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void extended_gcd(long long &g, long long &x, long long &y, long long a,
long long b) {
if (b == 0) {
g = a;
x = 1;
y = 0;
return;
}
extended_gcd(g, y, x, b, a % b);
y = y - (a / b) * x;
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<pair<long long, long long> > v;
for (long long i = 2; i * i < n; i++) {
if (n % i == 0) {
v.emplace_back(make_pair(i, n / i));
}
}
long long val = n - 1;
for (auto p : v) {
long long k = gcd(p.first, p.second);
long long a = p.first;
long long b = p.second;
long long c = val;
if (val % k == 0) {
long long g, x, y;
extended_gcd(g, x, y, a, b);
x = (c / g) * x;
y = (c / g) * y;
long long x1 = x;
long long y1 = y;
if (x1 <= 0) {
long long t = abs(x * g / b);
if (abs(b * t) != abs(x * g)) {
t++;
}
x1 = x + (b / g) * t;
y1 = y - (a / g) * t;
}
if (y1 <= 0) {
long long t = abs(y * g / a);
if (abs(a * t) != abs(y * g)) {
t++;
}
t = -t;
x1 = x + (b / g) * t;
y1 = y - (a / g) * t;
}
if (x1 <= 0 || y1 <= 0) {
continue;
}
long long f1n = (a * x1) / gcd(a * x1, n);
long long f1d = (n) / gcd(a * x1, n);
long long f2n = (b * y1) / gcd(b * y1, n);
long long f2d = (n) / gcd(b * y1, n);
if (f2d < n && f1d < n) {
cout << "YES" << '\n';
cout << 2 << '\n';
cout << f1n << ' ' << f1d << '\n';
cout << f2n << ' ' << f2d << '\n';
return 0;
}
}
}
cout << "NO" << '\n';
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
int* mas = new int[n];
for (int i = 1; i < n; i++) cin >> mas[i];
cin >> a >> b;
int result = 0;
for (int i = a; i < b; i++) result += mas[i];
cout << result;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e6 + 6;
const int T = (1 << 19) + 3;
const int K = 300;
struct gg {
vector<int> a;
vector<pair<int, int>> t;
int countOf(int l, int r) {
if (l > r) return 0;
int res = upper_bound((a).begin(), (a).end(), r) -
lower_bound((a).begin(), (a).end(), l);
for (auto &p : t)
if (l <= p.first && p.first <= r) res += p.second;
return res;
}
void wp() {
vector<int> v;
sort((t).begin(), (t).end());
int sum = 0, j = 0;
for (int i = 0; i < t.size(); ++i) {
int x = t[i].first;
sum += t[i].second;
if (i + 1 == t.size() || t[i + 1].first > x) {
assert(abs(sum) < 2);
while (j < a.size() && a[j] < x) v.push_back(a[j++]);
if (j < a.size() && a[j] == x) {
if (sum == 0) v.push_back(a[j]);
if (sum > 0) v.push_back(x);
++j;
} else {
if (sum > 0) v.push_back(x);
}
sum = 0;
}
}
while (j < a.size()) v.push_back(a[j++]);
a = v;
t.clear();
}
void insert(int x) {
t.push_back({x, +1});
if (t.size() > K) wp();
}
void erase(int x) {
t.push_back({x, -1});
if (t.size() > K) wp();
}
};
gg t[T];
int d;
int a[N];
int rq(int i, int j, int x, int y) {
int res = 0;
for (i += d, j += d; i <= j; ++i >>= 1, --j >>= 1) {
if (i & 1) res += t[i].countOf(x + 1, y - 1);
if (~j & 1) res += t[j].countOf(x + 1, y - 1);
}
return res;
}
void del(int i, int x) {
for (i += d; i; i >>= 1) t[i].erase(x);
}
void ins(int i, int x) {
for (i += d; i; i >>= 1) t[i].insert(x);
}
int br(int n) {
int res = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < i; ++j)
if (a[i] < a[j]) ++res;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
for (d = 2; d < n; d <<= 1)
;
for (int i = 0; i < n; ++i) t[i + d].a.push_back(a[i] = i + 1);
for (int i = d - 1; i; --i) {
for (int x : t[i * 2].a) t[i].a.push_back(x);
for (int x : t[i * 2 + 1].a) t[i].a.push_back(x);
}
ll ans = 0;
while (q--) {
int l, r;
cin >> l >> r;
--l;
--r;
if (l > r) swap(l, r);
if (l != r) {
int x = a[l], y = a[r];
if (x > y) swap(x, y);
int cnt = rq(l + 1, r - 1, x, y);
if (a[l] < a[r])
ans += cnt * 2 + 1;
else
ans -= cnt * 2 + 1;
del(l, a[l]);
del(r, a[r]);
swap(a[l], a[r]);
ins(l, a[l]);
ins(r, a[r]);
}
cout << ans << endl;
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
const long long mod = 1000000000 + 7;
const long long INF = 9000000000000000000;
using namespace std;
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
long long gcd(long long a, long long b) { return (a == 0 ? b : gcd(b % a, a)); }
long long lcm(long long a, long long b) { return (a * b / (gcd(a, b))); }
long long add(long long a, long long b, long long c = 0) {
return ((a % mod + b % mod) % mod + c % mod) % mod;
}
long long mul(long long a, long long b) {
return ((a % mod) * (b % mod)) % mod;
}
long long sub(long long a, long long b) {
return (a % mod - b % mod + mod) % mod;
}
void print(vector<long long> ans) {
for (auto x : ans) cout << x << " ";
cout << endl;
}
long long n, a, w, k, b, h, x, y, m, mx, cc, timer, realans, start, queries,
startindex;
string s, t;
long long arr[100005];
void solve() {
cin >> n;
for (long long i = 0; i < n; i++) cin >> arr[i];
cin >> s;
long long curr = 0;
for (long long i = 0; i < n; i++)
if (s[i] == '1') curr += arr[i];
long long mx = curr, zero_sum = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '1')
mx = max(mx, curr - arr[i] + zero_sum);
else
zero_sum += arr[i];
}
cout << mx << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long tests = 1;
while (tests--) {
solve();
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn], vis[maxn];
int main() {
int n, x, i;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
scanf("%d", &a[i]);
vis[a[i]] = 1;
}
for (int i = n; i >= 1; i--)
if (!vis[i]) vis[a[i]]++;
for (i = 1; i <= n; i++)
if (vis[i] && vis[i] < 4) break;
if (i > n)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> col(n);
for (int i = 0; i < n; i++) cin >> col[i];
vector<vector<pair<int, int>>> graph(n);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
graph[x].emplace_back(y, i);
graph[y].emplace_back(x, i);
}
int sum = 0;
for (int i = 0; i < n; i++)
if (col[i] > 0) sum ^= 1;
for (int i = 0; i < n; i++)
if (col[i] < 0)
if (sum) {
col[i] = 1;
sum = 0;
} else
col[i] = 0;
if (sum) {
cout << "-1\n";
return 0;
}
vector<int> subset;
vector<bool> visited(n);
function<bool(int)> dfs = [&](int v) {
visited[v] = true;
for (auto [ne, nei] : graph[v])
if (!visited[ne]) {
if (dfs(ne)) {
subset.push_back(nei);
col[v] ^= 1;
}
}
return col[v];
};
dfs(0);
cout << subset.size() << "\n";
for (int e : subset) cout << e << "\n";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int board[1005][1005];
int visited[1005][1005];
int pos[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int n, m;
int rows[1005], columns[1005];
void bfs(int i, int j) {
visited[i][j] = 1;
queue<pair<int, int> > q;
q.push(pair<int, int>(i, j));
while (!q.empty()) {
pair<int, int> u = q.front();
q.pop();
for (int k = 0, colchin = 4; k < colchin; ++k) {
int ni = u.first + pos[k][0], nj = u.second + pos[k][1];
if (ni >= 0 && ni < n && nj >= 0 && nj < m && !visited[ni][nj] &&
board[ni][nj] == 1) {
visited[ni][nj] = 1;
q.push(pair<int, int>(ni, nj));
}
}
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int sum = 0;
for (int i = 0, colchin = n; i < colchin; ++i) {
for (int j = 0, colchin = m; j < colchin; ++j) {
char c;
cin >> c;
if (c == '#') {
board[i][j] = 1;
sum++;
}
}
}
bool possible = true;
for (int i = 0, colchin = n; i < colchin; ++i) {
int flag = -1;
for (int j = 0, colchin = m; j < colchin; ++j) {
if (board[i][j] == 1) {
if (flag == -1) {
flag = 0;
} else if (flag == 1) {
possible = false;
}
} else {
if (flag == 0) {
flag = 1;
}
}
}
if (flag > -1) {
rows[i] = 1;
}
if (!possible) break;
}
for (int j = 0, colchin = m; j < colchin; ++j) {
int flag = -1;
for (int i = 0, colchin = n; i < colchin; ++i) {
if (board[i][j] == 1) {
if (flag == -1) {
flag = 0;
} else if (flag == 1) {
possible = false;
}
} else {
if (flag == 0) {
flag = 1;
}
}
}
if (flag > -1) {
columns[j] = 1;
}
if (!possible) break;
}
for (int i = 0, colchin = n; i < colchin; ++i) {
if (rows[i] == 0) {
for (int j = 0, colchin = m; j < colchin; ++j) {
if (columns[j] == 0 || columns[j] == 2) {
columns[j] = 2;
rows[i] = 2;
}
}
}
if (rows[i] == 0) possible = false;
}
for (int j = 0, colchin = m; j < colchin; ++j) {
if (columns[j] == 0) {
for (int i = 0, colchin = n; i < colchin; ++i) {
if (rows[i] == 0 || rows[i] == 2) {
columns[j] = 2;
rows[i] = 2;
}
}
}
if (columns[j] == 0) possible = false;
}
if (possible) {
int cnt = 0;
for (int i = 0, colchin = n; i < colchin; ++i) {
for (int j = 0, colchin = m; j < colchin; ++j) {
if (!visited[i][j] && board[i][j] == 1) {
bfs(i, j);
cnt++;
}
}
}
cout << cnt << "\n";
} else {
cout << "-1\n";
}
return 0;
}
| 8 | CPP |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100050;
struct node{
int a,b;
}a[N];
int r[N];
inline bool cmp1(const node &a,const node &b){return a.b<b.b;}
inline bool cmp2(int x,int y){return a[x].a<a[y].a;}
int main(){
int n,i,p,tot=1;
scanf("%d",&n);
for(i=1;i<=n;++i){scanf("%d",&a[i].a);r[i]=i;}
for(i=1;i<=n;++i)scanf("%d",&a[i].b);
sort(a+1,a+n+1,cmp1);sort(r+1,r+n+1,cmp2);
for(i=1;i<=n;++i)if(a[r[i]].a>a[i].b){
puts("No");
return 0;
}
for(i=1;i<n;++i)if(a[r[i+1]].a<=a[i].b){
puts("Yes");
return 0;
}
for(p=r[1];p!=1;p=r[p])++tot;
puts(tot==n?"No":"Yes");
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p,n||m||p){
vector<int> x(n+1);
int total=0;
for(int i=1;i<=n;++i){
cin>>x[i];
total+=x[i];
}
total=total*100;
total=total*(100-p)/100;
if(x[m]==0)
cout<<0<<endl;
else
cout<<total/x[m]<<endl;
}
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
void faltu() { cerr << endl; }
template <typename T>
void faltu(T a[], int n) {
for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n, s;
cin >> n;
s = sqrt(n);
if (n == 1) {
cout << 0 << endl;
continue;
} else {
if (s * s == n) {
cout << 2 * s - 2 << endl;
} else if ((s + 1) * s >= n) {
cout << 2 * s - 1 << endl;
} else if ((s + 1) * (s + 1) >= n) {
cout << 2 * s << endl;
}
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int a, b;
int main() {
cin >> n;
a = 1, b = n;
while (a < b) {
cout << a << " " << b << " ";
a++;
b--;
}
if (n % 2) {
cout << (n / 2) + 1 << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t, n, m, k, l, r;
int main() {
cin >> t;
while (t--) {
cin >> n >> m >> k;
l = n % 2 * m / 2;
r = (n - n % 2) * (m - m % 2) / 2 + l;
if (l <= k && k <= r && (k - l) % 2 == 0)
cout << "YES\n";
else
cout << "NO\n";
}
return 0;
}
| 10 | CPP |
k = list(map(int, input().split()))
scores = list(map(int, input().split()))
scores.sort(reverse=True)
k = k[-1]
count = 0
for score in scores:
if score >= scores[k-1] and score > 0:
count = count + 1
print(count) | 7 | PYTHON3 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<string,int> P;
int ans[200005]={0};
vector<string> vs,vr;
vector<P> vq,vq2,vq3;
int main(){
ll n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
string s;
cin>>s;
vs.push_back(s);
reverse(s.begin(),s.end());
vr.push_back(s);
}
sort(vs.begin(),vs.end());
sort(vr.begin(),vr.end());
for(int i=0;i<m;i++){
string s;
cin>>s;
bool f=false;
if(s[0]=='*'){
f=true;
reverse(s.begin(),s.end());
}
bool f_=false;
int cp=0;
for(int j=0;j<s.length();j++){
if(s[j]=='?'){
f_=true;
cp=j;
}
}
bool f2=false;
if(s[s.length()-1]=='*') f2=true;
if(f){
s.pop_back();
if(!f_) vq2.push_back(P(s,i));
else{
for(int k=0;k<26;k++){
s[cp]=(char)('a'+k);
vq2.push_back(P(s,i));
}
}
}
else{
if(f2){
s.pop_back();
if(!f_) vq.push_back(P(s,i));
else{
for(int k=0;k<26;k++){
s[cp]=(char)('a'+k);
vq.push_back(P(s,i));
}
}
}
else{
if(!f_) vq3.push_back(P(s,i));
else{
for(int k=0;k<26;k++){
s[cp]=(char)('a'+k);
vq3.push_back(P(s,i));
}
}
}
}
}
sort(vq.begin(),vq.end());
sort(vq2.begin(),vq2.end());
sort(vq3.begin(),vq3.end());
for(int i=0;i<vq.size();i++) {
string s=vq[i].first;
int sl=s.length();
int idx=vq[i].second;
// cout<<s<<" "<<idx<<" ";
int lb=lower_bound(vs.begin(),vs.end(),s)-vs.begin();
s[sl-1]=(char)(s[sl-1]+1);
// cout<<s<<" ";
int rb=lower_bound(vs.begin(),vs.end(),s)-vs.begin();
ans[idx]+=rb-lb;
// cout<<rb-lb<<endl;
}
for(int i=0;i<vq2.size();i++) {
string s=vq2[i].first;
int sl=s.length();
int idx=vq2[i].second;
// cout<<s<<" "<<idx<<" ";
int lb=lower_bound(vr.begin(),vr.end(),s)-vr.begin();
s[sl-1]=(char)(s[sl-1]+1);
int rb=lower_bound(vr.begin(),vr.end(),s)-vr.begin();
ans[idx]+=rb-lb;
// cout<<s<<" "<<rb-lb<<endl;
}
for(int i=0;i<vq3.size();i++) {
string s=vq3[i].first;
int sl=s.length();
int idx=vq3[i].second;
// cout<<s<<" "<<idx<<" ";
int lb=lower_bound(vs.begin(),vs.end(),s)-vs.begin();
s.push_back('a');
// cout<<s<<" ";
int rb=lower_bound(vs.begin(),vs.end(),s)-vs.begin();
ans[idx]+=rb-lb;
// cout<<rb<<" "<<lb<<endl;
}
for(int i=0;i<m;i++) cout<<ans[i]<<endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t)) aux1 += m * x;
long long aux2 = (long long)ceil((double)(m - (T - t)) / (T - t)) + 1;
aux2 *= cost;
ans += min(aux1, aux2);
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
double inf = 1.0e20;
double y[100010], l[100010], ans, xa, xb;
int a, b, n, m;
struct note {
double x;
int w;
bool operator<(const note& o) const { return x < o.x; }
} p[100010];
int aa, bb;
int find(double t) {
int low = 0, high = n - 1, mid = low + high >> 1;
while (low <= high) {
if (p[mid].x <= t) {
low = mid + 1;
} else {
high = mid - 1;
}
mid = low + high >> 1;
}
return low - 1;
}
double sdis(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
double getdis(double x1, double x2) {
return sdis(0, 0, xa, x1) + sdis(xa, x1, xb, x2);
}
int main() {
scanf("%d%d%d%d", &n, &m, &a, &b);
xa = a;
xb = b;
for (int i = 0; i < n; i++) {
scanf("%lf", &p[i].x);
p[i].w = i + 1;
}
sort(p, p + n);
for (int i = 1; i <= m; i++) scanf("%lf", y + i);
for (int i = 1; i <= m; i++) scanf("%lf", l + i);
ans = inf;
for (int i = 1; i <= m; i++) {
double t = y[i] * xa / xb;
int s = find(t);
double mm = inf;
if (s != n - 1) {
mm = getdis(p[s + 1].x, y[i]) + l[i];
if (ans > mm) {
ans = mm;
aa = p[s + 1].w;
bb = i;
}
}
if (s != -1) {
mm = getdis(p[s].x, y[i]) + l[i];
if (ans > mm) {
ans = mm;
aa = p[s].w;
bb = i;
}
}
}
printf("%d %d\n", aa, bb);
return 0;
}
| 10 | CPP |
n=int(input())
a=list(map(int,input().split()))
ps=[]
sum=0
for i in range(0,n):
sum+=a[i]
ps.append(sum)
if(ps[n-1]%2==0):
k=int(ps[n-1]/2)
c=0
for i in range(0,n-1):
if(ps[i]==k):
c+=1
print(c)
else:
print(0) | 9 | PYTHON3 |
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100;
int main() {
int n;
int p[N + 1], a[N + 1][N + 1];
cin >> n;
for( int i = 0; i < n; ++i ) {
cin >> p[i] >> p[i + 1];
}
for( int i = 1; i <= n; i++ ) a[i][i] = 0;
for( int m = 2; m <= n; m++ ) {
for( int i = 1; i <= n - m + 1; i++ ) {
int j = i + m - 1;
a[i][j] = ( 1 << 21 );
for( int k = i; k<=j - 1; k++) {
a[i][j] = min(a[i][j], a[i][k] + a[k+1][j] +
p[i-1] * p[k] * p[j] );
}
}
}
cout << a[1][n] << endl;
}
| 0 | CPP |
#include <stdio.h>
#include <utility>
#include <queue>
using namespace std;
typedef pair<int,int> pi;
#define F first
#define S second
struct cmp{
bool operator()(const pi &a,const pi &b){
return a.S>b.S;
}
};
int main(){
int n,ans=0,last=0;
pi temp;
priority_queue<pi,vector<pi>,cmp>pq;
scanf("%d",&n);
while(n--){
scanf("%d%d",&temp.F,&temp.S);
pq.push(temp);
}
while(!pq.empty()){
if(pq.top().F<=last)pq.pop();
else{
ans++;
last=pq.top().S;
pq.pop();
}
}
printf("%d\n",ans);
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline void timer(void) {
int t = clock();
cout << (float(t)) / CLOCKS_PER_SEC;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, res = 0, tt = -1;
cin >> n;
string s;
char c, h;
bool t = false;
vector<bool> no(26), yes(26), cc;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == '.') {
cin >> s;
for (int j = 0; j < (int)s.size(); j++) {
yes[s[j] - 'a'] = false;
no[s[j] - 'a'] = true;
}
int k = 0, b = 0;
for (int j = 0; j < (int)yes.size(); j++) k += yes[j], b += no[j];
if ((k == 1 || b == 25) && tt == -1) tt = res;
} else if (c == '!') {
res++;
cin >> s;
if (!t) {
for (int j = 0; j < (int)s.size(); j++)
if (!no[s[j] - 'a']) yes[s[j] - 'a'] = true;
t = true;
} else if (t) {
cc.assign(26, false);
for (int j = 0; j < (int)s.size(); j++)
if (yes[s[j] - 'a']) cc[s[j] - 'a'] = true;
for (int j = 0; j < (int)yes.size(); j++)
if (!cc[j]) yes[j] = false, no[j] = true;
for (int j = 0; j < (int)s.size(); j++)
if (!cc[s[j] - 'a']) no[s[j] - 'a'] = true, yes[s[j] - 'a'] = false;
}
for (int j = 0; j < 26; j++)
if (no[j]) yes[j] = false;
int k = 0, b = 0;
for (int j = 0; j < (int)yes.size(); j++) k += yes[j], b += no[j];
if ((k == 1 || b == 25) && tt == -1) tt = res;
} else if (c == '?') {
cin >> h;
if (i != n - 1) {
res++;
no[h - 'a'] = true;
yes[h - 'a'] = false;
} else {
if (tt == -1) tt = res;
}
int k = 0, b = 0;
for (int j = 0; j < (int)yes.size(); j++) k += yes[j], b += no[j];
if ((k == 1 || b == 25) && tt == -1) tt = res;
}
}
cout << res - tt << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int INF = 1e9 + 7;
const int N = 4e5 + 7;
const int M = 5e6 + 7;
int vis[M];
int p[N];
int qt[N];
signed main() {
ios::sync_with_stdio(false);
int q, x, y;
cin >> q >> x;
set<pair<int, int>> vals;
for (int i = 0; i < x; i++) vals.insert({qt[i], i});
while (q--) {
int y;
cin >> y;
y %= x;
vals.erase({qt[y], y});
vals.insert({++qt[y], y});
auto k = *vals.begin();
int nVal = k.first * x + k.second;
cout << nVal << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int main() {
int n, aux, aux_max = -1, max = -1, aux_min = 101, min = 101;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &aux);
if (aux < aux_min) {
min = i;
aux_min = aux;
}
if (aux > aux_max) {
max = i;
aux_max = aux;
}
}
if (max < min) {
printf("%d\n", ((min - 1 > n - max) ? min - 1 : n - max));
} else {
printf("%d\n", ((max - 1 > n - min) ? max - 1 : n - min));
}
return 0;
}
| 7 | CPP |
s = 0
for _ in range(int(input())):
p = input()
if p == 'Tetrahedron':
s += 4
elif p == 'Cube':
s += 6
elif p == 'Octahedron':
s += 8
elif p == 'Dodecahedron':
s += 12
elif p == 'Icosahedron':
s += 20
print(s) | 7 | PYTHON3 |
n,k=map(int,input().split())
i=0
while n//k**(i+1)>=1:
i+=1
print(i+1)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
scanf("%d", &(test));
for (int t = 1; t <= test; t++) {
int n;
scanf("%d", &(n));
unsigned long long int sum = 0;
for (unsigned long long int i = 1; i <= n / 2; i++) {
sum = sum + (long long int)(8 * (i * i));
}
cout << sum << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void prepare() {}
int N;
struct Tree {
long long t[10000];
Tree() { memset((t), (0), sizeof(t)); }
void build(long long *a, int i = 1, int l = 0, int r = N - 1) {
if (i == 1) {
}
if (l == r)
t[i] = a[l];
else {
int m = (l + r) / 2;
build(a, i * 2, l, m);
build(a, i * 2 + 1, m + 1, r);
t[i] = max(t[i * 2], t[i * 2 + 1]);
}
}
long long get_min(int l, int r, int i = 1, int tl = 0, int tr = N - 1) {
if (l == tl && r == tr) return t[i];
int m = (tl + tr) / 2;
if (r <= m) return get_min(l, r, i * 2, tl, m);
if (l > m) return get_min(l, r, i * 2 + 1, m + 1, tr);
return max(get_min(l, m, i * 2, tl, m),
get_min(m + 1, r, i * 2 + 1, m + 1, tr));
}
void update(int pos, int newval, int i = 1, int l = 0, int r = N - 1) {
if (l == r)
t[i] = newval;
else {
int m = (l + r) / 2;
if (pos <= m)
update(pos, newval, i * 2, l, m);
else
update(pos, newval, i * 2 + 1, m + 1, r);
t[i] = t[i * 2] + t[i * 2 + 1];
}
}
};
long long a[1501][1501];
int n, m;
Tree t;
const long long INF = 1LL << 60;
bool solve() {
scanf("%d%d", &n, &m);
N = m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) scanf("%lld", &a[i][j]);
}
for (int i = 1; i < m; i++) a[0][i] = a[0][i - 1] + a[0][i];
for (int i = 1; i < n; i++) {
t = Tree();
t.build(a[i - 1]);
for (int j = 1; j < m; j++) a[i][j] += a[i][j - 1];
for (int j = 0; j < m; j++) {
if ((i & 1) && j + 1 < m) {
long long x = t.get_min(j + 1, m - 1);
a[i][j] += x;
} else if (!(i & 1) && j > 0) {
a[i][j] += t.get_min(0, j - 1);
}
}
if (i & 1)
a[i][m - 1] = -INF;
else
a[i][0] = -INF;
}
long long res = -INF;
for (int i = 0; i < m; i++) res = max(res, a[n - 1][i]);
cout << res << endl;
return false;
}
int main() {
prepare();
while (solve())
;
return 0;
}
| 11 | CPP |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int inf = 1e9;
const int inf64 = 1e18;
const int MOD = inf + 7;
void solve() {
int n ;
cin >> n;
map<int , int > m;
vector<int> x[n+1],y[n+1];
int count=1;
int a[n+1];
for(int i=1;i<=n;i++)
{
cin >> a[i];
if(m[a[i]]==0)
{
x[count].pb(i);
m[a[i]]=count;
count++;
}
else
{
x[m[a[i]]].pb(i);
}
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
y[m[a[i]]].pb(i);
}
for(int i=1;i<count;i++)
{
int p=0,q=0;
for(int j=0;j<x[i].size();j++)
{
if((x[i][j])%2)
{
p++;
}
else
{
q++;
}
if((y[i][j])%2)
{
p--;
}
else
{
q--;
}
}
if(p || q )
{
cout<<"NO\n";
return ;
}
}
cout<<"YES\n";
}
int32_t main() {
fast;
int t = 1;
cin >> t;
while (t--) solve();
}
| 9 | CPP |
import sys
import collections
def input():
return sys.stdin.readline().rstrip()
def split_input():
return [int(i) for i in input().split()]
# tests = 1
tests = int(input())
for _ in range(tests):
n = int(input())
a = split_input()
ind = 0
while (ind < n and a[ind] == 1):
ind += 1
if ind == n:
if n%2 == 0:
print("Second")
else:
print("First")
else:
if ind %2 == 0:
print("First")
else:
print("Second")
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long cal(const vector<int> &aa, int n, long long minDiv) {
vector<int> a = aa;
for (int i = 1; i <= n; i++) {
a[i] %= minDiv;
}
long long ans = 0;
long long curSum = 0;
vector<long long> test;
for (int i = 1, j = 0; i <= n; i = j) {
int midIdx = 0;
j = i - 1;
curSum = 0;
while (curSum < minDiv && j < n) {
j++;
assert(j <= n);
long long leftNum = curSum;
curSum += a[j];
long long rightNum = max(0LL, minDiv - curSum);
long long sub = max(0LL, curSum - minDiv);
if (abs(rightNum - leftNum) <= a[j] - sub) {
midIdx = j;
}
}
if (curSum == 0) {
break;
}
long long res = 0;
for (int k = midIdx - 1; k >= i; k--) {
res += (long long)(midIdx - k) * a[k];
}
for (int k = midIdx + 1; k <= j; k++) {
int curNum = a[k];
if (k == j) {
curNum -= curSum - minDiv;
}
res += (long long)(k - midIdx) * curNum;
}
ans += res;
test.push_back(res);
a[j] = curSum - minDiv;
}
return ans;
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
long long sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
if (sum <= 1LL) {
do {
printf("-1\n");
return 0;
} while (0);
;
}
vector<long long> div;
long long tmp = sum;
for (long long num = 2; num * num <= tmp; num++) {
if (tmp % num == 0) {
div.push_back(num);
while (tmp % num == 0) {
tmp /= num;
}
}
}
if (tmp != 1) {
div.push_back(tmp);
}
long long ans = 1e18;
for (auto e : div) {
long long res = cal(a, n, e);
ans = min(ans, res);
}
printf("%lld\n", ans);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int MAX = 200009;
int a[MAX] = {0};
char s[MAX];
long long pw(long long base, long long expo, long long c) {
if (expo == 0) return 1;
long long f = pw(base, expo / 2, c);
if (expo & 1) return (((f * f) % c) * base) % c;
return (f * f) % c;
}
int main() {
int i, j, k;
scanf("%s", s);
;
int l = strlen(s);
long long p = 1LL;
long long x = pw(2, l - 1, 1000000007);
long long ans = 0;
for (i = l - 1; i >= 0; i--) {
if (s[i] - '0') {
ans = (ans + p) % 1000000007;
}
p = (p * 2) % 1000000007;
}
printf("%lld\n", (ans * x) % 1000000007);
return 0;
}
| 7 | CPP |
t=int(input())
for _ in range(t):
n=int(input())
a=list(map(int,input().split()))
ans="YES"
left_min=[0 for _ in range(n)]
left_min[0]=a[0]
for i in range(1,n):
left_min[i]=min(left_min[i-1],a[i])
for i in range(0,n-1):
if i>0:
left_min[i]=min(left_min[i-1],left_min[i])
if a[i]>a[i+1]:
if a[i]-a[i+1]>left_min[i]:
ans="NO"
break
else:
left_min[i]=left_min[i]-(a[i]-a[i+1])
print(ans) | 7 | PYTHON3 |
k=int(input())
s='codeforces'
l=[1 for i in range(0,10)]
mul=1
i=0
while(mul<k):
a=l[i%10]
l[i%10]+=1
mul=mul*l[i%10]//a
i+=1
for i in range(10):
print(s[i]*l[i],end="") | 8 | PYTHON3 |
x = str(input())
inp1 = []
for i in range(len(x)):
jk = x[i]
inp1.append(jk)
num = []
for j in range(len(inp1)):
if j%2==0:
lk = int(inp1[j])
num.append(lk)
n_num = num.sort()
nm = []
for i in num:
ki = str(i) + '+'
nm.append(ki)
af = nm[len(nm)-1]
nm.pop(len(nm)-1)
hj = af[0]
nm.append(hj)
ans = "".join(nm)
print (ans) | 7 | PYTHON3 |
# シンプル貪欲
d=int(input())
c= list(map(int, input().split()))
D= [list(map(int, input().split())) for i in range(d)]
for i in range(d):
print(1) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x, y, n, min = 100000, a1, a2, minx, miny;
while (~scanf("%lf%lf%lf", &x, &y, &n)) {
int i;
for (i = 1; i <= n; i++) {
a1 = x / y * i;
a1 = floor(a1 + 0.2);
a2 = abs(x / y - a1 / i);
if (min > a2) {
minx = a1;
miny = i;
min = a2;
}
}
printf("%.0lf/%.0lf\n", minx, miny);
}
return 0;
}
| 8 | CPP |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
vector<int>l;
int n, m;
while (cin >> n >> m){
if (n == 0 && m == 0)break;
int k[1001];
for (int i = 0; i < n; i++){
cin >> k[i];
}
sort(k, k + n);
int sum = 0;
for (int i = 0; i < n; i++)
if (n % m != i % m)sum += k[i];
l.push_back(sum);
}
for (int i : l) {
cout << i << endl;
}
char c;
cin >> c;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long v, pa, l;
} bfa[3010];
vector<int> mat[3010];
int que[3010], h, r, dp[3010][3010];
void bfs(int p, int pa) {
h = r = 0;
dp[pa][p] = bfa[p].l = 0;
bfa[p].pa = -1;
bfa[p].v = 1;
que[r] = p;
r++;
while (h != r) {
for (int i = 0; i < mat[p].size(); i++) {
int x = mat[p][i];
if (bfa[x].v == 0) {
dp[pa][x] = bfa[x].l = bfa[p].l + 1;
bfa[x].pa = p;
bfa[x].v = 1;
que[r] = x;
r++;
}
}
h++;
p = que[h];
}
}
int main() {
ios::sync_with_stdio(false);
memset(dp, -1, sizeof(dp));
int i, j, n, m, s, t, l, so, to, lo, a, b, c, x, y, z;
cin >> n >> m;
for (int i = 0; i <= m - 1; i++) {
cin >> a >> b;
mat[a].push_back(b);
mat[b].push_back(a);
}
for (int i = 1; i <= n; i++) memset(bfa, 0, sizeof(bfa)), bfs(i, i);
cin >> so >> to >> lo;
cin >> s >> t >> l;
for (int i = 1; i <= n; i++) {
}
if (dp[s][t] > l || dp[so][to] > lo || dp[s][t] == -1 || dp[so][to] == -1) {
cout << -1 << '\n';
return 0;
}
c = dp[s][t] + dp[so][to];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
swap(s, t);
x = dp[s][i] + dp[so][i] + dp[i][j] + dp[j][t] + dp[j][to];
if (dp[s][i] + dp[i][j] + dp[j][t] <= l)
if (dp[so][i] + dp[i][j] + dp[j][to] <= lo) c = min(c, x);
swap(s, t);
x = dp[s][i] + dp[so][i] + dp[i][j] + dp[j][t] + dp[j][to];
if (dp[s][i] + dp[i][j] + dp[j][t] <= l)
if (dp[so][i] + dp[i][j] + dp[j][to] <= lo) c = min(c, x);
}
}
cout << m - c << '\n';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int f() {
cin >> n;
vector<int> g[200];
vector<int> s[200];
for (int i = 0; i < 200; ++i) s[i].assign(n + 1, 0);
a.resize(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
--a[i];
g[a[i]].push_back(i);
s[a[i]][i + 1] = 1;
}
for (int i = 0; i < 200; ++i)
for (int j = 1; j < n + 1; ++j) s[i][j] += s[i][j - 1];
int res = 0;
for (int i = 0; i < 200; ++i) res = max(res, s[i].back());
for (int e = 0; e < 200; ++e) {
vector<int>& z = g[e];
if (z.size() < 2) continue;
int l = 0;
int r = z.size() - 1;
while (l < r) {
int add = 0;
int fr = z[l] + 1;
int to = z[r] - 1;
for (int i = 0; i < 200; ++i) add = max(add, s[i][to + 1] - s[i][fr]);
res = max(res, 2 * (l + 1) + add);
++l;
--r;
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) cout << f() << "\n";
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int x, y, d, ans[4];
vector<int> v;
void ch() {
if (x == 4 && y == 0) exit(0);
}
int main() {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 4; j++) cout << i;
cout << "\n";
cin >> x >> y;
ch();
if (x)
v.push_back(i);
else
d = i;
}
memset(ans, -1, sizeof(ans));
for (int i = 0; i < v.size(); i++) {
int a = v[i];
for (int j = 0; j < 4; j++) {
if (ans[j] != -1) continue;
cout << "\n";
for (int k = 0; k < 4; k++) {
if (k == j)
cout << a;
else
cout << d;
}
cout << "\n";
cin >> x >> y;
ch();
if (x) ans[j] = a;
}
}
for (int i = 0; i < 4; i++) cout << ans[i];
cout << "\n";
cin >> x >> y;
}
| 8 | CPP |
k, n, w = map(int, input().split())
a, b = 0, 0
for i in range(1, w + 1):
a = i * k
b += a
if n > b:
print(0)
else:
print(b - n)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long ara[1 << 20 + 1];
long long m[5][1 << 20 + 1];
int main() {
cin >> n;
long long ans = 0;
m[0][0] = 1;
for (long long i = 1; i <= n; i++) {
cin >> ara[i];
ara[i] ^= ara[i - 1];
ans += m[i % 2][ara[i]];
m[i % 2][ara[i]]++;
}
cout << ans << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 155;
char name[N][N];
int len[N];
vector<int> e[N];
int income[N];
int n;
void init() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", name[i]);
len[i] = strlen(name[i]);
}
}
void Edge() {
for (int i = 1; i < n; i++) {
int st = 0;
while (st < len[i] && st < len[i + 1] && name[i][st] == name[i + 1][st])
st++;
if (st == len[i + 1]) {
puts("Impossible");
exit(0);
} else if (st == len[i])
continue;
else {
e[name[i][st]].push_back((int)(name[i + 1][st]));
income[name[i + 1][st]]++;
}
}
}
vector<char> ans;
void topicSort() {
queue<int> que;
for (int i = 'a'; i <= 'z'; i++)
if (!income[i]) {
que.push(i);
ans.push_back(i);
}
while (!que.empty()) {
int pos = que.front();
que.pop();
for (int i = 0; i < (int)e[pos].size(); i++) {
income[e[pos][i]]--;
if (income[e[pos][i]] == 0) {
que.push(e[pos][i]);
ans.push_back(e[pos][i]);
}
}
}
if (ans.size() != 26)
puts("Impossible");
else
for (int i = 0; i < 26; i++) putchar(ans[i]);
puts("");
}
int main() {
init();
Edge();
topicSort();
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<char> counter;
int main() {
long n, i = 0, count1, count2, count3;
char c;
cin >> n;
while (i < n) {
cin >> c;
if (isdigit(c)) {
i++;
counter.push_back(c);
}
}
count1 = n - count(counter.begin(), counter.end(), '1');
count2 = n - count(counter.begin(), counter.end(), '2');
count3 = n - count(counter.begin(), counter.end(), '3');
cout << int(fmin(fmin(count1, count2), count3)) << endl;
return 0;
}
| 7 | CPP |
k=input()
if len(k)==1:
print(k)
else:
k=k.split("+")
print("+".join(sorted(k))) | 7 | PYTHON3 |
#include<iostream>
using namespace std;
int main()
{
int n,q,a[100000];
int mini,maxn;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
cin>>q;
int judge,low,high;
for(int i=1;i<=q;i++)
{
cin>>judge>>low>>high;
mini=maxn=a[low];
if(judge==0)
{
for(int i=low;i<=high-1;i++)
if(a[i]<mini)
mini=a[i];
cout<<mini<<endl;
}
else
{
for(int i=low;i<=high-1;i++)
if(a[i]>maxn)
maxn=a[i];
cout<<maxn<<endl;
}
}
return 0;
}
| 0 | CPP |
N = int(input())
A = []
B = []
for n in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2==1:
print (B[N//2]-A[N//2]+1)
else:
b = B[N//2]+B[N//2-1]
a = A[N//2]+A[N//2-1]
print (b-a+1) | 0 | PYTHON3 |
def mcd(a,b): # calculamos el mcd usando el Algoritmo de Euclides
while(b != 0): # por el algoritmo de Euclides el ultimo Rk (ultimo resto != 0) es el mcd(a,b)
c = a % b
a = b
b = c
return a # devuelve el mcd(a,b)
def primeFactors(n): # buscamos la descomposicion en numeros primos de n
factores=[]
if n%2==0: # en caso que n sea par tiene que tener a 2 en su descomposicion
exp=0
while n%2 ==0: # mientras pueda seguir dividiendo por 2 2 esta en la descomposicion de n con exponente+1
exp+=1
n//=2 # voy quitando cada 2 que este presente en la descomposicion de n
factores.append((2,exp)) # agrego a la lista el primo 2 con el exponente con que aparece en la descomposici\'on
i=3 #ahora empiezo a iterar por 3
while(i*i<=n): # recorro todas los numeros impares hasta la raiz
if(n%i==0):# en caso que i|n es como i es un primo en su descomposicion
exp=0
while n%i ==0: # mientras pueda seguir dividiendo por i aumenta en 1 la el exponente con que aparece en su descomposicion
exp+=1
n//=i
factores.append((i,exp))# agrego a la lista primo i con el exponente con que aparece en la descomposicion
i+=2
if n > 2: # En caso que n sea un primo distinto de 2 pues 2 se revisa arriba tengo que agregar al propio n a la descomposicion
factores.append((n,1)) #agrego a la lista n con exponente 1
return factores # devuelvo una lista donde cada tupla es de la forma (primo_i ,exponente_con_que_aparece_el_primo_i_en_la descomposicion)
def Phi(n): #calculamos phi de n
phi=1
for fact in primeFactors(n): # si n=p1^e1*p2^e2*...pk^ek* entonces calculos phi(n) como p1^(e1-1)*(p1-1)*p2^(e2-1)*(p2-1)*...*pk^(ek-1)*(pk-1)*
phi*=(fact[0]**(fact[1]-1))*(fact[0]-1) # pi^(ei-1)*(ei-1)
return phi #devuelvo Phi(n)
for _ in range(int(input())):# por cada caso t de entrada
a,m = map(int,input().split()) #
print(Phi(m//(mcd(a,m)))) # imprimo la salida del problema para el caso que es Phi(m/mcd(a,m)) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
int n;
int x[maxn], y[maxn];
bool check(int u) {
int xmx = -1, xmn = 55, ymx = -1, ymn = 55;
for (int(i) = (1); (i) <= (n); (i)++)
if (i != u) {
xmx = max(xmx, x[i]);
xmn = min(xmn, x[i]);
ymx = max(ymx, y[i]);
ymn = min(ymn, y[i]);
}
if (xmx - xmn != ymx - ymn) return false;
for (int(i) = (1); (i) <= (n); (i)++)
if (i != u && x[i] != xmn && x[i] != xmx && y[i] != ymn && y[i] != ymx)
return false;
return true;
}
int main() {
scanf("%d", &n);
n = 4 * n + 1;
for (int(i) = (1); (i) <= (n); (i)++) scanf("%d%d", x + i, y + i);
for (int(i) = (1); (i) <= (n); (i)++)
if (check(i)) {
printf("%d %d", x[i], y[i]);
return 0;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 600000 + 600;
const long long MOD = 1000000007LL;
long long pow2[N];
long long invpow2[N];
long long add(long long a, long long b) { return (a + b) % MOD; }
long long mul(long long a, long long b) { return (a * b) % MOD; }
struct Node {
Node() {}
Node(long long val_, long long prefix_, long long suffix_, int count_)
: val(val_), prefix(prefix_), suffix(suffix_), count(count_) {}
long long val;
long long prefix;
long long suffix;
int count;
} node[N << 2];
void push_up(int p, int l, int r) {
int lson = p << 1;
int rson = lson | 1;
node[p].count = node[lson].count + node[rson].count;
node[p].prefix =
add(node[lson].prefix, mul(node[rson].prefix, pow2[node[lson].count]));
node[p].suffix =
add(node[rson].suffix, mul(node[lson].suffix, pow2[node[rson].count]));
long long t = mul(node[lson].val, pow2[node[rson].count]);
node[p].val = 0;
node[p].val = add(node[p].val, t);
t = mul(node[rson].val, pow2[node[lson].count]);
node[p].val = add(node[p].val, t);
t = mul(node[lson].prefix, node[rson].suffix);
node[p].val = add(node[p].val, t);
}
void update(int p, int l, int r, int x, const Node &y) {
if (l == r) {
node[p] = y;
return;
}
int mid = (l + r) >> 1;
if (x <= mid)
update(p << 1, l, mid, x, y);
else
update(p << 1 | 1, mid + 1, r, x, y);
push_up(p, l, r);
}
void solve() {
int n;
cin >> n;
vector<pair<int, int> > vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first;
vec[i].second = i;
}
int q;
cin >> q;
vector<int> del(q);
for (int i = 0; i < q; i++) {
int x, y;
cin >> x >> y;
del[i] = x - 1;
vec.push_back({y, n + i});
}
sort(vec.begin(), vec.end());
vector<int> pos(vec.size());
for (int i = 0; i < vec.size(); i++) {
pos[vec[i].second] = i;
}
int m = vec.size() - 1;
for (int i = 0; i < n; i++) {
int x = pos[i];
int y = vec[x].first;
update(1, 0, m, x, Node{0, y, y, 1});
}
cout << mul(node[1].val, invpow2[n]) << endl;
for (int i = 0; i < q; i++) {
int x = pos[del[i]];
update(1, 0, m, x, Node{0, 0, 0, 0});
x = pos[n + i];
int y = vec[x].first;
pos[del[i]] = x;
update(1, 0, m, x, Node{0, y, y, 1});
cout << mul(node[1].val, invpow2[n]) << endl;
}
}
int main() {
pow2[0] = 1;
for (int i = 1; i < N; i++) {
pow2[i] = mul(pow2[i - 1], 2);
}
invpow2[0] = 1;
for (int i = 1; i < N; i++) {
invpow2[i] = mul(invpow2[i - 1], 500000004);
}
ios::sync_with_stdio(false);
solve();
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct pt {
int x, y, z;
pt() {}
pt(int a, int b, int c) : x(a), y(b), z(c) {}
inline pt operator+(const pt& o) const {
return pt(x + o.x, y + o.y, z + o.z);
}
inline pt operator-(const pt& o) const {
return pt(x - o.x, y - o.y, z - o.z);
}
inline pt operator*(const int& o) const { return pt(x * o, y * o, z * o); }
};
inline long long dp(const pt& a, const pt& b) {
return (long long)a.x * b.x + (long long)a.y * b.y + (long long)a.z * b.z;
}
const int NMAX = 32300;
int n, m;
pt a, b, amb;
int amt[NMAX];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
pt dir(1, 1, 1);
a = pt(-1, 0, 1);
b = pt(-1, 1, 0);
amb = a - b;
for (int i = m + 1; i <= n / 2 + 1; ++i) {
long long ans = 0;
pt pi = b * (n + 1) + amb * i;
int j = n - m;
int k = m + 1;
pt pj = a * j;
pt pk = b * k;
pt pji = pj - pi;
pt pki = pk - pi;
long long cur = dp(pj - pi, pk - pi);
for (; j >= m + 1;) {
while (cur >= 0 && k <= n - m) {
cur += -pji.x + pji.y;
pki = pki + b;
k++;
}
if (k == (n - m + 1)) break;
ans += (n - m + 1) - k;
j--;
pji = pji - a;
cur += pki.x - pki.z;
}
amt[i] = ans;
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
int v = min(i, n + 1 - i);
ans += amt[v];
}
cout << ans * 3 << endl;
return 0;
}
| 10 | CPP |
t = int(input())
dem = t//7*2
t%=7
if t>5: print(dem+t-5,dem+2)
elif t>2: print(dem,dem+2)
else: print(dem,dem+t) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T,U;
int A,B;
cin>>S>>T>>A>>B>>U;
if (S==U){A--;}
else if (T==U){B--;};
cout<<A<<" "<<B;
}
| 0 | CPP |
n,m = map(int,input().split())
mn = n
for _ in range(m):
l,r = map(int,input().split())
mn = min(mn,r-l+1)
j = 0
answer = [0]*n
for i in range(n):
answer[i] = j%mn
j += 1
print(mn)
print(*answer)
| 7 | PYTHON3 |
import sys
import string
import math
from collections import defaultdict
from functools import lru_cache
from collections import Counter
from fractions import Fraction
def mi(s):
return map(int, s.strip().split())
def lmi(s):
return list(mi(s))
def tmi(s):
return tuple(mi(s))
def mf(f, s):
return map(f, s)
def lmf(f, s):
return list(mf(f, s))
def js(lst):
return " ".join(str(d) for d in lst)
def jsns(lst):
return "".join(str(d) for d in lst)
def line():
return sys.stdin.readline().strip()
def linesp():
return line().split()
def iline():
return int(line())
def mat(n):
matr = []
for _ in range(n):
matr.append(linesp())
return matr
def matns(n):
mat = []
for _ in range(n):
mat.append([c for c in line()])
return mat
def mati(n):
mat = []
for _ in range(n):
mat.append(lmi(line()))
return mat
def pmat(mat):
for row in mat:
print(js(row))
def main():
S, T = line(), line()
counts = Counter(T)
yay = 0
who = 0
# Set to check if the index is done.
done = set()
for e, c in enumerate(S):
if counts[c] > 0:
counts[c] -= 1
yay += 1
done.add(e)
for e, c in enumerate(S):
if e in done:
continue
# Try to get a whoops.
if c.isupper():
if counts[c.lower()] > 0:
who += 1
counts[c.lower()] -= 1
else:
if counts[c.upper()] > 0:
who += 1
counts[c.upper()] -= 1
print(yay, who)
main()
| 8 | PYTHON3 |
s = input()
s = s.lower()
vowels = "aeiouy"
s = ''.join([x for x in s if x not in vowels])
s = ''.join(["." + x for x in s])
print(s) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int p;
cin >> p;
}
vector<pair<int, int> > ans;
for (int i = 1; i < m; i++) {
for (int j = i; j > 0; j--) ans.push_back(make_pair(j - 1, j));
}
cout << ans.size() << endl;
if (!k)
for (int i = 0; i < ans.size(); i++)
cout << ans[i].first + 1 << " " << ans[i].second + 1 << endl;
else
for (int i = 0; i < ans.size(); i++)
cout << ans[i].second + 1 << " " << ans[i].first + 1 << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using std::max;
using std::min;
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x3f3f3f3f3f3f3f3f;
__inline__ __attribute__((always_inline)) unsigned int rnd() {
static unsigned int seed = 416;
return seed += 0x71dad4bfu, seed ^= seed >> 5, seed += 0xc6f74d88u,
seed ^= seed << 17, seed += 0x25e6561u, seed ^= seed >> 13;
}
template <typename _Tp>
_Tp gcd(const _Tp &a, const _Tp &b) {
return (!b) ? a : gcd(b, a % b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {
return a >= 0 ? a : -a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {
(a < b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {
(b < a) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void read(_Tp &x) {
char ch(getchar());
bool f(false);
while (!isdigit(ch)) f |= ch == 45, ch = getchar();
x = ch & 15, ch = getchar();
while (isdigit(ch)) x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();
f && (x = -x);
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {
read(t);
read(args...);
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b,
const Args &...args) {
return a < b ? min(a, args...) : min(b, args...);
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b,
const Args &...args) {
return a < b ? max(b, args...) : max(a, args...);
}
__inline__ __attribute__((always_inline)) int read_str(char *s) {
char ch(getchar());
while (ch == ' ' || ch == '\r' || ch == '\n') ch = getchar();
char *tar = s;
*tar = ch, ch = getchar();
while (ch != ' ' && ch != '\r' && ch != '\n' && ch != EOF)
*(++tar) = ch, ch = getchar();
return tar - s + 1;
}
const int N = 600005;
const int mod = 1000000007;
template <typename _Tp1, typename _Tp2>
__inline__ __attribute__((always_inline)) void add(_Tp1 &a, _Tp2 b) {
(a += b) >= mod && (a -= mod);
}
template <typename _Tp1, typename _Tp2>
__inline__ __attribute__((always_inline)) void sub(_Tp1 &a, _Tp2 b) {
(a -= b) < 0 && (a += mod);
}
int n, l1, l2;
char s[N], t[N];
long long fac[N], inv[N], ifac[N], pw[N];
bool pr[N];
int p[N], pos, mu[N], ___;
void init() {
fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1;
pw[0] = 1, pw[1] = 2;
for (int i = 2; i < N; ++i) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
ifac[i] = ifac[i - 1] * inv[i] % mod;
pw[i] = pw[i - 1], add(pw[i], pw[i]);
}
mu[1] = 1;
for (int i = 2; i < N; ++i) {
if (!pr[i]) p[++pos] = i, mu[i] = -1;
for (int j = 1; j <= pos && 1ll * i * p[j] < N; ++j) {
pr[i * p[j]] = true;
if (!(i % p[j])) {
mu[i * p[j]] = 0;
break;
}
mu[i * p[j]] = -mu[i];
}
}
for (int g = 1; g <= n; ++g) {
long long tmp = 0;
for (int d = 1; d * g <= n; ++d)
tmp += 1ll * mu[d] * (n / (d * g)) * (n / (d * g)) % mod;
tmp %= mod, tmp += mod;
add(___, 1ll * tmp * pw[g] % mod);
}
}
__inline__ __attribute__((always_inline)) long long C(int n, int m) {
if (n < m || m < 0) return 0;
return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
long long f(int a, int b) {
if (!a && !b) return ___;
if (1ll * a * b >= 0) return 0;
a = abs(a), b = abs(b);
return pw[n / (max(a, b) / gcd(a, b)) + 1] - 2;
}
int main() {
l1 = read_str(s + 1);
l2 = read_str(t + 1);
read(n);
init();
int ans = 0, qwq = 0;
if (l1 == l2) {
for (int i = 1; i <= l1; ++i) {
if (s[i] == '?' && t[i] == '?')
++qwq;
else if (s[i] != '?' && t[i] != '?' && s[i] != t[i]) {
qwq = -1;
break;
}
}
if (qwq >= 0)
qwq = pw[qwq], add(ans, 1ll * qwq * (pw[n + 1] + mod - 2) % mod *
(pw[n + 1] + mod - 2) % mod);
else
qwq = 0;
}
int Da = 0, Db = 0, Ca = 0, Cb = 0;
for (int i = 1; i <= l1; ++i)
Da += s[i] == 'A', Db += s[i] == 'B', Ca += s[i] == '?';
for (int i = 1; i <= l2; ++i)
Da -= t[i] == 'A', Db -= t[i] == 'B', Cb += t[i] == '?';
Db += Ca - Cb;
for (int d = -Cb; d <= Ca; ++d) {
int da = Da + d, db = Db - d;
long long cnt = C(Ca + Cb, Cb + d);
if (!da && !db)
add(ans, 1ll * (cnt - qwq + mod) * ___ % mod);
else
add(ans, 1ll * cnt * f(da, db) % mod);
}
printf("%d\n", ans);
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int T;
long long L, R;
string s;
void solve() {
cin >> L >> R;
if (L == R)
cout << L << endl;
else
cout << 2 << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
T = 1;
while (T--) {
solve();
}
return 0;
}
| 7 | CPP |
import sys
import math
import bisect
from math import sqrt
def input(): return sys.stdin.readline().strip()
def iinput(): return int(input())
def rinput(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
mod = int(1e9)+7
n, m = rinput()
p = [0] + get_list()
d = {i:[] for i in range(1, n+1)}
for _ in range(m):
u, v = rinput()
d[u].append(v)
last = p[n]
target = n
for i in range(n-1, 0, -1):
for j in range(i, target):
if p[j+1] in d[p[j]]:
p[j], p[j+1] = p[j+1], p[j]
else:
break
if p[target]!=last:
target -= 1
print(n-target) | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long f[6][10010], b = 1;
int main() {
for (int i = 1; i <= 4; ++i)
for (int j = 1; j <= (i == 4 ? 1 : 10000); ++j) {
long long now = f[i - 1][j];
for (int k = 1; k <= j; ++k)
now += f[i - 1][min(now + j + 1, 10000ll)] + 1;
f[i][j] = now;
}
for (int i = 5, d; i >= 1; --i) {
long long now = 0;
printf("%lld", min(b, 10000ll));
for (int j = 1; j <= min(b, 10000ll); ++j) {
now += f[i - 1][min(b + now, 10000ll)];
printf(" %lld", b + now);
++now;
}
printf("\n");
fflush(stdout);
scanf("%d", &d);
if (d == -1)
break;
else {
now = 0;
for (int j = 1; j <= d; ++j) now += f[i - 1][min(b + now, 10000ll)] + 1;
b += now;
}
}
return 0;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10, inf = 1e9;
const long double pi = 3.14159265;
long long n, w, a[maxn], t, b[maxn];
vector<long long> ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n >> w;
ans.clear();
bool check = false;
long long index;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] >= (w + 1) / 2 && a[i] <= w) check = 1, index = i;
}
if (check == 1) {
cout << 1 << endl << index << endl;
continue;
}
long long sum = 0;
for (int i = 1; i <= n; i++) {
if (sum + a[i] <= w) {
sum += a[i];
ans.push_back(i);
}
}
if (sum < (w + 1) / 2) {
cout << -1 << endl;
continue;
}
cout << ans.size() << endl;
for (auto x : ans) {
cout << x << " ";
}
cout << endl;
}
return 0;
}
| 7 | CPP |
import sys
input = lambda :sys.stdin.readline().rstrip('\r\n')
# print(bin(9))
for _ in range(int(input())):
n=int(input())
v= n//4+(1 if n%4 else 0)
print('9'*(n-v)+'8'*(v)) | 8 | PYTHON3 |
n=int(input())
xlist=list(map(int,input().split()))
num=0;NUM=0
for i in range(n-1):
if(xlist[i]<=xlist[i+1]):
num+=1
NUM=NUM if NUM > num else num
else:
num=0
print(NUM+1)
| 7 | PYTHON3 |
inStr = input()
procStr = inStr.lower()
strLen = len(inStr)
vowels = ["a","e","i","o","u","y"]
for letter in procStr:
if letter not in vowels:
newLetter = "."+letter
print(newLetter, end="")
#print("\n")
| 7 | PYTHON3 |
a = input()
b = a.split("0")
c = a.split("1")
r = "NO"
for i in c:
if len(i) >= 7:
r = "YES"
for i in b:
if len(i) >= 7:
r = "YES"
print(r) | 7 | PYTHON3 |
s = input()
if int(s)>=0:
print(s)
exit()
c1 = s[:-1]
c2 = s[:-2] + s[-1]
if c1=='-0' or c2=='-0':
print(0)
exit()
if int(c1)<int(c2):
print(c2)
else:
print(c1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
const int MAX_L = 20; // ~ Log N
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 7;
#define endl "\n";
typedef long long ll;
ll p=100000007;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ll> vl;
typedef vector<vi> vvi;
#define break break;
#define LSOne(S) (S & (-S))
#define isBitSet(S, i) ((S >> i) & 1)
#define all(v) v.begin(),v.end()
#define pb push_back
#define loop(a,n) for(ll i=a;i<n;i++)
void faltu() {
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break}; while(1){break};
}
template<typename T> void scan(T &x)
{
x = 0; bool neg = 0; register T c = getchar(); if (c == '-') neg = 1, c = getchar(); while ((c < 48) || (c > 57)) c = getchar(); for ( ; c < 48||c > 57 ; c = getchar()); for ( ; c > 47 && c < 58; c = getchar() ) x= (x << 3) + ( x << 1 ) + ( c & 15 ); if (neg) x *= -1;
}
template<typename T> void print(T n)
{
bool neg = 0; if (n < 0) n *= -1, neg = 1; char snum[65]; ll i = 0; do { snum[i++] = n % 10 + '0'; n /= 10; } while (n); --i; if (neg) putchar('-'); while (i >= 0) putchar(snum[i--]); putchar('\n');
}
ll gcd(ll a,ll b)
{
if(b==0) return a;
return gcd(b,a%b);
}
ll power(long long x, unsigned int y)
{
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
bool semiprime(ll num)
{
int cnt = 0;
for (int i = 2; cnt < 2 && i * i <= num; ++i)
while (num % i == 0)
num /= i, ++cnt;
if (num > 1)
++cnt;
return cnt == 2;
}
bool prime(ll n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
/*-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
/*-------------------------------------------------------------------THIS IS LOB.......--------------------------------------------------------------------------------------------------------*/
/*--------------------------------------------------------------------HO JA SHURU...--------------------------------------------------------------------------------------------------------------------------------------*/
// ll dp[1e5+1][2];
// ll l[1e5+1],r[1e5+1];
// vector<ll>g[1e5+1];
// ll inf = 1e21;
ll ans,add;
void overpower(){
ll n;
cin>>n;
vector<ll>arr(n);
for(auto &x:arr){
cin>>x;
}
ans = 0,add = 0;
sort(arr.begin(), arr.end());
for(int i=2;i<n;i++){
add+=arr[i-2];
ans-=(arr[i]*(i-1));
ans+=add;
}
cout<<ans<<endl;
}
#undef int
int32_t main() {
Fast;
#ifdef _DEBUG
freopen("beyond_input.txt", "r", stdin);
freopen("beyond_output.txt", "w", stdout);
#endif
ll t;
cin>>t;
// t =1;
for(ll i=0;i<t;i++)
{
// cout << "Case #" << (i+1) << ": ";
overpower();
// cout<<endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, s, k;
cin >> n >> s >> k;
set<int> st;
int x;
for (int i = 1; i <= k; i++) {
cin >> x;
st.insert(x);
}
int ans = 0;
while (true) {
if (s + ans <= n && st.find(s + ans) == st.end()) break;
if (s - ans >= 1 && st.find(s - ans) == st.end()) break;
ans++;
}
cout << ans << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, n, t;
char base[500005];
int bp[500005], bk[500005], sums[500005];
int main() {
scanf("%d%d", &n, &t);
scanf("%s", base + 1);
for (a = t + 1; a <= n; a++)
if (base[a] == 'H') {
printf("-1");
return 0;
}
int top, bot;
top = n;
bot = 0;
for (a = 1; a <= n; a++) {
if (base[a] == 'H') bot++;
if (base[a] == 'S') bot--;
}
if (bot < 0) bot = 0;
while (top > bot) {
int tr = (top + bot) / 2;
int now = tr;
int backnum = 0;
for (a = 1; a <= n; a++) {
if (base[a] == 'H') {
if (now == 0) {
backnum++;
bp[backnum] = a;
}
now--;
}
if (base[a] == 'S') {
now++;
if (now == 0) {
bk[backnum] = a;
}
}
}
if (backnum == 0)
top = tr;
else {
for (a = 1; a <= backnum; a++)
sums[a] = sums[a - 1] + (bk[a] - bp[a]) * 2;
int sol = sums[backnum];
int posl = bk[backnum];
for (a = posl; a <= n; a++)
if (base[a] == 'H') posl = a;
a = backnum;
while (a >= 1 && sums[a - 1] + posl - bp[a] < sol)
sol = sums[a - 1] + posl - bp[a], a--;
if (sol + posl <= t)
top = tr;
else
bot = tr + 1;
}
}
printf("%d\n", top);
}
| 8 | CPP |
s=input()
lst=s.split()
n=int(lst[0])
k=int(lst[1])
m=input()
lstx=m.split()
ps=int(lstx[k-1])
num=len(lstx)
count=0
for i in range(num):
if int(lstx[i-1])>=ps and int(lstx[i-1])>0:
count=count+1
print(count)
| 7 | PYTHON3 |
import sys
input = sys.stdin.readline
k1,k2,k3=map(int,input().split())
A1=list(map(int,input().split()))
A2=list(map(int,input().split()))
A3=list(map(int,input().split()))
A=sorted(A1)+sorted(A2)+sorted(A3)
import bisect
N=k1+k2+k3
DP=[float("inf")]*N
for a in A:
pos=bisect.bisect_left(DP,a)
DP[pos]=a
ANS=0
for i in range(N):
if DP[i]!=float("inf"): ANS=i
print(N-(ANS+1))
| 11 | PYTHON3 |
n = int(input())
ans = ''
if (n % 2 != 0):
ans += '7'
n-=3
while (n >= 2):
ans += '1'
n-=2
print(ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxm = 54;
int n, m, k;
long long first[maxm], a[maxm], b[maxm], p[maxm];
long long c[maxm][maxm];
int ipow(long long b, int e) {
long long ret = 1;
for (; e; e >>= 1) {
if (e & 1) ret = ret * b % mod;
b = b * b % mod;
}
return ret;
}
void dfs(int i, long long x) {
if (i == k)
p[__builtin_popcountll(x)]++;
else
dfs(i + 1, x), dfs(i + 1, x ^ a[i]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
for (int j = m - 1; j >= 0; j--) {
if ((x >> j) & 1) {
if (!first[j]) {
first[j] = x;
break;
}
x ^= first[j];
}
}
}
for (int i = 0; i < m; i++) {
if (first[i]) {
for (int j = 0; j < i; j++) {
first[i] ^= ((first[i] >> j) & 1) * first[j];
}
for (int j = 0; j < m; j++) {
if (!first[j]) a[k] = (a[k] << 1) | ((first[i] >> j) & 1);
}
a[k] |= 1ll << (m - 1 - k), k++;
}
}
if (k < maxm / 2) {
dfs(0, 0);
int x = ipow(2, n - k);
for (int i = 0; i <= m; i++) {
cout << (x * p[i] % mod);
if (i != m) cout << " ";
}
cout << '\n';
} else {
swap(a, b);
k = m - k;
for (int i = 0; i < k; i++) {
for (int j = 0; j < m - k; j++) {
a[i] |= ((b[j] >> i) & 1) << j;
}
a[i] |= 1ll << (m - 1 - i);
}
for (int i = 0; i <= m; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
dfs(0, 0);
int x = (long long)ipow((mod + 1) / 2, k) * ipow(2, n - m + k) % mod;
for (int i = 0; i <= m; i++) {
long long ret = 0;
for (int j = 0; j <= m; j++) {
long long cur = 0;
for (int l = 0; l <= i; l++) {
(cur += (1 - 2 * (l & 1)) * c[j][l] % mod * c[m - j][i - l] % mod +
mod) %= mod;
}
(ret += cur * p[j] % mod) %= mod;
}
cout << (x * ret % mod);
if (i != m) cout << " ";
}
cout << '\n';
}
return 0;
}
| 11 | CPP |
n = int(input(""))
words = []
for i in range (1,n + 1):
word = input("")
words.append(word)
for word in words:
l = len(word)
if l > 10:
word = word[0] + str(l - 2) + word [l - 1]
print(word)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int n, m;
struct list {
int xu, a;
} st[100], x;
int main() {
while (~scanf("%d %d", &n, &m)) {
for (int i = 0; i < n; i++) {
scanf("%d", &st[i].a);
st[i].xu = i + 1;
}
while (n > 1) {
x = st[0];
if (x.a - m > 0) {
x.a = x.a - m;
for (int i = 0; i < n - 1; i++) st[i] = st[i + 1];
st[n - 1] = x;
} else {
for (int i = 0; i < n - 1; i++) st[i] = st[i + 1];
n--;
}
}
printf("%d\n", st[n - 1].xu);
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b;
cin >> n >> b;
int Arr[n];
int i = 0;
int result = b;
while (i < n) {
cin >> Arr[i++];
int j = i - 1;
for (; j >= 0; j--) {
if ((Arr[i - 1] <= Arr[j])) continue;
int temp = (b / Arr[j]) * Arr[i - 1] + b % (Arr[j]);
if (temp > result) result = temp;
}
}
cout << result << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000;
int n, m;
long long a[200100];
long long fibo[200100];
int main() {
fibo[0] = fibo[1] = 1;
for (int i = 2; i < 200100; i++) {
fibo[i] = (fibo[i - 2] + fibo[i - 1]) % mod;
}
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld", a + i);
}
for (int ttt = 1; ttt <= m; ttt++) {
int type;
scanf("%d", &type);
if (type == 1) {
int x, v;
scanf("%d %d", &x, &v);
a[x] = v;
} else if (type == 2) {
int l, r;
scanf("%d %d", &l, &r);
long long ans = 0;
for (int i = l; i <= r; i++) {
ans = (ans + fibo[i - l] * a[i] % mod) % mod;
}
printf("%lld\n", ans);
}
}
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const long long MAX = 2e9 + 7;
const long long mod = 1e9 + 7;
const long long maxn = 2e5 + 7;
long long n, a, b;
struct node {
long long hp, dmg, x, v;
} s[maxn];
bool cmp(node a, node b) { return a.x > b.x; }
int main() {
long long cnt = 1;
long long sum = 0, id = 0;
scanf("%lld%lld%lld", &n, &a, &b);
while (a--) cnt *= 2;
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &s[i].hp, &s[i].dmg);
s[i].x = max(0ll, s[i].hp - s[i].dmg);
s[i].v = s[i].hp * cnt - s[i].dmg;
sum += s[i].dmg;
}
sort(s + 1, s + 1 + n, cmp);
b = min(b, n);
cnt = 0;
long long ans = 0;
if (b > 0) {
for (int i = 1; i <= b; i++) cnt += s[i].x;
for (int i = 1; i <= b; i++) ans = max(ans, cnt - s[i].x + s[i].v);
for (int i = b + 1; i <= n; i++) ans = max(ans, cnt - s[b].x + s[i].v);
}
printf("%lld\n", sum + ans);
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int calch(long long int h, long long int x, long long int y,
long long int t, long long int m) {
for (long long int i = 1; i <= t; i++) {
h = ((h * x) + y) % m;
}
return h;
}
long long int calct(long long int h, long long int x, long long int y,
long long int a, long long int m) {
for (long long int i = 1; i <= m; i++) {
h = ((h * x) + y) % m;
if (h == a) return i;
}
return -1;
}
int main() {
long long int m, h1, a1, x1, y1, h2, a2, x2, y2;
cin >> m >> h1 >> a1 >> x1 >> y1 >> h2 >> a2 >> x2 >> y2;
long long int q, c, h2q, d, e;
q = calct(h1, x1, y1, a1, m);
if (q == -1) {
cout << -1 << endl;
return 0;
}
h2q = calch(h2, x2, y2, q, m);
if (h2q == a2) {
cout << q << endl;
return 0;
}
c = calct(a1, x1, y1, a1, m);
if (c == -1) {
cout << -1 << endl;
return 0;
}
d = calct(h2q, x2, y2, a2, m);
e = calct(a2, x2, y2, a2, m);
if (d == -1 || (e == -1 && d % c != 0)) {
cout << -1 << endl;
return 0;
}
for (long long int i = 1; i <= m; ++i) {
long long int t = c * i;
if ((t - d) % e == 0 && (t - d) >= 0) {
cout << q + t << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
struct data {
int num;
int init;
};
bool byNum(const data &left, const data &right) { return left.num > right.num; }
bool descend(const int &left, const int &right) { return left > right; }
data total[105];
pair<int, int> pile[105];
int sisa[105], card[105];
int main(void) {
int temp, n, i, j;
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &card[i]);
sisa[i] = 0;
for (j = 0; j <= card[i] / 2 - 1; j++) {
scanf("%d", &temp);
pile[i].first += temp;
}
if (card[i] % 2) {
scanf("%d", &temp);
sisa[i] = temp;
}
for (j = 0; j <= card[i] / 2 - 1; j++) {
scanf("%d", &temp);
pile[i].second += temp;
}
total[i].num = pile[i].first + sisa[i] + pile[i].second;
total[i].init = i;
}
sort(total, total + n, byNum);
sort(sisa, sisa + n, descend);
long long a = 0, b = 0;
for (i = 0; i <= n - 1; i++) {
a += pile[total[i].init].first;
b += pile[total[i].init].second;
}
for (i = 0; i <= n - 1; i++) {
if (i % 2)
b += sisa[i];
else
a += sisa[i];
if (!sisa[i]) break;
}
cout << a << " " << b << endl;
return 0;
}
| 9 | CPP |
for _ in range(int(input())):
n = int(input())
l = list(map(int, input().split()))
result = 0
for i in range(2, 101):
c = 0
lst = [0 for i in range(n)]
for j in range(n):
if lst[j]:
continue
for k in range(n):
if k == j:
continue
if not lst[k] and not lst[j]:
if l[j] + l[k] == i:
c += 1
lst[j], lst[k] = 1, 1
break
lst[j] = 1
result = max(result, c)
print(result)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3fffffff;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
int n;
int a[100];
bool vis[700][700];
struct node {
int x, y, d, step, level;
node(){};
node(int x, int y, int step, int d, int level)
: x(x), y(y), step(step), d(d), level(level){};
bool operator<(const node &ot) const {
if (x != ot.x) return x < ot.x;
if (y != ot.y) return y < ot.y;
if (step != ot.step) return step < ot.step;
if (d != ot.d) return d < ot.d;
return level < ot.level;
}
};
queue<node> q;
set<node> s;
int ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
node t = node(0, 0, 0, 0, 0);
t.x = 0, t.y = 0, t.d = 0, t.step = a[1], t.level = 1;
s.insert(t);
vis[0 + 500][0 + 500] = 1;
q.push(t);
while (!q.empty()) {
t = q.front();
q.pop();
if (t.step > 1) {
int d = t.d;
t.x += dx[d], t.y += dy[d], vis[t.x + 500][t.y + 500] = 1, t.step--;
if (s.count(t)) continue;
q.push(t);
s.insert(t);
} else {
int d = (t.d - 1 >= 0) ? (t.d - 1) : 7,
d2 = (t.d + 1 <= 7) ? (t.d + 1) : 0;
int level = t.level + 1;
if (level > n) continue;
t.d = d, t.x += dx[d], t.y += dy[d], vis[t.x + 500][t.y + 500] = 1,
t.step = a[level], t.level = level;
if (s.count(t) == 0) {
q.push(t);
s.insert(t);
}
t.d = d2, t.x += dx[d2] - dx[d], t.y += dy[d2] - dy[d],
vis[t.x + 500][t.y + 500] = 1, t.step = a[level], t.level = level;
if (s.count(t) == 0) {
q.push(t);
s.insert(t);
}
}
}
ans = 0;
for (int i = -150; i <= 150; i++)
for (int j = -150; j <= 150; j++)
if (vis[i + 500][j + 500]) ans++;
cout << ans << endl;
return 0;
}
| 10 | CPP |
n, k = map(int, input().split())
array = []
for i in range(n):
array.append(int(input()))
nabor = (n // 2 if n % 2 == 0 else n // 2 + 1)
array = sorted(array)
lenght = len(array)
nab = nabor
delet = 1
digit = [0] * k
counter = 0
for i in range(k):
for j in range(len(array)):
if array[j] == i+1:
digit[i] += 1
for i in range(k):
counter += digit[i] // 2
if nabor > counter:
print(counter * 2 + nabor - counter)
exit()
if nabor == counter:
print(counter * 2)
exit()
if nabor < counter:
print(counter * 2)
exit()
| 7 | PYTHON3 |
a,b=map(int,input().split())
c=list(range(1,b+1))
for i in range(a):
d,e=map(int,input().split())
for i in range(d,e+1):
if i in c:
c.remove(i)
print(len(c))
for i in c:
print(i,end=' ') | 7 | PYTHON3 |
#include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int main(){
int n,m,mi,mih,mit;
while(cin >> n >> m && n && m){
vector<int> taro(n);
vector<int> hanako(m);
int t=0,h=0;
for(int i=0;i<n;i++){
cin >> taro[i];
t+=taro[i];
}
for(int i=0;i<m;i++){
cin >> hanako[i];
h+=hanako[i];
}
mi = (1<<21);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if( t - taro[i] + hanako[j] == h - hanako[j] + taro[i] ){
if(taro[i]+hanako[j]<mi){
mi = taro[i]+hanako[j];
mit = taro[i];
mih = hanako[j];
}
}
}
}
if(mi == 1<<21)cout << -1 << endl;
else cout << mit << " " << mih << endl;
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long t, n, a[100011], sum[100011], ans;
map<long long, long long> mp;
signed main() {
scanf("%lld", &t);
while (t--) {
mp.clear();
scanf("%lld", &n);
memset(a, 0, sizeof a);
memset(sum, 0, sizeof sum);
ans = 0;
for (register long long i = 1; i <= n; ++i) {
a[i] = getchar() - '0';
while (a[i] < 0 || a[i] > 9) a[i] = getchar() - '0';
a[i] = (a[i]) ? a[i] - 1 : -1;
sum[i] = sum[i - 1] + a[i];
}
mp[0] = 1;
for (register long long i = 1; i <= n; ++i) {
ans += mp[sum[i]];
++mp[sum[i]];
}
printf("%lld\n", ans);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isInner[200600];
long long h[200600], n;
vector<long long> gr[200600];
void fillInnerDfs(long long v, long long p) {
for (long long u : gr[v])
if (u != p) {
fillInnerDfs(u, v);
isInner[v] |= isInner[u];
}
}
void clearH() {
for (long long i = 0; i < 200600; i++) h[i] = 0;
h[0] = -1;
}
void fillHDfs(long long v, long long p) {
h[v] = h[p] + 1;
for (long long u : gr[v])
if (u != p) {
fillHDfs(u, v);
}
}
long long getMaxArgH() {
long long ans = 0;
for (long long i = 0; i < 200600; i++)
if (h[i] > h[ans] && isInner[i]) {
ans = i;
}
return ans;
}
long long getSizeInner() {
long long ans = 0;
for (long long i = 1; i <= n; i++)
if (isInner[i]) ans++;
return ans;
}
int main() {
long long m;
cin >> n >> m;
long long u, v;
for (long long i = 0; i < n - 1; i++) {
cin >> u >> v;
gr[u].push_back(v);
gr[v].push_back(u);
}
for (long long i = 0; i < m; i++) {
cin >> u;
isInner[u] = true;
}
fillInnerDfs(u, 0);
long long sz = getSizeInner();
long long start = u;
vector<long long> acc;
fillHDfs(start, 0);
start = getMaxArgH();
acc.push_back(start);
clearH();
fillHDfs(start, 0);
start = getMaxArgH();
acc.push_back(start);
clearH();
fillHDfs(start, 0);
start = getMaxArgH();
acc.push_back(start);
sort(acc.begin(), acc.end());
start = acc[0];
clearH();
fillHDfs(start, 0);
long long argMax = getMaxArgH();
long long l = h[argMax];
long long ans = 2 * (sz - 1) - l;
cout << start << "\n" << ans;
return 0;
}
| 10 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.