solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
for _ in range(int(input())):
n=int(input())
a = list(map(int, input().split()))
for j,k in enumerate(a):
if k>1:
break
if j%2==0:
print('First')
else:
print('Second') | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e6 + 3;
long long mpow(long long a, long long p) {
long long res = 1;
a %= mod;
for (; p > 0; p >>= 1) {
if (p & 1) {
res = res * a % mod;
}
a = a * a % mod;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
if (n < 63 && k > (1LL << n)) {
cout << 1 << " " << 1;
return 0;
}
if (k > mod + 31) {
long long k2 = 0;
for (int i = 1; i < 63; i++) {
k2 += (k - 1) / (1LL << i);
}
long long x = mpow(mpow(2, n), k - 1) * mpow(mpow(2, k2), mod - 2) % mod;
cout << x << " " << x << endl;
return 0;
}
long long n2 = mpow(2, n);
long long a = 1;
long long b = 1;
for (int i = 1; i <= k - 1; i++) {
long long k2 = 0;
int x = i;
while ((x & 1) == 0) {
k2++;
x >>= 1;
}
k2 = min(k2, n);
b = b * mpow(2, n - k2) % mod;
a = a * (mpow(2, n - k2) - x + 10 * mod) % mod;
}
cout << (((b - a) % mod) + mod) % mod << " " << b;
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int II() {
int q;
scanf("%d", &q);
return q;
}
long long LII() {
long long q;
scanf("%lld", &q);
return q;
}
int N, H;
vector<pair<int, int> > v;
int calc() {
int mi = 1e9, mx = 0;
for (int i = 1, j = 1; i < N && j <= 5; i++, j++) {
int q = v[0].first + v[i].first + H;
mi = min(mi, q);
mx = max(mx, q);
}
for (int i = N - 1, j = 1; i > 0 && j <= 5; i--, j++) {
int q = v[0].first + v[i].first + H;
mi = min(mi, q);
mx = max(mx, q);
}
for (int i = 1, j = 1; i < N && j <= 5; i++, j++) {
for (int k = N - 1, kk = 1; k > 0 && kk <= 5; k--, kk++) {
if (i >= k) continue;
int q = v[i].first + v[k].first;
mi = min(mi, q);
mx = max(mx, q);
}
}
for (int i = 1, j = 1; i < N && j <= 5; i++, j++) {
for (int k = i + 1, kk = 1; k < N && kk <= 5; k++, kk++) {
int q = v[i].first + v[k].first;
mi = min(mi, q);
mx = max(mx, q);
}
}
for (int i = N - 1, j = 1; i > 0 && j <= 5; i--, j++) {
for (int k = i - 1, kk = 1; k > 0 && kk <= 5; k--, kk++) {
int q = v[i].first + v[k].first;
mi = min(mi, q);
mx = max(mx, q);
}
}
return mx - mi;
}
void solve() {
cin >> N >> H;
for (int i = 1; i <= N; i++) {
int q;
cin >> q;
v.push_back({q, i});
}
sort(v.begin(), v.end());
int mi1 = v[N - 1].first + v[N - 2].first - (v[0].first + v[1].first);
int mi2 = calc();
int br[N + 10];
if (mi1 < mi2) {
cout << mi1 << endl;
for (int i = 1; i <= N; i++) cout << 1 << " ";
cout << endl;
} else {
cout << mi2 << endl;
br[v[0].second] = 1;
for (int i = 1; i < N; i++) {
br[v[i].second] = 2;
}
for (int i = 1; i <= N; i++) {
cout << br[i] << " ";
}
cout << endl;
}
}
int32_t main() {
int tt;
tt = 1;
while (tt--) {
solve();
}
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
long long int n, remm[200010], actual_pos[200010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t clk = clock();
int q;
cin >> n;
for (int i = 1; i <= n; i++) cin >> remm[i], actual_pos[i] = remm[i];
remm[n + 1] = 1e15;
cin >> q;
set<int> stations;
for (int i = 1; i <= n + 1; i++) stations.insert(i);
while (q--) {
int type;
cin >> type;
if (type == 1) {
int vess, pour;
cin >> vess >> pour;
while (pour != 0) {
int go_to = *(stations.lower_bound(vess));
if (remm[go_to] > pour) {
remm[go_to] -= pour;
pour = 0;
} else {
pour -= remm[go_to];
remm[go_to] = 0;
stations.erase(go_to);
}
}
} else {
int ves;
cin >> ves;
cout << actual_pos[ves] - remm[ves] << endl;
}
}
cerr << endl
<< setprecision(10) << fixed << (double)(clock() - clk) / CLOCKS_PER_SEC;
return 0;
}
| 1,800 | CPP |
n = int(input())
angles = [int(input()) for i in range(n)]
for angle in angles:
sides = int(360 / (180 - angle))
print("YES") if angle == (180 - 360 / sides) else print("NO") | 1,100 | PYTHON3 |
n=int(input());c=c1=0;
x=list(map(int,input().split()))
t=[];y=x;z=[]
for i in range(n-1):
if(x[n-1]!=x[i]):
x1=n-c-1
break
c+=1
for i in range(n-1,0,-1):
if(x[0]!=x[i]):
x2=n-c1-1
break
c1+=1
print(max(x1,x2))
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int INF = 1e18;
long long int po(long long int a, long long int b) {
long long int re = 1;
while (b) {
if (b % 2 == 1) {
re = (re * a);
re %= mod;
}
a = (a * a);
a %= mod;
b >>= 1;
}
return re;
}
int n, m;
string s[55];
bool vi[55][55];
bool che(int i, int j) {
if (i < 0 || i >= n || j < 0 || j >= m) return 1;
if (s[i][j] == 'B') return 1;
if (s[i][j] == 'G') return 0;
s[i][j] = '#';
return 1;
}
void dfs(int i, int j) {
if (i < 0 || i >= n || j < 0 || j >= m) return;
if (s[i][j] == '#') return;
if (vi[i][j] == 1) return;
vi[i][j] = 1;
dfs(i - 1, j);
dfs(i + 1, j);
dfs(i, j - 1);
dfs(i, j + 1);
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int test = 1;
while (test--) {
int n;
cin >> n;
long long int a[n];
for (int i = (0); i < (n); i++) cin >> a[i];
if (n == 1) {
cout << a[0];
return 0;
}
if (n == 2) {
cout << (a[0] | a[1]);
return 0;
}
long long int o, m = 0;
for (int i = (0); i < (n); i++) {
for (int j = (i + 1); j < (n); j++) {
for (int k = (j + 1); k < (n); k++) {
o = (a[i] | a[j] | a[k]);
m = max(m, o);
}
}
}
cout << m;
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[12], b[12];
bool bothSame(long long i, long long j) {
if (a[i].first == b[j].first && a[i].second == b[j].second)
return true;
else
return false;
}
bool bothDifferent(long long i, long long j) {
if (a[i].first != b[j].first && a[i].first != b[j].second &&
a[i].second != b[j].first && a[i].second != b[j].second)
return true;
else
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
long long x, y;
long long f[10] = {0};
for (long long i = 0; i < n; i++) {
cin >> x >> y;
if (x > y) swap(x, y);
a[i].first = x;
a[i].second = y;
}
for (long long i = 0; i < m; i++) {
cin >> x >> y;
if (x > y) swap(x, y);
b[i].first = x;
b[i].second = y;
}
set<long long> s1[n], s2[m];
long long c;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
if (bothSame(i, j) || bothDifferent(i, j)) continue;
if (a[i].first == b[j].first || a[i].first == b[j].second ||
a[i].second == b[j].first || a[i].second == b[j].second) {
if (a[i].first == b[j].first || a[i].first == b[j].second)
c = a[i].first;
if (a[i].second == b[j].first || a[i].second == b[j].second)
c = a[i].second;
s1[i].insert(c);
s2[j].insert(c);
f[c]++;
}
}
}
long long cnt = 0;
for (long long i = 0; i < 10; i++)
if (f[i] > 0) cnt++;
if (cnt == 1) {
cout << c;
return 0;
}
long long a1 = 0, b1 = 0;
for (long long i = 0; i < n; i++)
if (s1[i].size() > 1) a1++;
for (long long i = 0; i < m; i++)
if (s2[i].size() > 1) b1++;
if (!a1 && !b1)
cout << 0;
else
cout << -1;
return 0;
}
| 1,900 | CPP |
# import sys
# sys.stdin = open('input.txt','r')
# sys.stdout = open('output.txt','w')
n,k = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted(arr)
ans = 0
if k == 0 :
ans = arr[0]-1
else:ans = arr[k-1]
count = 0
for i in range(n):
if arr[i]<=ans : count+=1
f = 1
if (count!=k) or not (1<=ans and ans<=1000*1000*1000 ):
print(-1)
f= 0
if f:print(ans) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using mpi = map<int, int>;
using mpis = map<int, string>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
const int MOD = 1e9 + 7;
const ld PI = 2 * acos(0.0);
template <typename T>
T Swap(T a, T b) {
T temp = a;
a = b;
b = temp;
}
inline void Solve() {
int n, m;
cin >> n >> m;
if (n == 1)
cout << 0 << endl;
else if (n == 2)
cout << m << endl;
else
cout << 2 * m << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int cases = 1;
cin >> cases;
while (cases--) Solve();
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const double PI = acos(-1.0);
const int N = 1e5 + 100;
long long ma[N], sum[N];
char st[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
ma[i] += ma[i - 1] + a;
}
scanf(" %s", st);
long long mx = 0;
for (int i = 0; i < n; i++) {
if (st[i] == 49) {
sum[i + 1] = ma[i + 1] - ma[i];
mx += sum[i + 1];
}
}
for (int i = 1; i <= n; i++) sum[i] += sum[i - 1];
while (st[n - 1] == 48) n--;
mx = max(mx, ma[n - 1]);
for (int i = 0; i < n - 1; i++) {
if (st[i] == 49) mx = max(mx, ma[i] + sum[n] - sum[i + 1]);
}
cout << mx;
puts("");
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
double y1, y2, yw, xb, yb, R;
scanf("%lf %lf %lf %lf %lf %lf", &y1, &y2, &yw, &xb, &yb, &R);
double xw = xb * ((yw - y1 - 2 * R) / (2 * yw - 3 * R - yb - y1));
if (xw * ((y2 - y1 - R) /
sqrt((yw - y1 - 2 * R) * (yw - y1 - 2 * R) + xw * xw)) >=
R)
printf("%.10lf\n", xw);
else
printf("-1\n");
return 0;
}
| 2,000 | CPP |
n = input()
line = input()
res = 0
for i, c in enumerate(line[:-1]):
if line[i] == line[i+1]:
res += 1
print(res)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, q;
cin >> n >> m >> q;
int a[n][m];
struct a {
int o;
int p;
} arr[q];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int fo[n];
for (int i = 0; i < n; i++) {
int c = 0;
int max = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] == 1) c++;
if (c > max) max = c;
if (a[i][j] == 0) c = 0;
}
fo[i] = max;
}
for (int i = 0; i < q; i++) {
cin >> arr[i].o;
cin >> arr[i].p;
arr[i].o--;
arr[i].p--;
}
for (int i = 0; i < q; i++) {
a[arr[i].o][arr[i].p] = a[arr[i].o][arr[i].p] ^ 1;
int max = 0;
int c = 0;
for (int j = 0; j < m; j++) {
if (a[arr[i].o][j] == 1) c++;
if (c > max) max = c;
if (a[arr[i].o][j] == 0) c = 0;
}
fo[arr[i].o] = max;
int maxi = 0;
for (int j = 0; j < n; j++) {
if (fo[j] > maxi) maxi = fo[j];
}
cout << maxi << endl;
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int dp[100001];
int main() {
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
int s = S.size(), t = T.size();
int sum = 0, cur = 0;
for (int i = t; i <= s; i++) {
sum = (sum + dp[i - t] + 1) % MOD;
if (S.compare(i - t, t, T) == 0) {
cur = sum;
}
dp[i] = (dp[i - 1] + cur) % MOD;
}
cout << dp[s] << endl;
return 0;
}
| 2,000 | CPP |
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 26 14:22:43 2020
@author: rishi
"""
try:
a=input()
a=list(a)
c4=a.count("4")
c7=a.count("7")
if((c4+c7==4 or c4+c7==7) and (c4>0 or c7>0)):
print("YES")
else:
print("NO")
except:
pass
| 800 | PYTHON3 |
t=int(input())
while t>0:
n=int(input())
a=[int(x) for x in input().split()]
flag=0
if a[0]+a[1]<=a[n-1]:
flag=1
print(1,2,n)
if flag==0:
print("-1")
t-=1 | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline int chkmin(T &x, const T &y) {
return x > y ? x = y, 1 : 0;
}
template <typename T>
inline int chkmax(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
template <typename T>
inline T read(T &f) {
f = 0;
int x = 1;
char c = getchar();
while (!isdigit(c)) x = c == '-' ? -1 : 1, c = getchar();
while (isdigit(c)) (f *= 10) += c & 15, c = getchar();
return f *= x;
}
using int64 = long long;
using uint64 = unsigned long long;
const int N = 200000 + 5;
int n, k;
struct Edge {
int to;
Edge *next;
} E[N << 1], *pre[N];
int fa[N], dep[N];
void addedge(int u, int v) {
static int cnt = 0;
E[++cnt] = {v, pre[u]}, pre[u] = &E[cnt];
E[++cnt] = {u, pre[v]}, pre[v] = &E[cnt];
}
void dfs(int u, int f) {
fa[u] = f, dep[u] = dep[f] + 1;
for (Edge *i = pre[u]; i; i = i->next) {
int v = i->to;
if (v == f) continue;
dfs(v, u);
}
}
int d, rt, dis[N], col[N];
void draw(int u, int f, int dt) {
for (Edge *i = pre[u]; i; i = i->next) {
int v = i->to;
if (v == f) continue;
if (col[v]) continue;
col[v] = col[u] + dt;
if (col[v] < 0) col[v] += k;
if (col[v] > k) col[v] -= k;
draw(v, u, dt);
}
}
int ret = 0;
void findpath(int u, int f) {
chkmax(ret, dis[u]);
for (Edge *i = pre[u]; i; i = i->next) {
int v = i->to;
if (v == f) continue;
if (col[v]) continue;
dis[v] = dis[u] + 1;
findpath(v, u);
}
}
int main() {
read(n), read(k);
for (int i = (1), ___ = (n - 1); i <= ___; ++i) {
static int u, v;
read(u), read(v);
addedge(u, v);
}
dfs(1, 0);
for (int i = (1), ___ = (n); i <= ___; ++i)
if (dep[i] > dep[rt]) rt = i;
dfs(rt, 0);
for (int i = (1), ___ = (n); i <= ___; ++i) chkmax(d, dep[i]);
if (k == 2) {
puts("Yes");
for (int i = (1), ___ = (n); i <= ___; ++i)
printf("%d ", dep[i] & 1 ? 1 : 2);
return 0;
}
if (d < k) {
puts("Yes");
for (int i = (1), ___ = (n); i <= ___; ++i) {
static int t = 0;
if (++t > k) t -= k;
printf("%d ", t);
}
return 0;
}
int v = 0;
for (int i = (1), ___ = (n); i <= ___; ++i)
if (dep[i] > dep[v]) v = i;
int t = 0, td = 0;
while (true) {
if (++td, ++t > k) t -= k;
col[v] = t, dis[v] = td;
if (v == rt) break;
v = fa[v];
};
for (int i = (1), ___ = (n); i <= ___; ++i)
if (dep[i] > dep[v]) v = i;
t = 0, td = 0;
do {
int dL = dis[v], dR = dis[rt] - dis[v] + 1;
dis[v] = ret = 0, findpath(v, 0);
if (ret == 0) {
v = fa[v];
continue;
}
dL += ret, dR += ret;
if (dL >= k && dR >= k) {
puts("No");
return 0;
}
draw(v, 0, dL >= k ? 1 : -1);
v = fa[v];
} while (v != rt);
puts("Yes");
for (int i = (1), ___ = (n); i <= ___; ++i) printf("%d ", col[i]);
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
bool debug = false;
int main() {
scanf("%d", &n);
int x, y;
long long sum = 0, ss = 0, px = 0, py = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
sum += (long long)x * x + (long long)y * y;
ss += px * x + py * y;
px += (long long)x;
py += (long long)y;
}
sum = sum * (n - 1);
sum -= 2 * ss;
cout << sum << endl;
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 7;
int n, m;
vector<tuple<int, int, int>> res;
vector<pair<int, int>> g[maxN];
bool blocked[maxN];
bool solve(int v, int pr = -1) {
vector<int> unpaired;
vector<int> adj;
for (auto& to : g[v]) {
if (!blocked[to.second]) {
adj.push_back(to.first);
}
blocked[to.second] = true;
}
for (auto& to : adj) {
if (solve(to, v)) {
unpaired.push_back(to);
}
}
while (unpaired.size() >= 2) {
int first = unpaired.back();
unpaired.pop_back();
int second = unpaired.back();
unpaired.pop_back();
res.push_back(make_tuple(first, v, second));
}
if (unpaired.size() > 0) {
int vertex = unpaired.back();
unpaired.pop_back();
res.push_back(make_tuple(pr, v, vertex));
return false;
}
return true;
}
int main() {
scanf("%d %d", &n, &m);
if (m % 2 == 1) {
printf("No solution\n");
return 0;
}
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d %d", &a, &b);
g[a].push_back({b, i});
g[b].push_back({a, i});
}
solve(1);
for (auto& x : res) {
printf("%d %d %d\n", get<0>(x), get<1>(x), get<2>(x));
}
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int q = 0, k = 0;
char c[1000009];
int main() {
int i = 0, j = 0;
while ((c[++i] = getchar()) != EOF)
if (c[i] == '1') k++;
while (c[++j] != '2' && j <= i)
if (c[j] == '0') q++;
for (int p = 1; p <= q; p++) printf("0");
q = 0;
for (int p = 1; p <= k; p++) printf("1");
if (c[j] == '2') printf("2");
j++;
for (; j <= i; j++) {
if (c[j] == '0') q++;
if (c[j] == '2') {
for (int p = 1; p <= q; p++) printf("0");
printf("2");
q = 0;
}
}
for (int p = 1; p <= q; p++) printf("0");
return 0;
}
| 1,400 | CPP |
from sys import stdin,stdout,setrecursionlimit
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm , accumulate
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
starttime = time.time()
mod = int(pow(10, 9) + 7)
mod2 = 998244353
# from sys import stdin
# input = stdin.readline
#def data(): return sys.stdin.readline().strip()
def data(): return input()
def num():return int(input())
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
def pmat(A):
for ele in A:
print(*ele,end="\n")
def pmat2(A):
for ele in A:
for j in ele:
print(j,end='')
print()
def seive():
prime=[1 for i in range(10**6+1)]
prime[0]=0
prime[1]=0
for i in range(10**6+1):
if(prime[i]):
for j in range(2*i,10**6+1,i):
prime[j]=0
return prime
#solution
n=int(data())
a=L();ans=a[0];flag=False
for i in range(1,n):
if (ans+a[i])%2==1:
flag=True
break
if flag:print(*sorted(a))
else:print(*a)
endtime = time.time()
#print(f"Runtime of the program is {endtime - starttime}")
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
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...);
}
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1, 0);
int sum12, sum13, sum23;
int i = 1, j = 2;
printf("? %d %d\n", i, j);
fflush(stdout);
scanf("%d", &sum12);
i = 1, j = 3;
printf("? %d %d\n", i, j);
fflush(stdout);
scanf("%d", &sum13);
i = 2, j = 3;
printf("? %d %d\n", i, j);
fflush(stdout);
scanf("%d", &sum23);
a[1] = (sum12 + sum13 - sum23) / 2;
a[2] = sum12 - a[1];
a[3] = sum13 - a[1];
for (int j = 4; j <= n; j++) {
int sum;
i = 1;
printf("? %d %d\n", i, j);
fflush(stdout);
scanf("%d", &sum);
a[j] = sum - a[1];
}
printf("! ");
fflush(stdout);
for (int i = 1; i <= n; i++) {
printf("%d ", a[i]);
fflush(stdout);
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300100;
int v[MAXN];
vector<int> grafo[MAXN];
signed main() {
memset(v, 0, sizeof v);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
grafo[x].push_back(y), grafo[y].push_back(x);
}
queue<int> fila;
for (int i = 1; i <= n; i++)
if (grafo[i].size() >= 2) fila.push(i);
while (!fila.empty()) {
int at = fila.front();
fila.pop();
int r = 0;
for (int i = 0; i < grafo[at].size(); i++) {
int pa = grafo[at][i];
if (v[at] == v[pa]) r++;
}
if (r >= 2)
v[at] += 1, v[at] %= 2;
else
continue;
for (int i = 0; i < grafo[at].size(); i++) {
int pa = grafo[at][i];
r = 0;
for (int j = 0; j < grafo[pa].size(); j++) {
int k = grafo[pa][j];
if (v[k] == v[pa]) r++;
}
if (r >= 2) fila.push(pa);
}
}
for (int i = 1; i <= n; i++) cout << v[i];
}
| 2,200 | CPP |
n, m = map(int, input().split()) # time check
a = sorted((list(map(int, input().split()))))
diff = []
i = 0
while i < (m-n+1):
diff.append(a[i+n-1] - a[i])
i += 1
diff.sort()
print(diff[0]) | 900 | PYTHON3 |
def solve(z, n):
z = [int(z) for z in z.split()]
c = 0
r = 0
x = []
for i in range(n):
if z[i] != 0:
x.append(z[i])
for i in x:
c = 0
for j in x:
if i == j:
c = c + 1
if c > 2:
return -1
if c == 2:
r = r + 1
return int(r/2)
n = int(input())
r1 = input()
print(solve(r1, n))
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool pal(int a[]) { return (a[0] == a[4] && a[1] == a[3]); }
int main() {
char sa[5], saat[2], dak[2];
int j, s, d, toplam, min, hour;
int num[5];
for (int i = 0; i < 5; i++) scanf(" %c", &sa[i]);
for (int i = 0; i < 2; i++) saat[i] = sa[i];
for (int i = 3, j = 0; i < 5; i++, j++) dak[j] = sa[i];
s = atoi(saat);
d = atoi(dak);
toplam = 60 * s + d;
if (toplam == 1439)
printf("00:00");
else {
int bir, iki, uc, dort;
int arr[4];
hour = toplam / 60;
min = toplam % 60;
bir = hour / 10;
iki = hour % 10;
uc = min / 10;
dort = min % 10;
arr[0] = bir;
arr[1] = iki;
arr[2] = uc;
arr[3] = ++dort;
while (!(arr[0] == arr[3] && arr[1] == arr[2])) {
toplam++;
if (toplam == 1439) toplam = 0;
hour = toplam / 60;
min = toplam % 60;
bir = hour / 10;
iki = hour % 10;
uc = min / 10;
dort = min % 10;
arr[0] = bir;
arr[1] = iki;
arr[2] = uc;
arr[3] = dort;
}
for (int i = 0; i < 4; i++) {
if (i == 2) printf(":");
printf("%d", arr[i]);
}
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, b, sum = 0, q, even = 0, odd = 0;
cin >> n >> m;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] % 2 == 0)
even++;
else
odd++;
}
for (int i = 0; i < m; ++i) {
cin >> b;
if (b % 2 == 0) {
if (odd == 0)
continue;
else {
odd--;
sum++;
}
}
if (b % 2 != 0) {
if (even == 0)
continue;
else {
even--;
sum++;
}
}
}
cout << sum;
}
| 800 | CPP |
t=int(input())
from math import *
def primes(n):
k=[]
for tz in range(1,ceil(sqrt(n))+1):
if n%tz==0:
if (n//tz==tz):
#n=n//tz
k.append(tz)
else:
k.append(tz)
k.append(n//tz)
#k.append(n)
return k
for xy in range(t):
x,y=list(map(int,input().split()))
tl=primes(x)
if (y>=x):
print(1)
continue
#print(tl)
prod=1
for ay in tl:
if (ay<=y and ay>prod):
prod=ay
print(x//prod)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 5e3 + 5;
const long long MOD2 = 998244353;
const long double pi = 3.14159265359;
const long long INF = (1LL << 62);
long long n, m, k, ans, dp[N][N];
long long po(long long base, long long ti) {
if (ti == 0) return 1;
long long tmp = po(base, ti / 2);
if (ti & 1) return tmp * tmp % MOD2 * base % MOD2;
return tmp * tmp % MOD2;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
dp[0][0] = 1;
for (long long i = 0; i <= k; i++) {
for (long long j = 0; j <= k; j++) {
dp[i + 1][j + 1] = (dp[i + 1][j + 1] + (n - j) * dp[i][j] % MOD2) % MOD2;
dp[i + 1][j] = (dp[i + 1][j] + j * dp[i][j] % MOD2) % MOD2;
}
}
for (long long i = 1; i <= k; i++) {
ans = (ans + dp[k][i] * po(po(m, MOD2 - 2), i) % MOD2) % MOD2;
}
cout << ans << "\n";
return 0;
}
| 2,600 | CPP |
def fn(ii,jj):
if(grid[ii][jj]=='0'):
grid[ii][jj]='1'
else:
grid[ii][jj]='0'
def solve(row):
one=(int(grid[row][c-2])+int(grid[row][c-1])+int(grid[row+1][c-2])+int(grid[row+1][c-1]))
if(one!=0):
if(one==4):
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
elif(one==3):
ll=[]
if(grid[row][c-2]=='1'):
ll+=[row+1,c-1]
if(grid[row][c-1]=='1'):
ll+=[row+1,c]
if(grid[row+1][c-2]=='1'):
ll+=[row+2,c-1]
if(grid[row+1][c-1]=='1'):
ll+=[row+2,c]
l.append(ll)
elif(one==2):
if(grid[row][c-2]=='1' and grid[row][c-1]=='1'):
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+2,c-1,row+2,c])
elif(grid[row+1][c-2]=='1' and grid[row+1][c-1]=='1'):
l.append([row+1,c-1,row+1,c,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
elif(grid[row][c-2]=='1' and grid[row+1][c-2]=='1'):
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c])
elif(grid[row][c-1]=='1' and grid[row+1][c-1]=='1'):
l.append([row+1,c-1,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
elif(grid[row][c-2]=='1' and grid[row+1][c-1]=='1'):
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
else:
l.append([row+1,c-1,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c])
else:
if(grid[row][c-2]=='1'):
l.append([row+1,c-1,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
elif(grid[row][c-1]=='1'):
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c])
l.append([row+1,c-1,row+1,c,row+2,c-1])
elif(grid[row+1][c-2]=='1'):
l.append([row+1,c-1,row+1,c,row+2,c-1])
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+2,c-1,row+2,c])
else:
l.append([row+1,c-1,row+1,c,row+2,c])
l.append([row+1,c,row+2,c-1,row+2,c])
l.append([row+1,c-1,row+2,c-1,row+2,c])
for _ in range(int(input())):
r,c=map(int,input().split())
grid=[]
for i in range(r):
grid.append(list(input()))
l=[]
for j in range(c-2):
for i in range(r):
if(grid[i][j]=='1'):
if(i==r-1):
l.append([i+1,j+1,i+1,j+2,i,j+2])
fn(i-1,j+1)
else:
l.append([i+1,j+1,i+1,j+2,i+2,j+2])
fn(i+1,j+1)
fn(i,j)
fn(i,j+1)
currow=0
if(r%2!=0):
if(grid[0][c-2]=='1'):
l.append([1,c-1,2,c-1,2,c])
fn(0,c-2)
fn(1,c-2)
fn(1,c-1)
if(grid[0][c-1]=='1'):
l.append([1,c,2,c-1,2,c])
fn(0,c-1)
fn(1,c-2)
fn(1,c-1)
currow=1
while(currow<r):
solve(currow)
currow+=2
print(len(l))
for i in l:
print(*i)
| 1,900 | PYTHON3 |
n,h = input().split()
a = list(map(int,input().split()))
ans = 0
for i in a:
if i<=int(h):
ans += 1
else:
ans += 2
print(ans) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void reloc() {
freopen("/Users/admin/Desktop/cards.in", "r", stdin);
freopen("/Users/admin/Desktop/cards.out", "w", stdout);
return;
}
const int maxn = 100000, maxq = 200000, maxt = maxn * 3, inf = 10000000;
struct rect {
int i;
bool ok;
int x1, x2, y1, y2;
bool operator<(const rect b) const { return i < b.i; }
};
struct event {
bool type;
int x1, x2, y1, y2, k;
bool operator<(const event b) const {
if (x2 != b.x2) return x2 < b.x2;
return type < b.type;
}
} e[maxq * 2 + 1];
int n, m, k, q, up;
pair<int, int> ro[maxq + 1];
rect re[maxq + 1];
struct segtree {
int mini[maxt + 1];
void init() { memset(mini, 0, sizeof(mini)); }
void upd(int x) {
mini[x] = min(mini[(x << 1)], mini[((x << 1) + 1)]);
return;
}
void update(int p, int v, int x = 1, int l = 1, int r = 0) {
if (r == 0) r = up;
if (p > r || p < l) return;
if (l == r) {
mini[x] = v;
return;
}
update(p, v, (x << 1), l, ((l + r) >> 1));
update(p, v, ((x << 1) + 1), ((l + r) >> 1) + 1, r);
upd(x);
return;
}
int qu(int le, int ri, int x = 1, int l = 1, int r = 0) {
if (r == 0) r = up;
if (r < le || ri < l) return inf;
if (le <= l && r <= ri) {
return mini[x];
}
return min(qu(le, ri, (x << 1), l, ((l + r) >> 1)),
qu(le, ri, ((x << 1) + 1), ((l + r) >> 1) + 1, r));
}
} t;
void read() {
scanf("%d%d%d%d", &n, &m, &k, &q);
for (int i = 1; i <= k; i++) {
scanf("%d%d", &ro[i].first, &ro[i].second);
}
for (int i = 1; i <= q; i++) {
scanf("%d%d%d%d", &re[i].x1, &re[i].y1, &re[i].x2, &re[i].y2);
re[i].i = i;
re[i].ok = 0;
}
return;
}
void makexbased() {
for (int i = 1; i <= k; i++) {
e[i].type = 0;
e[i].x2 = ro[i].first;
e[i].y2 = ro[i].second;
}
for (int i = 1; i <= q; i++) {
int j = i + k;
e[j].type = 1;
e[j].k = i;
e[j].x1 = re[i].x1;
e[j].x2 = re[i].x2;
e[j].y1 = re[i].y1;
e[j].y2 = re[i].y2;
}
up = m;
return;
}
void makeybased() {
for (int i = 1; i <= k; i++) {
e[i].type = 0;
e[i].x2 = ro[i].second;
e[i].y2 = ro[i].first;
}
for (int i = 1; i <= q; i++) {
int j = i + k;
e[j].type = 1;
e[j].k = i;
e[j].x1 = re[i].y1;
e[j].x2 = re[i].y2;
e[j].y1 = re[i].x1;
e[j].y2 = re[i].x2;
}
up = n;
return;
}
void solve() {
t.init();
sort(e + 1, e + 1 + k + q);
for (int i = 1; i <= k + q; i++) {
if (e[i].type) {
if (t.qu(e[i].y1, e[i].y2) >= e[i].x1) re[e[i].k].ok = 1;
} else {
t.update(e[i].y2, e[i].x2);
}
}
return;
}
void print() {
sort(re + 1, re + 1 + q);
for (int i = 1; i <= q; i++) {
if (re[i].ok)
printf("YES\n");
else
printf("NO\n");
}
return;
}
void work() {
makexbased();
solve();
makeybased();
solve();
print();
return;
}
int main() {
read();
work();
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, t;
string s;
int main()
{
cin>>t;
while(t--){
cin>>n>>s;
if(s[0] == '2' && s[1] == '0' && s[2] == '2' && s[3] == '0') cout<<"YES"<<endl;
else if(s[0] == '2' && s[1] == '0' && s[2] == '2' && s[n-1] == '0') cout<<"YES"<<endl;
else if(s[0] == '2' && s[1] == '0' && s[n-2] == '2' && s[n-1] == '0') cout<<"YES"<<endl;
else if(s[0] == '2' && s[n-3] == '0' && s[n-2] == '2' && s[n-1] == '0') cout<<"YES"<<endl;
else if(s[n-4] == '2' && s[n-3] == '0' && s[n-2] == '2' && s[n-1] == '0') cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long vec[10007];
int main() {
long long a, b;
long long t = 2;
int m = 0;
for (int i = 1;; i++) {
t = t * 2;
if (t > 2000000000000000001) {
break;
}
long long cur = t - 1;
for (int j = 0; j < i; j++) {
vec[m++] = (cur ^ (1ll << j));
}
}
sort(vec, vec + m);
while (cin >> a >> b) {
if (a > b) swap(a, b);
int r = upper_bound(vec, vec + m, b) - vec;
int l = lower_bound(vec, vec + m, a) - vec;
cout << r - l << endl;
}
return 0;
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = (1LL << 31) - 1;
const long long int LINF = (1LL << 63) - 1;
const int NMAX = 100000 + 5;
const int MMAX = 100000 + 5;
const int KMAX = 100000 + 5;
const int PMAX = 100000 + 5;
const int LMAX = 100000 + 5;
const int VMAX = 100000 + 5;
long long int L, R, K, S;
vector<long long int> sol;
int main() {
scanf("%I64d%I64d%I64d", &L, &R, &K);
if (K > 4 || (K == 4 && (L % 2 == 0 || R - L + 1 > 4))) {
if (L % 2 == 0) {
sol.push_back(L);
sol.push_back(L + 1);
sol.push_back(L + 2);
sol.push_back(L + 3);
} else {
sol.push_back(L + 1);
sol.push_back(L + 2);
sol.push_back(L + 3);
sol.push_back(L + 4);
}
} else if (K == 1) {
sol.push_back(L);
} else if (K == 2) {
if (L % 2 == 0) {
sol.push_back(L);
sol.push_back(L + 1);
} else if (R - L + 1 >= 3) {
sol.push_back(L + 1);
sol.push_back(L + 2);
} else {
auto x = L ^ R;
if (x < L)
sol.push_back(L), sol.push_back(R);
else
sol.push_back(L);
}
} else if (K >= 3) {
long long int i, a, b, c, l = 0;
for (i = 0; i <= 60; i++) {
a = 2 * (1LL << i) - 1;
b = 3 * (1LL << i) - 1;
c = 3 * (1LL << i);
if (L <= a && a <= R && L <= b && b <= R && L <= c && c <= R) {
sol.push_back(a);
sol.push_back(b);
sol.push_back(c);
l = 1;
break;
}
}
if (l == 0) {
if (L % 2 == 0)
sol.push_back(L), sol.push_back(L + 1);
else
sol.push_back(L + 1), sol.push_back(L + 2);
}
}
S = 0;
for (auto x : sol) S ^= x;
printf("%I64d\n%d\n", S, sol.size());
for (auto x : sol) printf("%I64d ", x);
return 0;
}
| 2,300 | CPP |
for _ in range(int(input())):
n = int(input())
pi, ci = map(int, input().split())
flag = True
if ci > pi :
flag = False
pc = [[pi,ci]]
for i in range(1,n):
pi , ci = map(int, input().split())
if ci>pi or pi<pc[-1][0] or ci<pc[-1][1] or ((pi -pc[-1][0])<(ci -pc[-1][1])):
flag = False
pc.append([pi,ci])
if flag:
print("YES")
else:
print("NO") | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
stack<int> stiva;
char x[5001], xfin[60001];
int i, tabele, sz[1001];
bool finished;
int main() {
while (cin.getline(x, 5001)) {
strcpy(&xfin[strlen(xfin)], x);
}
int p = strlen(xfin);
for (i = 0; i < p; i++) {
if (xfin[i] == 't' && xfin[i + 1] == 'a' && xfin[i - 1] == '<') {
tabele++;
stiva.push(tabele);
}
if (xfin[i] == 't' && xfin[i + 1] == 'd' && xfin[i - 1] == '<') {
sz[stiva.top()]++;
}
if (xfin[i] == 't' && xfin[i + 1] == 'a' && xfin[i - 1] == '/') {
stiva.pop();
}
}
sort(sz + 1, sz + tabele + 1);
for (i = 1; i <= tabele; i++) {
cout << sz[i] << " ";
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n;
int as, bs;
char a[maxn];
char b[maxn];
int pref[maxn];
int suff[maxn];
int main() {
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
as = strlen(a);
bs = strlen(b);
int pb = 0;
int pa = 0;
memset(pref, -1, sizeof pref);
while (pb < bs && pa < as) {
if (a[pa] == b[pb]) {
pref[pb] = pa;
pb++;
}
pa++;
}
pb = bs - 1;
pa = as - 1;
memset(suff, -1, sizeof suff);
int r = bs;
while (pb >= 0 && pa >= 0) {
if (a[pa] == b[pb]) {
suff[pb] = pa;
r = pb;
pb--;
}
pa--;
}
int l = 0;
int minn = bs;
int pos = -1;
if (r != bs) {
minn = r;
pos = 0;
}
while (l < bs && pref[l] != -1) {
while (r < bs && suff[r] <= pref[l]) r++;
if (r - l - 1 < minn) {
minn = r - l - 1;
pos = l + 1;
}
l++;
}
if (minn == bs)
printf("-");
else
for (int i = 0; i < bs; i++)
if (i < pos || i >= pos + minn) printf("%c", b[i]);
printf("\n");
return 0;
}
| 2,100 | CPP |
A=int(input(""))
remainder=A
stepscounter=0
for i in range (A) :
if remainder >=5:
remainder= remainder -5
stepscounter = stepscounter +1
elif remainder > 0:
remainder=0
stepscounter = stepscounter +1
print(stepscounter)
| 800 | PYTHON3 |
n = int(input())
t = 0
ans = ""
while n > 1:
if t % 2 == 0:
ans += ''.join("I hate that ")
else:
ans += ''.join("I love that ")
t += 1
n -= 1
if t % 2 == 0:
ans += ''.join("I hate it")
else:
ans += ''.join("I love it")
print(ans)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
int i;
for (i = 0; i < rep; i++) p[i] = val;
}
signed long long GETi() {
signed long long i;
scanf("%lld", &i);
return i;
}
int N;
signed long long A[1001], t;
signed long long mo = 1000000007;
map<signed long long, int> M;
signed long long combi(signed long long N_, signed long long C_) {
int i;
const int num = 20000;
static signed long long rev[num + 1], revt[num + 1];
if (rev[1] == 0) {
rev[1] = 1;
for (i = 2; i <= num; i++) rev[i] = rev[mo % i] * (mo - mo / i) % mo;
revt[0] = 1;
for (i = 1; i <= num; i++) revt[i] = revt[i - 1] * rev[i] % mo;
}
signed long long ret = revt[C_];
for (i = 0; i < C_; i++) ret = (ret * ((N_ - i) % mo)) % mo;
return ret;
}
signed long long hcomb(int P_, int Q_) { return combi(P_ + Q_ - 1, Q_); }
void solve() {
int f, i, j, k, l, x, y;
cin >> N;
for (i = 0; i < N; i++) {
cin >> t;
for (signed long long a = 2; a * a <= t; a++) {
while (t % a == 0) t /= a, M[a]++;
}
if (t > 1) M[t]++;
}
signed long long ret = 1;
for (__typeof(M.begin()) it = M.begin(); it != M.end(); it++) {
ret = (ret * hcomb(N, it->second)) % mo;
}
cout << ret << endl;
}
int main(int argc, char** argv) {
string s;
if (argc == 1) ios::sync_with_stdio(false);
for (int i = 1; i < argc; i++) s += argv[i], s += '\n';
for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin);
solve();
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 3e9 + 7;
long long n, m;
vector<long long> vals;
vector<long long> tmp;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ios_base::sync_with_stdio(0);
;
cin >> n;
vals.resize(n);
for (int i = 0; i < n; i++) cin >> vals[i], tmp.push_back(vals[i]);
sort(tmp.begin(), tmp.end());
cin >> m;
while (m--) {
vector<long long> answer;
map<long long, long long> freq;
long long k, pos;
cin >> k >> pos;
for (int i = 0; i < n - k; i++) {
freq[tmp[i]]++;
}
for (int i = n; i >= 0; i--) {
if (freq[vals[i]])
freq[vals[i]]--;
else
answer.push_back(vals[i]);
}
reverse(answer.begin(), answer.end());
cout << answer[pos - 1] << "\n";
;
}
}
| 1,600 | CPP |
def get_value(parters, solved):
if solved * 32 <= parters:
return 3000
if solved * 16 <= parters:
return 2500
if solved * 8 <= parters:
return 2000
if solved * 4 <= parters:
return 1500
if solved * 2 <= parters:
return 1000
return 500
def points(value, time):
return value - value // 500 * time
n = int(input())
t = [0] * n
for i in range(n):
t[i] = list(map(int, input().split()))
value = [0] * 5
solve = [0] * 5
for i in range(5):
solved = 0
for j in range(n):
if t[j][i] != -1:
solved += 1
else:
t[j][i] = 250
value[i] = get_value(n, solved)
solve[i] = solved
vasya = 0
for i in range(5):
vasya += points(value[i], t[0][i])
petya = 0
for i in range(5):
petya += points(value[i], t[1][i])
pot = [[0] * 20000 for i in range(5)]
for problem in range(5):
for cur_ac in range(20000):
new_value = 0
if t[0][problem] < t[1][problem]:
new_value = get_value(n + cur_ac, solve[problem])
elif t[0][problem] != 250:
new_value = get_value(n + cur_ac, solve[problem] + cur_ac)
else:
new_value = get_value(n + cur_ac, solve[problem])
win = points(new_value, t[0][problem]) - points(new_value, t[1][problem]) - points(value[problem], t[0][problem]) + points(value[problem], t[1][problem])
pot[problem][cur_ac] = win
res = -1
for i in range(20000):
tmp = 0
for pr in range(5):
if len(pot[pr]) <= i:
tmp += pot[pr][-1]
else:
tmp += pot[pr][i]
if tmp > petya - vasya:
res = i
break
print(res)
| 2,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, z;
int Len, Next[10005], Son[2005], Cap[10005], Link[10005], cur[2005];
int Deep[2005];
int s, t;
long long Sum;
void AddEdge(int x, int y, int z) {
Len++;
Next[Len] = Son[x];
Son[x] = Len;
Link[Len] = y;
Cap[Len] = z;
}
int Dfs(int u, int flow) {
if (u == t) return flow;
for (int& i = cur[u]; i; i = Next[i]) {
if ((Deep[Link[i]] == Deep[u] + 1) && (Cap[i])) {
int di = Dfs(Link[i], min(flow, Cap[i]));
if (di) {
Cap[i] -= di;
Cap[((i - 1) ^ 1) + 1] += di;
return di;
}
}
}
return 0;
}
int Bfs() {
queue<int> Q;
while (!Q.empty()) Q.pop();
memset(Deep, 0, sizeof(Deep));
Deep[s] = 1;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int i = Son[u]; i; i = Next[i]) {
if ((!Deep[Link[i]]) && (Cap[i])) {
Deep[Link[i]] = Deep[u] + 1;
Q.push(Link[i]);
}
}
}
return Deep[t];
}
long long Maxflow() {
long long ans = 0;
while (Bfs()) {
for (int i = 0; i <= t; i++) cur[i] = Son[i];
while (int d = Dfs(s, 0x3f3f3f3f)) ans += 1ll * d;
}
return ans;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
AddEdge(m + i, n + m + 1, x);
AddEdge(n + m + 1, m + i, 0);
}
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &x, &y, &z);
Sum += 1ll * z;
AddEdge(0, i, z);
AddEdge(i, 0, 0);
AddEdge(i, m + x, 0x3f3f3f3f);
AddEdge(m + x, i, 0);
AddEdge(i, m + y, 0x3f3f3f3f);
AddEdge(m + y, i, 0);
}
s = 0;
t = n + m + 1;
printf("%lld\n", Sum - Maxflow());
}
| 2,400 | CPP |
import sys
#sys.stdin = open('in', 'r')
#n = int(input())
#n,m = map(int, input().split())
#a = [int(x) for x in input().split()]
inp = input().split()
m = [0]*10
s = [0]*10
p = [0]*10
for st in inp:
if st[1] == 'm':
m[int(st[0])] += 1
if st[1] == 's':
s[int(st[0])] += 1
if st[1] == 'p':
p[int(st[0])] += 1
res = 3
for i in range(1, 10):
res = min(res, 3 - m[i])
res = min(res, 3 - s[i])
res = min(res, 3 - p[i])
for i in range(1, 8):
cnt = sum(map(lambda x: 1 if x == 0 else 0, m[i:i+3]))
res = min(res, cnt)
cnt = sum(map(lambda x: 1 if x == 0 else 0, s[i:i+3]))
res = min(res, cnt)
cnt = sum(map(lambda x: 1 if x == 0 else 0, p[i:i+3]))
res = min(res, cnt)
print(res)
#sys.stdout.write('YES\n')
#sys.stdout.write(f'{res}\n')
#sys.stdout.write(f'{y1} {x1} {y2} {x2}\n')
| 1,200 | PYTHON3 |
red,blue=map(int,input().split())
extra=abs(red-blue)
print((red+blue-extra)//2,extra//2) | 800 | PYTHON3 |
// #include<bits/stdc++.h>
// using namespace std;
// map<long long ,long long > mp;
// long long maxsum(long long a[],long long n,long long i){
// if(mp.count(i+a[i]))return mp[i+a[i]];
// if(i+a[i]>=n)return 0;
// long long sum = 0;
// sum += a[i+a[i]] + maxsum(a,n,i+a[i]);
// mp[i]=sum;
// return sum;
// }
// int main(){
// ios_base::sync_with_stdio(false); cin.tie(NULL); //cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("error.txt", "w", stderr);
// freopen("output.txt", "w", stdout);
// #endif
// long long i,j,t=1; cin>>t;
// while(t--){
// long long n;cin>>n;
// long long a[n];
// for(i=0;i<n;i++)cin>>a[i];
// long long maxi = 0;
// for(i=0;i<n;i++)
// maxi = max(maxi,a[i] + maxsum(a,n,i));
// mp.clear();
// cout<<maxi<<endl;
// mp.clear();
// }
// return 0;
// }
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); //cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
long long i,j,t=1; cin>>t;
while(t--){
long long n;cin>>n;
long long a[n];
for(i=0;i<n;i++)cin>>a[i];
long long dp[n];
memset(dp,-1,sizeof(dp));
for(i=n-1;i>=0;i--){
if(i+a[i]>=n)dp[i]=a[i];
else dp[i]=a[i]+dp[i+a[i]];
}
cout<<*max_element(dp,dp+n)<<endl;
}
return 0;
} | 1,100 | CPP |
def b(m, n):
if m == n:
return 10
if m == n-1:
return 10 * 9 * 2
return (10 * 9**2 * (n-(m+2)+1) * pow(10, n-m-2, 998244353) + 10*9*2 * pow(10,n-m-1, 998244353)) % 998244353
n = int(input())
print(*[b(i+1, n) for i in range(n)])
| 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, pair<long long, long long> > &a,
const pair<long long, pair<long long, long long> > &b) {
return (a.second.first < b.second.first);
}
bool sortbyth(const pair<long long, pair<long long, long long> > &a,
const pair<long long, pair<long long, long long> > &b) {
return (a.second.second < b.second.second);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
long long max3(long long a, long long b, long long c) {
return max(max(a, b), c);
}
long long max4(long long a, long long b, long long c, long long d) {
return max(max(a, b), max(c, d));
}
long long min3(long long a, long long b, long long c) {
return min(min(a, b), c);
}
long long min4(long long a, long long b, long long c, long long d) {
return min(min(a, b), min(c, d));
}
long long po(long long x, long long n, long long mod = 1000000007) {
if (n == 0) {
return 1;
}
long long m = po(x, n / 2, mod);
m *= m;
m %= mod;
if (n % 2) {
m *= x;
m %= mod;
}
return m;
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
clock_t startTime = clock();
cout << fixed << setprecision(12);
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
set<long long> ans, s;
for (long long i = 0; i < n; i++) {
set<long long> temp;
temp.insert(v[i]);
auto it = s.begin();
while (it != s.end()) {
temp.insert(*it | v[i]);
it++;
}
ans.insert(temp.begin(), temp.end());
s = temp;
}
cout << ans.size() << "\n";
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int i, j;
unordered_set<int> s;
vector<int> princess;
vector<int> vec;
for (i = 1; i <= n; i++) {
vec.push_back(i);
}
for (i = 1; i <= n; i++) {
int inp;
cin >> inp;
bool q = 0;
for (j = 0; j < inp; j++) {
int prince;
cin >> prince;
if (!s.count(prince) && q == 0) {
s.insert(prince);
auto it = lower_bound(vec.begin(), vec.end(), prince);
vec.erase(it);
q = 1;
}
}
if (q == 0) princess.push_back(i);
}
if (princess.empty())
cout << "OPTIMAL\n";
else {
cout << "IMPROVE\n";
cout << princess[0] << " " << vec[0] << "\n";
}
}
return 0;
}
| 1,200 | CPP |
n = int(input() )
print(2*n*n + (n+1)*(n+2) -1)
| 1,100 | PYTHON3 |
for _ in range(int(input())):
b, p, f = map(int, input().split())
h, c = map(int, input().split())
if h > c:
print(min(b // 2, p) * h + c * min(f, (b - min(b // 2, p) * 2) // 2))
else:
print(min(b // 2, f) * c + h * min(p, (b - min(b // 2, f) * 2) // 2))
| 800 | PYTHON3 |
def main():
x = int(input())
if x % 2 == 0 and x > 2:
return "YES"
else:
return "NO"
print(main())
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int sv = 0;
long long int sum = (n * (n + 1)) / 2;
vector<int> v;
if (sum % 2) {
cout << 1 << "\n";
int k = n;
while (sum / 2 - sv >= k) {
sv += k;
v.push_back(k);
k--;
}
if (sv != (sum / 2) && sv != (sum / 2 + 1)) {
int d = sv;
sv = 0;
sv += abs((sum / 2 - d));
v.push_back(sv);
}
} else {
cout << 0 << "\n";
int k = n;
while (sum / 2 - sv >= k) {
sv += k;
v.push_back(k);
k--;
}
if (sv != (sum / 2) && sv != (sum / 2 + 1)) {
int d = sv;
sv = 0;
sv += abs((sum / 2 - d));
v.push_back(sv);
}
}
cout << v.size() << " ";
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
return 0;
}
| 1,300 | CPP |
n = int(input())
a = list(map(int, input().split()))
out = ""
for i in range(n-1):
out += str(a[i] + a[i+1]) + " "
out += str(a[-1])
print(out)
| 800 | PYTHON3 |
import math
t = int(input())
for i in range(t):
n, k = input().split(" ")
n = int(n)
k = int(k)
arr = input().split(" ")
if n == k:
print(1, '\n')
continue
for j in range(len(arr)):
arr[j] = int(arr[j])
maxi = 0
for j in range(1, k):
if arr[j] - arr[j - 1] - 1 > maxi:
maxi = arr[j] - arr[j - 1] - 1
maxi = math.ceil(maxi / 2.0) + 1
if arr[0] > maxi:
maxi = arr[0]
if n - arr[len(arr) - 1] + 1 > maxi:
maxi = n - arr[len(arr) - 1] + 1
print(maxi) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
int a[100006], b[100006];
void merge_sort(int left, int right) {
if (left >= right) return;
int x = (left + right) / 2;
merge_sort(left, x);
merge_sort(x + 1, right);
int j = x + 1;
int i = left;
int k = left;
while (i <= x && j <= right) {
if (a[i] <= a[j])
b[k++] = a[i++];
else
b[k++] = a[j++];
}
while (i <= x) b[k++] = a[i++];
while (j <= right) b[k++] = a[j++];
for (int g = left; g <= right; g++) a[g] = b[g];
}
int unique(int n) {
int i = 1;
int j = 2;
for (; j <= n; j++) {
if (a[j] != a[j - 1]) {
a[++i] = a[j];
}
}
return i;
}
int main() {
int n;
int flag;
while (scanf("%d", &n) == 1) {
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
merge_sort(1, n);
int right = unique(n);
flag = 0;
for (int i = 1; i < right; i++) {
flag = 0;
if (a[i] < a[i + 1]) {
if (a[i] * 2 > a[i + 1]) {
printf("YES\n");
flag = 1;
break;
}
}
}
if (flag == 0) printf("NO\n");
}
return 0;
}
| 1,400 | CPP |
a, m = map(int, str.split(input()))
mem = set()
while a not in mem:
mem.add(a)
if a % m == 0:
print("Yes")
exit()
else:
a = (a + a % m) % m
print("No")
| 1,400 | PYTHON3 |
s=input()
def func(w):
c=0
for i in range(1,len(w)):
if w[i].isupper()==True:
c+=1
if c==len(w)-1:
return True
if s[0].islower()==True and func(s)==True:
print(s.capitalize())
elif s[0].isupper()==True and func(s)==True:
print(s.lower())
else:print(s)
| 1,000 | PYTHON3 |
def test(a, b, n):
count = 0
while b <= n and a <= n:
if b >= a:
a += b
else:
b += a
count += 1
return count
t = int(input())
for i in range(t):
a, b, n = map(int, input().split())
print(test(a, b, n)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
const int MOD = 1000000007;
int n, m, i, j, k, pre[MAXN], inv[MAXN], phi[MAXN], po[MAXN], ans;
int mu[MAXN], prim[MAXN], cnt, sa, sb, sc, ta, tb, tc, sum, sam = 1, lena, lenb;
int f[MAXN];
char a[MAXN], b[MAXN];
bool ok[MAXN];
inline int get() {
char c;
while ((c = getchar()) < 48 || c > 57)
;
int res = c - 48;
while ((c = getchar()) >= 48 && c <= 57) res = res * 10 + c - 48;
return res;
}
inline int gcd(int x, int y) {
int z = x % y;
while (z) {
x = y;
y = z;
z = x % y;
}
return y;
}
inline int ksm(int x, int y, int z) {
int b = 1;
while (y) {
if (y & 1) b = b * (long long)x % z;
x = x * (long long)x % z;
y >>= 1;
}
return b;
}
inline int C(int n, int m) {
return (long long)pre[n] * inv[m] % MOD * inv[n - m] % MOD;
}
inline int solve(int p, int q, int d) {
if (!p && !q) {
int A = C(sc + tc, tc + d) - sam;
if (A < 0) A += MOD;
int B = (po[n + 1] - 2 + MOD) * (long long)(po[n + 1] - 2 + MOD) % MOD;
return ((long long)A * sum + sam * (long long)B) % MOD;
}
if ((p >= 0 && q >= 0) || (p <= 0 && q <= 0))
return 0;
else {
if (p < 0) p = -p;
if (q < 0) q = -q;
int A = C(sc + tc, tc + d);
int g = gcd(p, q);
int B = po[n / (max(p, q) / g) + 1] - 2;
if (B < 0) B += MOD;
return A * (long long)B % MOD;
}
}
int main() {
pre[0] = 1;
for (i = 1; i <= 600000; i++) pre[i] = pre[i - 1] * (long long)i % MOD;
inv[600000] = ksm(pre[600000], MOD - 2, MOD);
for (i = 599999; i >= 0; i--) inv[i] = inv[i + 1] * (long long)(i + 1) % MOD;
scanf("%s", a + 1);
scanf("%s", b + 1);
lena = strlen(a + 1);
lenb = strlen(b + 1);
cin >> n;
for (i = 1; i <= lena; i++)
if (a[i] == 'A')
sa++;
else if (a[i] == 'B')
sb++;
else
sc++;
for (i = 1; i <= lenb; i++)
if (b[i] == 'A')
ta++;
else if (b[i] == 'B')
tb++;
else
tc++;
if (lena == lenb) {
for (i = 1; i <= lena; i++)
if (a[i] == b[i] && a[i] == '?')
sam = sam * 2 % MOD;
else if (a[i] == 'A' && b[i] == 'B')
sam = 0;
else if (a[i] == 'B' && b[i] == 'A')
sam = 0;
}
mu[1] = 1;
for (i = 2; i <= n; i++) {
if (!ok[i]) prim[++cnt] = i, mu[i] = -1, phi[i] = i - 1;
for (j = 1; j <= cnt && prim[j] * i <= n; j++) {
ok[i * prim[j]] = 1;
if (i % prim[j] == 0) {
mu[i * prim[j]] = 0;
phi[i * prim[j]] = phi[i] * prim[j];
break;
} else
mu[i * prim[j]] = -mu[i], phi[i * prim[j]] = phi[i] * phi[prim[j]];
}
}
po[0] = 1;
for (i = 1; i <= n + 1; i++) po[i] = po[i - 1] * 2 % MOD;
f[1] = 1;
for (i = 2; i <= n; i++)
f[i] = f[i - 1] + 2 * phi[i], (f[i] >= MOD) ? f[i] -= MOD : f[i];
for (i = 1; i <= n; i++)
sum = ((long long)sum + po[i] * (long long)f[n / i]) % MOD;
int p = sa - ta, q = sb - tb + sc - tc;
for (i = -tc; i <= sc; i++) ans = (ans + solve(p + i, q - i, i)) % MOD;
cout << ans << endl;
}
| 3,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
vector<int> var[50];
int ppp[3] = {0, 4, 7};
void dfs(int sum, vector<int> v) {
if (int((v).size()) == 6)
var[sum] = v;
else {
for (int d = 0; d < 3; ++d) {
int cc = ppp[d];
vector<int> tmp = v;
tmp.push_back(cc);
dfs(sum + cc, tmp);
}
}
}
void solve() {
long long x;
cin >> x;
string s;
do {
s += (char)('0' + (x % 10));
x /= 10;
} while (x);
int n = int((s).size());
const int maxrem = 7;
vector<vector<bool> > dp(n + 1, vector<bool>(maxrem));
vector<vector<int> > predj(n + 1, vector<int>(maxrem));
vector<vector<int> > predp(n + 1, vector<int>(maxrem));
dp[0][0] = true;
for (int i = 0; i < n; ++i)
for (int j = 0; j < maxrem; ++j) {
if (dp[i][j] == 0) continue;
for (int t = 0; t < 43; ++t)
if ((j + t) % 10 == s[i] - '0' && int((var[t]).size())) {
int torem = (j + t) / 10;
dp[i + 1][torem] = 1;
predj[i + 1][torem] = j;
predp[i + 1][torem] = t;
}
}
if (dp[n][0] == 0)
printf("-1\n");
else {
vector<vector<int> > vv;
int curj = 0;
for (int i = n; i > 0; --i) {
vv.push_back(var[predp[i][curj]]);
curj = predj[i][curj];
}
for (int i = 0; i < 6; ++i) {
long long num = 0;
for (int j = 0; j < int((vv).size()); ++j) num = num * 10 + vv[j][i];
printf("%I64d ", num);
}
printf("\n");
}
}
int main() {
int t;
scanf("%d", &t);
dfs(0, vector<int>());
while (t--) {
solve();
}
return 0;
}
| 2,200 | CPP |
def gcd(a,b):
return 0 if b == 0 else a//b + gcd(b, a%b)
a, b = (int(x) for x in input().split())
print(gcd(a,b)) | 1,600 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
l= [str(i) for i in range(1,n)]
s= str(n)+' '+' '.join(l)
print(s) | 800 | PYTHON3 |
from functools import reduce
def factors(n):
return set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))
n = int(input())
list_ = map(str, factors(n))
n = str(n)
cont=0
for el in list_:
flag = False
for i in el:
if i in n:
flag = True
if flag==True:
cont+=1
print(cont) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
c_p_c();
int n, i, j;
long long int S = 0, temp = 0, x, y;
cin >> n;
vector<int> a(n + 5, 0);
for (i = 0; i < n; i++) {
cin >> a[i];
S += a[i];
}
if (S & 1) {
cout << "NO\n";
return 0;
}
map<long long int, int> first, second;
first[a[0]]++;
for (i = 1; i < n; i++) second[a[i]]++;
for (i = 0; i < n; i++) {
temp += a[i];
if (temp == S / 2) {
cout << "YES\n";
return 0;
}
if (temp < S / 2) {
x = S / 2 - temp;
if (second[x] > 0) {
cout << "YES\n";
return 0;
}
} else {
y = temp - S / 2;
if (first[y] > 0) {
cout << "YES\n";
return 0;
}
}
first[a[i + 1]]++;
second[a[i + 1]]--;
}
cout << "NO\n";
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
int ifa[4] = {0, 1, 1, 0};
int b[4] = {0, 0, 0, 0};
int main(void) {
int n, flag = 1, spec = 3, lose = 2;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int winner;
scanf("%d", &winner);
memset(b, 0, sizeof(b));
b[winner] = 1;
b[spec] = 1;
for (int i = 1; i <= 3; i++)
if (b[i] == 0) lose = i;
if (ifa[winner]) {
ifa[spec] = 1;
ifa[lose] = 0;
int tem = lose;
lose = spec;
spec = tem;
} else {
flag = 0;
break;
}
}
if (flag)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
vector<vector<int>> ar(2, vector<int>());
vector<int> pref;
vector<int> suf;
for (int q = 0; q < t; ++q) {
int m;
cin >> m;
ar[0].resize(m);
ar[1].resize(m);
pref.resize(m);
suf.resize(m);
int sum1 = 0;
int sum2 = 0;
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < m; ++j) {
cin >> ar[i][j];
if (i == 0)
sum1 += ar[i][j];
else
sum2 += ar[i][j];
}
}
suf[m - 1] = ar[1][m - 1];
for (int i = m - 2; i > -1; --i) {
suf[i] = ar[1][i] + suf[i + 1];
}
pref[0] = ar[0][0];
int ans = 1e9;
for (int i = 1; i < m; ++i) {
pref[i] = ar[0][i] + pref[i - 1];
}
for (int i = 0; i < m; ++i) {
ans = min(ans, max(sum1 - pref[i], sum2 - suf[i]));
}
cout << ans << "\n";
}
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int sz = 1e4 + 5;
int tc, n, m, u, v, c;
;
struct R {
int l, cost;
bool operator<(R a) const {
if (cost == a.cost) return l < a.l;
return cost < a.cost;
}
};
vector<R> x[sz], y[sz];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> u >> v >> c;
x[u].push_back({v, c});
y[v].push_back({u, c});
}
for (int i = 1; i <= n; i++) {
if (x[i].empty() || y[i].empty()) {
cout << -1 << "\n";
return 0;
}
sort(x[i].begin(), x[i].end());
sort(y[i].begin(), y[i].end());
}
set<int> st;
for (int i = 1; i <= n; i++) {
st.insert(x[i][0].cost);
st.insert(y[i][0].cost);
}
cout << *st.rbegin() << "\n";
return 0;
}
| 1,900 | CPP |
n = int(input())
s = input()
print('1 '*s.count('n') + '0 ' * s.count('z'))
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long powmod(long long a, long long p) {
if (p == 0) return 1;
long long c = powmod(a, p / 2);
if (p & 1) return (c * c) % mod * a % mod;
return (c * c) % mod;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
string s;
cin >> s;
long long n = s.length();
reverse(s.begin(), s.end());
long long dp[n + 1];
if (s[0] == '1')
dp[1] = 1;
else
dp[1] = 0;
for (long long i = 1; i < n; i++) {
if (s[i] == '1')
dp[i + 1] = ((dp[i] * 2) % mod + powmod(2, 2 * i)) % mod;
else
dp[i + 1] = (2 * dp[i]) % mod;
}
cout << dp[n];
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
double dis(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main() {
int n;
cin >> n;
double x[110], y[110], k;
cin >> k;
double ans = 0;
for (int i = 1; i <= n; i++) {
cin >> x[i] >> y[i];
}
for (int i = 2; i <= n; i++) {
ans += dis(x[i], y[i], x[i - 1], y[i - 1]) / 50 * k;
}
printf("%.9f", ans);
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxc = 2e5 + 79;
vector<int> pf(maxc, 0);
void upd(int& a, const int& b) { a = max(a, b); }
int count_stars(int l, int r) { return pf[r] - pf[l - 1]; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> dpmv(n + 1, 0), dpfix(n + 1, 0);
vector<int> monsters(n), myblock(n);
for (int i = 0; i < n; i++) cin >> monsters[i];
sort(monsters.begin(), monsters.end());
vector<pair<int, int> > blocks;
for (int i = 0; i < n; i++) {
if (blocks.empty() ||
blocks.back().first + blocks.back().second != monsters[i])
blocks.push_back({monsters[i], 0});
blocks.back().second++;
myblock[i] = blocks.size() - 1;
}
vector<int> stars(m);
for (int i = 0; i < m; i++) {
cin >> stars[i];
pf[stars[i]]++;
}
sort(stars.begin(), stars.end());
for (int i = 1; i < maxc; i++) pf[i] += pf[i - 1];
int cnt = 0;
for (int i = 0; i < blocks.size(); i++) {
upd(dpmv[i + 1], max(dpfix[i], dpmv[i]));
int pos = blocks[i].first, len = blocks[i].second;
for (int left = 0; left < m; left++) {
if (stars[left] >= pos) break;
int need = pos - stars[left];
if (cnt < need) continue;
int block = myblock[cnt - need];
upd(dpfix[i + 1], max(dpmv[block], dpfix[block]) +
count_stars(stars[left], pos + len - 1));
}
upd(dpfix[i + 1], max(dpmv[i], dpfix[i]) + count_stars(pos, pos + len - 1));
for (int right = m - 1; right >= 0; right--) {
if (stars[right] <= pos + len - 1) break;
int need = stars[right] - (pos + len - 1);
if (n - len - cnt < need) continue;
int block = myblock[cnt + len - 1 + need];
upd(dpmv[block + 1], dpfix[i + 1] + count_stars(pos + len, stars[right]));
}
cnt += len;
}
cout << max(dpmv[blocks.size()], dpfix[blocks.size()]) << "\n";
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main() {
int n, l, x, y, t;
bool fx = 0, fy = 0;
cin >> n >> l >> x >> y;
for (int i = 1; i <= n; i++) {
cin >> t;
s.insert(t);
}
set<int>::iterator it;
for (it = s.begin(); it != s.end(); it++) {
t = *it;
if (s.count(t + x)) fx = 1;
if (s.count(t + y)) fy = 1;
}
if (fx & fy) {
puts("0");
return 0;
} else if (fx) {
printf("1\n%d\n", y);
return 0;
} else if (fy) {
printf("1\n%d\n", x);
return 0;
} else {
for (it = s.begin(); it != s.end(); it++) {
t = *it;
if (s.count(t + x + y)) {
printf("1\n%d\n", t + x);
return 0;
} else if (s.count(t + x - y) && t + x <= l) {
printf("1\n%d\n", t + x);
return 0;
} else if (s.count(t - x + y) && t - x >= 0) {
printf("1\n%d\n", t - x);
return 0;
}
}
}
printf("2\n%d %d\n", x, y);
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
string s;
cin >> s;
long long ans = 0;
long long cnt = s.size();
long long re = 0;
for (long long i = 0; i < cnt - 1; i++) {
if (s[i] == s[i + 1])
re++;
else {
ans += re;
re = 0;
}
}
re = 0;
for (long long i = cnt - 1; i > 0; i--) {
if (s[i] == s[i - 1])
re++;
else {
ans += re + 1;
re = 0;
}
}
cout << cnt * (cnt - 1) / 2 - ans << endl;
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
long long n, r[200000], a[200000], bad, brd, odd, ll, rr, cnt[200000],
cntl[200000], i, j, ans;
int main() {
scanf("%d", &n);
for (i = 0; i < n; ++i) scanf("%d", &r[i]), ++cnt[r[i]];
for (i = 0; i < 200000; ++i)
if (cnt[i] % 2LL) ++odd;
if (odd > 1) {
printf("%d\n", 0);
return 0;
}
for (i = 0; i < 200000; ++i) cnt[i] = 0;
for (i = 0; i < n / 2LL && r[i] == r[n - i - 1]; ++i) ++brd;
for (i = brd; i < n - brd; ++i) a[i - brd] = r[i], ++cnt[r[i]];
if (n - 2LL * brd <= 1LL) {
printf("%lld\n", (n * (n + 1LL)) / 2LL);
return 0;
}
n -= 2LL * brd;
if (n % 2LL) {
long long gmid = 0;
if (cnt[a[n / 2LL]] % 2LL) {
while (a[n / 2 - gmid] == a[n / 2 + gmid]) ++gmid;
}
for (i = n / 2 - gmid + 1; i <= n / 2 + gmid - 1; ++i) --cnt[a[i]];
long long minl, minr;
bad = 0;
for (i = 0; i < 200000; ++i)
if (cnt[i]) ++bad;
for (i = 0; i < 200000; ++i) cntl[i] = 0;
for (i = 0; i < n; ++i) {
++cntl[a[i]];
if (i >= n / 2 - gmid + 1 && i <= n / 2 + gmid - 1) --cntl[a[i]];
if (cntl[a[i]] && cntl[a[i]] == (cnt[a[i]] + 1) / 2LL) --bad;
if (i == n / 2 + gmid - 1) {
for (j = n / 2 - gmid + 1; j <= n / 2 + gmid - 1; ++j) {
++cntl[a[j]];
++cnt[a[j]];
}
for (j = n / 2 - gmid + 1; j <= n / 2 + gmid - 1; ++j)
if (cntl[a[j]] == (cnt[a[j]] + 1) / 2LL) --bad;
}
if (!bad) {
minl = i;
break;
}
}
gmid = 0;
if (cnt[a[n / 2LL]] % 2LL) {
while (a[n / 2 - gmid] == a[n / 2 + gmid]) ++gmid;
}
for (i = n / 2 - gmid + 1; i <= n / 2 + gmid - 1; ++i) --cnt[a[i]];
bad = 0;
for (i = 0; i < 200000; ++i)
if (cnt[i]) ++bad;
for (i = 0; i < 200000; ++i) cntl[i] = 0;
for (i = n - 1; i >= 0; --i) {
++cntl[a[i]];
if (i >= n / 2 - gmid + 1 && i <= n / 2 + gmid - 1) --cntl[a[i]];
if (cntl[a[i]] && cntl[a[i]] == (cnt[a[i]] + 1) / 2LL) --bad;
if (i == n / 2 - gmid + 1) {
for (j = n / 2 - gmid + 1; j <= n / 2 + gmid - 1; ++j) {
++cntl[a[j]];
++cnt[a[j]];
}
for (j = n / 2 - gmid + 1; j <= n / 2 + gmid - 1; ++j)
if (cntl[a[j]] == (cnt[a[j]] + 1) / 2LL) --bad;
}
if (!bad) {
minr = i;
break;
}
}
printf("%lld\n", (brd + 1LL) * (brd + (n - minl)) +
(brd + 1LL) * (brd + (minr + 1LL)) -
(brd + 1LL) * (brd + 1LL));
} else {
long long gmid = 0;
while (a[n / 2 - gmid - 1] == a[n / 2 + gmid]) ++gmid;
for (i = n / 2 - gmid; i <= n / 2 + gmid - 1; ++i) --cnt[a[i]];
long long minl, minr;
bad = 0;
for (i = 0; i < 200000; ++i)
if (cnt[i]) ++bad;
for (i = 0; i < 200000; ++i) cntl[i] = 0;
for (i = 0; i < n; ++i) {
++cntl[a[i]];
if (i >= n / 2 - gmid && i <= n / 2 + gmid - 1) --cntl[a[i]];
if (cntl[a[i]] == cnt[a[i]] / 2LL) --bad;
if (i == n / 2 + gmid - 1)
for (j = n / 2 - gmid; j <= n / 2 + gmid - 1; ++j) {
++cntl[a[j]];
if (cntl[a[j]] == cnt[a[j]] / 2LL) --bad;
}
if (!bad) {
minl = i;
break;
}
}
bad = 0;
for (i = 0; i < 200000; ++i)
if (cnt[i]) ++bad;
for (i = 0; i < 200000; ++i) cntl[i] = 0;
for (i = n - 1; i >= 0; --i) {
++cntl[a[i]];
if (i >= n / 2 - gmid && i <= n / 2 + gmid - 1) --cntl[a[i]];
if (cntl[a[i]] == cnt[a[i]] / 2LL) --bad;
if (i == n / 2 - gmid)
for (j = n / 2 - gmid; j <= n / 2 + gmid - 1; ++j) {
++cntl[a[j]];
if (cntl[a[j]] == cnt[a[j]] / 2LL) --bad;
}
if (!bad) {
minr = i;
break;
}
}
printf("%lld\n", (brd + 1LL) * (brd + (n - minl)) +
(brd + 1LL) * (brd + (minr + 1LL)) -
(brd + 1LL) * (brd + 1LL));
}
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200100;
long long low[MAXN], disc[MAXN], v[MAXN], tempo = 0;
vector<long long> grafo[MAXN], g[MAXN];
set<pair<long long, long long>> ponte;
bool vis[MAXN];
long long p[MAXN];
long long find(long long x) {
if (p[x] == x) return x;
return p[x] = find(p[x]);
}
void join(long long a, long long b) { p[find(a)] = find(b); }
void dfs(long long x, long long p) {
low[x] = disc[x] = ++tempo;
vis[x] = true;
for (long long i = 0; i < grafo[x].size(); i++) {
long long at = grafo[x][i];
if (at == p) continue;
if (vis[at] == true)
low[x] = min(low[x], disc[at]);
else {
dfs(at, x);
low[x] = min(low[x], low[at]);
if (low[at] > disc[x]) ponte.insert({x, at}), ponte.insert({at, x});
}
}
}
void solve(long long x) {
vis[x] = true;
for (long long i = 0; i < grafo[x].size(); i++) {
long long at = grafo[x][i];
if (vis[at] == true) continue;
if (ponte.find({x, at}) == ponte.end()) join(x, at);
solve(at);
}
}
long long t[MAXN], resp[MAXN];
bool sub[MAXN];
long long guad[MAXN];
long long st = 0;
void d(long long x) {
vis[x] = true;
sub[x] = true;
if (t[x] > 1) sub[x] = false;
long long h = 0;
for (long long i = 0; i < g[x].size(); i++) {
long long at = g[x][i];
if (vis[at] == true) continue;
d(at);
if (sub[at] == false) sub[x] = false;
h = max(guad[at], h);
}
if (sub[x] == true)
guad[x] = h + v[x];
else
st += resp[x];
}
signed main() {
memset(resp, 0, sizeof resp);
memset(t, 0, sizeof t);
memset(guad, 0, sizeof guad);
long long n, m;
cin >> n >> m;
for (long long i = 1; i <= n; i++) cin >> v[i], p[i] = i;
for (long long i = 1; i <= m; i++) {
long long x, y;
cin >> x >> y;
grafo[x].push_back(y);
grafo[y].push_back(x);
}
long long s;
cin >> s;
dfs(s, s);
memset(vis, false, sizeof vis);
solve(s);
for (long long i = 1; i <= n; i++) resp[find(i)] += v[i], t[find(i)]++;
for (auto i : ponte) {
long long a = find(i.first), b = find(i.second);
g[a].push_back(b), g[b].push_back(a);
}
memset(vis, false, sizeof vis);
d(find(s));
long long h = 0, rr = 0;
for (long long i = 1; i <= n; i++) {
if (t[i] > 1) continue;
rr += guad[i];
h = max(h, guad[i]);
}
cout << st + h << endl;
}
| 2,200 | CPP |
import os
import sys
from io import BytesIO, IOBase
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")
t = int(input())
li = [0]
for i in range(int(1e5+10)):
li.append(li[-1]+i+1)
for ti in range(t):
n = int(input())
s = input()
a1 = []
a0 = []
adv = -1
for i in s:
if i == '2':
if adv == -1:
a1.append('1')
a0.append('1')
else:
if adv==0:
a0.append('0')
a1.append('2')
else:
a0.append('2')
a1.append('0')
# eval("a%d.append('0')"%adv)
# eval("a%d.append('2')"%(adv^1))
#adv^=1
elif i == '0':
a1.append('0')
a0.append('0')
else:
if adv == -1:
adv = 0
a0.append('1')
a1.append('0')
else:
if adv==0:
a0.append('0')
a1.append('1')
else:
a0.append('1')
a1.append('0')
# eval("a%d.append('0')"%adv)
# eval("a%d.append('1')"%(adv^1))
#dv^=1
print(*a0,sep='')
print(*a1,sep='')
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'H' || s[i] == 'Q' || s[i] == '9') {
x = 1;
break;
}
}
if (x == 1)
cout << "YES\n";
else
cout << "NO\n";
}
| 900 | CPP |
t=int(input())
for test in range(t):
x=input()
y=list(x)
z=[]
for i in range(len(y)):
if y[i]=='R':
z.append(i)
if len(z)>0:
if len(z)==1:
p=z[0]
q=len(y)-z[0]-1
if p>=q:
max=p
else:
max=q
print(max+1)
else:
a=[]
for i in range(1,len(z)):
a.append(z[i]-(z[i-1]+1))
a.append(len(y)-z[len(z)-1]-1)
a.append(z[0])
m=a[0]
for i in range(len(a)):
if a[i]>m:
m=a[i]
print(m+1)
else:
print(len(y)+1) | 1,100 | PYTHON3 |
n = int(input())
ans = 0
for i in range(n):
i = n-i
ans += 1 / i
print (ans)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100010;
const long long MAXM = 1000010;
long long INF;
struct node {
long long id;
long long l, r;
} intree[MAXN << 2], outree[MAXN << 2];
struct edge {
long long v;
long long w;
long long nxt;
} e[MAXM << 2];
struct road {
long long i;
long long dis;
bool operator<(const road &rhs) const { return dis > rhs.dis; }
};
priority_queue<road> q;
long long n, m, s;
long long innum[MAXN], ounum[MAXN];
long long d[MAXM];
long long vis[MAXM], cnt = 0;
long long tot = 0;
long long head[MAXM << 2];
void adde(long long u, long long v, long long w) {
tot++;
e[tot].v = v;
e[tot].w = w;
e[tot].nxt = head[u];
head[u] = tot;
}
long long inbuild(long long o, long long l, long long r) {
intree[o].l = l;
intree[o].r = r;
intree[o].id = cnt++;
if (l == r) return innum[l] = intree[o].id;
long long mid = (l + r) >> 1;
adde(inbuild(((o) << 1), l, mid), intree[o].id, 0);
adde(inbuild(((o) << 1 | 1), mid + 1, r), intree[o].id, 0);
return intree[o].id;
}
long long oubuild(long long o, long long l, long long r) {
outree[o].l = l;
outree[o].r = r;
outree[o].id = cnt++;
if (l == r) return ounum[l] = outree[o].id;
long long mid = (l + r) >> 1;
adde(outree[o].id, oubuild(((o) << 1), l, mid), 0);
adde(outree[o].id, oubuild(((o) << 1 | 1), mid + 1, r), 0);
return outree[o].id;
}
void inmodify(long long o, long long l, long long r, long long fa,
long long w) {
if (intree[o].l >= l && intree[o].r <= r) {
adde(intree[o].id, fa, w);
return;
}
long long mid = (intree[o].l + intree[o].r) >> 1;
if (r <= mid)
inmodify(((o) << 1), l, r, fa, w);
else if (l >= mid + 1)
inmodify(((o) << 1 | 1), l, r, fa, w);
else {
inmodify(((o) << 1), l, mid, fa, w);
inmodify(((o) << 1 | 1), mid + 1, r, fa, w);
}
}
void oumodify(long long o, long long l, long long r, long long fa,
long long w) {
if (outree[o].l >= l && outree[o].r <= r) {
adde(fa, outree[o].id, w);
return;
}
long long mid = (outree[o].l + outree[o].r) >> 1;
if (r <= mid)
oumodify(((o) << 1), l, r, fa, w);
else if (l >= mid + 1)
oumodify(((o) << 1 | 1), l, r, fa, w);
else {
oumodify(((o) << 1), l, mid, fa, w);
oumodify(((o) << 1 | 1), mid + 1, r, fa, w);
}
}
void sssp() {
memset(d, 0x7f, sizeof(d));
INF = d[0];
q.push((road){innum[s], 0});
d[innum[s]] = 0;
while (!q.empty()) {
road t = q.top();
q.pop();
if (d[t.i] != t.dis) continue;
for (long long i = head[t.i]; i != NULL; i = e[i].nxt) {
if (t.dis + e[i].w < d[e[i].v]) {
long long v = e[i].v;
d[v] = t.dis + e[i].w;
q.push((road){v, d[v]});
}
}
}
}
int main() {
scanf("%lld%lld%lld", &n, &m, &s);
inbuild(1, 1, n);
oubuild(1, 1, n);
for (long long i = 1; i <= n; i++) {
adde(innum[i], ounum[i], 0);
adde(ounum[i], innum[i], 0);
}
while (m--) {
long long opt, v, l, r, w;
scanf("%lld", &opt);
switch (opt) {
case 1: {
scanf("%lld%lld%lld", &l, &v, &w);
adde(innum[l], ounum[v], w);
break;
}
case 2: {
scanf("%lld%lld%lld%lld", &v, &l, &r, &w);
oumodify(1, l, r, innum[v], w);
break;
}
case 3: {
scanf("%lld%lld%lld%lld", &v, &l, &r, &w);
inmodify(1, l, r, ounum[v], w);
break;
}
}
}
sssp();
for (long long i = 1; i <= n; i++)
if (d[ounum[i]] != INF)
printf("%lld%c", d[ounum[i]], " \n"[i == n]);
else
printf("-1%c", " \n"[i == n]);
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int f[2005];
long long ans = 1;
int find(int x) {
if (f[x] == x)
return x;
else {
f[x] = find(f[x]);
return f[x];
}
}
void union1(int x, int y) { f[find(x)] = find(y); }
int main() {
cin >> n >> m >> k;
for (int i = 0; i < n; i++) f[i] = i;
for (int i = 0; i < n + 1 - k; i++) {
for (int j = 0; j < k / 2; j++) {
union1(i + j, i - j + k - 1);
}
}
for (int i = 0; i < n; i++) {
if (i == find(i)) {
ans = (ans * m) % 1000000007;
}
}
cout << ans;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, M = 1510;
const long long Inf = 1e8, Sed = 31313, Mod = 1e12 + 7;
const int Prime[] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 23};
map<long long, int> mp;
int stk[N], divd[N], top;
int num[12][N], rec[12][N];
int cnt[N];
int dis[M][M], tmp[M], temp[N];
void Init(int now, int div, long long prob) {
if (now == 9) {
divd[++top] = div;
for (int i = 0; i <= 8; i++) num[i][top] = stk[i];
long long hash = 0;
for (int i = 1; i <= 8; i++)
if (stk[i]) {
hash = (hash * Sed % Mod + stk[i]) % Mod;
}
mp[hash] = top;
return;
}
for (int i = 0, sz = stk[now - 1]; i <= sz; i++) {
stk[now] = i;
Init(now + 1, div * (i + 1), prob);
prob *= Prime[now];
if (prob > Inf) break;
}
}
int ls[11];
int GetIndex(int x) {
int now = x;
memset(ls, 0, sizeof(ls));
for (int i = 1, j; i <= cnt[x]; i++) {
j = rec[i][x];
while (!(now % j)) now /= j, ++ls[i];
}
sort(ls + 1, ls + cnt[x] + 1);
long long hash = 0;
for (int i = cnt[x]; i >= 1; i--) hash = (hash * Sed % Mod + ls[i]) % Mod;
return mp[hash];
}
void Floyd() {
for (int k = 1; k <= top; k++) {
for (int i = 1; i <= top; i++) {
if (i == k || dis[i][k] >= 100) continue;
for (int j = 1; j <= top; j++) {
if (i == j || j == k || dis[k][j] > 100) continue;
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
for (int i = 1; i <= top; i++) {
for (int j = 1; j <= top; j++) tmp[j] = dis[i][j], dis[i][j] = 1e9;
for (int j = 1; j <= top; j++)
dis[i][divd[j]] = min(dis[i][divd[j]], tmp[j]);
}
for (int i = 2, j; i < N; i++) {
if (cnt[i]) continue;
j = i;
while (j + 5 < N) rec[++cnt[j]][j] = i, j += i;
}
}
bool vis[N];
int sze;
void Init_Bef() {
stk[0] = 30;
Init(1, 1, 1);
memset(dis, 63, sizeof(dis));
for (int i = 1; i <= top; i++) dis[i][i] = 0;
for (int i = 1; i <= top; i++) {
for (int j = 1; j <= 8; j++) {
if (num[j][i] + 1 > num[j - 1][i]) continue;
long long hash = 0;
++num[j][i];
for (int k = 1; k <= 8; k++)
if (num[k][i]) hash = (hash * Sed % Mod + num[k][i]) % Mod;
--num[j][i];
if (mp.count(hash)) {
int idx = mp[hash];
dis[idx][i] = dis[i][idx] = 1;
}
}
}
Floyd();
for (int i = 1; i <= top; i++)
if (!vis[divd[i]]) vis[divd[i]] = 1, temp[++sze] = divd[i];
}
int T, x, y;
int main() {
Init_Bef();
for (scanf("%d", &T); T--;) {
scanf("%d%d", &x, &y);
x = GetIndex(x);
y = GetIndex(y);
int ans = 1e9;
for (int i = 1; i <= sze; i++)
ans = min(ans, dis[x][temp[i]] + dis[y][temp[i]]);
printf("%d\n", ans);
}
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, a, b, c, d;
cin >> x >> t >> a >> b >> c >> d;
if (x == 0) {
cout << "YES" << endl;
return 0;
}
{
int sum = a, pp;
if (((a - x) % c) == 0) {
pp = a - x;
pp /= c;
if (pp >= 0 && pp < t) {
cout << "YES" << endl;
return 0;
}
}
}
{
int pp;
if (((b - x) % d) == 0) {
pp = b - x;
pp /= d;
if (pp >= 0 && pp < t) {
cout << "YES" << endl;
return 0;
}
}
}
int sum = a + b;
int need = sum - x;
if (x > sum) {
cout << "NO" << endl;
return 0;
}
int tt;
for (tt = 0; tt < t; tt++) {
int tnum = need - tt * c;
if (tnum < 0) {
cout << "NO" << endl;
return 0;
}
if (tnum % d == 0) {
int pf = tnum / d;
if (pf < t) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
const int maxx = 1e6 + 100;
const int mod = 1e9 + 7;
long long gcd(long long a, long long b) {
while (b ^= a ^= b ^= a %= b)
;
return a;
}
int fa[300];
void init() {
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= i; j++) {
fa[i] += j;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
init();
int a;
cin >> a;
while (a--) {
stack<int> q;
int n, k;
bool flag = false;
cin >> n >> k;
int turn = k + 1, rest = 100;
int vis = -1;
if (n - fa[k] < 0) {
cout << -1 << endl;
continue;
}
if ((n - fa[k]) % turn == 0) {
rest = (n - fa[k]) / turn;
vis = 0;
}
for (int i = 1; i <= 9; i++) {
int sum = i, pre = i;
bool biaoji = false;
for (int j = 1; j <= k; j++) {
pre++;
if (pre > 9) {
pre = 1;
biaoji = true;
}
sum += pre;
}
if (n >= sum && (n - sum) % turn == 0 && (n - sum) / turn < rest) {
rest = (n - sum) / turn;
vis = i;
flag = biaoji;
}
}
if (vis == -1) {
cout << -1 << endl;
continue;
}
q.push(vis);
while (rest) {
if (flag && rest > 8 && q.size() == 1) {
rest -= 8;
q.push(8);
} else {
q.push(min(9, rest));
rest -= min(9, rest);
}
}
while (q.size()) {
cout << q.top();
q.pop();
}
cout << endl;
}
return 0;
}
| 2,200 | CPP |
l1=[]
l2=[]
n=int(input())
for _ in range(n):
x,y=list(map(int,input().split()))
l1.append(x)
l2.append(y)
ans=[1]*n
for i in range(len(l1)):
for j in range(len(l2)):
if i==j:
continue
if l2[i]==l1[j]:
ans[j]=0
print(sum(ans)) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, S, D;
bitset<1005> arr[30], tmp, tmp2;
unordered_map<bitset<1005>, int> bf;
int main() {
cin >> N >> S >> D;
for (int i = 0; i < S; ++i) {
int c;
cin >> c;
for (int j = 0; j < c; ++j) {
int cur;
cin >> cur;
arr[i][cur - 1] = 1;
}
}
for (int i = 0; i < (1 << 20); ++i) {
tmp.reset();
for (int j = 0; j < 20; ++j) {
if (i & (1 << j)) tmp ^= arr[j];
}
if (bf.find(tmp) == bf.end()) {
bf[tmp] = __builtin_popcount(i);
} else {
bf[tmp] = min(bf[tmp], __builtin_popcount(i));
}
}
for (int i = 0; i < D; ++i) {
tmp.reset();
int c;
cin >> c;
for (int j = 0; j < c; ++j) {
int cur;
cin >> cur;
tmp[cur - 1] = 1;
}
int ans = 1e9;
for (int j = 0; j < (1 << 10); ++j) {
tmp2.reset();
for (int k = 0; k < 10; ++k) {
if (j & (1 << k)) tmp2 ^= arr[20 + k];
}
tmp2 ^= tmp;
if (bf.find(tmp2) != bf.end())
ans = min(ans, bf[tmp2] + __builtin_popcount(j));
}
cout << (ans == 1e9 ? -1 : ans) << endl;
}
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str[1000010];
int main() {
scanf("%s", str);
printf("%s", str);
reverse(str, str + strlen(str));
printf("%s\n", str);
return 0;
}
| 1,000 | CPP |
I=lambda:input().split(" ")
a=I()
y=I()
c=[]
for i in range(int(a[0])):
f=int(a[1])
g=2*f
h=int(y[i])
for j in c:
d=abs(h-j[0])
if d<=g:
f=max(f,j[1]+(g*g-d*d)**.5)
c.append([h,f])
for i in c:print(i[1]) | 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int s[5][5] = {0};
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= 3; j++) {
cin >> s[i][j];
}
}
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= 3; j++) {
cout << (s[i][j] + s[i][j - 1] + s[i][j + 1] + s[i - 1][j] + s[i + 1][j] +
1) %
2;
}
cout << endl;
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dp[10001] = {0};
int cal(long long int n, long long int m) {
if (n >= m) return (n - m);
if (dp[m] != 0)
return dp[m];
else {
if (m & 1) {
dp[m] = 1 + cal(n, m + 1);
} else {
dp[m] = 1 + cal(n, m / 2);
}
}
return dp[m];
}
int main() {
long long int m, n, cnt = 0;
cin >> n >> m;
cnt = cal(n, m);
cout << cnt << '\n';
}
| 1,400 | CPP |
#include <bits/stdc++.h>
int n;
std::vector<std::vector<int>> ans;
void out(int x, int y, int z) { ans.emplace_back(std::vector<int>({x, y, z})); }
void out(int x, int y, int z, int w) {
ans.emplace_back(std::vector<int>({x, y, z, w}));
}
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n;
if (n & 1) {
for (int i = 2; i < n; i += 2)
for (int j = i + 2; j < n; j += 2)
out(i, j + 1, i + 1, j), out(i, j + 1, i + 1, j);
for (int i = 2; i < n; i += 2) out(1, i, i + 1), out(1, i, i + 1);
} else {
for (int i = 3; i < n; i += 2)
for (int j = i + 2; j < n; j += 2)
out(i, j + 1, i + 1, j), out(i, j + 1, i + 1, j);
out(1, 2, 4, 3);
out(1, 2, 3, 4);
out(1, 3, 2, 4);
for (int i = 5; i < n; i += 2)
out(1, i, i + 1), out(2, i, i + 1), out(1, i, 2, i + 1);
}
std::cout << ans.size() << '\n';
for (auto c : ans) {
std::cout << c.size();
for (int p : c) std::cout << ' ' << p;
std::cout << '\n';
}
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 0 && n != 1) {
cout << "No solution" << endl;
return 0;
}
for (int i = 0; i < n; i++) {
cout << min(m, 9);
m -= min(m, 9);
}
return 0;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int p[n];
vector<int> v;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] >= n - k + 1) {
v.push_back(i + 1);
sum += p[i];
}
}
sort(v.begin(), v.end());
long long p2 = 1;
for (int i = 1; i < v.size(); i++) {
p2 = (p2 * (v[i] - v[i - 1])) % 998244353;
}
cout << sum << "\t" << p2 << "\n";
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, a, b, x = 945049, m = 15e6;
signed main() {
scanf("%lld %lld %lld", &n, &a, &b);
printf("%lld %lld", a * x % m * m + 1, b * x % m * m);
}
| 3,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.1415926535897932384626;
const long long MOD = 1000000007;
void Solve() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
a[n - 1] = (a[n - 1] == 1) ? 2 : 1;
sort(a, a + n);
for (long long i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
Solve();
return 0;
}
| 1,300 | CPP |
#RAVENS
#TEAM_2
#ESSI-DAYI_MOHSEN-LORENZO
arr=[]
n,m = map(int,input().split())
for i in range(n):arr.append(list(map(int,input().split())))
print(2 if 1 in arr[0] or 1 in arr[n-1] or (any(arr[i][0] for i in range(n))) or (any(arr[i][m-1]for i in range(n))) else 4) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long k, a, b;
while (cin >> k >> a >> b) {
long long c = 0;
if (b <= 0) {
if (b == 0) {
a = -a;
c = a / k;
c++;
cout << c << endl;
} else {
a = -a, b = -b;
if (b % k == 0)
c = b / k - 1;
else
c = b / k;
c = a / k - c;
cout << c << endl;
}
} else if (a >= 0) {
if (a == 0) {
c = b / k;
c++;
cout << c << endl;
} else {
if (a % k == 0)
c = a / k - 1;
else
c = a / k;
c = b / k - c;
cout << c << endl;
}
} else {
a = -a;
c = a / k + b / k;
c++;
cout << c << endl;
}
}
}
| 1,600 | CPP |
Subsets and Splits