solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 100100100100100100;
const long long mod = 1000000007;
long long dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};
long long dy[8] = {0, 1, 0, -1, -1, -1, 1, 1};
long long input() {
long long tmp;
cin >> tmp;
return tmp;
}
string raw_input() {
string tmp;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int a[N];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
int l = 0, r = n - 1;
int alic = 0, bob = 0;
alic += a[0];
int last = a[0];
l++;
int p = 1;
whil... | 4 |
#include <bits/stdc++.h>
using namespace std;
const unsigned long long mod = 1e9 + 7;
vector<vector<int>> a;
vector<vector<vector<unsigned long long>>> dp;
vector<unsigned long long> summ;
int n, k;
void dfs(int v, int p) {
for (int i = 0; i < a[v].size(); i++) {
if (a[v][i] == p) continue;
dfs(a[v][i], v);
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010;
const int mod = 1e9 + 7;
int a[maxn][maxn];
int ret[maxn][maxn];
int b[maxn];
long long buf[maxn][maxn];
int n, k;
void mul(int a[][maxn], int b[][maxn]) {
memset(buf, 0, sizeof(buf));
for (int j = 0; j < n; j++) {
for (int k = j; k < n; k++)
... | 3 |
#include <iostream>
#include <string>
#include <algorithm>
int main()
{
std::string s;
std::cin >> s;
size_t cg = std::count(s.begin(), s.end(), 'g');
size_t cp = s.length() - cg;
std::cout << (cp + cg) / 2 - cp << std::endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int cg(long long int n) { return n ^ (n >> 1); }
long long int SUM(long long int a) { return (a * (a + 1) / 2); }
bool CAN(int x, int y, int n, int m) {
if (x... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
const double pi = acos(-1.0);
long long int calcScore(int n) {
if (n == 0) return 0;
return 2 * (n)-1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL)... | 2 |
#include <iostream>
using namespace std;
int main(){
int a,b;cin>>a>>b;
cout << (a*b % 2 == 0 ? "No" : "Yes") << endl;
} | 0 |
#include<iostream>
#include<cmath>
using namespace std;
bool check(int S)
{
int x = 1;
while(2*(x*x+x)<=S)
{
if((S-x)%(2*x+1) == 0)return false;
x++;
}
return true;
}
int main()
{
int N;
cin >> N;
int found = 0;
for(int i=1;i<=N;i++)
{
int S;
cin >> S;
if(chec... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, a[1000001], d, b[1000], minn = 10000;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[a[i]]++;
minn = min(minn, a[i]);
}
if (b[minn] > n / 2)
cout << "Bob";
else
cout << "Alice";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int t;
cin >> t;
while (t--) {
bool ans = true;
int n;
cin >> n;
vector<int> p(n + 1, 0), pos(n + 1), check(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> p[i];
pos[p[i]] = i;
}
int s = 1;
... | 3 |
#include<cstdio>
#include<algorithm>
const int N=1e5+2;
int i,n,m,a[N];
long long ans=1e12,k[N],b[N];
void wk(int s,int t)
{
if(b[s]+=s,++k[t],--k[s],s<t)b[1]+=t-s,b[t]-=s;else
b[1]+=t,b[t]+=m-s,--k[1];
}
int main()
{
for(scanf("%d%d",&n,&m);i++<n;scanf("%d",a+i));
for(i=0;++i<n;wk(a[i]+1,a[i+1]+1));
for(i=0;i++<m... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long double PI = acos(-1.0);
const long double E = exp(1.0);
const int MAXN = 1e6 + 10;
char arr[MAXN];
int main() {
int n;
cin >> n;
while (n--) {
int n;
cin >> n;
cin >> arr;
bool flag = false;
for (int i = 0; i ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
ll modpow(ll k, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * k % mod;
k = k * k % mod;
n /= 2;
}
return res;
}
int main() {
int k;
... | 0 |
#include<bits/stdc++.h>
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define fs first
#define sc second
#define pb push_back
#define sz size()
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long double D;
typedef complex<D> P;
typedef pair<P,P> L;
typedef vector... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
bool yes = true;
for (long long i = 0; i < s.length();) {
if (s[i] == '1' && s[i + 1] == '4' && s[i + 2] == '4')
i += 3;
else if (s[i] == '1' && s[i + 1] == '4')
i += 2;
else if (s[... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
in >> p.first >> p.second;
return in;
}
template <typename T>
istream &operator>>(istream &in, vector<T> &v) {
for (auto &x : v) in >> x;
return in;... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const long long INF = -(long long)2e18 - 1;
struct point {
int x, y;
point(int x = 0, int y = 0) : x(x), y(y) {}
long long calc(long long q) { return q * x + y; }
} pt[N];
point operator-(point p, point q) { return point(p.x - q.x, p.y - q.y); ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
const int oo = 1000;
bool mark[N];
int visit[N];
int ans;
vector<int> _list, ed[N], adj[N];
int ncompo;
void DFS(int u) {
mark[u] = 1;
_list.push_back(u);
for (int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if (mark[v]) continue;... | 2 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... | 0 |
#include <iostream>
using namespace std;
long long a, b, c, d, n; char op;
int main()
{
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> c >> op >> d;
if(op == '(')
{
a += d;
}
else
{
b += d;
}
if(... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
long long n, k, sum2, sum1;
int main() {
cin >> n;
int arr[n];
int maxi = INT_MIN;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum2 += arr[i];
maxi = max(maxi, arr[i]);
}
k = maxi;
while (true) {
sum1 = 0;
for (int i... | 1 |
#include <cstdio>
#include <cmath>
int n;
void make_koch(double px,double py,double qx,double qy,int t){
if(t==n) return;
double sx=(2*px+qx)/3;
double sy=(2*py+qy)/3;
double tx=(px+2*qx)/3;
double ty=(py+2*qy)/3;
double ux=sx+(tx-sx)/2-(ty-sy)*sqrt(3)/2;
double uy=sy+(ty-sy)/2+(tx-sx)*sqrt(3)/2;
make... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
string a[4];
void calc() {
long long dp[n][n];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < 4; i++) {
for (int j = 0; j < n; j++) {
if (!i || !j)
dp[i][j] = 1;
else {
if (a[i][j] == '.') dp[i][j] = dp[i - 1][j] + dp[i][j - 1... | 2 |
#include <bits/stdc++.h>
using namespace std;
double dp[110][110][110];
int main() {
int shi, jian, bu;
while (scanf("%d%d%d", &shi, &jian, &bu) != EOF) {
memset(dp, 0, sizeof dp);
dp[shi][jian][bu] = 1;
for (int i = shi; i >= 0; i--) {
for (int j = jian; j >= 0; j--) {
for (int k = bu; k ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, i, j = 0;
char ar[1005];
char br[10000];
scanf("%s", &ar);
h = strlen(ar);
for (i = h - 1; i >= 0; i--) {
br[j] = ar[i];
j++;
}
printf("%s%s", ar, br);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[25][25];
int dp[25][2100000];
const int MOD = 1e9 + 7;
int rek(int x, int y) {
if (x == n) {
return 1;
}
int &ret = dp[x][y];
if (ret != -1) return ret;
ret = 0;
for (int i = 0; i < n; i ++) {
if (a[x][i] == 1 && (y&(1 << i)) == 0) {
ret += r... | 0 |
#include <bits/stdc++.h>
const int maxt = 100000 * 2 + 10;
int d[20];
int ch[maxt][2], val[maxt], sz;
void init() {
sz = 1;
ch[0][0] = ch[0][1] = 0;
}
int fun(long long a) {
int n = 0, i = 0;
if (a == 0)
d[n++] = 0;
else {
while (a) {
d[i++] = (a % 10) & 1;
a /= 10;
if (d[i - 1] & 1)... | 1 |
#include<bits/stdc++.h>
#define N 200100
using namespace std;
int a[N];
int main(){
int n,l,r;
scanf("%d",&n);
for(int i=1;i<n+n;i++){
scanf("%d",&a[i]);
}
l=1,r=n+n;
while(l+1<r){
int m=(l+r)/2;
int sl=0,sr=0;
while(sl<n-1&&(a[n-sl]<m)!=(a[n-sl-1]<m)) sl++;
while(sr<n-1&&(a[n+sr]<m)!=(a[n+sr+1]<m)) sr+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a;
cin >> a;
if(a=="hi"||a=="hihi"||a=="hihihi"||a=="hihihihi"||a=="hihihihihi"){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
void sort(int *array, size_t size) {
int i;
int swapped;
int tmp;
do {
swapped = 0;
for (i = 0; i < size - 1; i++) {
if (array[i] > array[i + 1]) {
tmp = array[i];
array[i] = array[i + 1];
array[i + 1] = tmp;
swapped = 1;
}
}
} w... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, cnt = 1, c1 = 1;
cin >> n;
long long int a[n];
cin >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
a[i - 1] = 2 * a[i - 1];
if (a[i - 1] >= a[i])
c1++;
else
cnt = max(cnt, c1), c1 = 1;
}
cnt = max(c... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,cnt=0;
cin>>a>>b;
for (;a>0;)
{
cnt++;
a=a/b;
}
cout<<cnt;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, p, q, top, dp[4010], sta[20][4010], ans[200010];
vector<pair<int, int> > tr[200010 << 2][2];
void modify(int p, int L, int R, int l, int r, int op, int x, int y) {
if (l <= L && R <= r) {
tr[p][op].push_back(make_pair(x, y));
return;
}
int mid = (L + R)... | 6 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
ll powmod(ll x,ll n){
if(n == 0)return 1;
ll ans = powmod(x*x%MOD,n/2);
if(n % 2)ans = ans * x % MOD;
return ans;
}
ll divmod(ll a,ll b){
r... | 0 |
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
typedef vec... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int v, next;
} ed[100005 * 4];
int head[100005], step[100005], flag[100005], que[100005], use[100005];
int n, m, k, s, t, q, f1, r1, num;
void addedge(int u, int v) {
ed[num].v = v;
ed[num].next = head[u];
head[u] = num++;
}
void init() {
int i, j;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cntl = 0, cntr = 0;
cin >> n;
if (n % 2 == 0)
cout << pow(n, 2) / 2 << endl;
else
cout << ceil(pow(n, 2) / 2) << endl;
if (n == 1) {
cout << "C";
return 0;
}
while (cntl < n) {
cntr = 0;
while (cntr < n) {
if (... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
//g++ -std=c++11
using namespace std;
#define INF 1001002003004005006ll
long long N, K;
long long H[305];
//idxを使う, いくつ消した？
long long dp[610][610];
int main(){
cin >> N >> K;
rep(i, N) cin >> H[i+1];
H[N+1] = 0;
rep(i, N + 5) rep(j,... | 0 |
#include <bits/stdc++.h>
#define eps 1e-9
using namespace std;
typedef double db;
struct P{
db x, y;
P(){}
P(db x, db y) : x(x) , y(y) {}
P operator - (P a){ return P(x-a.x, y-a.y); }
db times(P a){ return x*a.y-y*a.x; }
db dot(P a){ return a.x*x + a.y*y; }
};
typedef P V;
struct L{ P p, q; };
... | 0 |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define f first
#define s second
using namespace std;
const LL INF = (LL) 1e9 + 5;
const LL MOD = (LL) 1e9 + 7;
const int MAXN = 100005;
struct Edge {
int to, id;
};
int n, qn, a[MAXN], b[MAXN], vis[MAXN];
PII p[MAXN];
vector<Edge> G[MAXN];
ve... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, right = 0, left = 0, h;
string s;
cin >> s;
n = s.length();
h = s.find('^');
for (long int i = 0; i < h; ++i) {
if (s[i] != '=') {
left += (s[i] - '0') * (h - i);
}
}
for (long int i = h + 1; i < n; ++i) {
if (... | 1 |
#include <bits/stdc++.h>
const int maxn = 51;
const int mod = 1e9 + 7;
using std::cin;
int n, d[maxn];
int dp[51][834280];
int map[3][maxn][maxn][maxn][maxn], tot;
struct state {
int a0, a1, a2, a3;
int b0, b1, b2, b3;
inline operator int() const {
return map[a3 || b3 ? a3 ? 1 : 2 : 0][a1][a2][b1][b2];
}
... | 5 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=1000005;
const int mod=924844033;
struct E{
int to,next;
}mem[N];
int n,num,x,y,l,il;
int head[N],b[N],a[N],f[N],sz[N],g[N],fac[N],inv[N];
void add(int x,int y){
num++;
mem[... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000 * 100 + 10;
long long INF = 100000 * 10000LL * 100000 + 10;
int n, m, st, l, ans;
long long dist[maxN];
vector<pair<long long int, long long int> > adj[maxN];
vector<pair<long long int, long long int> > edge;
vector<int> W;
set<pair<long long int, long... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const long long mod = 998244353;
const long long maxn = 3e5 + 10;
long long a[maxn], p[maxn], n;
long long ksm(long long x, long long N) {
long long ans = 1;
long long tmp = x % mod;
while (N > 0) {
if (N & 1) {
ans = ans * tmp;
... | 2 |
#include <bits/stdc++.h>
long gh[2][201] = {0}, gt[2][201] = {0}, dis[40001] = {0}, d[40001] = {0},
du[40001] = {0}, num[201][201] = {0}, head[40001] = {0}, e[16000001] = {0},
next[16000001] = {0};
long totm = 0;
long add(long a, long b) {
e[++totm] = b;
next[totm] = head[a];
head[a] = totm;
du[b]++;
... | 5 |
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int n;
int p[800], d[800];
vector<P> e[800];
bool unuse[800];
ll dfs(int t, i... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, u, v, cnt, h[N], mod, seed;
long long ans, bin[N];
struct edge {
int v, w, n;
} e[N << 1];
struct treap {
int l[N], r[N], siz[N], id[N], val[N], root, tot;
int ran() {
return seed = (int)((((seed ^ 998244353) + 19260817ll) * 19890604ll... | 3 |
#include <bits/stdc++.h>
using namespace std;
int xs[500000];
int ys[500000];
int zs[500000];
struct wut {
int i;
wut(int _i) : i(_i) {}
int x() const { return xs[i]; }
int y() const { return ys[i]; }
int z() const { return zs[i]; }
void pnt() const { printf("%d - %d %d %d\n", i, x(), y(), z()); }
bool op... | 4 |
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <it... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, count = 0, n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
for (i = 1; i <= n * 3; i++) {
if (a + b - i >= 0 || a + c - i >= 0 || c + d - i >= 0 || b + d - i >= 0 ||
a + b - i < -n || a + c - i < -n || c + d - i < -n || b + d - i < -... | 2 |
#include <iostream>
using namespace std;
int N;
int t[22][22];
int solve(int idx)
{
int res = 0;
for (int i = 0; i < N; i++) {
if (t[idx][i] > 0) {
t[i][idx] = 0;
res = max(res, t[idx][i] + solve(i));
}
}
return res;
}
int main()
{
while (cin >> N, N)... | 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int main() {
int n; scanf("%d", &n);
int cnt = 0;
rep(i, n) {
int d; scanf("%d", &d);
for (int i = 1; i*i <= d; i++) {
if ((d - i) % (2 * i + 1) == 0)goto g;
}
cnt++;
g:;
}
printf("%d\n", cnt);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100000];
int i;
while (gets(a)) {
int i, j;
int first = 0;
for (i = 0; a[i]; ++i) {
int ans = 0;
for (j = 0; j <= 7; ++j) {
ans = ans * 2 + ((a[i] & (1 << j)) ? 1 : 0);
}
printf("%d\n", (first - ans + 256... | 3 |
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#include <queue>
using namespace std;
using P = pair<int, int>;
struct futon {
int x, y, dir;
bool operator<(futon const& f) const {
return x < f.x;
}
};
int main() {
int n;
while(cin >> n, n) {
vector<futon> v(... | 0 |
#include <iostream>
using namespace std;
int main(){
int H, R;
cin >> H >> R;
if(R + H == 0) cout << '0' << endl;
else if(R + H < 0) cout << "-1" << endl;
else cout << '1' << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll INF = 1LL<<61;
long long pairs(ll n, ll k, vector<ll> a) {
sort(a.begin(), a.end());
long long left = -INF, right = INF;
while(right > left + 1) {
long long x = (left + right) / 2;
long long s = 0, t = 0;
for(int i=0;i<n;... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long dp[100000][2][3];
int cap[100000];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N - 1; ++i) scanf("%d", &cap[i]);
memset(dp, -1, sizeof dp);
for (int i = 0; i < N; ++i) dp[i][0][0] = 0;
long long ans = 0;
for (int i = 0; i + 1 < N; ++i) {... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using vecint = vector<int>;
using vecll = vector<ll>;
constexpr ll mod = 0x1fffffffffffffff;
constexpr ll base = 257;
ll mul(ll a, ll b) {
__uint128_t ans = __uint128_t(a) * b;
ans = (ans >> 61) + (ans & mod);
if (ans >= mod) ans -= mod;
return a... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, now = 0, cnt = 0;
cin >> N;
while (cin >> P && ++now) if (P != now) cnt++;
cout << ((cnt <= 2) ? "YES" : "NO") << endl;
} | 0 |
#include <cstdio>
#include <queue>
#define int long long
using namespace std;
const int NC = 2e5 + 5;
int N, A[NC], B[NC];
int pre(int i) { return (i == 1) ? N : (i - 1); }
int nxt(int i) { return (i == N) ? 1 : (i + 1); }
struct cmp {
bool operator()(const int &x, const int &y) { return B[x] < B[y]; }
};
priority_que... | 0 |
#include <bits/stdc++.h>
using namespace std;
int ex[300005], ey[300005], num[300005], i, j, k, n, m, s[300005], ans[100005],
op, vis[300005], now, l, r;
struct str {
int x, y, p;
} a[300005];
bool cmp(str a, str b) {
if (a.x == b.x) return a.y < b.y;
return a.x < b.x;
}
int gcd(int x, int y) {
if (y == 0) ... | 6 |
#include <iostream>
#include <map>
#include <string>
int main()
{
std::map<std::string, long long int> M;
int q; std::string sq;
getline(std::cin, sq); q = std::stoi(sq);
for (int i=0; i<q; i++) {
std::string key;
int op;
long long int x;
std::string buf;
getline(std::cin, buf);
op = buf[0] - '0'... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=4010,mod=924844033;
int n,k,tot,ans,vis[N][2],fac[N],ed[N],g[N],f[N][N][2];
int main()
{
scanf("%d%d",&n,&k);
for(int i=fac[0]=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
for(int i=1;i<=n;i++)for(int j=0;j<2;j++)if(!vis[i][j]){int l=0;for(int x=i,y=j;x<=n;x+=k,y^=1)... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T qmin(const T a, const T b) {
return a < b ? a : b;
}
template <typename T>
inline T qmax(const T a, const T b) {
return a > b ? a : b;
}
template <typename T>
inline void getmin(T &a, const T b) {
if (a > b) a = b;
}
template <typename T... | 3 |
#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
using namespace std;
template <typename T>
using maxHeap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
using minHeap = priority_queue<T, vector<T>, greater<T>>;
inline void input(int& _x) {
_x = 0;
int _tmp = 1;
char _tc = getchar();
while ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double INF = 1e8;
const int maxn = 200010;
const long long mod = 9999991;
deque<int> dq[26];
int p[20010];
char c[20010];
int main() {
ios::sync_with_stdio(0);
int k;
string s;
int n;
cin >> k >> s >> n;
for (int t = (0); t < (n);... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &first, T2 second) {
if (first > second) first = second;
}
template <typename T1, typename T2>
inline void chkmax(T1 &first, T2 second) {
if (first < second) first = second;
}
template <typename T, typename U>
in... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, mx = 0, mn = 0;
cin >> n >> m;
vector<int> arr(m);
priority_queue<int> max_heap;
priority_queue<int, vector<int>, greater<int> > min_heap;
for (int i = 0; i < m; i++) {
cin >> arr[i]... | 2 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int inf = 1061109567;
const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int main() {
int n;
cin >> n;
if (n == 2) {
cout << -1 << endl;
return 0;
}
cout << 15 << e... | 4 |
#include <iostream>
using namespace std;
int main(){
int d,x,size;
while(cin>>d){
x=d;
size=0;
while(x<600){
size=size+(x*x*d);
x=x+d;
}
cout<<size<<endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int i = 1;
while (true) {
int cnt = i / 2 + 1;
if (cnt == a) {
break;
}
++i;
}
cout << i << ' ' << 2 << endl;
cout << "1 2\n";
return 0;
}
| 1 |
#include <bits/stdc++.h>
inline long long read() {
char v = getchar();
long long x = 0, f = 1;
while (!isdigit(v)) {
if (v == '-') {
f = -1;
}
v = getchar();
}
while (isdigit(v)) {
x = x * 10 + v - 48;
v = getchar();
}
return x * f;
}
long long dp[20][50][2520 + 1], dig[2520 + 1]... | 4 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
#define MAXN 200200
#define ll long long
int t, n, r[MAXN];
vector<pair<int,int> > pts;
ll cost(pair<int,int> a, pair<int,int> b) {
if (b.first - a.first == b.second - a.second)
return ((a.first + a.second) % 2) ?... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int md = 1000000007;
const int maxn = 101010;
const long long inf = 2020202020202020202LL;
double xm, ym, px[maxn], py[maxn], ans, tx, ty, n, x, y;
int m;
double sq(double x1, double y1, double x2, double y2) {
return (x2 - xm) * (y1 - ym) - (x1 - xm) * (y2 - ym);
}... | 5 |
#include<iostream>
using namespace std;
int main(){
int N;
cin >>N;
for(int i=0; i<=25; i++){
for(int j=0;j<=14; j++){
if(N==4*i+7*j){ cout << "Yes"; return 0;}
}
}
cout << "No";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
return a * (b / gcd(a, b));
}
template <class T>
void read(T &num) {
num = 0;
char c = ' ';
int flag = 1;
for (; c > '9' || c < '0'; c = getchar())
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.00);
const double rad = pi / 180.00;
const double deg = 180.00 / pi;
template <typename T>
T gcd(T a, T b) {
T mn = min(a, b), mx = max(a, b);
if (mn == 0) return mx;
if (mx % mn == 0)
return mn;
else
gcd(mx % mn, mn);
}
template <t... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define N 505
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define inf 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define lowbit(i) ((i)&(-i))
#define VI vector<int>... | 6 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
const int N = 10;
int T, n, a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> T;
while (T--) {
cin >> n;
for (int i = (0); i <= (n - 1); ++i) cin >> a[i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int IN() {
int c, f, x;
while (!isdigit(c = getchar()) && c != '-')
;
c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
return !f ? x : -x;
}
const int N = 500000;
vector<int> V;
int Ans[N];
nam... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5, M = 1e5 + 5;
int n, n1, k, cc, res, C[N], Dt[N], Assigned[N], color[M], visited[N];
vector<pair<int, int>> S[N];
void Enter() {
cin >> n1 >> n >> k;
n += n1;
int u, v;
for (int i = 1; i <= k; i++) {
cin >> u >> v;
v += n1;
S[u].emp... | 6 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=2e5+500;
char st[10];
int w[N],fh[N],n,lst[N];long long s[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",w+i);
if(i!=n)
{
scanf("%s",st+1);
if(st[1]=='-')fh[i]=-1;else fh[i]=1;
}
}
long long an... | 0 |
#include <bits/stdc++.h>
int main() {
int i = 1, j, k;
scanf("%d", &k);
j = 1;
while (j <= k) {
j = (i * (i + 1) * (i + 2)) / 6;
i++;
}
printf("%d\n", i - 2);
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < m; ++i) {
... | 1 |
#include<cstdio>
using namespace std;
#define N 16400
#define M 204
#define mod 998244353
int dp[M][N],n,m,fr[N],ifr[N],rev[N],a[N],b[N],ntt[N];
int pw(int a,int p){int as=1;while(p){if(p&1)as=1ll*as*a%mod;a=1ll*a*a%mod;p>>=1;}return as;}
int c(int a,int b){if(a<b)return 0;return 1ll*fr[a]*ifr[b]%mod*ifr[a-b]%mod;}
voi... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mod1 = 1000000007;
long long gcd(long long a, long long b) {
long long c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
long long issub(string a, string b) {
if (a.find(b) != string::npos)
return 1;
else
return 0;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, K;
vector<int> vect;
int res;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> K;
res = n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vect.push_back(a);
}
sort(vect.begin(), vect.end());
int L = 0;
int R =... | 2 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k;
cin>>n>>k;
int k1=0,k2=0;
for(int i=1;i<=n;i++){
k1+=(i%k==0);
k2+=(i%k==k/2);
}
cout<<k1*k1*k1+(k%2==0)*k2*k2*k2<<endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f;
int dp[60][510][510];
char s[60];
void minn(int &u,int v)
{
u=min(u,v);
}
int main()
{
scanf("%s",s+5);
for(int i=1;i<=4;++i)
s[i]='0';
int l=strlen(s+1);
memset(dp,0x3f,sizeof(dp));
dp[0][250][250]=0;
for(int i=0;i<l;i++)
for(int ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int d[10];
int solve(int n);
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) d[i] = i + 1;
int ans = 0;
for (int i = 1, j = n; i <= n; i++, j--) ans += i * j;
int p = 0;
do {
if (solve(n) == ans) p++;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
vector<vector<int>> who(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] = n - a[i];
who[a[i]].push_back(i);
}
vector<int> ans(... | 2 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e13 + 7;
const long long dd = 1e5 + 7;
const long long mod = 1e9 + 7;
vector<bool> isr(dd, 1), go(dd);
vector<pair<int, int> > P[dd], Z[dd];
vector<pair<int, pair<int, int> > > Q[dd];
int pred[dd][32];
int gpred[dd][32];
int h[dd];
long long getm(int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long mp1[40], mp2[40];
int main() {
long long n;
cin >> n;
while (n--) {
string str, st;
cin >> str;
cin >> st;
long long sz1 = str.size();
long long sz2 = st.size();
memset(mp1, 0, sizeof(mp1));
memset(mp2, 0, sizeof(mp2));
bool f... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int b[m];
for (int i = 0; i < m; i++) cin >> b[i];
int check = 0;
for (int i = 0; i < n; i++) {
if (chec... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> kits;
unordered_map<int, int> home_count;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
kits.push_back({x, y});
home_count[x]++;
}
for (int i = 0; i < n; i++) {
int ans1 = n - 1;... | 2 |
#include <bits/stdc++.h>
using namespace std;
struct rec {
int x;
int l;
rec* next;
};
int shortest[110000];
rec a[110000];
set<pair<int, int>> st;
int main() {
int i, j, m, n, x, y, ki, z, t;
rec* p;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) a[i].next = NULL;
for (i = 0; i < m; i++) {
scanf("%... | 2 |
#include<stdio.h>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,n;
int p,j[65000];
unsigned int psum,jsum;
int cnt;
unsigned int kin,mkin;
while(1) {
scanf("%d",&n);
if(n==0) break;
psum=0;
for(i=0;i<n;i++) {
scanf("%d",&p);
psum+=p;
}
for(i=0;i<n-1;i++)... | 0 |
#include <bits/stdc++.h>
using namespace std;
pair<int, pair<int, pair<int, pair<int, int> > > > res;
bool vis[(1 << 12)];
queue<int> q;
vector<int> g[(1 << 12)];
vector<pair<int, int> > d[(1 << 12)];
vector<pair<int, pair<int, int> > > f[(1 << 12)];
int n, m, x, y, dis[(1 << 12)][(1 << 12)];
void bfs(int s) {
memset... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.