solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a, b;
int main() {
cin >> n;
a.resize(n), b.resize(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long san = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
if (b[i] != 1 && b[i] <= a[i] * 2) {
san += 1LL * (b[i] / 2) * (b[i] - (b[i] / 2));
} else
san--;
}
cout << san;
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
const double EPS = 1e-12;
const double PI = acos(0) * 2;
char s[N][N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
int cnt = 0;
for (int k = 0; k < 4; ++k) cnt += (s[i + dx[k]][j + dy[k]] == 'o');
if (cnt & 1) {
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
| 1,000 | CPP |
m, n = input().split(' ')
m = int(m)
n = int(n)
x = m*n
if x % 2 == 0:
answer = x/2
else:
answer = (x-1)/2
print(int(answer))
| 800 | PYTHON3 |
from collections import Counter
n=int(input())
sentence = input()
t1=Counter(list(sentence))['A']
t2=Counter(list(sentence))['D']
if t1>t2:
print('Anton')
elif t2>t1:
print('Danik')
elif t1==t2:
print('Friendship') | 800 | PYTHON3 |
knw = list(map(int,input().split()))
costo = (knw[2]*(knw[2]+1)//2)*knw[0]
prestamo = knw[1] - costo
if prestamo < 0:
print(abs(prestamo))
else:
print(0)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[22];
int n, a[111111];
bool used[3333333];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
for (int j = 0; j < 20; ++j)
if (a[i] & (1 << j)) v[j].push_back(i);
}
for (int i = 0; i < n; ++i) {
int x = a[i], k = i;
while (k >= 0) {
used[x] = true;
int p = -1;
for (int j = 0; j < 20; ++j)
if (!(x & (1 << j))) {
int l = lower_bound(v[j].begin(), v[j].end(), k) - v[j].begin() - 1;
if (l >= 0) {
p = max(p, v[j][l]);
}
}
if (p >= 0) x |= a[p];
k = p;
}
}
int res = 0;
for (int i = 0; i < 3000000; ++i) {
res += used[i];
}
cout << res << endl;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool solve() {
int n;
cin >> n;
vector<int> a(1 << (n + 1));
vector<int> s(1 << (n + 1));
for (int i = 2; i < (1 << (n + 1)); ++i) cin >> a[i];
long long res = 0;
for (int i = (1 << n) - 1; i >= 1; --i) {
s[i] = max(a[i * 2] + s[i * 2], a[i * 2 + 1] + s[i * 2 + 1]);
res += max(a[i * 2] + s[i * 2], a[i * 2 + 1] + s[i * 2 + 1]) -
min(a[i * 2] + s[i * 2], a[i * 2 + 1] + s[i * 2 + 1]);
}
cout << res << endl;
return false;
}
int main() {
while (solve())
;
return 0;
}
| 1,400 | CPP |
a = input()
b = input()
a1 = 0
b1 = 0
c = 0
c1 = 0
a1 = a.replace("0", '')
b1 = b.replace("0", '')
c = int(a) + int(b)
c1 = str(c).replace("0", "")
if (int(a1) + int(b1)) == int(c1):
print('YES')
else:
print("NO")
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T t) {
return t < 0 ? -t : t;
}
const long long modn = 1000000007;
inline long long mod(long long x) { return x % modn; }
int main() {
long long d1, d2, d3;
cin >> d1 >> d2 >> d3;
long long ans = min(d1 + d2 + d3, d1 * 2 + d2 * 2);
ans = min(ans, min(d1 * 2 + d3 * 2, d2 * 2 + d3 * 2));
cout << ans << '\n';
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
set<int> s, s1;
map<int, int> m, m1;
set<int>::iterator iter;
int main() {
int i, k = 0, n;
int j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
if (m[j] > 0) {
while (m[j] > 0) {
s.erase(j);
m[j]--;
j++;
}
}
s.insert(j);
m[j]++;
}
iter = s.end();
iter--;
j = (*iter);
cout << (int)(1 + j - s.size());
return 0;
}
| 1,600 | CPP |
n,m,a = map(int,input().split())
num_required1 = -n//a
num_required2 = -m//a
print(num_required1 * num_required2)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string m[200050];
map<string, bool> u;
int main() {
int q, n, i;
scanf("%i", &q);
n = q;
while (q--) cin >> m[q];
for (i = 0; i < n; i++)
if (!u[m[i]]) cout << m[i] << "\n", u[m[i]] = true;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<vector<int> > par;
vector<int> dep;
int LCA(int a, int b) {
if (dep[a] < dep[b]) swap(a, b);
int diff = dep[a] - dep[b];
for (int i = 0; i < 20; i++) {
if (diff & (1 << i)) a = par[i][a];
}
if (a == b) return a;
for (int i = 20; i--;) {
if (par[i][a] != par[i][b]) {
a = par[i][a];
b = par[i][b];
}
}
return par[0][a];
}
int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[LCA(u, v)]; }
int main() {
scanf("%d", &N);
par = vector<vector<int> >(20, vector<int>(N, -1));
dep = vector<int>(N, 0);
int X = 0;
int Y = 0;
for (int i = 1; i < N; i++) {
int p;
scanf("%d", &p);
p--;
par[0][i] = p;
for (int j = 1; j < 20; j++) {
int t = par[j - 1][i];
if (t == -1) break;
par[j][i] = par[j - 1][t];
}
dep[i] = dep[p] + 1;
if (dist(X, Y) < dist(i, Y) && dist(X, i) < dist(i, Y)) {
X = i;
} else if (dist(X, Y) < dist(X, i)) {
Y = i;
}
printf("%d\n", dist(X, Y));
}
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-') neg = true, t = getchar();
if (t == EOF) return false;
for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
if (neg) x = -x;
return true;
}
template <typename T>
void print_int(T x) {
if (x < 0) putchar('-'), x = -x;
short a[20] = {}, sz = 0;
while (x > 0) a[sz++] = x % 10, x /= 10;
if (sz == 0) putchar('0');
for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
int qpow(int x, int y, int p) {
int ret = 1;
while (y) {
if (y & 1) ret = (long long)ret * x % p;
x = (long long)x * x % p;
y >>= 1;
}
return ret;
}
int chk[5555], d, p, tot;
void add(int a, int b, int c) { printf("+ %d %d %d\n", a, b, c); }
void yjzakioi2019(int a, int b) { printf("^ %d %d\n", a, b); }
void addto(int s, int k, int t) {
if (k < 0) k += p;
if (k >= p) k -= p;
while (k) {
if (k & 1) add(s, t, t);
k >>= 1;
if (k) add(s, s, s);
}
}
void mult(int s, int k, int t) {
add(s, s, t);
addto(s, k - 2, t);
}
int a[12][12], b[12][12], c[12][12];
void gauss(int n) {
for (int i = 0; i < n; i++) {
if (!a[i][i]) {
for (int j = i + 1; j < n; j++)
if (a[j][i]) {
for (int k = 0; k < n; k++) swap(a[i][k], a[j][k]);
for (int k = 0; k < n; k++) swap(b[i][k], b[j][k]);
break;
}
}
if (!a[i][i]) puts("baojing");
int rv = qpow(a[i][i], p - 2, p);
for (int j = 0; j < n; j++) a[i][j] = (long long)a[i][j] * rv % p;
for (int j = 0; j < n; j++) b[i][j] = (long long)b[i][j] * rv % p;
for (int j = 0; j < n; j++)
if (i != j) {
int coef = (p - a[j][i]) % p;
for (int k = 0; k < n; k++)
a[j][k] = (a[j][k] + (long long)a[i][k] * coef) % p;
for (int k = 0; k < n; k++)
b[j][k] = (b[j][k] + (long long)b[i][k] * coef) % p;
}
}
}
int one = 4, tmp = 5;
void getsqr(int s, int t) {
yjzakioi2019(s, tmp);
mult(tmp, b[2][0], t);
for (int i = 1; i <= d; i++) {
add(s, one, s);
yjzakioi2019(s, tmp);
addto(tmp, b[2][i], t);
}
}
int main() {
(get_int(d) && get_int(p));
for (int i = 0; i <= d; i++) {
c[i][0] = 1;
for (int j = 1; j <= i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % p;
}
for (int i = 0; i <= d; i++) {
int prod = 1;
for (int j = d; j >= 0; j--) {
a[i][j] = (long long)c[d][j] * prod % p;
prod = (long long)prod * i % p;
}
b[i][i] = 1;
}
gauss(d + 1);
add(1, 2, 3);
getsqr(1, 5000);
getsqr(2, 4999);
getsqr(3, 4998);
addto(5000, -1, 4998);
addto(4999, -1, 4998);
mult(4998, (p + 1) / 2, 4997);
puts("f 4997");
return 0;
}
| 3,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() {
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2)
? EOF
: *p1++;
}
inline int read() {
register int f = 0;
register char c;
while (!isdigit(c = getChar())) {
}
do f = f * 10 + (c ^ 48);
while (isdigit(c = getChar()));
return f;
}
const int N = 100003;
int a[N];
int main() {
int n = read(), i, minVal = 50, cnt = 0;
for (i = 1; i <= n; ++i) a[i] = read(), minVal = min(minVal, a[i]);
for (i = 1; i <= n; ++i) cnt += a[i] == minVal;
printf(cnt <= n >> 1 ? "Alice" : "Bob");
return 0;
}
| 2,000 | CPP |
n = int(input());
s = n%5;
ans = n//5
if(s != 0):
ans = ans + 1
print(ans); | 800 | PYTHON3 |
s = list(input())
f = False
for i in range(len(s)):
if s[i] != "a":
s[i] = chr(ord(s[i]) - 1)
f = True
else:
if f:
break
elif i == len(s) - 1:
s[i] = "z"
print("".join(s))
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxpq = priority_queue<T>;
inline long long CC(long long n, long long y) {
return (((n) + (y - 1) - 1) / (y - 1)) - (((n) + (y)-1) / (y));
}
inline long long FF(long long n, long long y) { return n / y - n / (y + 1); }
inline long long __gcd(long long a, long long b) {
return !b ? a : __gcd(b, a % b);
}
inline int add(int a, int b, int p = 1000000007) {
int c = a + b;
if (c >= p) c -= p;
return c;
}
inline int sub(int a, int b, int p = 1000000007) {
int c = a - b;
if (c < 0) c += p;
return c;
}
inline int mul(int a, int b, int p = 1000000007) { return (a * 1ll * b) % p; }
int adj[55][55];
int dp[55][55];
int mask0[55][55], mask1[55][55];
string s, t;
int n, m;
const int inf = 1e9;
inline int d(char c) { return c - 'a'; }
inline bool bit(int i, int b) { return i & (1 << b); }
void solve(int mask[55][55], string s) {
int n = s.size();
for (int i = (n - 1); i > (-1); i--) {
for (int j = (i); j < (n); j++) {
if (i == j) {
mask[i][j] = 1 << d(s[i]);
42;
} else {
for (int t = (i); t < (j); t++) {
for (int b1 = (0); b1 < (26); b1++) {
if (!bit(mask[i][t], b1)) continue;
for (int b2 = (0); b2 < (26); b2++) {
if (!bit(mask[t + 1][j], b2)) continue;
mask[i][j] |= adj[b1][b2];
}
}
}
}
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
clock_t clk = clock();
cerr << "I will return...\n";
cin >> s >> t;
n = s.size(), m = t.size();
int k;
cin >> k;
for (int i = (0); i < (k); i++) {
string s;
cin >> s;
adj[d(s[3])][d(s[4])] |= 1 << d(s[0]);
}
solve(mask0, s);
solve(mask1, t);
for (int i = (0); i < (n + 1); i++) {
for (int j = (0); j < (m + 1); j++) {
dp[i][j] = inf;
if (i == 0 && j == 0) dp[i][j] = 0;
for (int k = (0); k < (i); k++) {
for (int l = (0); l < (j); l++) {
42;
if (mask0[k][i - 1] & mask1[l][j - 1]) {
dp[i][j] = min(dp[i][j], dp[k][l] + 1);
42;
}
}
}
42;
}
}
cout << (dp[n][m] == inf ? -1 : dp[n][m]) << '\n';
cerr << "...don't you ever hang your head.\n";
cerr << "Time (in ms): " << double(clock() - clk) * 1000.0 / CLOCKS_PER_SEC
<< '\n';
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int n;
cin >> n;
while (n--) {
int b, k;
cin >> b;
if (b % 4 == 0)
k = b / 4;
else if (b % 4 == 1) {
if (b / 4 >= 2)
k = b / 4 - 1;
else
k = -1;
} else if (b % 4 == 2) {
if (b / 4 >= 1)
k = b / 4;
else
k = -1;
} else if (b % 4 == 3) {
if (b / 4 >= 3)
k = b / 4 - 1;
else
k = -1;
}
cout << k << endl;
}
return 0;
}
| 1,300 | CPP |
T = int(input())
while T > 0:
T -= 1
n, k = map(int, input().split())
s = input()
length = n / k
ans = 0
halfk = k // 2 if k % 2 == 0 else k // 2 + 1
for i in range(halfk):
d = {}
for ch in s[i::k]:
ch = ord(ch)
if ch in d:
d[ch] += 1
else:
d[ch] = 1
if i * 2 + 1 != k:
for ch in s[k - 1 - i::k]:
ch = ord(ch)
if ch in d:
d[ch] += 1
else:
d[ch] = 1
if i * 2 + 1 != k:
ans += max(d.values())
else:
ans += max(d.values())
print(n - ans)
| 1,500 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,k = LI()
t = [0] * n
t[0] = 1
for _ in range(k):
u = [0] * n
for i in range(n):
b = t[i] % mod
for j in range(i,n,i+1):
u[j] += b
t = u
return sum(t) % mod
print(main())
| 1,400 | PYTHON3 |
"""
βββ βββββββ βββ βββββββ βββββββ βββ ββββββ
βββββββββββββββ βββββββββββββββββββββββββββββ
ββββββ ββββββ ββββββββββββββββββββββββββββ
ββββββ ββββββ βββββββ βββββββββ βββ βββββββ
βββββββββββββββ βββββββββββββββββ βββ βββββββ
βββ βββββββ βββ ββββββββ βββββββ βββ ββββββ
"""
__author__ = "Dilshod"
n = int(input())
for i in range(n):
s, a, b, c = map(int, input().split())
cnt = s // c
cnt += (cnt // a) * b
print(cnt)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int SIZE = 1 << 21 | 1;
char ibuf[SIZE], *iS, *iT, c;
template <class I>
inline void gi(I &x) {
for (c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
(iS == iT ? EOF : *iS++))
: *iS++);
c < '0' || c > '9';
c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
(iS == iT ? EOF : *iS++))
: *iS++))
;
for (x = 0; c <= '9' && c >= '0';
c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
(iS == iT ? EOF : *iS++))
: *iS++))
x = x * 10 + (c & 15);
}
} // namespace io
using io ::gi;
const int MaxN(200003);
const int Mod(1e9 + 7);
bool p[MaxN], Vis[MaxN];
int K, root, n, cnt, ans, Index;
int Deep[MaxN], h[MaxN], Size[MaxN];
int a[MaxN], Pr[MaxN], phi[MaxN], s[MaxN];
int dfn[MaxN], mu[MaxN], F[MaxN], fa[21][MaxN];
vector<int> G[MaxN], nG[MaxN];
inline void upd(int &x, int y) { (x += y) >= Mod ? x -= Mod : x; }
inline void add(int u, int v) {
nG[u].push_back(v);
nG[v].push_back(u);
}
int fexp(int x, int k) {
int res = 1;
for (; k; k >>= 1, x = (unsigned long long)x * x % Mod)
if (k & 1) res = (unsigned long long)res * x % Mod;
return res;
}
void getprime(int n) {
mu[1] = phi[1] = 1;
for (int i = 2, tot = 0; i <= n; i++) {
if (!p[i]) {
Pr[++tot] = i;
phi[i] = i - 1, mu[i] = Mod - 1;
}
for (int j = 1; j <= tot && Pr[j] * i <= n; j++) {
p[Pr[j] * i] = 1;
if (i % Pr[j]) {
phi[i * Pr[j]] = phi[i] * phi[Pr[j]];
mu[i * Pr[j]] = Mod - mu[i];
} else {
phi[i * Pr[j]] = phi[i] * Pr[j];
break;
}
}
}
}
void dfs(int u) {
dfn[u] = ++Index;
Deep[u] = Deep[fa[0][u]] + 1;
for (auto v : G[u])
if (v != fa[0][u]) fa[0][v] = u, dfs(v);
}
void Init() {
dfs(1);
for (int j = 1; (1 << j) <= n; j++)
for (int i = 1; i <= n; i++) fa[j][i] = fa[j - 1][fa[j - 1][i]];
}
int lca(int u, int v) {
if (Deep[u] < Deep[v]) swap(u, v);
for (int j = 19; ~j; j--)
if (Deep[fa[j][u]] >= Deep[v]) u = fa[j][u];
if (u == v) return u;
for (int j = 19; ~j; j--)
if (fa[j][u] ^ fa[j][v]) u = fa[j][u], v = fa[j][v];
return fa[0][u];
}
void Build() {
int top;
static int S[MaxN];
sort(h + 1, h + 1 + K, [](int x, int y) { return dfn[x] < dfn[y]; });
S[top = 1] = h[1];
for (int i = 2; i <= K; i++) {
int f = lca(h[i], S[top]);
while (top > 1 && dfn[f] <= dfn[S[top - 1]]) add(S[top], S[top - 1]), --top;
if (f != S[top]) add(f, S[top]), S[top] = f;
S[++top] = h[i];
}
while (top > 1) add(S[top], S[top - 1]), --top;
root = S[top];
}
void dp(int u, int f) {
Size[u] = Vis[u] ? phi[a[u]] : 0;
for (auto v : nG[u])
if (v != f) {
dp(v, u);
upd(cnt, (unsigned long long)Size[u] * Size[v] % Mod * Deep[u] % Mod);
upd(Size[u], Size[v]);
}
nG[u].clear();
}
int solve(int d) {
K = 0;
for (int i = d; i <= n; i += d) Vis[h[++K] = s[i]] = true;
cnt = 0, Build(), dp(root, 0);
int res = 0, tmp = 0;
for (int i = 1; i <= K; i++) upd(res, phi[a[h[i]]]);
for (int i = 1; i <= K; i++) {
int w = phi[a[h[i]]];
upd(tmp, (unsigned long long)w * (res - w + Mod) % Mod * Deep[h[i]] % Mod);
Vis[h[i]] = false;
}
return tmp = (tmp - 2ull * cnt % Mod + Mod) % Mod;
}
int main() {
gi(n);
getprime(n);
for (int i = 1; i <= n; i++) gi(a[i]), s[a[i]] = i;
for (int i = 1, u, v; i < n; i++) {
gi(u), gi(v);
G[u].push_back(v);
G[v].push_back(u);
}
Init();
for (int i = 1; i <= n; i++) F[i] = solve(i);
for (int i = 1; i <= n; i++) {
int tmp = 0;
for (int j = 1; i * j <= n; j++)
upd(tmp, (unsigned long long)mu[j] * F[i * j] % Mod);
upd(ans, (unsigned long long)tmp * i % Mod * fexp(phi[i], Mod - 2) % Mod);
}
ans = 2ull * ans % Mod * fexp(n, Mod - 2) % Mod * fexp(n - 1, Mod - 2) % Mod;
printf("%d\n", ans);
return 0;
}
| 3,100 | CPP |
# You lost the game.
n = int(input())
L = list(map(int, input().split()))
L.sort()
r = 0
t = 0
for i in range(n):
if L[i] >= t:
r += 1
t += L[i]
print(r)
| 1,300 | PYTHON3 |
n = int(input())
a = sorted(map(int, input().split()))
cost = 0
for i in range(1, n):
if a[i-1] >= a[i]:
cost += a[i-1] - a[i] + 1
a[i] = a[i-1] +1
print(cost) | 1,200 | PYTHON3 |
n=int(input())
y=0
x=0
for i in range(n):
a,b=input().split()
a=int(a)
b=int(b)
x+=b-a
if x>y:
y=x
print(y) | 800 | PYTHON3 |
t=int(input())
for i in range(t):
a,b=map(int,input().split())
if(a%b==0):
print('0')
else:
x=a%b
print(b-x)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1ll * inf * inf;
const int N = 200000 + 7;
const int M = 31;
const int multipleTest = 0;
int n, m;
vector<int> a[N];
int r[N];
int get(int u) { return r[u] < 0 ? u : r[u] = get(r[u]); }
void uni(int u, int v) {
if (u == v) return;
if (r[u] > r[v]) swap(u, v);
if (v > m) swap(u, v);
r[u] += r[v];
r[v] = u;
}
vector<int> adj[N];
vector<int> rev[N];
int cnt[N];
int state[N];
void dfs(int u) {
state[u] = 2;
for (int v : adj[u]) {
if (state[v] == 0) {
rev[v].push_back(u);
cnt[u]++;
dfs(v);
} else {
if (state[v] == 2) {
puts("No");
exit(0);
} else {
rev[v].push_back(u);
cnt[u]++;
}
}
}
state[u] = 1;
}
int st[N], top;
int inv[N];
void solve() {
cin >> n >> m;
for (int i = (0), _b = (n); i < _b; ++i) {
int k;
scanf("%d", &k);
a[i].resize(k);
for (int j = (0), _b = (k); j < _b; ++j) scanf("%d", &a[i][j]);
}
for (int i = (1), _b = (m + 5); i < _b; ++i) r[i] = -1;
vector<pair<int, int> > ls;
for (int i = n - 2; i >= 0; --i) {
bool diff = false;
for (int j = (0), _b = (min(a[i].size(), a[i + 1].size())); j < _b; ++j) {
if (a[i][j] == a[i + 1][j]) continue;
int u = a[i][j], v = a[i + 1][j];
ls.push_back(make_pair(u, v));
adj[u].push_back(v);
diff = true;
break;
}
if (!diff && a[i].size() > a[i + 1].size()) {
puts("No");
return;
}
}
for (int j = (1), _b = (m + 1); j < _b; ++j)
if (state[j] == 0) dfs(j);
for (int j = (1), _b = (m + 1); j < _b; ++j)
if (cnt[j] == 0) st[top++] = j;
for (int j = 0; j < top; ++j) {
int v = st[j];
bool ok = true;
for (int u : adj[v]) {
if (inv[u])
ok &= false;
else {
if (v < u)
ok &= true;
else
ok &= false;
}
}
if (!ok) {
int cost = v - m;
for (int u : adj[v]) {
if (inv[u]) {
if (cost > u - m) {
puts("No");
return;
}
} else {
if (cost > u) {
puts("No");
return;
}
}
}
}
inv[v] = !ok;
for (int u : rev[v]) {
--cnt[u];
if (!cnt[u]) st[top++] = u;
}
}
int res = 0;
for (int j = (1), _b = (m + 1); j < _b; ++j) res += inv[j];
puts("Yes");
cout << res << '\n';
for (int j = (1), _b = (m + 1); j < _b; ++j)
if (inv[j]) printf("%d ", j);
}
int main() {
int Test = 1;
if (multipleTest) {
cin >> Test;
}
for (int i = 0; i < Test; ++i) {
solve();
}
}
| 2,100 | CPP |
from sys import stdin, stdout
ip = lambda : stdin.readline().rstrip("\r\n")
ips = lambda : ip().split()
out = lambda x, end='\n': stdout.write(f"{x}{end}")
for _ in range(int(ip())):
n = int(ip())
if n == 1:
out('()')
continue
for i in range(n-2):
for j in range(i):
out('()','')
out('(','')
for k in range(n-i-1, 0, -1):
out('()','')
out(')')
for i in range(n):
out('()','')
out('')
for i in range(n):
out('(','')
for i in range(n):
out(')','')
out('') | 800 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t-- !=0){
int n;
cin>>n;
int z=0;
long long int h=0;
for(int i=0;i<n;i++){
long long int x;
cin>>x;
h+=x;
if(((i*(i+1))/2)<=h){
}
else{
z++;
}
}
if(z==0){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
}
} | 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 510;
struct zy {
int s, i;
} a[N];
struct yz {
int x, y;
} an[N];
int bz[N], z[N];
int n, l, r, mid, i, q, t;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while ('0' <= c && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x;
}
inline int cmp(zy x, zy y) { return x.s < y.s; }
inline void ask(int x) {
printf("1\n");
printf("1\n");
printf("%d\n", n - 1);
for (int i = 2; i <= n; ++i) printf("%d ", i);
printf("\n");
printf("%d\n", x);
fflush(stdout);
}
inline int find(int x, int y) {
int t = 0, i, ss;
for (i = 1; i <= x; ++i)
if (!bz[i]) z[++t] = a[i].i;
if (!t) return 0;
printf("1\n");
printf("1\n");
printf("%d\n", t);
for (i = 1; i <= t; ++i) printf("%d ", z[i]);
printf("\n");
printf("%d\n", y);
fflush(stdout);
ss = read();
return ss;
}
int main() {
n = read();
t = 0;
if (n == 2) {
printf("ANSWER\n");
printf("1 2");
fflush(stdout);
return 0;
}
a[1].s = n;
a[1].i = 1;
for (i = 2; i <= n; ++i) ask(i), a[i].s = read(), a[i].i = i;
sort(a + 1, a + n + 1, cmp);
for (i = 1; i < n; ++i) {
while (1) {
l = 1;
r = i - 1;
q = 0;
while (l <= r) {
mid = (l + r) >> 1;
if (find(mid, a[i].i))
q = mid, r = mid - 1;
else
l = mid + 1;
}
if (!q) break;
t++;
an[t].x = a[q].i;
an[t].y = a[i].i;
bz[q] = 1;
}
}
for (i = 1; i < n; ++i)
if (!bz[i]) an[++t].x = a[i].i, an[t].y = 1;
printf("ANSWER\n");
for (i = 1; i <= t; ++i) printf("%d %d\n", an[i].x, an[i].y);
fflush(stdout);
return 0;
}
| 3,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int INF = 0x3f3f3f3f;
int INF2 = 0x7fffffff;
long long LNF = 0x3f3f3f3f3f3f3f3f;
long long LNF2 = 0x7fffffffffffffff;
long long n, k, M, D;
long long ans;
int main() {
scanf("%I64d%I64d%I64d%I64d", &n, &k, &M, &D);
for (int i = (1); i <= (D); ++i) {
if (i * k - k + 1 > n) break;
long long c = n / (i * k - k + 1);
c = min(c, M);
ans = max(ans, c * i);
}
printf("%I64d", ans);
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = LONG_LONG_MAX >> 1;
const long long int NINF = LONG_LONG_MIN / 2;
const long long int N = 100009;
long long int d[N];
bool vis[N];
set<long long int> adj[N];
long long int dist(long long int u, long long int v) {
bool found = false;
queue<long long int> q;
q.push(u);
vis[u] = true;
set<long long int> s;
s.insert(u);
d[u] = 0;
while (!q.empty()) {
long long int y = q.front();
q.pop();
for (long long int x : adj[y]) {
if (!vis[x]) {
vis[x] = true;
q.push(x);
d[x] = d[y] + 1;
s.insert(x);
if (x == v) {
found = true;
break;
}
}
}
}
for (long long int x : s) vis[x] = false;
if (found)
return d[v];
else
return INF;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int n;
cin >> n;
long long int a[n];
for (long long int& x : a) cin >> x;
long long int len = 1;
set<long long int> used;
for (long long int i = 0; i < 64; i++) {
vector<long long int> cluster;
for (long long int j = 0; j < n; j++) {
if ((a[j] & (1ll << i)) != 0) {
cluster.push_back(j);
}
}
if (cluster.size() >= 3) {
cout << 3 << endl;
return 0;
}
if (cluster.size() == 2) {
adj[cluster[0]].insert(cluster[1]);
adj[cluster[1]].insert(cluster[0]);
}
len++;
}
long long int ans = INF;
vector<pair<long long int, long long int> > edges;
for (long long int i = 0; i < n; i++) {
for (long long int x : adj[i]) edges.push_back({x, i});
}
for (pair<long long int, long long int> p : edges) {
long long int u = p.first;
long long int v = p.second;
adj[u].erase(v);
adj[v].erase(u);
ans = min(ans, dist(u, v) + 1);
adj[u].insert(v);
adj[v].insert(u);
}
if (ans != INF && ans >= 3) {
cout << ans << endl;
} else
cout << -1 << endl;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int len, ans;
struct node {
int x;
int d;
} num[100005];
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &num[i].x);
num[i].d = i;
}
sort(num, num + n, cmp);
len = ans = 0;
m = -1;
for (int i = 0; i < n; i++) {
if (num[i].d > m) {
len++;
if (len > ans) ans = len;
m = num[i].d;
} else {
m = num[i].d;
len = 1;
}
}
printf("%d\n", n - ans);
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int tinf = (int)1e9 + 7;
const long long inf = (long long)1e18 + 7;
const int N = 1e5 + 5;
struct p {
long long first;
long long second;
long long t;
};
bool cmp(p a, p b) { return a.first < b.first; }
int main() {
{
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
long long n, T, sum = 0;
cin >> n >> T;
p a[n];
;
for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second, a[i].t = i + 1;
int Max = 0;
sort(a, a + n, cmp);
multiset<pair<long long, long long> > second, s1;
for (int i = n - 1; i >= 0; i--) {
if (sum + a[i].second <= T && second.size() < a[i].first)
second.insert({a[i].second, a[i].t}), sum += a[i].second;
else if (second.size() < a[i].first && second.size()) {
pair<long long, long long> g = *second.rbegin();
if (g.first <= a[i].second) continue;
sum -= g.first - a[i].second;
second.erase(second.find(g));
second.insert({a[i].second, a[i].t});
} else if (second.size() >= a[i].first) {
pair<long long, long long> g = *second.rbegin();
sum -= g.first, second.erase(second.find(g));
}
Max = max(Max, int(second.size()));
}
second = s1;
sum = 0;
cout << Max << endl;
for (int i = n - 1; i >= 0; i--) {
if (sum + a[i].second <= T && second.size() < a[i].first)
second.insert({a[i].second, a[i].t}), sum += a[i].second;
else if (second.size() < a[i].first && second.size()) {
pair<long long, long long> g = *second.rbegin();
if (g.first <= a[i].second) continue;
sum -= g.first - a[i].second;
second.erase(second.find(g));
second.insert({a[i].second, a[i].t});
} else if (second.size() >= a[i].first) {
pair<long long, long long> g = *second.rbegin();
sum -= g.first, second.erase(second.find(g));
}
if (second.size() == Max) {
cout << second.size() << endl;
for (auto& i : second) cout << i.second << " ";
return 0;
}
}
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int best = 0;
int n, m, k;
int a[10][100];
int b[10][100];
int c[10][100];
void trade(int from, int to) {
vector<pair<int, int> > v;
for (int i = 0; i < m; i++) {
v.push_back(make_pair(((b[to][i] - a[from][i])), (c[from][i])));
}
sort(v.begin(), v.end());
int idx = m - 1, kk = k, pf = 0;
while (idx >= 0 && v[idx].first > 0 && k > 0) {
pf += v[idx].first * min(v[idx].second, kk);
kk -= min(v[idx].second, kk);
idx--;
}
if (pf > best) best = pf;
}
int main() {
cin >> n >> m >> k;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < m; j++) cin >> a[i][j] >> b[i][j] >> c[i][j];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (i == j) continue;
trade(i, j);
}
cout << best;
return 0;
}
| 1,200 | CPP |
a,b=map(int,input().split())
l=list(map(int,input().split()))
cp=1
time=0
for i in l:
if cp<=i:
time+=i-cp
else:
time+=i+a-cp
cp=i
print(time) | 1,000 | PYTHON3 |
n = int(input())
u = list(map(int, input().split()))
d = dict()
for i in range(n):
cur = u[i] - i
if cur in d.keys():
d[cur] += u[i]
else:
d[cur] = u[i]
mx = 0
for i in d.keys():
mx = max(mx, d[i])
print(mx)
| 1,400 | PYTHON3 |
s = len(set(list(map(ord, list(input())))))
if s % 2 == 0:
print('CHAT WITH HER!')
else:
print('IGNORE HIM!')
| 800 | PYTHON3 |
// Problem: A. Dense Array
// Contest: Codeforces - Codeforces Round #702 (Div. 3)
// URL: https://codeforces.com/contest/1490/problem/A
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<int>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define all(a) (a).begin(),(a).end()
#define fi first
#define si second
#define sz(x) (ll)x.size()
#define endl "\n"
#define checkbit(n, b) ((n >> b) & 1)
#define mod 1000000007
#define inf 1000000000000000000
#define puts(n) cout<<n;
#define um unordered_map<ll,ll>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define setbits(x) __builtin_popcount(x)
#define mset(m,v) memset(m,v,sizeof(m))
#define int ll
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
using namespace std;
int power(int base, int exp);
//=======================
// USED UNORDERED_MAP????????
// INT_MAX and LONG_MAX range???
//gcd(x,y)=gcd(x-y,y)
//gcd(x,y,z...)=gcd(x,y-x,z-x,...)
void solve() {
int n;
cin>>n;
vi arr(n,0);
rep(i,0,n)
{
cin>>arr[i];
}
int cnt=0;
rep(i,0,n-1)
{
int x=max(arr[i],arr[i+1]);
int y=min(arr[i],arr[i+1]);
while(y*2<x)
{
x=(x+1)/2;
cnt++;
}
}
cout<<cnt<<endl;
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
cin >> t;
while(t--) {
solve();
}
return 0;
}
int power(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
} | 800 | CPP |
import sys
def main():
x=sys.stdin.readline().rstrip()
y=sys.stdin.readline().rstrip()
result=0
z=['a']*len(x)
for i in range(len(x)):
if x[i]<y[i]:
result=-1
break
else:
z[i]=y[i]
if result!=-1: result=''.join(z)
sys.stdout.write(str(result)+'\n')
main()
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int DEBUG = 0;
namespace defs {
template <class Type>
Type read() {
Type aa;
int bb = 1, ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
ch == '-' ? aa = 0, bb = -1 : aa = ch - '0';
while (ch = getchar(), ch >= '0' && ch <= '9') aa = aa * 10 + ch - '0';
return bb == 1 ? aa : -aa;
}
const unsigned int rand_x = 11309;
const unsigned int rand_y = 1000000019;
unsigned int rand_cur;
unsigned int rand_int() { return rand_cur = rand_cur * rand_x + rand_y; }
const int inf = 1071026353;
const int mod = 1000000007;
const int modx = 998244353;
} // namespace defs
namespace lightningwork {
int (*read)() = defs::read<int>;
bool get(int len, int &x, int &y) {
len = len * len;
for (int i = 1; i * i < len; ++i) {
int j = sqrt(len - i * i) - 1;
while (j * j + i * i < len) ++j;
if (j * j + i * i == len) {
x = i, y = j;
return 1;
}
}
return 0;
}
void work() {
int x1, x2, y1, y2;
int la = read();
int lb = read();
for (int i = 1; i < la; ++i) {
x1 = i;
y1 = sqrt(la * la - x1 * x1) - 1;
while (y1 * y1 + x1 * x1 < la * la) ++y1;
if (y1 * y1 + x1 * x1 > la * la) continue;
y2 = (-x1) * (1.0 * lb / la);
x2 = sqrt(lb * lb - y2 * y2) - 1;
while (x2 * x2 + y2 * y2 < lb * lb) ++x2;
if (x2 * x2 + y2 * y2 > lb * lb) continue;
if (x1 * x2 + y1 * y2 != 0) continue;
if (x1 == x2 || y1 == y2) continue;
puts("YES");
printf("%d %d\n", 0, 0);
printf("%d %d\n", x1, y1);
printf("%d %d\n", x2, y2);
return;
}
puts("NO");
}
} // namespace lightningwork
int main() {
if (0)
freopen(
"work"
".in",
"r", stdin),
freopen(
"work"
".out",
"w", stdout);
lightningwork::work();
if (0) fclose(stdin), fclose(stdout);
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
const long long INF = 4e18L + 1;
const int IINF = 2e9 + 1;
const int limit = 1048576;
using namespace std;
template <class TH>
void _dbg(const char* sdbg, TH h) {
cerr << sdbg << '=' << h << endl;
}
template <class TH, class... TA>
void _dbg(const char* sdbg, TH h, TA... a) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << '=' << h << ',';
_dbg(sdbg + 1, a...);
}
void pr(char c, int x) {
cout << c << " " << x << endl;
fflush(stdout);
}
vector<int> read(vector<vector<int>>& v, int x) {
pr('?', x);
int k;
cin >> k;
vector<int> ret(k);
for (auto& y : ret) {
cin >> y;
}
v[x] = ret;
return ret;
}
pair<bool, vector<int>> init(vector<vector<int>>& v) {
vector<int> path;
vector<int> nei = read(v, 1);
if ((int)((nei).size()) == 2) {
pr('!', 1);
return {1, path};
}
path.push_back(1);
while (1) {
if ((int)((v[path.back()]).size()) == 1) {
return {0, path};
}
int x = path.back();
int y;
for (auto z : v[x]) {
if ((int)((path).size()) == 1 or path[(int)((path).size()) - 2] != z) {
y = z;
break;
}
}
vector<int> nei = read(v, y);
if ((int)((nei).size()) == 2) {
pr('!', y);
return {1, path};
}
path.push_back(y);
}
}
bool find_other(vector<vector<int>>& v, vector<int>& path) {
while (1) {
if ((int)((v[path.back()]).size()) == 1) {
return 0;
}
int x = path.back();
int y;
for (auto z : v[x]) {
if (path[(int)((path).size()) - 2] != z) {
y = z;
break;
}
}
vector<int> nei = read(v, y);
if ((int)((nei).size()) == 2) {
pr('!', y);
return 1;
}
path.push_back(y);
}
}
bool cut(vector<vector<int>>& v, vector<int>& path) {
int s = (int)((path).size()) / 2 + 1;
int nope = path[s];
path.resize(s);
for (auto y : v[path.back()]) {
if (y != path[s - 2] and y != nope) {
vector<int> nei = read(v, y);
if ((int)((nei).size()) == 2) {
pr('!', y);
return 1;
}
path.push_back(y);
break;
}
}
return 0;
}
void bfs(vector<vector<int>>& v, vector<int>& path) {
vector<int> odw(129);
odw[path[(int)((path).size()) - 1]] = 1;
odw[path[(int)((path).size()) - 2]] = 1;
queue<int> q;
for (auto y : v[path.back()]) {
if (!odw[y]) {
q.push(y);
}
}
int cnt = 0;
while (1) {
cnt++;
int x = q.front();
odw[x] = 1;
q.pop();
if (cnt == 6) {
pr('!', x);
return;
}
vector<int> nei = read(v, x);
if ((int)((nei).size()) == 2) {
pr('!', x);
return;
}
for (auto y : nei) {
if (!odw[y]) {
q.push(y);
}
}
}
}
int main() {
int t;
cin >> t;
while (t--) {
int h;
cin >> h;
vector<vector<int>> v(129);
auto tmp = init(v);
if (tmp.first == 1) {
continue;
}
vector<int> path = tmp.second;
reverse((path).begin(), (path).end());
if ((int)((path).size()) == 1) {
int x = v[path[0]][0];
vector<int> nei = read(v, x);
if ((int)((nei).size()) == 2) {
pr('!', x);
continue;
}
path.push_back(x);
}
if (find_other(v, path)) {
continue;
}
if (cut(v, path)) {
continue;
}
int czy = 0;
while ((int)((path).size()) < 5) {
if (find_other(v, path) or cut(v, path)) {
czy = 1;
break;
}
}
if (czy) {
continue;
}
bfs(v, path);
}
}
| 2,800 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int IT_MAX = 1024;
const long long MOD = 1000000007;
const int INF = 1034567890;
const long long LL_INF = 3234567890123456789ll;
const double PI = acos(-1);
const long double ERR = 1E-12;
int getgr(int x) {
if (x == 0) return 0;
if (x == 1 || x == 3) return 1;
if (x == 2) return 0;
if (x % 2 == 1) return 0;
int t1 = getgr(x / 2), t2 = getgr(x - 1);
if (t1 != 0 && t2 != 0) return 0;
if (t1 != 1 && t2 != 1) return 1;
return 2;
}
int main() {
int N, K, GR = 0, t;
scanf("%d %d", &N, &K);
if (K % 2 == 0) {
while (N--) {
scanf("%d", &t);
if (t == 1)
GR ^= 1;
else if (t == 2)
GR ^= 2;
else
GR ^= (t + 1) % 2;
}
} else {
while (N--) {
scanf("%d", &t);
GR ^= getgr(t);
}
}
if (GR == 0)
printf("Nicky\n");
else
printf("Kevin\n");
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 42;
char arr[N][N];
int mxh[N][N];
int dp[N][N][N][N];
int sm[N][N][N][N];
int n, m, q;
void calc_mxh() {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (arr[i][j] == '0') {
if (i == 0) continue;
if (arr[i - 1][j] == '1')
mxh[i][j] = i;
else
mxh[i][j] = mxh[i - 1][j];
}
}
void calc_dp() {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (arr[i][j] == '0')
for (int h = 0; h < i + 1; h++) {
int sum = 0;
int up = h;
for (int k = j; k >= 0; k--) {
if (arr[i][k] == '1') up = i + 1;
up = max(mxh[i][k], up);
sum += (i - up + 1);
dp[i][j][h][k] = sum;
}
}
}
}
void calc_sm() {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
for (int h = 0; h < i + 1; h++)
for (int k = 0; k < j + 1; k++) {
sm[i][j][h][k] = dp[i][j][h][k];
if (i) sm[i][j][h][k] += sm[i - 1][j][h][k];
if (j) sm[i][j][h][k] += sm[i][j - 1][h][k];
if (i && j) sm[i][j][h][k] -= sm[i - 1][j - 1][h][k];
}
}
void pre() {
calc_mxh();
calc_dp();
calc_sm();
}
int get_ans(int x0, int y0, int x1, int y1) {
int h = x0, k = y0;
return sm[x1][y1][h][k];
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
;
cin >> n >> m >> q;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> arr[i][j];
pre();
while (q--) {
int x0, y0, x1, y1;
cin >> x0 >> y0 >> x1 >> y1;
cout << get_ans(x0 - 1, y0 - 1, x1 - 1, y1 - 1) << endl;
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, p, ma, l[1000010], f[5010][5010], fac[1000010], g[1000010],
dp[2][5010];
signed main() {
scanf("%lld%lld%lld", &n, &m, &p);
for (long long i = 1; i <= n; i++) scanf("%lld", &l[i]), ma = max(ma, l[i]);
f[1][1] = fac[0] = g[0] = dp[0][0] = 1;
for (long long i = 2; i <= ma; i++)
for (long long j = 1; j <= min(i, m); j++)
f[i][j] = (f[i - 1][j - 1] + f[i - 1][j] * (j - 1) % p) % p;
for (long long i = 1; i <= m; i++)
fac[i] = fac[i - 1] * i % p, g[i] = g[i - 1] * (m - i + 1) % p;
for (long long i = 1; i <= n; i++) {
memset(dp[i & 1], 0, sizeof(dp[i & 1]));
for (long long j = 1; j <= l[i]; j++) {
dp[i & 1][j] = f[l[i]][j] * g[j] % p * dp[(i - 1) & 1][0] % p -
f[l[i]][j] * fac[j] % p * dp[(i - 1) & 1][j] % p;
dp[i & 1][0] = (dp[i & 1][0] + dp[i & 1][j]) % p;
}
}
printf("%lld", (dp[n & 1][0] + p) % p);
return 0;
}
| 2,600 | CPP |
t=int(input())
import math
M=[]
def fonction(x,y,n):
return ((n-y)//x)*x+y
for i in range(t):
x,y,n=[int(x) for x in input().split()]
M.append(fonction(x,y,n))
for k in M:
print(k) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long cnt = 0, sm1 = 0, sm2 = 0;
for (long long i = 1; i < n / 2; i += 1) {
sm1 += (1ll << i);
}
sm1 += (1ll << n);
sm2 = (1ll << (n + 1)) - 2 - sm1;
cout << abs(sm1 - sm2) << endl;
}
return 0;
}
| 800 | CPP |
''' Ψ¨ΩΨ³ΩΩ
Ω Ψ§ΩΩΩΩΩΩ Ψ§ΩΨ±ΩΩΨΩΩ
ΩΩ°ΩΩ Ψ§ΩΨ±ΩΩΨΩΩΩ
Ω '''
#codeforces
gi = lambda : list(map(int,input().split()))
t, = gi()
for k in range(t):
n, = gi()
div = 1
sq = int(n ** .5)
for j in range(2, sq + 1):
if n % j == 0:
div = j
break
x = n // div
sq = int(x ** .5)
div2 = 1
for j in range(2, sq + 1):
if x % j == 0:
if len({div, j, x // j}) == 3:
div2 = j
break;
if div == 1 or div2 == 1:
print("NO")
else:
print("YES")
print(div, div2, x // div2) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s = "ROYGBIV";
long long int n, i;
cin >> n;
for (i = 0; i < n - 3; i++) {
cout << s[i % 4];
}
cout << "BIV";
return 0;
}
| 1,200 | CPP |
import sys
T = int(input())
for _ in range(T):
N = int(input())
a = sorted(map(int, input().split()))
M_IDX = N // 2 + (0 if N % 2 else -1)
M = a[M_IDX]
res = [M]
i = 1
while len(res) < N:
if M_IDX+i < N:
res.append(a[M_IDX+i])
if M_IDX-i >= 0:
res.append(a[M_IDX-i])
i += 1
print(*res) | 1,200 | PYTHON3 |
n,m = map(int,input().split())
a = list(map(int,input().split()))
ans=0
for i in range(m):
if min(a)<0:
ans+=-1*(min(a))
del a[a.index(min(a))]
print(ans) | 900 | PYTHON3 |
n=int(input())
a={97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122}
s={ord(x) for x in input().lower()}
if s==a:
print("YES")
else:
print("NO")
| 800 | PYTHON3 |
import math as m
for i in range ( int(input()) ):
n=int(input())
x= 0.5/(m.tan(m.pi/(2*n)))
print(2*x)
# central angle= 360/n degrees
# In this case -> 360/(2*n) degrees
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, k;
int num[100000 + 22];
bool flag;
while (~scanf("%d %d", &n, &k)) {
for (int i = 1; i <= n; i++) scanf("%d", &num[i]);
flag = true;
for (int i = k + 1; i <= n; i++) {
if (num[i] != num[k]) {
flag = false;
break;
}
}
if (!flag) {
printf("-1\n");
continue;
}
int ans;
for (ans = k - 1; ans > 0; ans--) {
if (num[ans] != num[k]) break;
}
printf("%d\n", ans);
}
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long int mod = 1e9 + 7;
const long long int inf = (long long int)1e18 + 2;
const long long int N = (long long int)2e5 + 2;
long long int power(long long int x, long long int y) {
long long int res = 1;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
void solve() {
long long int n;
cin >> n;
long long int arr[n];
for (auto& x : arr) cin >> x;
long long int dp[2][n];
stack<pair<long long int, long long int> > s;
long long int ans = 0;
for (long long int j = 0; j < n; j++) {
long long int cnt = 1;
while (!s.empty() && s.top().first > arr[j]) {
pair<long long int, long long int> x = s.top();
s.pop();
ans -= x.first * x.second;
cnt += x.second;
}
ans += cnt * arr[j];
s.push({arr[j], cnt});
dp[0][j] = ans;
}
ans = 0;
while (!s.empty()) s.pop();
for (long long int j = n - 1; j >= 0; j--) {
long long int cnt = 1;
while (!s.empty() && s.top().first > arr[j]) {
pair<long long int, long long int> x = s.top();
s.pop();
ans -= x.first * x.second;
cnt += x.second;
}
ans += cnt * arr[j];
s.push({arr[j], cnt});
dp[1][j] = ans;
}
ans = 0;
long long int pos = -1;
for (long long int i = 0; i < n; i++) {
long long int x = dp[0][i] + dp[1][i] - arr[i];
if (x > ans) ans = x, pos = i;
}
long long int mn = arr[pos];
for (long long int i = pos; i >= 0; i--) mn = min(mn, arr[i]), arr[i] = mn;
mn = arr[pos];
for (long long int i = pos; i < n; i++) mn = min(mn, arr[i]), arr[i] = mn;
for (auto c : arr) cout << c << ' ';
cout << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t;
t = 1;
while (t--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| 1,500 | CPP |
#include<bits/stdc++.h>
#define test() int n; cin>>n; while(n--)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define mod 100000007
#define mp make_pair
#define pb push_back
using namespace std;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
unsigned ll modInverse(unsigned ll n, ll p)
{
return power(n, p - 2, p);
}
//ncr mod funtion
ll fac[200005];
void store()
{
fac[0] = 1;
for(int i = 1 ; i <= 200004 ; i++){
fac[i] = (fac[i-1]*i)%1000000007;
}
}
ll ncr(ll n, ll r, ll p)
{
if (n < r)
return 0;
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r], p) % p
* modInverse(fac[n - r], p) % p)
% p;
}
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
map<ll,ll> mp;
for(int i=0;i<n;i++)
{
ll x;
cin>>x;
mp[x]++;
}
ll ans=INT_MIN;
for(auto i:mp)
{
ans=max(ans,i.second);
}
cout<<ans<<endl;
}
} | 800 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-4;
const long long mod = 1e9 + 7;
const unsigned long long mx = 133333331;
inline void RI(int &x) {
char c;
while ((c = getchar()) < '0' || c > '9')
;
x = c - '0';
while ((c = getchar()) >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0';
}
int vis[200005];
vector<int> v[200005];
int num[200005];
long long ans;
int k;
void dfs1(int u, int fa) {
if (vis[u]) num[u] = 1;
for (int i = 0; i < v[u].size(); i++) {
int vv = v[u][i];
if (vv != fa) {
dfs1(vv, u);
num[u] += num[vv];
}
}
}
void dfs2(int u, int fa) {
for (int i = 0; i < v[u].size(); i++) {
int vv = v[u][i];
if (vv != fa) {
ans += min(num[vv], 2 * k - num[vv]);
dfs2(vv, u);
}
}
}
int main() {
int n;
while (cin >> n >> k) {
memset(vis, 0, sizeof(vis));
memset(num, 0, sizeof(num));
for (int i = 1; i <= n; i++) v[i].clear();
for (int i = 0; i < 2 * k; i++) {
int a;
scanf("%d", &a);
vis[a] = 1;
}
for (int i = 1; i < n; i++) {
int a, b;
scanf("%d%d", &a, &b);
v[a].push_back(b);
v[b].push_back(a);
}
ans = 0;
dfs1(1, -1);
dfs2(1, -1);
cout << ans << endl;
}
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline vector<string> __split(const string& s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c)) v.emplace_back(x);
return move(v);
}
inline void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
inline void err(vector<string>::iterator it, T a, Args... args) {
auto item = it->substr((*it)[0] == ' ', it->length());
cerr << item << ": " << a << '\n';
err(++it, args...);
}
static char buff[(int)1e6 + 17];
static constexpr long long inf = (long long)1e9 + 7ll;
inline void config_io(const bool& __fastio) {
if (__fastio) {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
}
if (!std::string("").empty()) {
assert(
freopen(""
".in",
"r", stdin));
assert(
freopen(""
".out",
"w", stdout));
}
}
const int maxn = (int)1e5 + 17;
int n;
long long mx, cf, cm, m;
pair<long long, int> a[maxn];
long long sum[maxn], arr[maxn];
long long solve(int j, bool ret_l = false) {
long long cnt =
1ll * mx * j - sum[n - 1] + (n - 1 - j >= 0 ? sum[n - 1 - j] : 0);
if (cnt > m)
return -inf * inf;
else
cnt = m - cnt;
int l, r;
for (l = 1, r = n - j; l < r;) {
int mid = (l + r + 1) / 2;
if (a[mid - 1].first * mid - sum[mid - 1] <= cnt)
l = mid;
else
r = mid - 1;
}
long long realmin =
(j == n ? mx
: min(1ll * mx, a[l - 1].first +
(cnt - a[l - 1].first * l + sum[l - 1]) / l));
if (ret_l) return realmin;
return 1ll * j * cf + realmin * cm;
}
int main() {
config_io(false);
scanf(
"%d"
"%lld"
"%lld"
"%lld"
"%lld",
&n, &mx, &cf, &cm, &m);
int cntmx = 0;
for (int i = 0; i < (int)n; ++i) {
scanf("%lld", &a[i].first);
a[i].second = i;
cntmx += (a[i].first == mx);
}
sort(a, a + n);
for (int i = 0; i < (int)n; ++i)
sum[i] = (i == 0 ? 0 : sum[i - 1]) + a[i].first;
long long ans = -inf * inf;
int id;
for (int j = cntmx; j <= n; ++j) {
long long rat = solve(j);
if (rat > ans) ans = rat, id = j;
}
int realmin = solve(id, true);
printf(
"%lld"
"\n",
ans);
for (int i = n - 1, j = 0; i >= 0 && j < id; --i, ++j) a[i].first = mx;
for (int i = 0; i < n; ++i)
if (a[i].first <= realmin) a[i].first = realmin;
for (int i = 0; i < n; ++i) arr[a[i].second] = a[i].first;
for (int i = 0; i < n; ++i)
printf(
"%lld"
" ",
arr[i]);
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> ts, cs;
struct PLLI {
long long first;
int second;
PLLI(long long a, int b) {
first = a;
second = b;
}
};
struct cmp {
bool operator()(const PLLI& a, const PLLI& b) {
if (a.first != b.first) {
return a.first > b.first;
} else {
return a.second > b.second;
}
}
};
vector<long long> dijk(vector<pair<int, int> > v[], int s) {
vector<long long> ans(n, -1LL);
priority_queue<PLLI, vector<PLLI>, cmp> pq;
ans[s] = 0;
pq.push(PLLI(0LL, s));
while (!pq.empty()) {
PLLI now = pq.top();
pq.pop();
long long value = now.first;
int id = now.second;
for (int nexti = 0; nexti < (v[id].size()); ++nexti) {
pair<int, int> pnext = v[id][nexti];
int next = pnext.first;
long long w = pnext.second;
long long go = value + w;
if (ans[next] == -1 || go < ans[next]) {
ans[next] = go;
pq.push(PLLI(go * 1LL, next));
}
}
}
return ans;
}
int main() {
scanf("%d %d", &n, &m);
int s, t;
scanf("%d %d", &s, &t);
s--;
t--;
vector<pair<int, int> > conn[1024];
for (int i = 0; i < m; ++i) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
a--;
b--;
conn[a].push_back(make_pair(b, c));
conn[b].push_back(make_pair(a, c));
}
for (int i = 0; i < n; ++i) {
int ti, ci;
scanf("%d %d", &ti, &ci);
ts.push_back(ti);
cs.push_back(ci);
}
vector<pair<int, int> > cnn2[1024];
for (int i = 0; i < n; ++i) {
vector<long long> dis = dijk(conn, i);
for (int j = 0; j < n; ++j) {
if (dis[j] != -1 && dis[j] <= ts[i]) {
cnn2[i].push_back(make_pair(j, cs[i]));
}
}
}
vector<long long> ans = dijk(cnn2, s);
cout << ans[t] << endl;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int _abs(int x) { return x < 0 ? -x : x; }
int add(int x, int y) {
x += y;
return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
x -= y;
return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
x -= y;
if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
int ret = 1;
while (y) {
if (y & 1) ret = (long long)(ret) * (x) % MOD;
x = (long long)(x) * (x) % MOD;
y >>= 1;
}
return ret;
}
void checkmin(int &x, int y) {
if (x > y) x = y;
}
void checkmax(int &x, int y) {
if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
if (x < y) x = y;
}
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
const int N = 200005;
struct node {
int x, y;
} a[N];
vector<int> v[N];
int val[N], n, m;
long long ans = 0;
struct Segment_Tree {
int val[N << 2], sum[N << 2];
void pushup(int x) { sum[x] = sum[x << 1] + sum[x << 1 | 1]; }
void insert(int x, int l, int r, int pos, int Val) {
if (l == r) {
val[x] += Val;
sum[x] = (val[x] ? 1 : 0);
return;
}
int mid = (l + r) >> 1;
if (mid >= pos)
insert(x << 1, l, mid, pos, Val);
else
insert(x << 1 | 1, mid + 1, r, pos, Val);
pushup(x);
}
int query(int x, int l, int r, int L, int R) {
if (L <= l && r <= R) return sum[x];
int mid = (l + r) >> 1, ret = 0;
if (mid >= L) ret += query(x << 1, l, mid, L, R);
if (mid < R) ret += query(x << 1 | 1, mid + 1, r, L, R);
return ret;
}
} T;
int main() {
n = read();
for (int i = 1; i <= n; i++) a[i].x = read(), a[i].y = read();
for (int i = 1; i <= n; i++) val[i] = a[i].y;
sort(val + 1, val + n + 1);
m = unique(val + 1, val + n + 1) - val - 1;
for (int i = 1; i <= n; i++)
a[i].y = lower_bound(val + 1, val + m + 1, a[i].y) - val;
int tot = m;
for (int i = 1; i <= n; i++) val[i] = a[i].x;
sort(val + 1, val + n + 1);
m = unique(val + 1, val + n + 1) - val - 1;
for (int i = 1; i <= n; i++)
a[i].x = lower_bound(val + 1, val + m + 1, a[i].x) - val;
for (int i = 1; i <= n; i++) v[a[i].y].push_back(a[i].x);
for (int i = tot; i >= 1; i--) {
if (v[i].empty()) continue;
int mi = inf, mx = 0;
vector<int> tt;
tt.clear();
for (auto &to : v[i]) {
T.insert(1, 1, m, to, 1);
checkmin(mi, to);
checkmax(mx, to);
tt.push_back(to);
}
sort(tt.begin(), tt.end());
for (int j = 1; j < (int)(tt).size(); j++) {
if (tt[j - 1] + 1 <= tt[j] - 1) {
int tmp = T.query(1, 1, m, tt[j - 1] + 1, tt[j] - 1);
ans -= 1ll * tmp * (tmp + 1) / 2;
}
}
int S = T.sum[1];
if (mx < m) {
int tmp = T.query(1, 1, m, mx + 1, m);
ans -= 1ll * tmp * (tmp + 1) / 2;
}
if (mi > 1) {
int tmp = T.query(1, 1, m, 1, mi - 1);
ans -= 1ll * tmp * (tmp + 1) / 2;
}
ans += 1ll * S * (S + 1) / 2;
}
cout << ans << endl;
return 0;
}
| 2,000 | CPP |
a = int(input())
b = int(input())
c = int(input())
re1 = a+b+c
re2 = a+b*c
re3 = (a+b)*c
re4 = a*b+c
re5 = a*(b+c)
re6 = a*b*c
print(max(re1,re2,re3,re4,re5,re6)) | 1,000 | PYTHON3 |
from math import ceil
a1,a2,a3=map(int,input().split())
b1,b2,b3=map(int,input().split())
n=int(input())
a=(a1+a2+a3)
na=ceil(a/5)
b=b1+b2+b3
nb=ceil(b/10)
if n>=na+nb:
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int Mod = (int)1e9 + 7;
int CaseN = 1;
const long double PI = 22 / 7.0;
int tst() {
int ans = 0;
return ans;
}
int f(int l, int r, vector<vector<int>> &dp, vector<vector<int>> &en) {
if (dp[l][r] != -1) {
return dp[l][r];
}
dp[l][r] = 0;
if (l > r) {
return dp[l][r];
}
int cnt = 0;
if (count(en[l].begin(), en[l].end(), r)) {
cnt++;
}
dp[l][r] = max(dp[l][r], cnt + (l + 1 <= r ? f(l + 1, r, dp, en) : 0));
for (auto ng : en[l]) {
if (ng >= r) {
continue;
}
dp[l][r] = max(dp[l][r], cnt + f(l, ng, dp, en) +
((ng + 1 <= r) ? f(ng + 1, r, dp, en) : 0));
}
return dp[l][r];
}
void solve() {
int n;
cin >> n;
int l[n + 1], r[n + 1];
vector<int> v;
for (int i = 1; i <= n; i++) {
cin >> l[i] >> r[i];
v.push_back(l[i]);
v.push_back(r[i]);
}
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
for (int i = 1; i <= n; i++) {
l[i] = lower_bound(v.begin(), v.end(), l[i]) - v.begin();
r[i] = lower_bound(v.begin(), v.end(), r[i]) - v.begin();
}
int sz = v.size();
vector<vector<int>> dp(sz + 1, vector<int>(sz + 1, -1));
vector<vector<int>> en(sz + 1);
for (int i = 1; i <= n; i++) {
en[l[i]].push_back(r[i]);
}
int ans = f(0, sz - 1, dp, en);
cout << ans << endl;
CaseN++;
return;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
cin >> t;
while (t-- > 0) {
solve();
}
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define fix(f,n) std::fixed<<std::setprecision(n)<<f
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef unsigned long long int ull;
#define vi vector<int>
#define pii pair<int,int>
#define vii vector<pii>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define max3(a,b,c) ((a>b)?(a>c)?a:c:(b>c)?b:c)
#define min3(a,b,c) ((a<b)?(a<c)?a:c:(b<c)?b:c)
#define REP(i,a,n) for(ll i=a;i<n;i++)
#define pb push_back
#define mp make_pair
#define mod 998244353
#define MAX 1000000001
int main(){
fast;
int test=1;
cin >> test;
while(test--){
int n;
cin >> n;
ll ans=0;
ll lx=1,ly=1;
ll a[n];
for(int i=0 ; i<n ; i++){
cin >> a[i];
}
vector<pair<ll,ll>> v(n);
for(int i=0 ; i<n ; i++){
ll x;
cin >> x;
v[i]={a[i],x};
}
sort(v.begin(),v.end());
for(int i=0 ; i<n ; i++){
ll x=v[i].first,y=v[i].second;
if(x==1 && y==1){
continue;
}
if((lx+ly)%2){
ans+=(x-lx-y+ly+1)/2;
}else{
if((x-lx)==(y-ly)){
ans+=(x-lx);
}else{
ans+=(x-lx-y+ly)/2;
}
}
lx=x;
ly=y;
//cout << ans << endl;
}
cout << ans << endl;
}
return 0;
} | 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
double p, d, t, f, c;
scanf("%lf %lf %lf %lf %lf", &p, &d, &t, &f, &c);
if (p >= d) return puts("0"), 0;
double now = t * p, bizo = 0;
while (now <= c) {
double step = now / (d - p);
if (now + p * step >= c) break;
bizo++;
now = now + (p * step) * 2;
now += p * f;
if (now >= c) break;
}
printf("%.0f\n", bizo);
return 0;
}
| 1,500 | CPP |
#only gravity will pull me down
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.append(0)
P=0
N=0
maxP=0
maxN=-1*(10**9)
summ=0
if a[0]>0:
maxP=a[0]
P=1
else:
maxN=a[0]
N=1
for i in range(n):
#print(summ)
if a[i]>maxP and P==1:
maxP=a[i]
elif a[i]>maxN and N==1:
maxN=a[i]
if a[i+1]>0 and N==1:
summ+=maxN
maxN=-1*(10**9)
P=1
N=0
elif a[i+1]<0 and P==1:
summ+=maxP
maxP=0
P=0
N=1
elif a[i+1]==0:
if P==1:
summ+=maxP
elif N==1:
summ+=maxN
print(summ)
| 1,200 | PYTHON3 |
import math
d, h, v, e = map(int, input().split())
if e >= 4*v/math.pi/d/d:
print('NO')
else:
print('YES')
print(h/(4*v/math.pi/d/d - e)) | 1,100 | PYTHON3 |
a = int(input())
if a % 2 == 0 and a != 2:
print('YES')
elif a % 2 != 0 or a == 2:
print('NO')
| 800 | PYTHON3 |
for i in range(int(input())):
s = input()
if s.endswith('po'):
print("FILIPINO")
elif s.endswith('desu') or s.endswith('masu'):
print("JAPANESE")
else:
print("KOREAN") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int p, q, N;
long long **v, x[200009], y[200009], cnt[200009];
long long gcd(long long a, long long b) {
long long r;
while (b) r = a % b, a = b, b = r;
return a;
}
int cntDiv(long long x) {
int ans = 0;
for (int i = 1; 1LL * i * i <= x; i++)
if (x % i == 0) {
ans += 2;
if (i * i == x) ans--;
}
return ans;
}
void printAns(int x) {
printf("%d\n", x);
exit(0);
}
map<long long, int> ln, cl;
void read() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%I64d %I64d %I64d", &x[i], &y[i], &cnt[i]);
if (ln[x[i]] == 0) ln[x[i]] = ++p;
if (cl[y[i]] == 0) cl[y[i]] = ++q;
}
if (1LL * p * q != N) printAns(0);
v = new long long *[p + 1];
for (int i = 1; i <= p; i++) v[i] = new long long[q + 1];
for (int i = 1; i <= N; i++)
x[i] = ln[x[i]], y[i] = cl[y[i]], v[x[i]][y[i]] = cnt[i];
}
int main() {
read();
for (int i = 1; i < p; i++)
for (int j = 1; j < q; j++) {
if (N < 210) continue;
long long a = v[i][j], b = v[i + 1][j + 1], c = v[i][j + 1],
d = v[i + 1][j];
long long r = gcd(a, c);
a /= r, c /= r;
r = gcd(a, d), a /= r, d /= r;
r = gcd(b, c), b /= r, c /= r;
r = gcd(b, d), b /= r, d /= r;
if (a + b + c + d != 4) printAns(0);
}
long long gd = 0;
for (int i = 1; i <= p; i++)
for (int j = 1; j <= q; j++) gd = gcd(gd, v[i][j]);
printAns(cntDiv(gd));
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string a, s;
cin >> a >> s;
map<long long, long long> pos;
for (long long i = 0; i < 26; i++) pos[a[i]] = i;
long long n = s.size();
long long ans = 0;
for (long long i = 1; i < n; i++) {
long long tmp = abs(pos[s[i]] - pos[s[i - 1]]);
ans += tmp;
}
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) solve();
return 0;
}
| 800 | CPP |
import sys
import os.path # =========================================================================
if(os.path.exists('in.txt')):
sys.stdin = open("in.txt", "r")
sys.stdout = open("out.txt", "w") # =
# =============================================================================================
# for _ in range(int(input())):
n = int(input()); ans = 0
s = input()
for i in range(n-1):
if(s[i] == s[i+1]): ans += 1
print(ans) | 800 | PYTHON3 |
n = input()
n = str(int(n) + 1)
a = list(n)
while True:
b = list(set(a))
if len(b) == len(a):
print(n)
break
else:
n = str(int(n) + 1)
a = list(n)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
int ss, mm, hh, dd, dat, mon;
int n;
inline bool is_leap_year(int x) {
return (x % 4 == 0 && x % 100 != 0) || x % 400 == 0;
}
int days_in_month[2][15] = {
{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
{0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
inline bool check_day(int m, int d, int day) {
if (m != mon && mon != -1) return false;
if (dd == -1) {
return d == dat || dat == -1;
} else if (dat == -1) {
return day == dd || dd == -1;
} else {
return d == dat || day == dd;
}
}
long long get_next(long long t0) {
++t0;
int now_year = 1970;
int day = 3;
day = (day + t0 / 86400) % 7;
long long _t0 = t0;
while (1) {
int tmp = is_leap_year(now_year) ? 86400 * 366 : 86400 * 365;
if (t0 >= tmp) {
t0 -= tmp;
++now_year;
} else {
break;
}
}
bool leap = is_leap_year(now_year);
int now_month = 1;
while (1) {
int tmp = 86400 * days_in_month[leap][now_month];
if (t0 >= tmp) {
t0 -= tmp;
++now_month;
} else {
break;
}
}
int now_day = 1 + t0 / 86400;
t0 %= 86400;
if (check_day(now_month, now_day, day)) {
int now_h = t0 / 3600;
int now_m = t0 % 3600 / 60;
int now_s = t0 % 60;
L_h:
while (hh != -1 && now_h != hh && now_h < 24) {
++now_h, now_m = now_s = 0;
if (now_h >= 24) break;
}
if (now_h < 24) {
while (mm != -1 && now_m != mm && now_m < 60) {
++now_m, now_s = 0;
if (now_m >= 60) break;
}
if (now_m >= 60) {
++now_h, now_m = now_s = 0;
goto L_h;
} else {
while (ss != -1 && now_s != ss && now_s < 60) {
++now_s;
if (now_s >= 60) break;
}
if (now_s >= 60) {
now_s = 0, ++now_m;
goto L_h;
} else {
return _t0 - _t0 % 86400 + now_h * 3600 + now_m * 60 + now_s;
}
}
}
}
while (1) {
if (++now_day > days_in_month[leap][now_month]) {
now_day = 1;
if (++now_month > 12) {
++now_year;
now_month = 1;
leap = is_leap_year(now_year);
}
}
_t0 += 86400;
day = (day + 1) % 7;
if (check_day(now_month, now_day, day)) break;
}
return _t0 - _t0 % 86400 + std::max(0, hh) * 3600 + std::max(0, mm) * 60 +
std::max(0, ss);
}
int main() {
scanf("%d%d%d%d%d%d", &ss, &mm, &hh, &dd, &dat, &mon);
if (dd != -1) --dd;
scanf("%d", &n);
while (n--) {
long long t;
scanf("%I64d", &t);
printf("%I64d\n", get_next(t));
}
}
| 2,800 | CPP |
q = int(input())
for k in range(q):
a = str(input())
n = len(a)
t = [0]*3
ans = [0, 0]
#len = 10**10
c = 0
for i in range(n):
if t[int(a[i]) - 1] == 0:
c += 1
t[int(a[i]) - 1] += 1
if c == 3:
break
if c != 3:
print(0)
continue
l = 0
r = i
min = r - l
ans = [l, r]
while True:
if t[int(a[l]) - 1] > 1:
t[int(a[l]) - 1] -= 1
l += 1
elif r != n - 1:
t[int(a[r+1]) - 1] += 1
r += 1
else:
break
if r - l < min:
min = r - l
ans = [l, r]
print(min+1)
#ans[0] += 1
#ans[1] += 1
#print(*ans) | 1,200 | PYTHON3 |
t=int(input())
for i in range(t):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[0]
h=0
for j in range(n):
p=b[j]-a[j]
if p>0:
if 1 in c:
pass
else:
h=1
break
if p<0:
if -1 in c:
pass
else:
h = 1
break
if a[j] not in c:
c.append(a[j])
if h==0:
print("YES")
else:
print("NO")
| 1,100 | PYTHON3 |
from collections import Counter,defaultdict,deque
#from heapq import *
#import itertools
#from operator import itemgetter
#from itertools import count, islice
#from functools import reduce
#alph = 'abcdefghijklmnopqrstuvwxyz'
#dirs = [[1,0],[0,1],[-1,0],[0,-1]]
#from math import factorial as fact
#a,b = [int(x) for x in input().split()]
#sarr = [x for x in input().strip().split()]
#import math
from math import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(2**30)
#mod = 10**9+7
def solve():
n = int(input())
arr = [int(x) for x in input().split()]
s = set(arr)
for i in range(1,1025):
news = set()
for el in arr:
news.add(el^i)
if news == s:
print(i)
return
print(-1)
tt = int(input())
for test in range(tt):
solve()
#
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 * 100 + 10;
int d[maxn][5];
int bad[26][4];
int n, k;
string s, help;
vector<string> v;
int ans = 0;
int main() {
cin >> s;
cin >> k;
for (int i = 0; i < k; ++i) {
cin >> help;
v.push_back(help);
}
n = s.size();
memset(d, -1, sizeof d);
int t1 = 0, t2 = 0;
char cur = 'A';
char bad = 'B';
for (int i = 0; i < n; ++i) {
if (s[i] == cur)
t1++;
else if (s[i] == bad)
t2++;
else if (cur == 'A') {
cur = s[i];
t1++;
} else if (bad == 'B') {
cerr << cur << "::" << i << endl;
bool qw = false;
for (int j = 0; j < k; ++j)
if ((cur == v[j][0] && s[i] == v[j][1]) ||
(cur == v[j][1] && s[i] == v[j][0])) {
bad = s[i];
t2 = 1;
qw = true;
}
if (qw == false) {
t1 = 1;
cur = s[i];
}
} else {
if (s[i] == cur)
t1++;
else if (s[i] == bad)
t2++;
else {
ans += min(t1, t2);
cur = s[i];
t1 = 1;
bad = 'B';
}
}
}
if (cur != 'A' && bad != 'B') ans += min(t1, t2);
cout << ans << endl;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
struct ss {
int x, index;
};
ss c[200050];
int a[200050];
bool cmp(ss x, ss y) { return x.x < y.x; }
int find(int x) {
int left = 1;
int right = n;
while (left <= right) {
int mid = (left + right) / 2;
if (c[left].x == x) return c[left].index;
if (c[mid].x < x) {
left = mid + 1;
} else {
if (c[right].x == x) return c[right].index;
if (c[mid].x == x) return c[mid].index;
right = mid + 1;
}
}
if (c[left].x == x) return c[left].index;
if (c[right].x == x) return c[right].index;
}
int main() {
cin >> n;
int flag = -1;
for (int i = 1; i <= n; i++) {
cin >> a[i];
ss temp;
temp.index = i;
temp.x = a[i];
c[i] = temp;
if (a[i] == n) flag = i;
}
sort(c, c + n, cmp);
bool check = true;
int left = flag - 1;
int right = flag + 1;
for (int i = n - 1; i >= 1; i--) {
int pos = find(i);
if (pos == left)
left--;
else if (pos == right)
right++;
else {
check = false;
break;
}
}
if (check)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const int N = 1e5 + 5;
int n, k;
int a[N], b[N];
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < n; ++i) scanf("%d", &b[i]);
long long l = 0, r = INT_MAX;
while (l < r) {
long long m = (l + r + 1) / 2;
long long t = 0;
for (int i = 0; i < n; ++i) {
t += max(m * a[i] - b[i], 0ll);
if (t > k) break;
}
if (t <= k)
l = m;
else
r = m - 1;
}
printf("%lld\n", l);
return 0;
}
| 1,500 | CPP |
n=int(input())
li=[]
for i in range(n):
li.append(input())
li.sort(key=len, reverse=False)
q=True
for i in range(n-1):
if li[i] in li[i+1]:
pass
else:
q=False
break
if q==False:
print('NO')
else:
print('YES')
for ii in li:
print(ii) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
vector<int> v[150000 + 10];
int visited[150000 + 10];
long long dfs(int idx) {
a++;
long long ret = v[idx].size();
for (auto it : v[idx]) {
if (visited[it]) continue;
visited[it] = 1;
ret += dfs(it);
}
return ret;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
v[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
if (visited[i]) continue;
visited[i] = 1;
a = 0;
if (dfs(i) != (long long)a * (long long)(a - 1)) {
printf("NO");
return 0;
}
}
printf("YES");
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int t[200005];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
long long tmp = 0;
for (int i = 1; i <= n; i++) {
tmp += a[i];
t[i] += tmp / m;
tmp %= m;
}
for (int i = 1; i <= n; i++) cout << t[i] << " ";
cout << endl;
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, b, mn, mx;
cin >> t;
while (t--) {
cin >> a >> b;
mn = min(a, b);
mx = max(a, b);
if (a == 0 || b == 0)
cout << 0 << '\n';
else if (mn * 2 <= mx)
cout << mn << '\n';
else
cout << (a + b) / 3 << '\n';
}
return 0;
}
| 1,100 | CPP |
def output_successful_answer(count):
print('YES')
power = 1
for i in range(len(count) - 1, -1, -1):
while count[i] > 0:
print(power, end=' ')
count[i] -= 1
power *= 2
print()
def get_ans(count, total_powers, k, i):
while total_powers < k and i + 1 < len(count):
if count[i] >= 1:
count[i + 1] += 2
count[i] -= 1
total_powers += 1
while total_powers < k and count[i] >= 1:
count[i + 1] += 2
count[i] -= 1
total_powers += 1
i += 1
return total_powers
n, k = map(int, input().split())
count = list(map(int, list(bin(n)[2:])))
total_powers = get_ans(count, sum(count), k, 0)
if total_powers == k:
output_successful_answer(count)
else:
print('NO')
| 1,400 | PYTHON3 |
n=int(input())
t=list(map(int,input().split()))
a=min(t.count(1),t.count(2),t.count(3))
print(a)
l1=[]
l2=[]
l3=[]
for i in range(n):
if t[i]==1:
l1.append(i+1)
elif t[i]==2:
l2.append(i+1)
else:
l3.append(i+1)
if a>0:
for i in range(a):
s=[str(l1.pop(0)),str(l2.pop(0)),str(l3.pop(0))]
print(' '.join(s)) | 800 | PYTHON3 |
n = int(input())
line = input().split()
a = []
for i in range(n):
a.append(int(line[i]))
a.sort()
print(a[(n-1)//2])
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 5e5 + 5;
vector<long long int> adj[N];
bool visited[N] = {false};
long long int parent[N];
long long int rnk[N];
long long int degree[N];
long long int c[N];
vector<long long int> ax;
bool isprime(long long int n);
bool ispalin(long long int num);
long long int power(long long int x, unsigned long long int y);
long long int sumofdigits(long long int n);
bool sortinrev(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b);
bool sortbysec(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b);
void make(long long int a);
long long int find(long long int a);
void Union(long long int a, long long int b);
void dfs(long long int vert);
void solve() {
long long int n, m;
long long int mini = 20000;
cin >> n;
long long int a[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
map<long long int, long long int> mx;
for (long long int i = 0; i < n; i++) {
bool valid = true;
for (long long int j = 0; j < i; j++) {
mx[a[j]]++;
if (mx[a[j]] == 2) {
valid = false;
break;
}
}
long long int suff = n;
for (long long int j = n - 1; j >= i; j--) {
mx[a[j]]++;
if (mx[a[j]] == 1) {
suff = j;
} else
break;
}
if (valid == true) {
mini = min(mini, suff - i);
}
mx.clear();
}
cout << mini << '\n';
}
void dfs(long long int vert) {
visited[vert] = true;
for (long long int child : adj[vert]) {
if (visited[child] == false) {
dfs(child);
}
}
}
long long int power(long long int x, unsigned long long int y) {
long long int temp;
if (y == 0) return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
bool isPrime(long long int num) {
bool flag = true;
for (long long int i = 2; i <= num / 2; i++) {
if (num % i == 0) {
flag = false;
break;
}
}
return flag;
}
bool isPalin(long long int num) {
bool flag = false;
long long int digit, rev = 0, n = num;
do {
digit = num % 10;
rev = (rev * 10) + digit;
num = num / 10;
} while (num != 0);
if (rev == n) flag = true;
return flag;
}
long long int sumofdigits(long long int n) {
long long int c = 0;
while (n > 0) {
c++;
n /= 10;
}
return c;
}
bool sortinrev(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b) {
return (a.first > b.first);
}
bool sortbysec(const pair<long long int, long long int> &a,
const pair<long long int, long long int> &b) {
return (a.second < b.second);
}
void make(long long int a) {
parent[a] = a;
rnk[a] = 1;
}
long long int find(long long int a) {
if (parent[a] == a) return a;
return parent[a] = find(parent[a]);
}
void Union(long long int a, long long int b) {
a = find(a);
b = find(b);
if (a == b) return;
if (rnk[a] > rnk[b]) {
parent[b] = a;
rnk[a] += rnk[b];
} else {
parent[a] = b;
rnk[b] += rnk[a];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| 1,500 | CPP |
n, m = map(int, input().split())
print(1 if n == 1 else m-1 if m > 1 and m-1 >= n - m else m + 1) | 1,300 | PYTHON3 |
d = {'purple':'Power', 'green':'Time', 'blue':'Space', 'orange':'Soul', 'red':'Reality', 'yellow':'Mind'}
for i in range(int(input())):
del d[input()]
print(len(d))
print(*[d[x] for x in d], sep='\n')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string is_prime(long long a) {
if (a % 2 == 0) {
return "No";
}
for (int i = 3; i <= sqrt(a) / 1; i += 2) {
if (a % i == 0 and a != i) {
return "No";
}
}
return "Yes";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
short int test, ch = 1;
long long a, b, s;
cin >> test;
while (ch <= test) {
cin >> a >> b;
if (a - b != 1) {
cout << "No"
<< "\n";
} else {
cout << is_prime(a + b) << "\n";
}
ch++;
}
}
| 1,100 | CPP |
def main():
T = int(input())
for i in range(1, T + 1):
n = int(input())
s = [int(_) for _ in input().split(" ")]
s.sort()
min_diff = 1000000000000
for j, v in enumerate(s[1:]):
diff = v - s[j]
if diff < min_diff:
min_diff = diff
print(min_diff)
if __name__ == "__main__":
main()
| 800 | PYTHON3 |
n=int(input())
count=1
arr=[None]*n
for i in range(n):
arr[i]=input()
if arr[i-1]==None:
continue
elif arr[i]!=arr[i-1]:
count+=1
print(count) | 800 | PYTHON3 |
for t in range(int(input())):
n, k = map(int, input().split())
a = list(map(int, input().split()))
m=1
a.sort()
b = [a[0]]
for i in range(1, n):
if a[i] > a[i - 1]:
m+=1
b.append(a[i])
if k<m:
print('-1')
else:
for i in range(k-m):
b.append(b[0])
c=[]
for i in range(n):
c.extend(b)
print(k*n)
print(*c)
| 1,400 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
i = 0
s = []
while n != 0:
rem = n%10
if rem != 0:
s.append(rem*(10**i))
i += 1
n //= 10
print(len(s))
for i in s:
print(i, end=" ")
print("")
| 800 | PYTHON3 |
s = input()
n = len(s)
"""
start = (n - 1) // 2
ans = s[start]
for i in range(1, n // 2 + 1):
if start + i < n:
ans += s[start + i]
if start - i >= 0:
ans += s[start - i]
print(ans)
"""
ans = ''
i, j = 0, n - 1
while i < j:
if n % 2 == 1:
ans += s[i]
ans += s[j]
else:
ans += s[j]
ans += s[i]
i += 1
j -= 1
if n % 2 == 1:
ans += s[n // 2]
print(ans[::-1]) | 800 | PYTHON3 |
#!/usr/bin/env python
# coding: utf-8
# In[7]:
l=int(input())
s=input()
subxcount=removals=0
i=0
while i<l:
if s[i]=='x':
subxcount+=1
else:
if subxcount>2:
removals+=subxcount-2
subxcount=0
i+=1
if subxcount>2:
removals+=subxcount-2
print(removals)
# In[ ]:
| 800 | PYTHON3 |
for tc in range(int(input())):
n = int(input())
print(1, n-1) | 800 | PYTHON3 |
from array import array
import math
if __name__ == "__main__":
t = int(input())
for i in range(t):
n , k = map(int, input().split())
arr = list(map(int, input().split()))
fnd = False
bgr = False
for i in range(0,n):
if arr[i] == k :
fnd = True
for i in range(1,n-1) :
cnt = 0
if arr[i] >= k :
cnt += 1
if(arr[i-1] >= k) :
cnt += 1
if(arr[i+1] >= k) :
cnt += 1
if cnt >= 2 :
bgr = True
if n == 1 and arr[0] == k:
print("yes")
elif n == 2 and min(arr[0],arr[1]) == k :
print("yes")
elif bgr and fnd :
print("yes")
else :
print("no") | 2,000 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.