solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
long long MOD = 1000000007;
long long inf = 1e18;
using namespace std;
vector<long long> S;
long long p[300001];
vector<long long> Children[300001];
int main() {
ios::sync_with_stdio(0);
long long i, n, x, y, w, q, a, b, e, j;
long long ans = 0;
cin >> n >> w;
for (i = 0; i < n; i++) ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int sum = 0;
for (int i = 0, j = k - 1; j < n; j++) {
if (a[j] + 1 - a[i] <= m) {
a[j] = -1;
sum++;
if (i ... | 4 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mymap;
const int N = 2000001;
int audio[N], sub[N];
int main() {
int n, m, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
mymap[x]++;
}
cin >> m;
int nho = 1, a, b, y;
pair<int, int> p;
for (int i = 0; i < m; i++) cin >> audio[i];... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
//while(true)
{
int m,n;
cin>>m>>n;
map<int,int> was;
map<int,int> acs;
int sum = 0;
for( int i=0; i<n; i++ )
{
int a;
string b;
cin>>a>>b;
if( b == "WA")
was[a]++;
else
{
if(!acs.count(a))
sum += was[a];
ac... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[1000], s = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] <= 8)
s += a[i];
else {
s += 8;
a[i + 1] += a[i] - 8;
}
if (s >= k) {
cout << i + ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N, sol;
string a[100009], b[100009];
vector<pair<int, int> > ans;
struct nod {
nod *urm[26];
vector<int> a, b;
nod() {
memset(urm, 0, sizeof(urm));
a.clear(), b.clear();
}
} *R = new nod;
void Push(string &s, int val) {
nod *q = R;
for (auto it = s.b... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int sum = 0, x, n, l, i;
cin >> n >> l;
for (i = 1; i <= n; i++) {
cin >> x;
sum += x;
}
if (sum + n - 1 == l)
printf("YES\n");
else
printf("NO\n");
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,N) for(int i = 0;i < N;i++)
int main()
{
int L;
int A, B, C, D;
cin >> L;
cin >> A >> B >> C >> D;
cout << L - max((A + C - 1) / C,(B + D - 1) / D) << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
ll m, n;
cin >> m >> n;
if (n / 2 < m)
cout << n % m << endl;
else {
if (n % 2 == 0)
cout << n - (n / 2 + 1) << endl;
else
cout << n / 2 << endl;
}
return;
}
int main() {
int tc;
cin >> tc;
while... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[200005], b[200005], k, sa, sb;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m, d, pa, push_back;
cin >> n;
for (long long i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
cin >> m;
for (long long i = 0; i ... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool compare(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
int main() {
int n, k;
vector<pair<int, int>> v;
int arr[100] = {0};
cin >> n >> k;
for (int i = 0; i < n; i++) {
pair<int, i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
char mn = 'z';
for (auto c : s) {
if (c <= mn)
cout << "Mike\n";
else
cout << "Ann\n";
mn = min(mn, c);
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using dd = double;
const int N = (int)1e6 + 7;
int a[N];
vector<int> foo;
void help() {}
void TaoCode() {
int n, x, y;
cin >> n >> x >> y;
string bit;
cin >> bit;
int cnt = 0;
for (int i = (0); i < (x); i++) {
if (i == y and bit[(int)bi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
string s;
cin >> s;
vector<pair<int, int>> v1, v2;
for (int i = 0; i < n; i++) {
if (s[i] == '0'... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct ed {
int l, r, mx, lazy, v;
} e[400004];
int n, cnt, m, ans[100001];
void build(int m, int l, int r) {
e[m].l = l;
e[m].r = r;
e[m].mx = e[m].lazy = 0;
if (l == r) {
e[m].v = ++cnt;
return;
}
int mid = (l + r) >> 1;
build(m << 1, l, mid);
bu... | 3 |
#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <cmath>
#define forn(i, n) for(int i = 0; i < int(n); ++i)
using namespace std;
using ll = long long;
void solve(){
int n;
cin >> n;
vector<pair<int ,int>> points(n);
for (int i = 0; i < n; ++i) {
cin >> poi... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
if (n >= s - n + 1) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
for (int i = (1); i <= (n - 1); ++i) cout << 1 << " ";
cout << s - n + 1 << endl;
cout << n << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
long long int fac[2000];
long long int pwr(long long int num) {
long long int pw = mod - 2;
long long int res = 1;
while (pw) {
if (pw % 2) res = (res * num) % mod;
pw /= 2;
num = (num * num) % mod;
}
return res;
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
string s;
cin >> s;
long long int mv = n;
for (long long int i = 0; i < n - 1; i++) {
if (s[i] == 'U' && s[i + 1] == 'R') {
mv--;
s[i +... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[10000], b[10000];
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
}
int r1 = 0, r0 = 0, l0 = 0, l1 = 0, m;
for (i = 0; i < n; i++) {
if (a[i] == 1)
l1++;
else
l0++;
m = (l1 < l0 ?... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long linf = 1e18;
const double eps = 1e-12;
const double pi = acos(-1);
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
for (auto&& x : vec) is >> x;
return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>&... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, i, j, s, p, k, m;
vector<long long> v;
long long a[1000005];
cin >> t;
while (t--) {
long long n, x, i, cnt;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
cnt = 0;
for (i = 0; i < n; i++) {
if (... | 2 |
#include <bits/stdc++.h>
using namespace std;
map<int, bool> H[10];
const int MAXN = 7e4 + 5;
bool chk[MAXN][9][9];
int n;
char s[MAXN][10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%s", s[i]);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 9; j++) {
int cur = 0;
for (... | 2 |
#include <bits/stdc++.h>
using namespace std;
void see(int x) {cout << x;}
void see(long long int x) {cout << x;}
void see(long double x) {cout << x;}
void see(char x) {cout << '\'' << x << '\'';}
void see(string x) {cout << '\"' << x << '\"';}
template<typename T, typename V>
void see(const pair<T, V> &x) {cout << '... | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll P=1000000007;
const int maxn=5010;
int n,m,cnt,rt,mn,sum;
ll ans;
int head[maxn],to[maxn<<1],nxt[maxn<<1],siz[maxn],fa[maxn],v[maxn];
ll jc[maxn],jcc[maxn],ine[maxn],f[maxn],g[maxn],h[maxn];
inline void add(int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<int, vector<int>, greater<int> >q;
int main() {
int T, n, k;
scanf("%d", &T);
while(T--) {
scanf("%d%d", &n, &k);
q.push(k);
while(n > 1) {
k = q.top();
q.pop();
k = 127 ^ k;
... | 0 |
#include<iostream>
#include<vector>
#define int long long
using namespace std;
const int N=2e3+2;
const int inf=1e9+7;
vector<int> adj[N];
int num[N],sum[N],f[N];
string s;
void dfs(int x,int p){
if(s[x-1]=='1'){
num[x]=1;
}
else{
num[x]=0;
}
sum[x]=0;
for(int i=0;i<adj[x].size();i++){
if(adj[x][i]!=p){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct strongly_connected_components{
int V;
vector<vector<int>> E1;
vector<vector<int>> E2;
vector<int> t;
vector<bool> used;
vector<int> scc;
strongly_connected_components(vector<vector<int>> &G){
V = G.size();
E1 = vector<vector<int>>(V);
E2 = vector<vector<... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, p[100010], d[100010], c[100010];
int main() {
cin >> n;
for (int i = 2; i <= n; i++) scanf("%d", &p[i]);
c[0] = 1;
for (int i = 2; i <= n; i++) d[i] = d[p[i]] + 1, c[d[i]]++;
int ans = 0;
for (int i = 0; i <= n; i++)
if (c[i] & 1) ans++;
cout << ans... | 1 |
#include <bits/stdc++.h>
using namespace std;
int i, n, m, c, Q, f[100005], x, y, col;
map<int, vector<int>> mp[100005];
set<int> d[100005];
int find(int x) { return (f[x] == x) ? x : f[x] = find(f[x]); }
void merge(int x, int y) {
int fx = find(x), fy = find(y);
if (fx != fy) {
if (d[fx].size() < d[fy].size())... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int mod = 1e9 + 7;
inline int add(int x, int y) {
x += y;
if (x >= mod) x -= mod;
return x;
}
inline int mul(int x, int y) {
x = (1LL * x * y) % mod;
return x;
}
double dist(double x1, double y1, double x2, double y2) {
return s... | 3 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int A, B, H, M;
cin >> A >> B >> H >> M;
double w;
w = M_PI*11*( 60*H + M )/360;
double y;
y = pow(A,2) + pow(B,2)-2*A*B*cos(w);
double x;
x = sqrt(y);
printf("%.15f\n", x);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int modulo = 1e9 + 7;
template <class __Ty>
bool mini(__Ty& a, __Ty b) {
return a > b ? ((a = b) | 1) : (0);
}
template <class __Ty>
bool maxi(__Ty& a, __Ty b) {
return a <= b ? ((a = b) | 1) : (0);
}
template <class __Ty>
__Ty add(__Ty a, __Ty b) {
return (a + ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, d;
cin >> k >> d;
if (d >= 2 && k > 1) {
cout << "1";
for (int i = 0; i < k - 2; i++) {
cout << "0";
}
cout << d - 1;
} else if (k == 1) {
cout << d;
} else if (d == 1) {
cout << "9";
for (int i = 0; i < k - 2;... | 1 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int n_ = 2e5 + 5;
int n, a[550], b[550], c[550], m, x[550], y[550], z[550];
long long ans, sol[550];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; sol[i] = 1e18, i++)
scanf("%d%d%d", &a[i], &b[i], &c[i]);
scanf("%d", &m);
... | 2 |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
// #define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp ma... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 10;
const long long INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const long long MOD = 1e9 + 7;
long long segtree[MAXN << 2];
long long lazy[MAXN << 2];
long long arr[MAXN];
long long ans[MAXN];
void pushup(long long rt) {
seg... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int MAXN = 5e5 + 5;
const long long int mod = 1e9 + 7;
const long double pi = 3.141592653;
long long int a[4015];
long long int dp[4015][4015];
void solve() {
long long int n;
cin >> n;
for (long long int i = 0; i < n + 5; i++) {
for (long long int... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a;
cin>>a;
cout<<(a<97?"A":"a")<<'\n';
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 61;
const int Max = 1000007;
const double PI = acos(-1.0);
long long ANS[1050];
bool taken[1050];
void solve(long long n) {
vector<long long> query1, query2;
long long i, j, k, l, step;
for (i = 0; i <= (n + 2); i++) ANS[i] = INF;
for (s... | 4 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int r1, c1, r2, c2;
};
vector<node> ans;
int n, a[1010], b[1010], A[1010], B[1010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
A[a[i]] = i;
}
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
B[b... | 4 |
#include <bits/stdc++.h>
constexpr int MOD = 1e9 + 7;
const int N = 50000;
using namespace std;
long long int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long int lcm(int a, int b) { return a / gcd(a, b) * b; }
void solve() {
long long int a, b;
cin >> a >> b;
string s;
cin >> s;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long ans = 0;
long long add = 1;
n--;
while (n > 0) {
ans += add * (n / 2 + n % 2);
n -= n / 2 + n % 2;
add *= 2;
}
cout << ans;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int mpow(int base, long long exp);
void ipgraph(int m);
void DFS(int n);
bool isprime(long long n);
int gcd(int a, int b);
void rstgraph(int n);
const int mod = pow(10, 9) + 7;
const int N = 3e5, M = N;
vector<int> g[N];
int vis[N];
int nodes = 0;
void iluzn() {
int n, m;... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 100009;
int sz[inf];
bool is[inf];
char sol[inf];
vector<int> adj[inf];
int sz_all;
int calsz(int x, int p) {
sz[x] = 1;
for (int i = 0; i < adj[x].size(); ++i) {
if (adj[x][i] == p || is[adj[x][i]]) continue;
sz[x] += calsz(adj[x][i], x);
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n + 1], sum = 0;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % n) {
cout << -1 << endl;
continue;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e6 + 5;
int pw[M], pr[M];
long long int ans;
int main() {
for (int i = 0; (1 << i) < M; i++) pw[(1 << i)] = (1 << i);
for (int i = 1; i < M; i++)
if (!pw[i]) pw[i] = pw[i - 1];
int n;
cin >> n;
fill(pr, pr + M, -1);
for (int i = n; i >= 0; i--... | 3 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
char prev = s[0];
string t;
for (int i = 1; i < s.size(); i++) {
if (prev <= s[i]) t += prev, prev = s[i];
}
t += prev;
reverse(t.begin(), t.end());
cout << t << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
const long long N = 1000010;
const long long MOD = 1000000007;
using namespace std;
struct nn {
long long l, r;
} a[N];
long long n, k, x[N], m, ans, c[N], jie[N], las, num = 0;
long long ksm(long long x, long long y) {
long long res = 1;
while (y) {
if (y % 2 == 1) res = (res * x) % ... | 5 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
using namespace std;
int n, Q, seg[4000001], ffl, p;
int qread() {
int nans = 0, nf = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') {
c = getchar();
}
if (c == '-') {
nf = -1;
c = getchar();
}
whil... | 4 |
#include <bits/stdc++.h>
const int N = 500005;
int bas[22], pos[22], n, Q, ans[N], a[N], l, r;
struct query {
int l, id;
};
std::vector<query> q[N];
void ins(int x, int l) {
for (int i = 20; i >= 0; i--) {
if (x & (1 << i)) {
if (!bas[i]) {
bas[i] = x;
pos[i] = l;
return;
} e... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
pair<long long, long long> d[N];
int main() {
int pos = 0, h, q, i, ans;
scanf("%d%d", &h, &q);
long long L, R, l, r, left = (1LL << h - 1), right = (1LL << h);
while (q--) {
cin >> i >> l >> r >> ans;
L = l << (h - i), R = r + 1 << (... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long int mod = 1e9 + 7;
long int n, q;
vector<long int> adj[100005];
vector<vector<long int> > ch, chain;
pair<long int, long int> chainID[100005];
long int mxChainSize, ans;
vector<vector<long int> > seg;
void update(long int id, long int idx, long int l, long int r,... | 5 |
#include<bits/stdc++.h>
using namespace std;
char c[101];
int main()
{
int i=0;
long long s;
scanf("%s",&c);
scanf("%lld",&s);
while(i<strlen(c)&&c[i]=='1')
i++;
if(i>=s)
printf("1",s);
else
printf("%c",c[i]);
return 0;
} | 0 |
#include <cstdio>
int P[100000],T[100000];
int main() {
int N,R,L,PT=0,n1=0;
scanf("%d %d %d",&N,&R,&L);
for(int i=0;i<R;i++) {
int d,t,x;
scanf("%d %d %d",&d,&t,&x); d--;
P[d]+=x;
if(x>0) {
if(P[d]>P[n1]||(P[d]==P[n1]&&n1>d)) {
T[n1]+=t-PT+1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
int h, w, n; cin >> h >> w >> n;
vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i];
vector<int> res;
for (int i = 0; i < n; i++) {
for (int j = 0; j < a[i]; j++) {
res.push_back(i + 1);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
cout << (n / 2) - (n % 2) * n << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
namespace SegmentTree {
typedef struct Node *pnode;
pnode null;
struct Node {
int cnt;
pnode l;
pnode r;
};
void seed() {
null = new Node();
null->cnt = 0;
null->l = null;
null->r = null;
}
void pointUpdate(pnode &u, int x, int v, i... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10003;
vector<int> allp;
int isc[N + 2];
int a[N];
int ans;
int main() {
memset(isc, 0, sizeof(isc));
for (int i = 4; i < N; i += 2) {
isc[i] = 1;
}
isc[1] = isc[0] = 1;
for (int i = 3; i * i < N; i++) {
if (!isc[i]) {
for (int j = i * ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int i, x[100005], y[100005], a[100005], ans, n, mp[100005];
vector<int> v[100005];
int main() {
cin >> n;
for (i = 1; i < n; ++i) {
cin >> x[i] >> y[i];
v[x[i]].push_back(y[i]);
v[y[i]].push_back(x[i]);
}
for (i = 1; i <= n; ++i) cin >> a[i];
for (i = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int ar[83];
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
for (int i = 1; i <= 81; i++) {
long long int temp = i;
for (int j = 1; j < a; j++) temp *= i;
temp *= b;
temp += c;
if (temp > 0 && temp < 1000000000) ar[i] = temp;
}
int store... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, n, t;
scanf("%d", &t);
while (t--) {
scanf("%d", &a);
if (360 % (180 - a)) {
puts("NO");
continue;
}
n = 360 / (180 - a);
if (n < 3) {
puts("NO");
continue;
}
puts("YES");
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long A, B, C, used[2405];
vector<int> Q;
map<long long, int> g[505];
long long dp(int a, int b, int c, int p) {
if (p == -1) return 1;
long long t, l = (long long)(a * 2405 + b) * 2405 + c;
t = g[p][l];
if (t) return t;
long long ans = 0, q = Q[p];
for (int... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long mod(long long base, long long exponent, long long modulus) {
if (modulus == 1) return 0;
long long result = 1;
base = base % modulus;
while (exponent > 0) {
if (exponent % 2 == 1) {
result = (result * base) % modulus;
}
exponent = exponen... | 3 |
#include <bits/stdc++.h>
int main() {
std::string a, b;
getline(std::cin, a);
getline(std::cin, b);
long ftos(0), stof(0);
for (int k = 0; k < a.size(); k++) {
if (a[k] == '4' && b[k] == '7') {
++ftos;
} else if (a[k] == '7' && b[k] == '4') {
++stof;
}
}
printf("%ld\n", (ftos > sto... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n=s.length(),a=0,b=0;
for(int i=0;i<n;i++){
int x=(int)s[i]-'0';
if(x%2==i%2) a++;
else b++;
}
cout<<min(a,b)<<endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
int n,s;
int fa[200200];
int d[200200];
int rt1,rt2;
int te;
struct data{
int to,nxt,id;
}mp[1000100];
int head[200200],cnt;
void link(int x,int y,int id)
{
mp[++cnt].to=y;
mp[cnt].id=id;
mp[cnt].nxt=head[x];
head[x]=cnt;
}
int ans[200200];
bool del[500500];
int sta[5... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
cin>>c;
char d = ((int)c >=97) ? 'a' : 'A';
cout<<d<<"\n";
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
inline long long rd() {
long long x = 0;
char c = getchar();
int neg = 1;
while (c < '0' || c > '9') {
if (c == '-') neg = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * neg;... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<pair<int, int> > g[500];
int x[500];
double solve() {
double ret = 0.0;
for (int i = 0; i < (int)(n); i++) {
for (auto &pr : g[i]) {
int j = pr.first;
int c = pr.second;
double tmp = 1.0 * (x[i] + x[j]) / c;
ret = max(ret, tm... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
#define TT template<typename T>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline int ubnd(T&v,ET(T) x){return upper_bound(begin... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
using namespace std;
typedef long long int ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a,b,c; cin >> a >> b >> c;
int ma=max(a,max(b,c));
if(ma==a){
cout << "A" << endl;
}
else if(m... | 0 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define EPS (1e-10)
void add_mod(ll &a, ll b){
a += b;
a %= MOD;
}
void mul_mod(ll &a, ll b){
a *= b;
a %... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool dp[2][3][1001][1001];
int n, m;
string s;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
memset(dp, 0, sizeof(dp));
cin >> n >> m;
cin >> s;
int win = m;
int wn = 0, ls = 0;
for (int j = 0; j < n; j++) {
if (s[j] == 'L')
ls++;
els... | 5 |
#include <bits/stdc++.h>
int main() {
int n, a, b, i, j, k;
scanf("%d%d%d", &n, &a, &b);
for (i = 0; i * a <= n; ++i)
if ((n - i * a) % b == 0) {
for (j = 0; j < i; ++j) {
for (k = 1; k < a; ++k) printf("%d ", j * a + k + 1);
printf("%d ", j * a + 1);
}
for (j = 0; j < (n - i... | 3 |
#include <bits/stdc++.h>
using namespace std;
int s[100010], n, k;
int main() {
while (cin >> n >> k) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> s[i];
if (s[i] < 0) cnt++;
}
int sum = 0;
if (cnt >= k) {
for (int i = 1; k; i++) {
s[i] *= -1;
k--;
}
... | 2 |
#include<cmath>
#include<iomanip>
#include<iostream>
#define A(a,b) S[a]*S[b]*S[n-a-b]*2
#define db long double
using namespace std;
typedef long long ll;
ll n,k,tot;
int lim,l,r,mid;
db S[200005],L,R,Mid,st;
int main()
{
cout<<setprecision(50);
cin>>n>>k;lim=n/3;st=3.14159265358979/n;
if (n%3==0 && n*(n-1)*(n-2)/6... | 0 |
#include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.0);
double num[3010];
int n,l;
inline int rd()
{
int x=0;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x;
}
int main()
{
n=rd();l=rd();
for (int i=1;i<=n;i++) num[i]=rd();
... | 0 |
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<cstring>
#include<cctype>
#include<complex>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<functional>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
using namespace std;
const int dx[] = {1,0... | 0 |
#include <bits/stdc++.h>
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
int n, m, k;
int ans[1000001];
int main() {
cin >> n >> m >> k;
int f = 1 + n + m;
int im = 0;
for (int i = 0; i < k; i++) {
ans[im++] = 1;
}
bool ff = false;
if (k == 1) {
int l = 1000000;
for ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100050], num[100050], oc[100050];
inline void read(int &x) {
x = 0;
register char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
int main() {
read(n);
for (registe... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<vector<int> > DP(n + 1, vector<int>(k + 1, 0));
for (int i = 1; i <= n; i++) DP[i][1] = 1;
for (int j = 1; j < k; j++)
for (int i = 1; i <= n; i++)
for (int t = 1; t * ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int i, j, k;
int main() {
int t;
while (cin >> t) {
for (i = 0; i < t; i++) {
int a;
cin >> a;
int n1 = 360 / (180 - a);
double n2 = 360 / (double)(180 - a);
if (n2 - n1 > 0) {
cout << "NO" << endl;
} else
cout << ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)2e6 + 10;
const int inf = (int)1e9;
const int P[] = {(int)1e9 + 7, (int)1e9 + 9};
const int Q[] = {17, 239};
int stp[2][maxn];
int h[2][maxn];
int h1[2][maxn];
int h2[2][maxn];
const int sh = 1 << 21;
int rm[2 * sh + 10];
void upd(int first, int val) {... | 6 |
#include <bits/stdc++.h>
int main() {
int a, b, t;
scanf("%d%d", &a, &b);
t = 0;
while (a <= b) {
a = a * 3;
b = b * 2;
t = t + 1;
}
printf("%d", t);
return 0;
}
| 1 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct Lonoid {
int64_t x;
Lonoid() {}
Lonoid(int64_t x) : x(x) {}
static Lonoid ident() { return Lonoid(0); }
static Lonoid multiply(Lonoid f, Lonoid g) { ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, M; cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
int def[M - 1];
for (int i = 1; i < M; i++) {
def[i-1] = X[i] - X[i - 1];
}
sort(def, def + M - 1);
long long ans = 0;
for (int i = 0; i < M - N; i++) ... | 0 |
#include <bits/stdc++.h>
template <typename T>
void read(T& num) {
num = 0;
int w = 1;
char ch = getchar();
if (ch == '-') w = -1;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-') w = -1;
}
while ((ch >= '0' && ch <= '9')) num = num * 10 + ch - '0', ch = getchar();
num = num * w;
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1000000, mod = 998244353;
long long n, frac[N + 10], ifrac[N + 10];
long long l1[N + 10], l2[N + 10], r1[N + 10], r2[N + 10];
char str[N + 10];
long long qpow(long long a, long long b, long long p) {
long long ret = 1;
for (; b; b >>= 1) {
if (b ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int Trie[3000000][2], children[3000000][2];
char sign;
bitset<31> num;
int new_node = 1;
void Add(bitset<31> num) {
int node = 0;
for (int i = 30; i >= 0; --i) {
if (children[node][num[i]] == 0) children[node][num[i]] = new_node++;
++Trie[node][num[i]];
node... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, k;
vector<pair<int, int>> ri[N];
int pref[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
int l, r;
cin >> l >> r;
ri[l].push_back({r, i});
pref[l]++;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long x, y;
cin >> x >> y;
int q;
cin >> q;
long long count = 0;
for (int i = 0; i < q; i++) {
long long a, b;
cin >> a >> b;
long long k, l;
if (a > 0 && b > 0) {
k = (n - x) / a;
l... | 2 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector <int> so,sum;
int a[110001]={0},from,n,p,i,j;
for(i=2;i<=110000;i++){
if(a[i]==0){
so.push_back(i);
for(j=i;j<=110000;j+=i) a[j]=1;
}
}
//for(i=0;i<20;i++) cout<<so[i]<<endl;
while(... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long n, k, d1, d2;
int solve(long long d1, long long d2) {
long long x, y, z;
y = (k - d1 + d2) / 3;
if ((k - d1 + d2) % 3 != 0) return 0;
x = y + d1;
z = y - d2;
if (x >= 0 && x <= n / 3 && y >= 0 && y <= n / 3 && z >= 0 && z <= n /... | 3 |
#include <bits/stdc++.h>
int main() {
int n, t;
scanf("%d %d", &n, &t);
for (int i = 1, k; i <= n; ++i) {
scanf("%d", &k);
t -= (86400 - k);
if (t <= 0) {
printf("%d", i);
return 0;
}
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
const long long INF = (1e9 + 12312), MOD = 1e9 + 7;
const long double EPS = 0.0000000001;
using namespace std;
bool ask(long long first, long long second) {
cout << first << " " << second << endl;
string s;
cin >> s;
if (s == "Bad") {
exit(1);
}
return s == "Yes";
}
signed main(... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long Seive[200006];
long long searchgreater(vector<long long> &v, long long target) {
long long l = 0, u = (long long)v.size() - 1;
long long m;
while (l <= u) {
m = (l + u) / 2;
if (v[m] < target) {
l = m + 1;
} else {
if (v[m] > target) ... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long dp[N];
long long ans[N];
vector<long long int> a(N, 0);
int solve() {
long long n;
cin >> n;
for (long long int i = 1; i < n + 1; i++) cin >> a[i];
ans[0] = dp[0] = 0;
for (long long int i = 1; i < n + 1; i++) {
long long... | 2 |
#include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
string s,t;
cin>>s>>t;
bool tmp=false;
for(int i=s.size()-t.size();i>=0;i--){
bool check=true;
rep(j,t.size()){
if(s[i+j]=='?' or s[i+j]==t[j])continue;
check=false;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.