solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
import math
ip = input()
num = int(ip, 2)
val = 1;
count = 0;
while(val < num):
count+=1
val*=4
print(count) | 7 | PYTHON3 |
n=int(input())
a=0;b=0
for i in map(int,input().split()):
if i==25:
a+=1
elif i==50:
b+=1
if a: a-=1
else: print("NO");exit()
elif i==100:
if b and a: b-=1;a-=1
elif a>2: a-=3
else: print("NO");exit()
print("YES")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
int main() {
int n;
cin >> n;
a.assign(1024 * 1024, 0);
for (int i = 0; i < n; i++) {
string x, y;
int res = 0;
cin >> x >> y;
for (int i = 0; i < y.size(); i++) {
if ((y[i] - '0') & 1) {
res *= 2;
res += 1;
} else {
res *= 2;
}
}
if (x == "+") {
a[res] += 1;
} else if (x == "-") {
a[res] -= 1;
} else {
cout << a[res] << "\n";
}
}
}
| 7 | CPP |
import math as m
def isPrime(n):
if n == 2 or n == 3:
return True
if n == 1 or n%2 == 0 or n % 3 == 0:
return False
i = 1
while (6*i - 1) <= int(m.sqrt(n)):
if n % (6*i + 1) == 0 or n % (6*i - 1) == 0:
return False
i+=1
return True
n, k = list(map(int, input().split()))
sum = 0
result = 'NO'
a = 2
for i in range(3, n+1):
if isPrime(i):
if a+i+1>n:
break
if isPrime(a + i + 1):
sum+=1
a = i
if sum >= k:
result = 'YES'
print(result) | 7 | PYTHON3 |
from math import factorial
N,M = map(int,input().split())
def foo(N,M):
if N == M+1 or N+1 == M:
tm = factorial(min(N,M))
return(tm*max(N,M)*tm)
elif N==M:
return((factorial(N)**2)*2)
else:
return(0)
print(foo(N,M)%(10**9+7)) | 0 | PYTHON3 |
#include <iostream>
#include <set>
using namespace std;
int main()
{
int n;
while( cin >> n && n ){
set< int > list;
int size = ( n - 1 ) / 2;
int* counts = new int[ size + 1 ]();
for( int i = 1; i < n; ++i ){
list.insert( i * i % n );
}
set< int >::iterator itr1 = list.begin();
set< int >::iterator itr2 = list.begin();
while( itr1 != list.end() ){
while( itr2 != list.end() ){
if( itr1 == itr2 ){
++itr2;
continue;
}
int a = *itr1;
int b = *itr2;
int diff = a - b;
if( diff < 0 ){
diff += n;
}
if( diff > size ){
diff = n - diff;
}
++counts[ diff ];
++itr2;
}
++itr1;
itr2 = list.begin();
}
for( int i = 1; i <= size; ++i ){
cout << counts[ i ] << endl;
}
delete[] counts;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
set<int> prims;
vector<bool> used;
vector<int> divisors;
vector<bool> skip;
vector<int> nxt;
vector<int> prv;
void init_prims(int ub) {
divisors.resize(ub, 0);
for (int i = 0; i < ub; ++i) {
divisors[i] = i;
}
for (int i = 2; i < ub; ++i) {
if (divisors[i] == i) prims.insert(i);
for (int p : prims) {
if (i * p >= ub) break;
divisors[i * p] = p;
if (i % p == 0) break;
}
}
}
vector<int> factors(int x) {
vector<int> f;
while (x > 1) {
int d = divisors[x];
f.push_back(d);
while (x % d == 0) x /= d;
}
return f;
}
bool is_ok(int x) {
for (auto f : factors(x)) {
if (used[f]) return false;
}
return true;
}
int main() {
int n;
cin >> n;
const int ub = 2300000;
init_prims(ub);
used.resize(ub, 0);
nxt.resize(ub, 0);
prv.resize(ub, 0);
skip.resize(ub, false);
vector<int> v(n, 0);
for (int i = 0; i < ub - 1; ++i) nxt[i] = i + 1;
for (int i = 0; i < ub - 1; ++i) prv[i + 1] = i;
for (int i = 0; i < n; ++i) cin >> v[i];
bool le = true;
int lo = 2;
vector<int> b;
for (int i = 0; i < n; ++i) {
int a = v[i];
int start = le ? a : lo;
while (skip[start]) start = nxt[start];
if (!le) lo = nxt[start];
if (le && start > a) le = false;
b.push_back(start);
for (int d : factors(b.back())) {
for (int j = d; j < ub; j += d) {
nxt[prv[j]] = nxt[j];
prv[nxt[j]] = prv[j];
skip[j] = true;
}
}
}
for (int x : b) cout << x << " ";
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)3e5 + 7;
int n, k;
int x[N], y[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> x[i];
}
for (int i = 1; i <= n; i++) {
cin >> y[i];
}
long long f, s;
f = s = 0;
for (int i = 1; i <= n; i++) {
f = max(0LL, x[i] + f - y[i] * 1LL * k);
s = max(0LL, y[i] + s - x[i] * 1LL * k);
if (f > k || s > k) {
puts("NO");
return 0;
}
}
puts("YES");
}
| 12 | CPP |
n,m = map(int,input().split())
if(m % n != 0):
print(-1)
else:
two = 0
three = 0
n = m // n
while(n % 2 == 0):
two = two + 1
n = n // 2
while(n % 3 == 0):
three = three + 1
n = n // 3
if(n == 1):
print(two+three)
else:
print(-1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int rooms[1000001];
int n, m;
int color = 1;
int xm[] = {1, 0, -1, 0};
int ym[] = {0, 1, 0, -1};
char museum[1005][1005];
int colored[1005][1005];
bool inRange(int x, int y) { return (x < n && x > -1 && y < m && y > -1); }
int dfs(int x, int y) {
if (inRange(x, y) && museum[x][y] == '*') return 1;
if (!inRange(x, y)) return 0;
if (colored[x][y] != 0) return 0;
colored[x][y] = color;
int sum = 0;
for (int i = 0; i < 4; i++) sum += dfs(x + xm[i], y + ym[i]);
return sum;
}
void flood() {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (museum[i][j] == '*' || colored[i][j] != 0) continue;
rooms[color] = dfs(i, j);
color++;
}
}
int main() {
ios::sync_with_stdio(false);
int k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> museum[i][j];
flood();
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
cout << rooms[colored[x - 1][y - 1]] << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
int count = a[i][j];
if (i - 1 >= 0) {
count += a[i - 1][j];
}
if (i + 1 <= 2) {
count += a[i + 1][j];
}
if (j - 1 >= 0) {
count += a[i][j - 1];
}
if (j + 1 <= 2) {
count += a[i][j + 1];
}
if (count % 2 == 0) {
cout << "1";
} else
cout << "0";
}
cout << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
int n, m, g1, g2, s1, s2, f[55][55], G[55], S[55], B[55];
long long dp[52][52][52][2][2], ans;
pair<int, int> p[55][55];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) f[i][j] = 1000000007;
f[i][i] = 0;
}
for (int i = 1; i <= m; ++i) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
f[x][y] = f[y][x] = min(f[x][y], z);
}
scanf("%d%d%d%d", &g1, &g2, &s1, &s2);
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
}
}
for (int i = 1; i <= n; ++i) sort(f[i] + 1, f[i] + n + 1);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) p[i][j] = make_pair(f[i][j], i);
}
for (int gg = 1; gg <= n; ++gg) {
pair<int, int> g = p[gg][2];
for (int bb = 1; bb <= n; ++bb) {
pair<int, int> b = p[bb][n];
if (b <= g) continue;
for (int i = 1; i <= n; ++i) {
G[i] = (p[i][2] <= g), B[i] = (p[i][n] >= b), S[i] = 0;
for (int j = 2; j <= n; ++j)
if (p[i][j] < b && p[i][j] > g) S[i] = 1, j = n;
}
memset(dp, 0, sizeof(dp));
dp[0][0][0][0][0] = 1;
for (int i = 0; i <= g2; ++i) {
for (int j = 0; j <= s2; ++j) {
for (int k = 0; k + i + j < n; ++k) {
int o = i + j + k + 1;
if (G[o]) {
if (p[o][2] == g) {
dp[i + 1][j][k][1][0] += dp[i][j][k][0][0] + dp[i][j][k][1][0];
dp[i + 1][j][k][1][1] += dp[i][j][k][0][1] + dp[i][j][k][1][1];
} else {
dp[i + 1][j][k][0][0] += dp[i][j][k][0][0];
dp[i + 1][j][k][0][1] += dp[i][j][k][0][1];
dp[i + 1][j][k][1][0] += dp[i][j][k][1][0];
dp[i + 1][j][k][1][1] += dp[i][j][k][1][1];
}
}
if (S[o]) {
dp[i][j + 1][k][0][0] += dp[i][j][k][0][0];
dp[i][j + 1][k][0][1] += dp[i][j][k][0][1];
dp[i][j + 1][k][1][0] += dp[i][j][k][1][0];
dp[i][j + 1][k][1][1] += dp[i][j][k][1][1];
}
if (B[o]) {
if (p[o][n] == b) {
dp[i][j][k + 1][0][1] += dp[i][j][k][0][0] + dp[i][j][k][0][1];
dp[i][j][k + 1][1][1] += dp[i][j][k][1][0] + dp[i][j][k][1][1];
} else {
dp[i][j][k + 1][0][0] += dp[i][j][k][0][0];
dp[i][j][k + 1][0][1] += dp[i][j][k][0][1];
dp[i][j][k + 1][1][0] += dp[i][j][k][1][0];
dp[i][j][k + 1][1][1] += dp[i][j][k][1][1];
}
}
}
if (i >= g1 && j >= s1 && n - i - j >= 0)
ans += dp[i][j][n - i - j][1][1];
}
}
}
}
printf("%I64d\n", ans);
return 0;
}
| 14 | CPP |
#include <bits/stdc++.h>
using namespace std;
long double dp[100][10], ch[100][10], p[100][100];
int main() {
int r, n;
cin >> r;
n = (1 << r);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> p[i][j];
p[i][j] /= 100.0;
}
}
for (int i = 0; i < n; i++) {
ch[i][0] = 1.0;
dp[i][0] = 0.0;
}
for (int t = 1; t <= r; t++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((i >> t) == (j >> t) && (i >> (t - 1)) != (j >> (t - 1))) {
ch[i][t] += ch[i][t - 1] * ch[j][t - 1] * p[i][j];
}
}
for (int j = 0; j < n; j++) {
if ((i >> t) == (j >> t) && (i >> (t - 1)) != (j >> (t - 1))) {
dp[i][t] = max(dp[i][t], dp[i][t - 1] + dp[j][t - 1] +
ch[i][t] * (1 << (t - 1)));
}
}
}
}
long double ans = 0;
for (int i = 0; i < n; i++) ans = max(ans, dp[i][r]);
cout << fixed << setprecision(20) << ans << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k;
cin >> n >> m >> k;
vector<pair<int, int>> przeszkody;
vector<set<int>> przeX(n), przeY(m);
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
przeszkody.push_back(make_pair(x, y));
przeX[x].insert(y);
przeY[y].insert(x);
}
int akt_x = 0;
int akt_y = 0;
int min_x = 0;
int max_x = n - 1;
int min_y = 0;
int max_y = m - 1;
int kier = 0;
bool flaga = true;
long long licz = 1;
while (true) {
if (kier == 0) {
int y1 = akt_y;
akt_y = max(akt_y, max_y);
if (przeX[akt_x].upper_bound(y1) != przeX[akt_x].end()) {
akt_y = min(*przeX[akt_x].upper_bound(y1) - 1, akt_y);
}
if (akt_y - y1 == 0 && !flaga) {
break;
}
licz += akt_y - y1;
min_x = akt_x + 1;
flaga = false;
} else if (kier == 1) {
int x1 = akt_x;
akt_x = max(akt_x, max_x);
if (przeY[akt_y].upper_bound(x1) != przeY[akt_y].end()) {
akt_x = min(*przeY[akt_y].upper_bound(x1) - 1, akt_x);
}
if (akt_x - x1 == 0) {
break;
}
licz += akt_x - x1;
max_y = akt_y - 1;
} else if (kier == 2) {
int y1 = akt_y;
akt_y = min(akt_y, min_y);
if ((int)(przeX[akt_x]).size() > 0 && !przeX[akt_x].empty() &&
przeX[akt_x].upper_bound(y1) != przeX[akt_x].begin()) {
akt_y = max(*(--przeX[akt_x].upper_bound(y1)) + 1, akt_y);
}
if (akt_y - y1 == 0) {
break;
}
licz += y1 - akt_y;
max_x = akt_x - 1;
} else if (kier == 3) {
int x1 = akt_x;
akt_x = min(akt_x, min_x);
if ((int)(przeY[akt_y]).size() > 0 && !przeY[akt_y].empty() &&
przeY[akt_y].upper_bound(x1) != przeY[akt_y].begin()) {
akt_x = max(*(--przeY[akt_y].upper_bound(x1)) + 1, akt_x);
}
if (akt_x - x1 == 0) {
break;
}
licz += x1 - akt_x;
min_y = akt_y + 1;
}
kier += 1;
kier %= 4;
}
if (n * m - k == licz)
cout << "Yes";
else
cout << "No";
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long sum(long long n, long long a, long long d) {
if (n <= 0) return 0;
return (n * (2 * a + (n - 1) * d)) / 2;
}
int main() {
ios::sync_with_stdio(false);
int t, n, m, i, j, k, a[10004], l, r, x;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> a[i];
}
while (m--) {
cin >> l >> r >> x;
for (i = l - 1, j = 0; i < r; i++) {
if (a[i] < a[x - 1]) {
j++;
}
}
if (x - l == j) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long double pie = 3.14159265358979323846264338327950;
long double eps = 0.0000001;
long long mul(long long x, long long y) { return (x * 1ll * y) % mod; }
long long add(long long x, long long y) {
x += y;
while (x >= mod) x -= mod;
while (x < 0) x += mod;
return x;
}
long long power(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res % m;
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
char a[n + 1][m + 1];
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] == '*') count++;
}
}
int t = k * 2;
set<pair<int, int>> s;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] == '*') {
int x = 0;
for (int p = j + t; p <= m; p += 2) {
if (a[i][p] == '*') {
if (i + (p - j) / 2 > n) break;
int f = 1, e = 1;
for (int q = i + 1; q <= (i + k); q++) {
if (a[q][j + e] == '*' && a[q][p - e] == '*')
e++;
else {
f = 0;
break;
}
}
if (f == 1) {
e = 0, x = 1;
for (int q = i; q <= (i + k); q++) {
s.insert(make_pair(q, j + e));
s.insert(make_pair(q, p - e));
e++;
}
}
}
}
}
}
}
if (s.size() == count)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 9 | CPP |
n,k=map(int,input().split())
a=sorted(list(map(int,input().split())))
a=[1]+a
print(a[k] if n==k or a[k]!=a[k+1] else -1) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dp[30003][203][2][2][2];
int inf = (int)400000000;
int N, K;
int a[30003];
int s[2] = {1, -1};
int main() {
scanf("%d%d", &N, &K);
for (int i = 1; i <= N; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i <= N + 1; ++i) {
for (int j = 0; j <= K + 1; ++j) {
for (int e = 0; e < 2; ++e) {
for (int c1 = 0; c1 < 2; ++c1) {
for (int c2 = 0; c2 < 2; ++c2) {
dp[i][j][e][c1][c2] = -inf;
if (j == 0 && e == 0) {
dp[i][j][e][c1][c2] = 0;
}
}
}
}
}
}
int ans = -inf;
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= K; ++j) {
for (int e = 0; e < 2; ++e) {
for (int c1 = 0; c1 < 2; ++c1) {
for (int c2 = 0; c2 < 2; ++c2) {
if (dp[i][j][e][c1][c2] == -inf) continue;
if (j == 0) {
dp[i + 1][j + 1][1][c1][c2] =
max(dp[i + 1][j + 1][1][c1][c2], s[c2] * a[i + 1]);
} else if (j <= K - 1) {
dp[i + 1][j][1][c1][c2] =
max(dp[i + 1][j][1][c1][c2],
(j == 1 ? 0 : -s[c1] * a[i + 1]) + s[c2] * a[i + 1] +
dp[i][j][e][c1][c2]);
if (e == 0)
dp[i + 1][j][e][c1][c2] =
max(dp[i + 1][j][e][c1][c2], dp[i][j][e][c1][c2]);
if (e != 0) {
for (int x = 0; x < 2; ++x) {
dp[i + 1][j + 1][0][c2][x] =
max(dp[i + 1][j + 1][0][c2][x], dp[i][j][e][c1][c2]);
dp[i + 1][j + 1][1][c2][x] = max(
dp[i + 1][j + 1][1][c2][x],
-s[c2] * a[i + 1] + (j == K - 1 ? 0 : s[x] * a[i + 1]) +
dp[i][j][e][c1][c2]);
}
}
} else if (j == K) {
dp[i + 1][j][1][c1][c2] =
max(dp[i + 1][j][1][c1][c2],
-s[c1] * a[i + 1] + dp[i][j][e][c1][c2]);
if (e == 0)
dp[i + 1][j][e][c1][c2] =
max(dp[i + 1][j][e][c1][c2], dp[i][j][e][c1][c2]);
}
}
}
}
}
}
for (int i = 0; i <= N; ++i) {
for (int c1 = 0; c1 < 2; ++c1) {
for (int c2 = 0; c2 < 2; ++c2) {
ans = max(ans, dp[i][K][1][c1][c2]);
}
}
}
printf("%d\n", ans);
return 0;
}
| 11 | CPP |
n,k=map(int,input().split())
H=list(map(int,input().split()))
print(sum(h>=k for h in H)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, q;
int a[5005], mxp[5005];
int v[5005][5005], ma[5005][5005];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
v[i][1] = ma[i][i] = a[i];
}
int b = 1;
for (int i = 2; i <= n; i++) {
mxp[i] = b;
if (b * 2 <= i) b *= 2;
}
for (int len = 2; len <= n; len++)
for (int st = 1; st + len - 1 <= n; st++) {
int max_pw = mxp[len];
int x = len - max_pw;
v[st][len] = v[st][x] ^ v[st + max_pw][x];
ma[st][st + len - 1] = v[st][len];
}
for (int len = 2; len <= n; len++)
for (int st = 1; st + len - 1 <= n; st++) {
int &t = ma[st][st + len - 1];
t = max(t, max(ma[st + 1][st + len - 1], ma[st][st + len - 2]));
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int x, y;
scanf("%d%d", &x, &y);
printf("%d\n", ma[x][y]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main()
{
int W, H, N, L[100000] = {};
scanf("%d %d %d", &W, &H, &N);
for(int i = 0; i < N; i++) {
int x, y;
scanf("%d %d", &x, &y);
L[x] = max(L[x], y);
}
int ret = INF, curr = 0;
for(int i = W - 1; i >= 0; i--) {
ret = min(ret, i + curr);
curr = max(curr, L[i]);
}
cout << ret << endl;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
bool first = 1;
for (int i = n; i >= n - k + 1; --i) {
if (first) {
printf("%d", i);
first = !first;
} else
printf(" %d", i);
}
for (int i = 1; i <= n - k; ++i) {
if (first) {
printf("%d", i);
first = !first;
} else
printf(" %d", i);
}
printf("\n");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
void A();
void B();
void C();
void D();
void E();
void F();
int main() {
B();
return 0;
}
void B() {
long long n;
cin >> n;
long long ans = 1LL;
;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
ans *= i;
while (n % i == 0) {
n /= i;
}
}
}
if (n > 1) ans *= n;
cout << ans << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T mceil(T a, T b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
const long long int M = 1e9 + 7;
const long long int N = 2e5 + 5;
const long long int inf = 9e18;
vector<long long int> vis;
vector<vector<long long int> > adj;
void solve() {}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m;
cin >> n >> m;
vector<string> v(n);
for (long long int i = 0; i < n; i++) cin >> v[i];
long long int prex[n][m], sufx[n][m], prey[n][m], sufy[n][m];
long long int count = 0;
for (long long int i = 0; i < n; i++) {
long long int ct = 0;
for (long long int j = 0; j < m; j++) {
if (v[i][j] == '*') {
ct++;
count++;
} else
ct = 0;
prex[i][j] = ct;
}
}
for (long long int i = 0; i < n; i++) {
long long int ct = 0;
for (long long int j = m - 1; j >= 0; j--) {
if (v[i][j] == '*')
ct++;
else
ct = 0;
sufx[i][j] = ct;
}
}
for (long long int j = 0; j < m; j++) {
long long int ct = 0;
for (long long int i = 0; i < n; i++) {
if (v[i][j] == '*')
ct++;
else
ct = 0;
prey[i][j] = ct;
}
}
for (long long int j = 0; j < m; j++) {
long long int ct = 0;
for (long long int i = n - 1; i >= 0; i--) {
if (v[i][j] == '*')
ct++;
else
ct = 0;
sufy[i][j] = ct;
}
}
set<pair<long long int, long long int> > s;
vector<vector<long long int> > ans;
for (long long int i = 1; i < n - 1; i++) {
for (long long int j = 1; j < m - 1; j++) {
if (v[i][j] == '.') continue;
long long int mn =
min({prex[i][j - 1], sufx[i][j + 1], prey[i - 1][j], sufy[i + 1][j]});
if (mn > 0) {
ans.push_back({i + 1, j + 1, mn});
for (long long int k = i; k < i + mn + 1; k++) s.insert({k, j});
for (long long int k = i; k >= i - mn; k--) s.insert({k, j});
for (long long int k = j; k < j + mn + 1; k++) s.insert({i, k});
for (long long int k = j; k >= j - mn; k--) s.insert({i, k});
}
}
}
if ((int)((s).size()) < count) {
cout << -1 << "\n";
return 0;
}
cout << (int)((ans).size()) << "\n";
for (long long int i = 0; i < (int)((ans).size()); i++) {
for (long long int j = 0; j < (int)((ans[i]).size()); j++)
cout << ans[i][j] << " ";
cout << "\n";
}
}
| 11 | CPP |
from math import *
from collections import *
import sys
sys.setrecursionlimit(10**9)
t = int(input())
for y in range(t):
d,n = map(int,input().split())
x = int(sqrt(n))
ans = x-1 + ceil(n/x)
#print(ans)
if(ans > d): print("NO")
else: print("YES")
| 7 | PYTHON3 |
#include <string.h>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int kMaxV = 10010;
int v, e, source = 0, dfs_clock = 0;
vector<int> g[kMaxV];
int pre[kMaxV] = {0};
int low[kMaxV] = {0};
int parent[kMaxV];
vector<int> is_cut;
void DFS(int u, int father) {
int child_num = 0;
++dfs_clock;
pre[u] = dfs_clock;
low[u] = dfs_clock;
for (int v: g[u]) {
if (!pre[v]) {
++child_num;
parent[v] = u;
DFS(v, u);
low[u] = min(low[u], low[v]);
if (low[v] >= pre[u]) {
is_cut.push_back(u);
}
} else if (v != father) {
low[u] = min(low[u], pre[v]);
}
}
if (father < 0 && child_num == 1) {
is_cut.erase(remove(is_cut.begin(), is_cut.end(), source), is_cut.end());
}
}
void ArticulationVertex() {
memset(parent, source, sizeof(parent));
DFS(source, -1);
sort(is_cut.begin(), is_cut.end());
is_cut.erase(unique(is_cut.begin(), is_cut.end()), is_cut.end());
}
int main() {
scanf("%d %d", &v, &e);
for (int i = 0; i < e; ++i) {
int s, t;
scanf("%d %d", &s, &t);
g[s].push_back(t);
g[t].push_back(s);
}
ArticulationVertex();
for (auto u: is_cut) {
printf("%d\n", u);
}
return 0;
}
| 0 | CPP |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=100010;
int n,ck=2,suma,sumb,tota,totb,fxor,ans,f[N],siz[N],a[N],b[N],lsha[N],lshb[N];
int find(int x){
return x==f[x]?x:f[x]=find(f[x]);
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
lsha[i]=a[i];
suma^=a[i];
}
for(int i=1;i<=n;i++){
scanf("%d",b+i);
lshb[i]=b[i];
sumb^=b[i];
if(a[i]!=b[i])
ans++;
}
if(!ans){
puts("0");
return 0;
}
++n;
lsha[n]=a[n]=suma,lshb[n]=b[n]=sumb;
sort(lsha+1,lsha+n+1);
sort(lshb+1,lshb+n+1);
for(int i=1;i<=n;i++){
if(lsha[i]!=lshb[i]){
puts("-1");
return 0;
}
}
tota=unique(lsha+1,lsha+n+1)-(lsha+1);
for(int i=1;i<=tota;i++)
siz[f[i]=i]=1;
for(int i=1;i<=n;i++){
a[i]=lower_bound(lsha+1,lsha+tota+1,a[i])-lsha,b[i]=lower_bound(lsha+1,lsha+tota+1,b[i])-lsha;
int fx=find(a[i]),fy=find(b[i]);
if(fx!=fy){
f[fx]=fy;
siz[fy]+=siz[fx];
}
}
if(a[n]==b[n]&&siz[find(a[n])]==1)
ans++;
for(int i=1;i<=n;i++){
int fi=find(i);
if(i==fi&&siz[fi]>1)
ans++;
}
printf("%d",ans-1);
return 0;
} | 0 | CPP |
n=int(input())
l1=[]
for i in range(n):
s=str(input())
l1.append(s)
l2=[]
for i in range(n):
s=str(input())
l2.append(s)
for t in l1:
if t in l2:
l2.remove(t)
print (len(l2))
| 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort()
sums=[0]*n
mini=10000
for i in range(n):
sums[i]=abs(a[i-1]-a[i])
mini=min(mini,sums[i])
print(mini)
| 8 | PYTHON3 |
#data and definitions
n, k = map(int,input().split())
houses = map(int,input().split())
counter = 0
previous_color = None
temporary_counter = 0
#main idea
for color in houses:
if previous_color != color:
if (temporary_counter == 0) and (previous_color != None):
temporary_counter += 2
else:
temporary_counter += 1
else:
temporary_counter = 0
if counter < temporary_counter:
counter = temporary_counter
previous_color = color
#answer
print(counter)
| 20 | PYTHON3 |
a=input()
b=input()
if a==b[::-1]:
print("YES")
else:
print('NO') | 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n=int(input())
s=list(map(int,input().split()))
s.sort()
ans=float("INF")
for i in range(n-1):
ans=min(ans,s[i+1]-s[i])
print(ans) | 8 | PYTHON3 |
n = int(input())
h = int(input())
w = int(input())
print(max(0, n-h+1) * max(0, n-w+1)) | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 100005;
int a[N], b[N];
int x[N], y[N];
int cnt = 0;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
for (int i = 1; i <= n; i++) {
x[i] = x[i - 1];
if (b[i]) x[i] += a[i];
}
for (int i = n; i > 0; i--) {
y[i] = y[i + 1];
if (b[i]) y[i] += a[i];
}
int ans = 0;
for (int i = 1; i <= k; i++) cnt += a[i];
for (int i = k; i <= n; i++) {
ans = max(ans, cnt + x[i - k] + y[i + 1]);
cnt -= a[i - k + 1];
cnt += a[i + 1];
}
cout << ans << endl;
return 0;
}
| 8 | CPP |
n=int(input())
arr=list(map(int,input().split()))
g=[[] for i in range(100)]
for i in range(2*n):
g[arr[i]].append(i)
x=0
y=0
curr=1
r=[]
for i in range(10,100):
if len(g[i])==1:
arr[g[i][0]]=curr
if curr==1:
x+=1
else:
y+=1
curr=3-curr
if len(g[i])>1:
arr[g[i][0]]=1
arr[g[i][1]]=2
x+=1
y+=1
for j in range(2,len(g[i])):
r.append(g[i][j])
for i in range(len(r)):
arr[r[i]]=2-(i%2)
print(x*y)
print(*arr) | 8 | PYTHON3 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=1e5+50;
int n,a[N];LL s[N],ans,now;
int main(){
scanf("%d",&n);
for(int i=0;i<=n;i++)scanf("%d",&a[i]);
for(int i=n;i;i--)s[i]=s[i+1]+a[i];
for(int i=0;i<=n;i++){
now=i?min(now*2,s[i]):1,ans+=now;
if(now<a[i])puts("-1"),exit(0);
now-=a[i];
}
cout<<ans;
return 0;
} | 0 | CPP |
n = int(input())
k = list(map(int,input().split()))
count = 0
max_ = k[0]
min_ = k[0]
for i in range(1,len(k)):
if k[i] > max_:
max_ = k[i]
count+=1
if k[i] < min_:
min_=k[i]
count+=1
print(count)
| 7 | PYTHON3 |
n,k = map(int,input().split())
a = list(map(int,input().split()))
count = 0
for i in range(n):
if a[i]<=k:
count+=1
else:
break
if count == n:
print(count)
quit()
for i in range(n-1,-1,-1):
if a[i]<=k:
count+=1
else:
break
print(count) | 7 | PYTHON3 |
n = int(input())
numbers = list(map(int, input().split()))
a, b, = 0, 0
answer = 'YES'
for number in numbers:
if(number == 25):
a +=1
elif(number == 50):
if(a > 0):
a -=1
b +=1
else:
answer = 'NO'
break
else:
if((b > 0 and a > 0)):
b -=1
a -=1
elif(a>2):
a -=3
else:
answer = 'NO'
print(answer)
| 7 | PYTHON3 |
import math as mt
import sys,string,bisect
input=sys.stdin.readline
from collections import deque
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
a,b=M()
k=a
c=0
d=0
while(a%2==0):
a//=2
c+=1
while(a%5==0):
a//=5
d+=1
if(c<b):
k*=2**(b-c)
if(d<b):
k*=5**(b-d)
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100001], n;
bool func(double val, int &k) {
double x = a[k == 0];
for (int i = (k != -1) + 1; i < n; i++) {
if (fabs(x * val - a[i]) < 1e-6)
x = a[i];
else if (k != -1)
return false;
else
k = i;
}
return true;
}
double findb(double x, double y) {
if (fabs(x) < 0.5 || fabs(y) < 0.5)
return 0;
else
return y / x;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
if (n == 1) {
cout << "0\n";
return 0;
}
double b;
int k = -1;
b = findb(a[0], a[1]);
if (func(b, k) == true) {
if (k == -1)
cout << "0\n";
else
cout << "1\n";
return 0;
}
if (n > 2) {
k = 1;
b = findb(a[0], a[2]);
if (func(b, k) == true) {
cout << "1\n";
return 0;
}
k = 0;
b = findb(a[1], a[2]);
if (func(b, k) == true) {
cout << "1\n";
return 0;
}
}
cout << "2\n";
return 0;
}
| 10 | CPP |
t = int(input())
for i in range(t):
n, x = map(int, input().split(' '))
counter = 0
s = 0
li = [int(b) for b in input().split()]
for k in li:
if k == x:
counter += 1
s += k
if counter == n:
print(0)
elif counter > 0 or s == n * x:
print(1)
else:
print(2) | 9 | PYTHON3 |
from heapq import *
from collections import *
import os
import sys
from io import BytesIO, IOBase
import math
ins = lambda: [int(x) for x in input()]
t = lambda: int(input())
inps = lambda: [int(x) for x in input().split()]
def main():
for i in range(t()):
n=t()
if n<3:
print(0)
else:
if n%2&1:
print(n//2)
else:
print(n//2-1)
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using std::max;
using std::min;
using std::sort;
using std::swap;
template <typename T>
void read(T &x) {
long long flag = 1;
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') flag = -flag;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= flag;
}
const long long N = 1e5 + 10, _ = 1e3 + 10;
long long n, m, b[N], a[N];
double ans, f[N][110];
long long C[_][_];
signed main() {
read(n), C[0][0] = 1;
for (long long i = 1; i <= 1000; ++i) {
C[i][0] = 1;
for (long long j = 1; j <= i; ++j) C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
}
for (long long i = 1; i <= n; ++i)
read(a[i]), b[i] = a[i], f[i][a[i]] = 1, ans += f[i][0];
read(m);
long long u, v, k;
while (m--) {
read(u), read(v), read(k);
ans -= f[u][0];
for (long long i = 0; i <= a[u]; ++i) {
double tmp = 0, t = C[b[u]][k];
for (long long j = 0; j <= k; ++j) {
if (b[u] - i - j < 0) continue;
tmp =
(tmp + 1. * f[u][i + j] * C[i + j][j] * C[b[u] - i - j][k - j] / t);
}
f[u][i] = tmp;
}
b[u] -= k, b[v] += k, ans += f[u][0];
printf("%.10lf\n", ans);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, c = 0;
cin >> t;
string s;
for (int i = 0; i < t; i++) {
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (s[j] == 'N') c++;
}
if (c == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
c = 0;
}
return 0;
}
| 7 | CPP |
def solve(arr, res, n, m):
ans = []
for i in range(m):
temp = 0
for j in range(n):
temp += ord(arr[j][i])
for j in range(n-1):
temp -= ord(res[j][i])
ans += chr(temp)
temp = ""
for x in ans:
temp += x
return temp
t = int(input())
for _ in range(t):
n,m = map(int,input().split())
arr = []
for _ in range(n):
arr.append(input())
res = []
for _ in range(n-1):
res.append(input())
print(solve(arr,res, n, m))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, k, p, i, j, h[N], a[N], lst[N];
long long L, R, M, ct[N], nw[N];
priority_queue<pair<int, int> > q;
int main() {
scanf("%d%d%d%d", &n, &m, &k, &p);
for (i = 1; i <= n; ++i)
scanf("%d%d", h + i, a + i), R = max(R, h[i] + 1ll * a[i] * m);
for (; L < R;) {
M = L + R >> 1;
for (; !q.empty(); q.pop())
;
long long s = 0;
for (i = 1; i <= n; ++i)
s += ct[i] = max(0ll, (h[i] - (M - 1ll * a[i] * m) + p - 1) / p);
if (s > m * k) {
L = M + 1;
continue;
}
for (i = 1; i <= n; ++i)
if (ct[i])
nw[i] = M, lst[i] = m + 1,
q.push(pair<int, int>(max(0ll, m - M / a[i] + 1), i));
for (i = m; i; --i) {
for (j = 0; j < k && !q.empty();) {
if (q.top().first > i) break;
int u = q.top().second;
q.pop();
nw[u] -= (lst[u] - i) * a[u];
nw[u] += p;
--ct[u];
++j;
lst[u] = i;
if (ct[u]) q.push(pair<int, int>(max(0ll, i - nw[u] / a[u]), u));
}
if (!q.empty() && j < k) break;
}
if (i)
L = M + 1;
else
R = M;
}
printf("%lld\n", L);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, a, b, res, t;
int main() {
cin >> n;
for (long i = 1; i <= n; i++) {
cin >> a >> b;
res = 0;
if (a < b) {
t = b;
b = a;
a = t;
}
while (a > 0 && b > 0) {
t = a - b;
res += t / b + 1;
int tmp = a;
a = b;
b = tmp - (t / b + 1) * b;
}
cout << res << "\n";
}
}
| 7 | CPP |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
while (cin >> s) {
string ox = "ox";
string res = "d";
for (int i=0; i<2; ++i) {
bool ok = false;
if (s[0] == ox[i] && s[0] == s[1] && s[1] == s[2]) ok = true;
if (s[3] == ox[i] && s[3] == s[4] && s[4] == s[5]) ok = true;
if (s[6] == ox[i] && s[6] == s[7] && s[7] == s[8]) ok = true;
if (s[0] == ox[i] && s[0] == s[3] && s[3] == s[6]) ok = true;
if (s[1] == ox[i] && s[1] == s[4] && s[4] == s[7]) ok = true;
if (s[2] == ox[i] && s[2] == s[5] && s[5] == s[8]) ok = true;
if (s[0] == ox[i] && s[0] == s[4] && s[4] == s[8]) ok = true;
if (s[2] == ox[i] && s[2] == s[4] && s[4] == s[6]) ok = true;
if (ok) res = ox[i];
}
cout << res << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
vector<vector<long long>> g;
vector<long long> vis;
vector<long long> ord;
void dfs(long long x) {
vis[x] = 1;
for (auto it : g[x]) {
if (!vis[it]) dfs(it);
}
ord.push_back(x);
}
void solve() {
long long n, m, i;
i = 0;
cin >> n >> m;
g = vector<vector<long long>>(n);
vector<pair<long long, long long>> edge;
for (long long i = 0; i < m; ++i) {
long long t, x, y;
cin >> t >> x >> y;
--x, --y;
if (t == 1) {
g[x].push_back(y);
}
edge.push_back({x, y});
}
ord.clear();
vis = vector<long long>(n);
for (long long i = 0; i < n; ++i) {
if (!vis[i]) dfs(i);
}
reverse(ord.begin(), ord.end());
vector<long long> pos(n);
for (long long i = 0; i < n; ++i) {
pos[ord[i]] = i;
}
bool ok = false;
for (long long i = 0; i < n; ++i) {
for (auto j : g[i]) {
if (pos[i] > pos[j]) ok = true;
}
}
if (ok) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
for (auto [x, y] : edge) {
if (pos[x] < pos[y])
cout << x + 1 << " " << y + 1 << "\n";
else
cout << y + 1 << " " << x + 1 << "\n";
}
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 100 + 10;
long long dp[N][N], n, a[N], comb[N][N], mark[N][N];
long long C(int i, int j) {
if (i > j || j < 0) return 0;
if (!i || i == j) return 1;
if (mark[i][j]) return comb[i][j];
mark[i][j] = 1;
return comb[i][j] = (C(i - 1, j - 1) + C(i, j - 1)) % mod;
}
int main() {
cin >> n;
for (int i = 0; i < 10; i++) cin >> a[i];
for (int i = a[9]; i <= n; i++) dp[i][9] = 1;
for (int i = 0; i <= n; i++)
for (int j = 8; j >= 0; j--)
for (int k = a[j]; k <= i; k++)
dp[i][j] += dp[i - k][j + 1] * C(k, i - (j == 0 ? 1 : 0)),
dp[i][j] %= mod;
long long ans = 0;
for (int i = 1; i < n + 1; i++) ans += dp[i][0], ans %= mod;
cout << ans << endl;
}
| 8 | CPP |
n = int(input())
arr = list(map(int,input().split()))
ind = []
maxx = max(arr)
for i in range(n):
if arr[i]==maxx:
ind+=[i]
ans = []
maxx = 0
for x in range(n):
t = arr[:]
for i in range(x-1,-1,-1):
if t[i]>t[i+1]:
t[i] = t[i+1]
for i in range(x+1,n):
if t[i]>t[i-1]:
t[i] = t[i-1]
if sum(t)>maxx:
maxx = sum(t)
ans = t[:]
print(*ans) | 9 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int a, b, c, d;
int x, y, z;
scanf("%d%d%d%d", &a, &b, &c, &d);
if ((a + c) == b * 2 && (b + d) == c * 2) {
printf("%d", (2 * d) - c);
} else if ((b * b == a * c) && (c * c == b * d) && ((d * d) % c == 0)) {
printf("%d", (d * d) / c);
} else
printf("42");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
inline int getint() {
int x = 0, p = 1;
char c = getchar();
while (c <= 32) c = getchar();
if (c == 45) p = -p, c = getchar();
while (c > 32) x = x * 10 + c - 48, c = getchar();
return x * p;
}
using namespace std;
const int N = 2e5 + 5;
int cnt, n, m, k, R[N], in[N], l[N], r[N], vis[N], ans[N];
queue<int> qu;
vector<int> G[N], oG[N], id, g[N];
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
pq;
void finit() {
n = getint();
m = getint();
k = getint();
for (int(i) = 0; (i) < (n); (i)++) R[i] = getint();
for (int(i) = 0; (i) < (m); (i)++) {
int x = getint() - 1, y = getint() - 1;
in[y]++;
oG[y].push_back(x);
G[x].push_back(y);
}
for (int(i) = 0; (i) < (n); (i)++)
if (!in[i]) {
id.push_back(i);
cnt++;
qu.push(i);
}
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for (int(i) = 0; (i) < (G[u].size()); (i)++) {
int to = G[u][i];
in[to]--;
if (!in[to]) {
cnt++;
id.push_back(to);
qu.push(to);
}
}
}
if (k > n) {
printf("%d\n", -1);
exit(0);
}
if (cnt != n) {
printf("%d\n", -1);
exit(0);
}
for (int i = n - 1; i >= 0; i--) {
int x = id[i];
l[x] = 1;
for (int(j) = 0; (j) < (G[x].size()); (j)++) {
int to = G[x][j];
l[x] = max(l[to] + 1, l[x]);
}
if (l[x] > k) {
printf("%d\n", -1);
exit(0);
}
if (R[x] > 0) {
if (l[x] > R[x]) {
printf("%d\n", -1);
exit(0);
}
l[x] = R[x];
}
g[l[x]].push_back(x);
}
for (int(i) = 0; (i) < (n); (i)++) {
int x = id[i];
r[x] = k;
for (int(j) = 0; (j) < (oG[x].size()); (j)++) {
int to = oG[x][j];
r[x] = min(r[to] - 1, r[x]);
}
if (r[x] <= 0) {
printf("%d\n", -1);
exit(0);
}
if (R[x] > 0) {
if (r[x] < R[x]) {
printf("%d\n", -1);
exit(0);
}
r[x] = R[x];
}
}
}
void solve() {
for (int ii = 1; ii <= k; ii++) {
for (int i : g[ii]) pq.push(make_pair(r[i], i));
bool flag = false;
while (pq.size()) {
pair<int, int> u = pq.top();
if (u.first != ii) break;
ans[u.second] = ii;
flag = true;
pq.pop();
}
if (!flag) {
if (pq.empty()) {
printf("%d\n", -1);
exit(0);
}
pair<int, int> u = pq.top();
pq.pop();
ans[u.second] = ii;
}
}
for (int(i) = 0; (i) < (n); (i)++) printf("%d ", ans[i]);
}
int main() {
finit();
solve();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
long int pos_count[100001], neg_count[100001];
int main() {
long int n, count = 0, i;
scanf("%ld", &n);
long int arr[n];
for (i = 0; i < n; i++) {
scanf("%ld", &arr[i]);
if (arr[i] > 0)
pos_count[arr[i]]++;
else if (arr[i] < 0)
neg_count[-arr[i]]++;
}
for (i = 0; i < 100001; i++) {
if (pos_count[i] > 0) count++;
if (neg_count[i] > 0) count++;
}
printf("%ld\n", count);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long f = 1, sum = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
return sum * f;
}
const int MAXN = 25;
const int Mod = 1e9 + 7;
long long a[MAXN];
int quickpow(long long a, long long b) {
int tmp = 1;
while (b) {
if (b & 1) tmp = (long long)(tmp * a) % Mod;
b /= 2;
a = (long long)(a * a) % Mod;
}
return tmp;
}
long long C(int n, int m) {
if (n > m) return 0;
if (n > m - n) n = m - n;
long long a = 1, b = 1;
for (int i = 1; i <= n; i++) a = a * i % Mod, b = b * (m - i + 1) % Mod;
return b * quickpow(a, Mod - 2) % Mod;
}
int lucas(long long n, long long m) {
if (!n) return 1;
return ((long long)C(n % Mod, m % Mod) * lucas(n / Mod, m / Mod)) % Mod;
}
int main() {
int n;
long long s;
scanf("%d%I64d", &n, &s);
for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
long long ans = 0;
for (int i = 0; i < (1 << n); i++) {
long long sig = 1, sum = s;
for (int j = 1; j <= n; j++)
if (i & (1 << (j - 1))) sum -= a[j] + 1, sig = -sig;
if (sum >= 0)
ans = (ans + (lucas(n - 1, sum + n - 1) * sig) % Mod + Mod) % Mod;
}
cout << ans;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
int main() {
int n, a[200003], i, min = 2000000000, mincount = 2000000000, count,
last = -1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] < min) min = a[i];
}
for (i = 0; i < n; i++) {
if (a[i] == min) {
if (last == -1) {
last = i;
} else {
count = i - last;
last = i;
if (count < mincount) mincount = count;
}
}
}
printf("%d\n", mincount);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, now, tmp;
int s[1005], d[1005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> s[i] >> d[i];
for (int i = 1; i <= n; i++) {
if (now < s[i])
now = s[i];
else {
tmp = now - s[i];
tmp = tmp / d[i];
tmp++;
now = tmp * d[i] + (s[i]);
}
}
cout << now << endl;
return 0;
}
| 7 | CPP |
n = input()
s = input()
A = 0
D = 0
for i in s:
if i == "A":
A += 1
else:
D += 1
if A > D:
print("Anton")
elif A < D:
print("Danik")
else:
print("Friendship") | 7 | PYTHON3 |
n, t = map(int, input().split())
a = list(map(int, input().split()))
i = 0
while t>0:
t-=86400-a[i]
i+=1
print(i) | 7 | PYTHON3 |
#Written by Shagoto
t = int(input())
for x in range(t):
n = int(input())
s = input()
if(n == 1):
print(s)
else:
for i in range(0, len(s), 2):
print(s[i], end = "")
print() | 7 | PYTHON3 |
t = int(input())
ans = []
def f(s):
odds = 0
e = 0
new = ''
for i in s:
if int(i)%2==1:
odds+=1
else: e +=1
if odds % 2 == 0:
j = len(s)-1
found = -1
while j >= 0 :
if int(s[j]) % 2 == 1:
found = j
break
else: j -= 1
if found > -1:
i = 0
while i <= found:
new += s[i]
i += 1
else:
new = '-1'
else:
if odds == 1:
return '-1'
else:
l = 0
for i in s:
if int(i) % 2 == 1:
new += i
l += 1
if l == 2:
break
return new
for i in range(t):
n = input()
s = input()
ans.append(f(s))
for element in ans:
print(element)
| 7 | PYTHON3 |
def solve(x, queries):
surplus = [0] * x
mex = 0
for q in queries:
surplus[q % x] += 1
while surplus[mex % x] > 0:
surplus[mex % x] -= 1
mex += 1
yield mex
if __name__ == '__main__':
q, x = map(int, input().split())
for result in solve(x, [int(input()) for i in range(q)]):
print(result)
| 10 | PYTHON3 |
n = int(input())
pr = list(map(lambda a, b: int(a) - int(b), input().split(), input().split()))
pr.sort()
ptr = n - 1
ans = 0
for i in range(n):
while ptr >= 0 and pr[ptr] > -pr[i]:
ptr -= 1
ans += n - 1 - max(ptr, i)
print(ans)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
#define inf 1000000000 //1E+9
using namespace std;
int main(){
int n,a,b;cin>>n>>a>>b;
cout<<min(a,b)<<" "<<max(0,a+b-n)<<endl;
return 0;
} | 0 | CPP |
#include <stdio.h>
int main(){
int n;scanf("%d",&n);printf("%d\n",n&1?1+n>>1:n>>1);return 0;
} | 0 | CPP |
t=int(input())
for _ in range(t):
x,n,m=map(int,input().split())
if(x<=20):
while(x>0 and m>0):
x-=10
m-=1
if(x>0):
print("NO")
else:
print("YES")
else:
while(x>20 and n>0):
x=x//2+10
n-=1
while(x>0 and m>0):
x-=10
m-=1
if(x>0):
print("NO")
else:
print("YES") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> graph[1001];
bool BFS(int source) {
int visited[1001];
queue<int> Q;
memset(visited, 0, sizeof(visited));
Q.push(source);
visited[source] = 1;
while (!Q.empty()) {
int u = Q.front();
Q.pop();
if (graph[u].size() == 0) continue;
int nonleaf = 0;
for (int i = 0; i < graph[u].size(); i++) {
int v = graph[u][i];
if (visited[v] == 0) {
visited[v] = 1;
Q.push(v);
if (graph[v].size() == 0) nonleaf++;
}
}
if (nonleaf < 3) return 0;
}
return 1;
}
int main() {
int N;
cin >> N;
int x;
for (int i = 2; i <= N; i++) {
cin >> x;
graph[x].push_back(i);
}
bool ans = BFS(1);
if (ans == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long INF = 1e18 + 7;
int main() {
long long a, ta, b, tb;
cin >> a >> ta >> b >> tb;
long long h, m, t;
scanf("%lld:%lld", &h, &m);
t = h * 60 + m;
long long to = t + ta;
t -= tb;
long long res = 0;
t++;
while (t < (to)) {
long long T = t - 300;
if (300 <= t && t < 1440 && T % b == 0) res++;
t++;
}
cout << res;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
long int n;
int k, i;
scanf("%ld%d", &n, &k);
for (i = 1; i <= k;) {
if (n % 10 != 0) {
n = n - 1;
i++;
} else if (n % 10 == 0) {
n = n / 10;
i++;
}
}
printf("%ld", n);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+10;
struct sc
{
ll x,y;
}p[N];
ll vis[N],m,a[N],b[N];
ll sum[N];
int main()
{
//freopen("i.txt","r",stdin);
scanf("%lld",&m);
for(int i=0; i<m; i++)
{
scanf("%lld %lld",&p[i].x,&p[i].y);
vis[p[i].x]++;
vis[p[i].y]--;
a[p[i].x]++;
b[p[i].y]++;
}
ll ans1=0,ans2=0;
for(int i=1; i<=100000; i++)
{
vis[i]+=vis[i-1];
ans2=max(vis[i],ans2);
a[i]+=a[i-1];
b[i]+=b[i-1];
}
for(int i=0; i<m; i++)
ans1=max(ans1,m-a[100000]+a[p[i].y-1]-b[p[i].x]);
printf("%lld %lld\n",ans1,ans2);
}
| 0 | CPP |
n=int(input())
b=[]
for i in range(n):
a= list(map(int, input().split()))
a.append(i+1)
b.append(a)
def fn(a):
return a[3]
b.sort(key=fn)
def fn1(b,n):
for i in range(n):
for j in range(n):
c=0
for k in range(3):
if b[i][k]<b[j][k]:c+=1
if c==3:break
if j==n-1:return b[i][4]
print(fn1(b,n))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;bitset<55560>p;int main(){int n;scanf("%d",&n);printf("2");for(int i=2;n>1;++i){if(p[i])continue;if(i%10==1){printf(" %d",i);--n;}for(int j=i*i;j<=55555;j+=i)p[j]=1;}return 0;} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3005;
const long long INF = 1e18;
long long f[maxn][maxn];
int a[maxn], b[maxn];
int N;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%d", &a[i]), a[i] -= i, b[i] = a[i];
sort(b + 1, b + N + 1);
for (int i = 0; i <= N; i++)
for (int j = 0; j <= N; j++) f[i][j] = INF;
for (int i = 0; i <= N; i++) f[0][i] = 0ll;
for (int i = 1; i <= N; i++) {
long long mini = INF;
for (int j = 1; j <= N; j++) {
mini = min(mini, f[i - 1][j]);
f[i][j] = mini + (long long)abs(a[i] - b[j]);
}
}
long long ans = INF;
for (int i = 1; i <= N; i++) ans = min(ans, f[N][i]);
printf("%lld", ans);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chkMax(T &x, T y) {
return (y > x) ? x = y, 1 : 0;
}
template <typename T>
bool chkMin(T &x, T y) {
return (y < x) ? x = y, 1 : 0;
}
template <typename T>
void inline read(T &x) {
int f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
x *= f;
}
const int N = 10, M = 10000;
int n, m, ans[M];
pair<int, int> c[M];
long long x[N], val;
int s[N][M];
int main() {
int T;
read(T);
while (T--) {
val = -9e18;
read(n), read(m);
for (int i = 0; i < n; i++) read(x[i]);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%1d", &s[i][j]);
for (int i = 0; i < (1 << n); i++) {
long long ret = 0;
for (int j = 0; j < m; j++) c[j].first = 0, c[j].second = j;
for (int j = 0; j < n; j++) {
int t = (i >> j & 1) ? 1 : -1;
for (int k = 0; k < m; k++) {
if (s[j][k]) c[k].first += t;
}
if (t == 1)
ret -= x[j];
else
ret += x[j];
}
sort(c, c + m);
for (int j = 0; j < m; j++) ret += c[j].first * (j + 1ll);
if (chkMax(val, ret)) {
for (int j = 0; j < m; j++) ans[c[j].second] = j;
}
}
for (int i = 0; i < m; i++) printf("%d ", ans[i] + 1);
puts("");
}
return 0;
}
| 11 | CPP |
import sys
N,M=map(int,input().split())
come=[0]*N
for i in range(M):
ab=list(map(int,input().split()))
if ab[0]==1:
if come[ab[1]]:
print("POSSIBLE")
sys.exit()
come[ab[1]]=1
if ab[1]==N:
if come[ab[0]]:
print("POSSIBLE")
sys.exit()
come[ab[0]]=1
print("IMPOSSIBLE") | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, si, sj;
char g[1001][1001];
bool v[1000][1000][5][3];
int dx[4] = {0, -1, 0, 1}, dy[4] = {-1, 0, 1, 0};
bool ok = false;
void dfs(int i, int j, int d, int t) {
if (t > 2) return;
if (i < 0 || i >= n || j < 0 || j >= m) return;
if ('*' == g[i][j]) return;
if ('T' == g[i][j]) ok = true;
if (v[i][j][d][t]) return;
v[i][j][d][t] = true;
for (int k = 0; k < 4; ++k)
dfs(i + dx[k], j + dy[k], k, t + (d != 4 && d != k));
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", g[i]);
for (int j = 0; j < m; ++j)
if (g[i][j] == 'S') si = i, sj = j;
}
dfs(si, sj, 4, 0);
printf(ok ? "YES\n" : "NO\n");
}
| 8 | CPP |
N = int(input())
Q = [[int(x) for x in input().split()] for _ in range(N)]
for i in range(N):
a,b = Q[i]
if a==b:
print((a-1)*2)
continue
c = int((a*b)**0.5)
if a>c and b>c:
if c*(c+1)<a*b:
print(c*2)
else:
print(c*2-1)
else:
if c*(c+1)<a*b:
print(c*2-1)
else:
if c**2==a*b:
print(c*2-3)
else:
print(c*2-2)
| 0 | PYTHON3 |
import sys
import heapq
input = sys.stdin.readline
a = list(set(map(int, input().split())))
k = len(a)
n = int(input())
b = list(set(map(int, input().split())))
n = len(b)
a.sort()
b.sort()
c = [0 for i in range(n)]
mn = float("inf")
pq = []
for i in range(n):
heapq.heappush(pq, (- b[i] + a[c[i]], i))
mn = min(mn, b[i] - a[c[i]])
x = float("inf")
while True:
td = heapq.heappop(pq)
i = td[1]
x = min(x, -td[0] - mn)
c[i] += 1
if c[-1] == k:
break
mn = min(b[i] - a[c[i]], mn)
heapq.heappush(pq, (- b[i] + a[c[i]], i))
print(x) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string str[2005];
int row1[2005], col1[2005];
int row2[2005], col2[2005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cin >> n;
for (int i = 0; i < n; i++) cin >> str[i];
int cnt = 0;
for (int j = 0; j < n - 1; j++) {
int px = j, py = n - 1;
while (px >= 0 and py >= 0) {
int bit = str[px][py] - '0';
if ((row1[px] + col1[py]) % 2 == 1) bit = 1 - bit;
if (bit == 1) {
row1[px]++;
col1[py]++;
cnt++;
}
px--;
py--;
}
}
for (int j = 0; j < n - 1; j++) {
int px = n - 1, py = j;
while (px >= 0 and py >= 0) {
int bit = str[px][py] - '0';
if ((row2[px] + col2[py]) % 2 == 1) bit = 1 - bit;
if (bit == 1) {
row2[px]++;
col2[py]++;
cnt++;
}
px--;
py--;
}
}
for (int j = 0; j < n; j++) {
int bit = str[j][j] - '0';
if ((row1[j] + col1[j] + row2[j] + col2[j]) % 2 == 1) bit = 1 - bit;
if (bit == 1) cnt++;
}
cout << cnt << endl;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mx = 2e5 + 6;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n, d;
cin >> n >> d;
vector<int> a(n);
for (long long(i) = 0; (i) < (n); ++(i)) cin >> a[i];
int ans = 0;
for (int i = 1; i < n; ++i) {
int res = a[i] * i;
if (res >= d) {
int ak = d / i;
ans += ak;
break;
} else {
ans += a[i];
d -= a[i] * i;
}
}
cout << ans + a[0] << '\n';
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j;
int n, count = 0;
cin >> n;
char a[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
cin >> a[i][j];
if (a[i][j] == '.') {
count++;
}
}
}
if (count % 5 != 0) {
cout << "NO";
} else {
int tiles = 0;
for (i = 1; i < n - 1; i++) {
for (j = 1; j < n - 1; j++) {
if ((a[i][j] == '.') && (a[i + 1][j] == '.') && (a[i - 1][j] == '.') &&
(a[i][j + 1] == '.') && (a[i][j - 1] == '.')) {
tiles++;
a[i][j] = '#';
a[i - 1][j] = '#';
a[i + 1][j] = '#';
a[i][j - 1] = '#';
a[i][j + 1] = '#';
}
}
}
if (count == (tiles * 5))
cout << "YES";
else {
cout << "NO";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j, temp = 0;
scanf("%d%d", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] + k <= 5) temp++;
}
printf("%d\n", temp / 3);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 100;
int n, m;
char s[N], t[N];
int pre[N], suf[N];
int got(int len) {
for (int i = 1; i + len - 1 <= n; i++)
if (pre[i - 1] + suf[i + len] >= m) return 1;
return 0;
}
int main() {
scanf(" %s %s", s + 1, t);
m = strlen(t);
n = strlen(s + 1);
int idx = 0;
for (int i = 1; i <= n + 1; i++) {
if (idx >= m)
pre[i] = idx;
else {
if (s[i] == t[idx]) idx++;
pre[i] = idx;
}
}
idx = 0;
for (int i = n; i >= 0; i--) {
if (idx >= m)
suf[i] = idx;
else {
if (s[i] == t[m - idx - 1]) idx++;
suf[i] = idx;
}
}
int lo = 0, hi = n, ans;
while (lo <= hi) {
int mid = (lo + hi) >> 1;
if (got(mid))
ans = mid, lo = mid + 1;
else
hi = mid - 1;
}
printf("%d\n", ans);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int getbit(T x, int pos) {
return (x >> (pos - 1)) & 1;
}
template <class T>
void turn_on(T &x, int pos) {
x = x | ((T)1 << (pos - 1));
}
template <class T>
void turn_off(T &x, int pos) {
x = x & ~((T)1 << (pos - 1));
}
int read_int() {
char r;
bool start = false, neg = false;
int ret = 0;
while (true) {
r = getchar();
if ((r - '0' < 0 || r - '0' > 9) && r != '-' && !start) continue;
if ((r - '0' < 0 || r - '0' > 9) && r != '-' && start) break;
if (start) ret *= 10;
start = true;
if (r == '-')
neg = true;
else
ret += r - '0';
}
if (!neg)
return ret;
else
return -ret;
}
long long gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
const long long oo = 1e18 + 7;
const long long MOD = 987654321;
void Dijkstra(int s, vector<pair<long long, long long>> graph[],
vector<long long> &dist, vector<long long> &cnt) {
dist[s] = 0;
cnt[s] = 1;
priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
greater<pair<long long, long long>>>
pq;
pq.push(pair<long long, long long>(0, s));
while (!pq.empty()) {
int u = pq.top().second;
long long du = pq.top().first;
pq.pop();
if (du != dist[u]) continue;
for (auto v : graph[u]) {
if (dist[v.first] >= dist[u] + v.second) {
if (dist[v.first] == dist[u] + v.second) {
cnt[v.first] = (cnt[u] + cnt[v.first]) % MOD;
} else {
dist[v.first] = dist[u] + v.second;
cnt[v.first] = cnt[u];
pq.push(pair<long long, long long>(dist[v.first], v.first));
}
}
}
}
}
int main() {
srand(time(NULL));
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, s, t;
cin >> n >> m >> s >> t;
vector<pair<long long, long long>> graph[n + 1], graph_re[n + 1];
vector<long long> dist(n + 1, oo), dist_re(n + 1, oo), cnt(n + 1, 0),
cnt_re(n + 1, 0);
vector<pair<pair<long long, long long>, long long>> edge;
while (m--) {
int u, v, w;
cin >> u >> v >> w;
graph[u].push_back(pair<long long, long long>(v, w));
graph_re[v].push_back(pair<long long, long long>(u, w));
edge.push_back(pair<pair<long long, long long>, long long>(
pair<long long, long long>(u, v), w));
}
Dijkstra(s, graph, dist, cnt);
Dijkstra(t, graph_re, dist_re, cnt_re);
for (auto x : edge) {
int u = x.first.first;
int v = x.first.second;
int w = x.second;
if (dist[u] + w + dist_re[v] == dist[t] &&
(cnt[u] * cnt_re[v]) % MOD == cnt[t]) {
cout << "YES\n";
continue;
}
long long r = dist[t] - dist[u] - dist_re[v];
if (r <= 1) {
cout << "NO\n";
} else {
cout << "CAN " << w - r + 1 << "\n";
}
}
}
| 11 | CPP |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Aug 9 19:55:54 2020
@author: divyarth
"""
import sys
import heapq
import math
#sys.setrecursionlimit(100000)
#input=sys.stdin.readline
#print=sys.stdout.write
from collections import deque
from collections import defaultdict
from collections import Counter
modH=int(10**9)+7
I=lambda : list(map(int,input().split(' ')))
def PRINT(lst,sep=' '): print(sep.join(map(str,lst)))
for _ in range(int(input())):
n,m=I()
lst=[list(input()) for i in range(n)]
cnt=0
for i in range(n-1):
if lst[i][-1]=='R':
cnt+=1
for i in range(m-1):
if lst[-1][i]=='D':
cnt+=1
print(cnt)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1 << 20;
int n, m;
int arr[SIZE];
int stk;
int stx[SIZE], sty[SIZE];
long long sum[SIZE];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
arr[n] = 0;
stx[0] = -1;
sty[0] = 0;
stk = 1;
for (int i = 0; i <= n; i++) {
int q = arr[i];
while (q < sty[stk - 1]) {
int newlvl = max(q, sty[stk - 2]);
int hgt = sty[stk - 1] - newlvl;
int len = i - stx[stk - 1];
sum[len] += hgt;
sty[stk - 1] -= hgt;
if (sty[stk - 1] == sty[stk - 2]) stk--;
}
if (q > sty[stk - 1]) {
stx[stk] = i;
sty[stk] = q;
stk++;
}
}
long long curr = 0;
for (int i = n; i > 0; i--) {
curr += sum[i];
sum[i] = curr;
}
curr = 0;
for (int i = n; i > 0; i--) {
curr += sum[i];
sum[i] = curr;
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
int ll;
scanf("%d", &ll);
int combs = n - ll + 1;
double res = double(sum[ll]) / combs;
printf("%0.15lf\n", res);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, a;
vector<int> V[N];
int get_same(int x){
sort(V[x].begin(), V[x].end());
int cnt = 1;
int ret = 0;
for(int i=1; i<V[x].size(); i++){
if(V[x][i] == V[x][i-1]){
cnt++;
} else {
ret = ret + cnt / 2;
cnt = 1;
}
}
ret = ret + cnt / 2;
return ret;
}
int cal(int x, int y){
int n = V[x].size();
int m = V[y].size();
int ret = min(n, m);
int a = get_same(x);
int b = get_same(y);
int c = 0;
while(a && b){
if(n > m){
n-=2;
a--;
c++;
} else {
m -= 2;
b--;
c++;
}
ret = max(ret, min(n, m) + c);
}
while(a){
n-=2;
a--;
c++;
ret = max(ret, min(n, m) + c);
}
while(b){
m-=2;
b--;
c++;
ret = max(ret, min(n, m) + c);
}
return ret;
}
int solve(){
int ans = V[0].size() / 2;
for(int i=1; i<m; i++){
int j = m - i;
if(j < i) break;
if(i == j){
ans += V[i].size() / 2;
} else {
ans += cal(i, j);
}
}
return ans;
}
int main(){
while(~scanf("%d %d", &n, &m)){
for(int i=0; i<m; i++){
V[i].clear();
}
for(int i=0; i<n; i++){
scanf("%d", &a);
V[a%m].push_back(a);
}
printf("%d\n", solve());
}
return 0;
}
| 0 | CPP |
n=int(input())
lst=list(map(int,input().split()))
on=0
tw=0
th=0
one=[]
two=[]
three=[]
for i in range(n):
if lst[i]==1:
on+=1
one.append(i)
elif lst[i]==2:
tw+=1
two.append(i)
else:
th+=1
three.append(i)
print(min(on,tw,th))
for j in range(min(on,tw,th)):
print(one[j]+1,end=" ")
print(two[j]+1,end=" ")
print(three[j]+1) | 7 | PYTHON3 |
D = int(input())
print('Christmas' + (' Eve' * (25 - D))) | 0 | PYTHON3 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
int main(){
map<string, int> id;
string A,B;
cin >> A >> B;
int a = 0, b = 1;
id[A] = a, id[B] = b;
int n,v = 2;
cin >> n;
vector< vector<pii> > docs(n);
rep(i,n){
int m; cin >> m;
rep(j,m){
cin >> A >> B;
if(id.count(A) == 0) id[A] = v, v++;
if(id.count(B) == 0) id[B] = v, v++;
docs[i].push_back( make_pair(id[A], id[B]) );
}
}
vector< vector<vi> > inv(v, vector<vi>(v));
rep(i,n){
for(auto x : docs[i]){
inv[x.first][x.second].push_back(i);
}
}
vector<vi> d(v, vi(v,0));
rep(i,v) d[i][i] = 1;
d[a][b] = 1;
vi used_docs(n,0);
queue<int> q;
for(int idx : inv[a][b]){
if(!used_docs[idx]){
used_docs[idx] = 1;
q.push(idx);
}
}
while(q.size()){
int idx = q.front(); q.pop();
for(auto x : docs[idx]){
a = x.first, b = x.second;
if(d[a][b]) continue;
if(d[b][a] == 1){
cout << "No" << endl;
return 0;
}
rep(i,v){
if(d[i][a]==0) continue;
rep(j,v){
if(d[b][j]==0) continue;
if(d[i][j]) continue;
d[i][j] = 1;
for(int nidx : inv[i][j]){
if(used_docs[nidx]) continue;
used_docs[nidx] = 1;
q.push(nidx);
}
}
}
}
}
cout << "Yes" << endl;
} | 0 | CPP |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <set>
typedef long long lld;
const int MAXA = 26;
const int MAXC = 2E5+5;
char buff[MAXC]{ };
int dest[MAXC]{ };
std::deque<int> pos[MAXA]{ };
lld ret=0LL;
int L;
struct BinaryIndexedTree
{
int data[MAXC]{ };
void add(int x)
{
for(int i = x; i <= L; i += i & -i)
++data[i];
}
int get(int x)
{
int sum = 0;
for(int i = x; i >= 1; i -= i & -i)
sum += data[i];
return sum;
}
} bintr;
int main()
{
scanf("%s", buff+1);
L = strlen(buff+1);
for(int i = 1; i <= L; ++i)
pos[buff[i]-'a'].push_back(i);
int odd = -1;
for(int i = 0; i < MAXA; ++i)
if(pos[i].size() & 1)
{
if(odd != -1)
return puts("-1"), 0;
odd = i;
}
if(odd != -1)
{ // Handle Unique Centre
int mid = pos[odd][pos[odd].size() / 2];
for(int i = 0; i < MAXA; ++i)
for(int j = 0; j*2 < (int)pos[i].size(); ++j)
ret += (pos[i][j] > mid) +
(pos[i][(int)pos[i].size()-j-1] < mid);
}
int cnt = 1;
for(int i = 1; i <= L; ++i) if(!dest[i])
{ // Record Destinations
int beg = pos[buff[i]-'a'].front();
int end = pos[buff[i]-'a'].back();
pos[buff[i]-'a'].pop_front();
if(beg == end) continue;
pos[buff[i]-'a'].pop_back();
dest[end] = L-cnt+1;
dest[beg] = cnt++;
}
for(int i = 1; i <= L; ++i) if(dest[i])
{ // Compute Inversions
ret += bintr.get(L-dest[i]+1);
bintr.add(L-dest[i]+1);
}
printf("%lld\n", ret);
return 0;
} | 0 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll i,r,mn=10,ans=0;ll a[6]={0};
for(i=0;i<5;i++){
cin >> a[i];
r = a[i]%10;
if(r<mn&&r>0)mn=r;
ans += a[i]+10-r;
if(r==0)ans -=10;
}
ans -= 10-mn;
cout << ans << endl;
}
| 0 | CPP |
def solve(vectors):
x_count = y_count = z_count = 0
for vector in vectors:
x_count += vector[0]
y_count += vector[1]
z_count += vector[2]
if(x_count==y_count==z_count==0):
return "YES"
else:
return "NO"
if __name__ == "__main__":
cases = int(input())
vectors = []
for x in range(cases):
vector =list(map(int,input().split(" ")))
vectors.append(vector)
print(solve(vectors)) | 7 | PYTHON3 |
n = int(input())
friends = list(map(int, input().split()))
group = {}
for k in range(4):
group[k+1] = friends.count(k+1)
car = group[4]
car += group[3]
if (group[1] - group[3] < 0):
group[1] = 0
else:
group[1] = group[1] - group[3]
car += group[2] // 2
group[2] = group[2] % 2
if (group[2] != 0):
if (group[1] >= 2):
group[1] -= 2
elif (group[1] == 1):
group[1] -= 1
car += 1
car += group[1] // 4
group[1] = group[1] - (group[1] // 4) * 4
if (group[1] > 0):
car += 1
print(car) | 8 | PYTHON3 |
"""A. Subractions
"""
import sys
pairs = int(sys.stdin.readline())
for x in range(pairs):
a, b = map(int, sys.stdin.readline().split(" "))
r = 0
times = 0
rem = 0
while True:
times = max(a, b) // min(a, b)
r += times
rem = max(a, b) % min(a, b)
if rem == 0:
break
a = min(a, b)
b = rem
print(r)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using std::vector;
const int maxn = 1e5 + 1;
struct Edge {
int u, v;
} e[maxn << 1];
int head[maxn], ecnt;
inline void addedge(int u, int v) {
e[++ecnt].v = v;
e[ecnt].u = head[u];
head[u] = ecnt;
}
inline void add(int u, int v) {
addedge(u, v);
addedge(v, u);
}
int fa[maxn], dep[maxn], top[maxn], son[maxn], siz[maxn], vis[maxn],
val[maxn << 2], idx[maxn], id, n, m, a, b, q, bcj[maxn], fx, fy;
inline int find(int x) { return bcj[x] == x ? x : bcj[x] = find(bcj[x]); }
inline void jh(int &x, int &y) { x ^= y ^= x ^= y; }
inline void pushdown(int rt, int l, int r) {
if (val[rt] != (r - l + 1)) return;
val[rt << 1] = (((l + r) >> 1) - l + 1);
val[rt << 1 | 1] = (r - ((l + r) >> 1));
}
inline void pushup(int rt) { val[rt] = val[rt << 1] + val[rt << 1 | 1]; }
inline void update(int rt, int l, int r, int L, int R) {
if (L <= l && r <= R) return (void)(val[rt] = r - l + 1);
pushdown(rt, l, r);
if (L <= ((l + r) >> 1)) update(rt << 1, l, ((l + r) >> 1), L, R);
if (R > ((l + r) >> 1)) update(rt << 1 | 1, ((l + r) >> 1) + 1, r, L, R);
pushup(rt);
}
inline int query(int rt, int l, int r, int L, int R) {
if (L <= l && r <= R) return val[rt];
pushdown(rt, l, r);
int ANS = 0;
if (L <= ((l + r) >> 1)) ANS += query(rt << 1, l, ((l + r) >> 1), L, R);
if (R > ((l + r) >> 1))
ANS += query(rt << 1 | 1, ((l + r) >> 1) + 1, r, L, R);
return ANS;
}
inline void upd(int x, int y) {
while (top[x] != top[y]) {
if (dep[top[x]] < dep[top[y]]) jh(x, y);
update(1, 1, n, idx[top[x]], idx[x]);
x = fa[top[x]];
}
if (dep[y] < dep[x]) jh(x, y);
update(1, 1, n, idx[x] + 1, idx[y]);
}
inline int qry(int x, int y) {
int cnt = 0;
while (top[x] != top[y]) {
if (dep[top[x]] < dep[top[y]]) jh(x, y);
cnt += query(1, 1, n, idx[top[x]], idx[x]);
x = fa[top[x]];
}
if (dep[y] < dep[x]) jh(x, y);
cnt += query(1, 1, n, idx[x], idx[y]);
return cnt;
}
inline void dfs1(int x, int f) {
siz[x] = 1;
dep[x] = dep[f] + 1;
fa[x] = f;
for (int i = head[x], v; i; i = e[i].u) {
v = e[i].v;
if (dep[v]) continue;
dfs1(v, x);
siz[x] += siz[v];
if (siz[v] > siz[son[x]]) son[x] = v;
}
}
inline void dfs2(int x, int topf) {
idx[x] = ++id;
top[x] = topf;
if (!son[x]) return;
dfs2(son[x], topf);
for (int i = head[x], v; i; i = e[i].u) {
v = e[i].v;
if (dep[v] < dep[x] || v == son[x]) continue;
if (fa[v] == x) dfs2(v, v);
}
}
inline void dfs3(int x) {
for (int i = head[x], v; i; i = e[i].u) {
v = e[i].v;
if (v == fa[x]) continue;
if (fa[v] == x)
dfs3(v);
else if (dep[v] > dep[x])
continue;
else if (!((dep[x] - dep[v]) & 1))
upd(x, v);
}
}
inline void dfs4(int x) {
for (int i = head[x], v; i; i = e[i].u) {
v = e[i].v;
if (v == fa[x]) continue;
if (fa[v] == x)
dfs4(v);
else if (dep[v] > dep[x])
continue;
else if ((dep[x] - dep[v]) & 1) {
int cnt = qry(x, v) - query(1, 1, n, idx[v], idx[v]);
if (cnt > 0) upd(x, v);
}
}
}
inline int LCA(int x, int y) {
while (top[x] != top[y])
dep[top[x]] > dep[top[y]] ? x = fa[top[x]] : y = fa[top[y]];
return dep[x] < dep[y] ? x : y;
}
inline int dis(int x, int y) {
return (dep[x] + dep[y] - (dep[LCA(x, y)] << 1));
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) bcj[i] = i;
for (int i = 1; i <= m; i++) {
scanf("%d %d", &a, &b);
add(a, b);
fx = find(a);
fy = find(b);
bcj[fy] = fx;
}
for (int i = 1; i <= n; i++) {
if (dep[i]) continue;
dfs1(i, 0);
dfs2(i, i);
dfs3(i);
dfs4(i);
}
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d %d", &a, &b);
int lca = LCA(a, b);
if (find(a) != find(b))
puts("No");
else {
if (dis(a, b) & 1)
puts("Yes");
else if ((qry(a, b) - query(1, 1, n, idx[lca], idx[lca])) > 0)
puts("Yes");
else
puts("No");
}
}
}
| 11 | CPP |
import sys
N = int(input())
S = input().strip()
ss = []
for c in S:
ss.append(int(c))
if N == 2:
print(abs(ss[0]-ss[1]))
sys.exit()
X = []
X2 = []
fff = 0
for i in range(N-1):
c = abs(ss[i] - ss[i+1])
X.append(c%2)
X2.append((c//2)%2)
if c == 1:
fff = 1
N=N-2
i = 0
Y = []
while N:
if N%2:
Y.append(i)
i += 1
N=N//2
C = [0]
for y in Y[::-1]:
y = 2**y
# print(y)
tmp = []
for c in C:
tmp.append(c+y)
for t in tmp:
C.append(t)
r = 0
r2 = 0
for c in C:
r = r^X[c]
r2 = r2^X2[c]
if fff:
print(r)
else:
print(r2*2)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int len;
int n, k, m;
struct aa {
int x, pos, s;
} a[4100000];
long long s[4100000], sum[4100000];
bool cmp(aa a, aa b) { return a.x < b.x; }
void modify(int k, int q, int h, int x, int ss) {
s[k] += ss;
sum[k] += 1LL * x * ss;
if (q < h) {
if (x <= (q + h) / 2)
modify(k * 2, q, (q + h) / 2, x, ss);
else
modify(k * 2 + 1, (q + h) / 2 + 1, h, x, ss);
}
}
long long query(int k, int q, int h, int pre) {
if (q == h) {
return min(sum[k], 1LL * pre * q);
} else {
if (s[k * 2] <= pre)
return query(k * 2 + 1, (q + h) / 2 + 1, h, pre - s[k * 2]) + sum[k * 2];
else
return query(k * 2, q, (q + h) / 2, pre);
}
}
int main() {
scanf("%d%d%d", &n, &k, &m);
for (int i = 1; i <= m; i++) {
int l, r, c, p;
scanf("%d%d%d%d", &l, &r, &c, &p);
len++;
a[len].x = l;
a[len].pos = p;
a[len].s = c;
len++;
a[len].x = r + 1;
a[len].pos = p;
a[len].s = -c;
}
sort(a + 1, a + len + 1, cmp);
long long ans = 0;
int h = 1;
for (int i = 1; i <= n; i++) {
while (h <= len && a[h].x <= i) {
modify(1, 1, 1000000, a[h].pos, a[h].s);
h++;
}
ans += query(1, 1, 1000000, k);
}
cout << ans << endl;
}
| 9 | CPP |
n,x=int(input()),0
for _ in range(n):
s=input()
if '+' in s:x+=1
elif '-' in s:x-=1
print(x) | 7 | PYTHON3 |