solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n;
int a[n];int x=0;
for(int i=0;i<n;++i){
cin>>a[i];
x =a[i]^x;
}
for(int i=0;i<n;++i){
k=x^a[i];
cout<<k<<" ";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
using namespace std;
bool Solve(int n, vector<int> &val, int mid, vector<bool> &ans) {
int last0 = 0, last1 = mid;
for (int i = 0; i < n; i++) {
if (val[i] >= last1) {
ans[i] = true;
last1 = val[i];
} ... | 3 |
#include <bits/stdc++.h>
using namespace std;
void Code_780A_AndryushaAndSocks();
void Code_625A_GuestFromThePast();
void Code_799A_CarrotCakes();
void Code_222A_ShooshunsAndSequence();
void Code_336A_VasilyTheBearAndTriangle();
void Code_157A_GameOutcome();
void Code_485A_Factory();
void Code_16A_Flag();
void Code_382... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int nx;
long int x;
long int y;
long int z;
long int px = 1;
long int py = 1;
long int pz = 1;
long int k;
cin >> x;
cin >> y;
cin >> z;
cin >> k;
long int maxk = x + y + z - 3;
if (k > maxk) {
nx = (long long int)x * y... | 1 |
#include <bits/stdc++.h>
using namespace std;
void ans(vector<string>& a, int n) {
int size = 0;
vector<string> b;
string c = "";
int k;
for (int i = 0; i < n; i++) {
c += a[i][0];
c += a[i][1];
k = 2;
size = a[i].length();
for (int j = 3; j < size; j += 2) {
c += a[i][j];
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
return __gcd(a, b);
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
vector<long long> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
int flag = 0;
for (int j = i - 1; j >= i - x; j--) {
if (j < 0) break;
if (v[j] <= v[i]) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int prim[maxn], vis[maxn], cnt;
void sprim() {
for (int i = 2; i < maxn; i++) {
if (!vis[i]) prim[++cnt] = i;
for (int j = 1; j <= cnt && i * prim[j] < maxn; j++) {
vis[i * prim[j]] = 1;
if (i % prim[j] == 0) break;
}
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int arr[n + 1];
for (int i = 1; i <= n; i++) cin >> arr[i];
int c = 0;
for (int i = 0; i < m; i++) {
int ch;
cin >> ch;
if (ch == 1) {
int y;
int z;
cin >> y >> z;
arr[y] = z;
arr[y]... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 69;
const long long LOGN = 20;
struct edge {
long long u, v, w;
bool operator<(const edge& oth) const { return w < oth.w; }
};
struct vl {
long long x, y;
};
struct node {
long long p, ma;
};
long long n, m;
vector<edge> e;
vector<vl> a[... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int cases;
cin >> cases;
while (cases > 0) {
cases -= 1;
int a;
cin >> a;
if (a < 31) {
cout << "NO" << '\n';
} else {
cout << "YES" << '\n';
if (a - 30 == 6) {
... | 1 |
#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
#define dis(p,q) ((p)*(p)+(q)*(q))
int main(){
int i,j,k;
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
const int MAXP = 20;
int par[MAXP][MAXN];
int depth[MAXN];
int n, m;
vector<int> G[MAXN];
void dfs(int u, int p, int d) {
par[0][u] = p;
depth[u] = d;
for (auto v : G[u])
if (v != p) dfs(v, u, d + 1);
}
void calc_par(void) {
for (int p(1); ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n;
bool exists[1 << 22] = {false};
bool visited[1 << 22];
void dfs1(int u, stack<int> &st) {
assert(u >= 0 && u < (1 << n));
visited[u] = true;
if (exists[u]) {
const int v = ((1 << n) - 1) ^ u;
assert(v >= 0 && v < (1 << n));
if (!visited[v]) dfs1(v, ... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0)
return b;
else
return gcd(b % a, a);
}
set<long long> divs;
vector<long long> vecDivs;
void allDiv(long long a) {
long long sqA = sqrt(a) + 1;
for (int i = 1; i < sqA; i++) {
if (a % i == 0) {
d... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int frsti, lsti, frstj, lstj, n, m, le, ri, ans, mid;
vector<int> dp[N], dp1[N], a[N], fix[N];
char ch;
int sz(int i, int j, int i1, int j1) {
int len = (i1 - i + 1);
int height = (j1 - j + 1);
return len * height;
}
int cnt(int i, int j, int i1... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, p = 1e9 + 7;
int n, ans = 0;
long long jc[N];
long long qpow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1) r = r * a % p;
a = a * a % p;
b >>= 1;
}
return r;
}
long long C(long long m, long long n) {
long lo... | 3 |
#include<bits/stdc++.h>
using namespace std;
void getmax(int &x,int y){x=max(x,y);}
void getmin(int &x,int y){x=min(x,y);}
int n,q,l,r;
int b[200100],dat[524288],mx=262144,dp[200100];
int w[200100],pre[200100];
vector<int> opr[200100];
void update(int l,int r,int delta){
l+=mx;r+=mx;
while(l<=r){
getmin(dat[l],delt... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int login(int a, int b, int c){
int count = 0;
while( c > 0 ){
c -= a;
count++;
if(count % 7 == 0) c -= b;
}
return count;
}
int main(){
int a, b, c;
scanf("%d %d %d",&a, &b, &c);
printf("%d\n",login(a... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
const int mod = 1e9 + 7;
int cnt1[N], cnt2[N];
int main() {
string s;
cin >> s;
int i;
s = " " + s;
int n = (int)s.size() - 1;
for (i = 1; i < (int)s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z')
cnt1[i] = cnt1[i - 1] + 1;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, temp, arr[1005];
scanf("%lld", &n);
for (i = 0; i < n; i++) scanf("%lld", &arr[i]);
for (i = 0; i < n - 1; i++) {
if (i % 2 == 0) {
if (arr[i] > arr[i + 1]) {
temp = arr[i];
arr[i] = arr[i + 1];
arr[... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, a;
vector<int> v;
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a != 0 && a <= k) {
v.push_back(10 * abs(i + 1 - m));
}
}
sort(v.begin(), v.end());
printf("%d\n", v[0]);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, a, b, lo = 0, hi = m, res;
scanf("%I64d %I64d", &a, &b);
m = (b - 1) / a;
m++;
printf("%I64d\n", m);
return 0;
}
| 1 |
#include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int main(){
double a,b,c,s,l,h;
cin >> a >> b >> c;
s=0.5*a*b*sin((M_PI*c*1.0)/180);
l=a+b+sqrt(pow(a,2.0)+pow(b,2.0)-2*a*b*cos((M_PI*c*1.0)/180));
h=b*sin((M_PI*c*1.0)/180);
printf("%.8f\n%.8f\n%.8f\n",s,l,h);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int cnt = 0;
void insertionSort(int a[], int n, int g) {
for (int i=g; i<n; i++) {
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v) {
a[j+g] = a[j];
j -= g;
cnt++;
}
a[j+g] = v;
}
}
void shellSort(int a[], int n) {
vecto... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = 3.14159265359;
vector<long long> primes;
void GeneratingPrimes(int top) {
vector<bool> p(top + 1, 1);
p[0] = p[1] = 0;
for (int i = 2; i <= sqrt(top); i++) {
if (p[i]) {
for (int j = i * i; j <= top; j += i) {
... | 4 |
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<sstream>
#include<cmath>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<i... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int max_m = 55;
const int inv = 1000000007;
long long n;
int m, k;
long long a[max_m][max_m], b[max_m][max_m], c[max_m][max_m], d[max_m][max_m];
void mult() {
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++) {
a[i][j] = 0;
for (int k = 0; k < ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, m, k, t, mx;
cin >> t;
while (t--) {
cin >> n >> m >> k;
mx = min(n / k, m);
cout << (m >= mx ? mx - ceil((long double)(m - mx) / (k - 1)) : mx) << '\n';
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[100], dis[100][50], l, r, num, ans, down, tot;
long long dfs(long long book, long long go, bool to) {
if (book == -1) {
return 1;
}
if (to == 0 && dis[book][go] != -1) {
return dis[book][go];
}
long long down = to ? a[book] : 9;
long long ans... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, d, m;
int main() {
cin >> n >> d;
vector<int> a(n);
for (auto i(0); i < n; ++i) cin >> a[i];
cin >> m;
sort(begin(a), end(a));
;
long long sum = 0;
for (auto i(0); i < min(n, m); ++i) sum += a[i];
cout << sum - (n < m) * d * (m - n);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int e = 0, o = 0;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] & 1)
o++;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long M = 1000000007;
void solve() {
long long x;
cin >> x;
string s;
cin >> s;
long long l = s.size();
vector<char> v(s.begin(), s.end());
for (int i = 1; i <= x; i++) {
int c = v[i - 1] - '1';
if (v.size() < x) {
vector<char> tmp(v.begin() ... | 3 |
#include <bits/stdc++.h>
using namespace std;
struct room {
int x, y, z;
};
struct s {
int x, y, cost;
};
room a[500 + 1];
s b[500 + 1];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i].x >> a[i].y >> a[i].z;
int m;
cin >> m;
for (int i = 0; i < m; ++i) cin >> b[i].x >> b[i].y >> b[... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1000006, INF = 1e18, MOD = 1e9 + 7;
long long n, w, nn, m, a[20][20], b[N], f[20][26], c[20], dp[1 << 20], d[20],
e[20], x, y, t, u, o, h, ans, Ans = INF;
pair<int, pair<int, int> > p[20];
string second;
vector<string> s;
vector<long long> v[N];
vect... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int ans = 0, a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (e < f) {
int now = min(d, min(b, c));
ans += now * f... | 1 |
#include <bits/stdc++.h>
using namespace std;
char enl = '\n';
int n;
int fx1, fy1, fx2, fy2;
int sx1, sy1, sx2, sy2;
bool lr1(int l, int r) {
if (l == r) return false;
int m = (l + r) / 2;
int ls, rs;
cout << "? 1 1 " << n << " " << m << endl;
cin >> ls;
cout << "? 1 " << (m + 1) << " " << n << " " << n <<... | 4 |
#include <bits/stdc++.h>
using namespace std;
inline const int getint() {
int r = 0, k = 1;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') k = -1;
for (; c >= '0' && c <= '9'; c = getchar()) r = r * 10 + c - '0';
return k * r;
}
inline const int max(const int &a, const int &b)... | 4 |
#include<iostream>
#include<vector>
#include<unordered_set>
#include<cstdio>
using namespace std;
vector<int>e[100005]{};
int par[100005];
int Rank[100005];
int find(int x) {
if (par[x] == x)return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank... | 0 |
#include <iostream>
using namespace std;
int main() {
int h, hh, k, kk;
int a, b, c, d;
cin >> h >> hh;
cin >> k >> kk;
cin >> a >> b >> c >> d;
int sum1 = h * a + hh * b + (h / 10) * c + (hh / 20) * d;
int sum2 = k * a + kk * b + (k / 10) * c + (kk / 20) * d;
if(sum1 > sum2) cout <... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int ans = a[0];
for (int i = 1; i < n; ++i) ans = max(ans, a[i] - a[i - 1]);
cout << ans << "\n";
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int answer(int a, int b, int n, int i) {
if (a + b <= n) {
cout << i << ' ' << a << ' ' << n - a << endl;
return 1;
}
return 0;
}
int main() {
int n, a1, a2, b1, b2;
int na = -1, fa, sa;
cin >> n;
for (int i = 0; i < 4; ++i) {
cin >> a1 >> b1 >> a2... | 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
long long N, M;
long long A[1 << 18], B[1 << 18];
vector<int> X[1 << 18], Y[1 << 18];
long long Q;
long long P[1 << 18];
long long dist[1 << 18];
int main() {
scanf("%lld%lld", &N, &M);
for (int i = 1; i <= M; i++) {
scanf("%lld%lld",... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k, i;
cin >> n >> k;
string s;
cin >> s;
int ns = 1, ls = n, p = n - 1;
stack<string> st;
st.push(s);
while (ns < k && p >= 0) {
set<string> se;
while (!st.emp... | 5 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
using P = pair<int, int>;
constexpr int INF = 1e9;
int main() {
int N;
while(cin >> N, N) {
vector<int> hp(N);
int max_hp = 0;
for(int i=0; i<N; ++i) {
cin >> hp[i];
ma... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool a[33340][320], as[33340][320];
int n, m, k, ty, tl, t, z, M;
void dfs(int x, int y, int s) {
if (tl) return;
if ((x != 1 || y != 1) && s == k) {
tl = 1;
for (int i = (1); i <= (n); i++)
for (int j = (1); j <= (m); j++) as[i][j] = a[i][j];
return;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 1 << 30;
int T, N;
int t[30], D[110], M[110];
int getup[110];
int dp[110][30];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
while (cin >> T, T) {... | 0 |
#include <bits/stdc++.h>
int main() {
int H, W;
std::cin >> H >> W;
std::vector<std::vector<int>> tiles_hist(H, std::vector<int>(W, 0));
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
int val;
std::cin >> val;
if (val == 1) {
ti... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vr... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 610;
const int M = 200010;
const int M2 = 1000010;
const int MX = 1731311;
int S, T;
struct Dinic {
struct edge {
int v, nxt, cap, flow;
} E[M2];
int tot = 1;
int head[M], dis1[M], cur[M];
queue<int> q;
void add(int u, int v, int cap, int flow)... | 4 |
#include <bits/stdc++.h>
#define meow(args...) fprintf(stderr, args)
template<class T1, class T2> inline bool cmin(T1 &a, const T2 &b) {return b<a?(a=b, true):false;}
template<class T1, class T2> inline bool cmax(T1 &a, const T2 &b) {return a<b?(a=b, true):false;}
template<class Type> Type read() {
Type a;
bool b;
u... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, s[50005], ans[50005];
pair<int, int> t[50005];
int main() {
scanf("%d", &n);
for (int i = (1); i <= (n); i++) scanf("%d", &s[i]);
s[n + 1] = s[1];
for (int i = (1); i <= (n); i++) t[i] = make_pair(s[i] + s[i + 1], i);
sort(t + 1, t + n + 1);
for (int i = ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i;
scanf("%d %d", &k, &n);
if (n * 3 > k || n == 1)
printf("-1\n");
else {
for (i = 2; i <= n; i++) printf("%d ", i);
printf("1");
for (i = n; i < k; i++) printf(" %d", i % n + 1);
printf("\n");
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
string S;
cin >> N >> S;
int count = 1;
for (int i = 1; i < N; ++i)
{
if (S[i] != S[i-1])
count++;
}
cout << count;
}
| 0 |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin... | 6 |
#include <bits/stdc++.h>
using namespace std;
int CalGoodness(vector<int>& left, vector<int> right, int h) {
vector<int> s1;
for (int i = 0; i < left.size(); i++)
for (int j = 0; j < left.size(); j++)
if (i != j) {
s1.push_back(left[i] + left[j]);
}
for (int i = 0; i < right.size(); i++)
... | 2 |
#include <bits/stdc++.h>
using namespace std;
bool qf = false;
map<char, long long> a;
long long i, j;
long long power(long long a, long long b) {
long long i, p = 1;
for (i = 1; i <= b; i++) p *= a;
return p;
}
long long len, ans = 1, cnt, num, t;
char c[100001];
int main() {
for (i = 0; i < 10; i++) a[i + '0'... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
x = 0;
char c = getchar();
bool flag = false;
while (!isdigit(c)) {
if (c == '-') flag = true;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
if (flag)... | 5 |
#include <bits/stdc++.h>
using namespace std;
int p[1005][6];
vector<int> ans;
int cal(int i, int j, int k) {
int ans = 0;
for (int q = 1; q <= 5; q++) {
int x = p[j][q] - p[i][q];
int y = p[k][q] - p[i][q];
ans += x * y;
}
return ans;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i+... | 3 |
#include <bits/stdc++.h>
using namespace std;
pair<int, int> l[1000000];
void solve() {
int n;
int a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
l[i] = {t, i + 1};
}
sort(l, l + n);
for (int i = 0; i < n; i++) {
{
int aNeed = (a + l[i].first - 1) / l[i].fir... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], sum1[100005], sum2[100005];
char p[100005], tmp1[100005], tmp2[100005];
void jia1() {
int i, t = 0, tmp;
for (i = 0; i < 100005; i++) sum1[i] = a[i] + b[i];
for (i = 0; i < 100005; i++) {
tmp = t;
t = (sum1[i] + t) / 10;
sum1[i] =... | 2 |
#include <bits/stdc++.h>
using namespace std;
void file() {}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
}
const int N = 5000 + 20;
long long v[N], cum[N];
long long dp[N][N];
int n, m;
long long solve(int i, int k) {
if (!k) return 0;
if (k < 0 || i + m - 1 > n) {
return -1e9;
}
lon... | 3 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
string s;
cin >> s;
int ans = ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, a, b, c;
cin >> t;
while (t--) {
c = 0;
cin >> a >> b;
if (b > a) {
if ((b - a) & 1)
c = 1;
else
c = 2;
} else if (b == a) {
c = 0;
} else {
if ((a - b) & 1)
c = 2;
else
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
in... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> V(n), T(n);
for (int i = 0; i < n; i++) cin >> V[i];
for (int i = 0; i < n; i++) cin >> T[i];
multiset<long long> A;
long long t = 0;
for (int i = 0; i < n; i++) {
long long melted = 0;
A.insert(V[i] + ... | 3 |
#include<iostream>
#include<cstdio>
#include<cstring>
typedef long long ll;
const int N=201000,MOD=998244353;
ll qpow(ll a,ll b){ll c=1;for(;b;b>>=1,a=a*a%MOD)if(b&1)c=c*a%MOD;return c;}
void inc(int a,int &b){b=(a+b)%MOD;}
int s[N];
int n;
namespace bf
{
bool vis[N];
int ans;
void dfs(int state)
{
if(vis[stat... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, s, d, f, g, h, j, k;
cin >> a >> s >> d >> f >> g >> h >> j >> k;
cout << (min(s * d / j, min(f * g, h / k))) / a << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int LCM = 2520;
int a[20];
int b[LCM + 5];
long long dp[20][50][LCM + 5];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
long long dfs(int i, int prelcm, int presum, bool e) {
if (i < 0) return presum % prelcm == 0;
if (!e && dp[i][b[prelcm]][presum] != -... | 4 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
namespace _buff {
const size_t BUFF = 1 << 19;
char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
char getc() {
if (ib == ie) {
ib = ibuf;
ie = ibuf + fread(ibuf, 1, BUFF, stdin);
}
return ib == ie ? -1 : *ib++;
}
} // namespace _buff
LL read() {
... | 4 |
#include <bits/stdc++.h>
char pos[10 * 9 * 8 * 7][5];
int valid[10 * 9 * 8 * 7];
void fillPos() {
int posi = 0;
for (int i = 0; i < 10000; i++) {
char temp[5];
int val = 1;
sprintf(temp, "%04d", i);
for (int j = 0; j < 4; j++) {
for (int k = j + 1; k < 4; k++) {
if (temp[j] == temp[k])... | 3 |
//56
#include<iostream>
#include<map>
#include<vector>
#include<cstdlib>
#include<string>
#include<algorithm>
using namespace std;
struct P{
int x,y,t;
};
int main(){
for(int w,h;cin>>w>>h,w|h;){
int gx,gy;
map<int,vector<P> > m;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
string s;
cin>>s;
... | 0 |
#include <iostream>
#include <string>
int main(int argc, char const *argv[]) {
std::string s;
std::cin >> s;
std::cout <<s.find_last_of('Z') - s.find_first_of('A') + 1 << '\n';
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, n, m;
cin >> t;
for (long long i = 0; i < t; i++) {
cin >> n >> m;
if (n == 1)
cout << 0 << endl;
else if (n == 2)
cout << m << endl;
else
cout << m * 2 << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, ans;
while (cin >> n) {
ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1')
ans++;
else {
ans++;
break;
}
}
cout << ans << endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("Sisend.txt");
int n, c, d, a, b;
char s;
int vaata(vector<pair<int, int>> cc, int c, int &ma) {
vector<int> il;
int m = 0, n = cc.size();
for (int(i) = (0); ((i)) < ((n)); ((i))++) {
m = max(m, cc[i].second);
il.emplace_back(m);
}
int in = 0,... | 3 |
#include <bits/stdc++.h>
int main() {
int i, j, n, a = 0, g = 0, c = 0, t = 0, q = 0, k, af = 0, gf = 0, cf = 0,
tf = 0;
scanf("%d", &n);
k = n / 4;
char name[n];
scanf("%s", name);
if (n % 4 != 0) {
printf("===");
return 0;
}
for (i = 0; i < n; i++) {
if (name[i] == 'A') {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int dp[N][N];
queue<int> q;
vector<int> adj[N];
void bfs(int s) {
dp[s][s] = 0;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
for (auto it : adj[x]) {
if (dp[s][it] == -1) {
dp[s][it] = dp[s][x] + 1;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
char s[5050];
int judge(int len) {
for (int i = 0; i < len / 2; i++)
if (s[i] != s[len - 1 - i]) return -1;
if (len & 1) {
bool aaabaaa = true;
for (int i = 1; i < len / 2; i++) aaabaaa &= s[i] == s[i - 1];
return aaabaaa ? 0 : 2;
} else {
int stat... | 4 |
#include <bits/stdc++.h>
using namespace std;
int maxx;
char s[2100000];
char t[2100000];
int n, k, x;
set<int> S;
int main() {
scanf("%d", &n);
for (int i = 1; i <= 2010000; i++) S.insert(i);
while (n--) {
scanf("%s", t + 1);
int l = strlen(t + 1);
scanf("%d", &k);
while (k--) {
scanf("%d",... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
const long long N = 2e5 + 10;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true"... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e5 + 1);
const int inf = int(2e9);
int n, l, r;
int a[N], p_c[N];
int main() {
cin >> n >> l >> r;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> p_c[i];
int np_c[N];
for (int i = 0; i < n; i++) np_c[p_c[i] - 1] = i;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int> > a;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
a.push_back(make_pair(x, y));
}
sort(a.begin(), a.end());
int k = 0, sz = 102;
int floor = -1, nrf = 0;
for (int i = 1; i < ... | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define INF (ll)(1e10)
int main(){
int n, m;
cin >> n >> m;
vector<ll> cost(1<<n, INF);
cost[0]=0;
for(int i=0; i<m; i++){
int a, b;
cin >> a >> b;
int c=0;
for(int j=0; j<b; j++){
int t;
cin >> t... | 0 |
#include <bits/stdc++.h>
using namespace std;
string a, b, c, r[10], s, rr;
int n;
string nrm(string s) {
string r = "";
for (int i = 0; i < s.length(); i++)
if ((s[i] != '-') && (s[i] != ';') && (s[i] != '_')) r += tolower(s[i]);
return r;
}
int main() {
cin >> a >> b >> c;
a = nrm(a);
b = nrm(b);
c ... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using uint8 = unsigned char;
using uint16 = unsigned short int;
using uint32 = unsigned int;
using uint64 = unsigned long long;
using int8 = signed ch... | 3 |
#include <iostream>
using namespace std;
using ll = long long;
ll h, w;
ll solve(ll x, ll y){
ll ans = h * w;
for(int i = 1; i < x; i++){
ll s1 = i * y;
ll s2 = (x - i) / 2 * y;
ll s3 = x * y - s1 - s2;
ll smax = max(s1, max(s2, s3));
ll smin = min(s1, min(s2, s3));
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, w, h, m, max_height = INT_MIN, landing;
cin >> n;
vector<long long> stairs(n, 0);
for (i = 0; i < n; i++) {
cin >> stairs[i];
}
cin >> m;
for (i = 0; i < m; i++) {
cin >> w >> h;
landing = (stairs[w - 1] > max_height... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, arr[300001], ans[300001];
long long tot;
priority_queue<pair<int, int> > q;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> arr[i];
for (int i = 1; i <= k; ++i) q.push(pair<int, int>(arr[i], i));
for (int i = k + 1; i <= k + n; ++i) {
i... | 3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int64_t n;
cin >> n;
vector<pair<int64_t, int64_t>> v;
for (int64_t i = 0; i < n; i += 1) {
int64_t t;
cin >> t;
v.push_back(make_pair(t, i + 1));
}
sort(v.begin(), v.end());
if (v[0].first == v[1].first)
cout << "Still Rozdil";
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt;
int n;
cin>>n;
ll a[n+1],b[n];
for(i=0;i<n+1;i++)cin>>a[i];
for(i=0;i<n;i++)cin>>b[i];
ll sum=0;
for(i=0;i<n;i++){
if(a[i]>=b[i])sum+=b[i];
else if(b[i]-a[i]<=a[i+1]){
a[i+1]-=(b[i]-a[i]);
sum... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f3f3f;
const int N = 100000 + 10;
const double eps = 1e-15;
int n, m, num, a1, b1, z;
char s1[100100], s2[100100];
int main() {
int t, ans = 0;
scanf("%d", &n);
scanf("%s", s1);
scanf("%s", s2);
for (int i = 0, j = n - 1; i <= j; i++... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505000;
int n;
string str;
long long p[maxn], pre[maxn], suf[maxn];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; ++i) cin >> p[i];
cin >> str;
long long init = 0, now;
for (int i = 0; i < n; ++i)
if (str[i] == '... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a[1000010], t[5000000], n, m;
int create(int u, int l, int h, int& ch) {
if (l == h) {
ch = 2;
t[u] = a[l];
return t[u];
}
int z, zz;
int c = create(2 * u, l, (l + h) / 2, z);
int d = create(2 * u + 1, (l + h) / 2 + 1, h, zz);
if (z == 1) {
c... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 111111;
int A[maxn];
using namespace std;
int main() {
int n, k;
while (scanf("%d%d", &n, &k) != EOF) {
for (int i = 0; i < n; i++) scanf("%d", &A[i]);
int m = n - k;
int ans = 0;
for (int i = 0; i < m; i++) {
ans = max(ans, A[i] +... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g, comps;
const int N = 1e5 + 1;
int m, n;
bool vis[N];
vector<int> res;
int main() {
string s;
cin >> s;
int i;
i = (s.size() * 25);
i = i + 26;
cout << i << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int v, u;
long long cap, cost;
Edge() : v(), u(), cap(), cost() {}
Edge(int _v, int _u, long long _cap, long long _cost)
: v(_v), u(_u), cap(_cap), cost(_cost) {}
};
const long long INF1 = (long long)1e9;
const long long INF2 = (long long)1e15;
c... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[101];
if (n % 2 == 1) {
cout << "-1";
} else {
for (int i = 0; i <= n; i++) {
if (i % 2 == 1) {
a[i] = i + 1;
} else {
a[i] = i - 1;
}
}
for (int i = 1; i <= n; i++) {
cout... | 1 |
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
vector<int> ans;
bool check(int cl, int b, int turn) {
if (turn == n) return true;
for (int i = 1; i < s.size(); i++) {
bool k = true;
if (s[i] == '1' && i > cl && i != b) {
if (check(i - cl, i, turn + 1)) {
ans.push_back(i);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
int val[maxn], n, vis[maxn];
vector<int> son[maxn];
inline int id(char c) {
if (c == 'A') return -1;
if (c == 'I') return 0;
if (c == 'X') return -3;
if (c == 'O') return -2;
if (c == 'N') return -4;
return -4;... | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.