solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int dp[41][450][450];
int a[40], b[40], c[40];
int main() {
int n, m1, m2; scanf("%d%d%d", &n, &m1, &m2);
rep(i, n)scanf("%d%d%d", &a[i], &b[i], &c[i]);
memset(dp, 0x3f, sizeof(dp));
dp[0][0][0] = 0;
rep(i,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 1, sum = 0;
cin >> n;
while (sum < n) {
sum = (i * (i + 1)) / 2;
i++;
}
if (sum == n)
cout << "YES";
else
cout << "NO";
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n - 1];
for (auto &x : a) cin >> x;
vector<long long> pref(n);
pref[0] = 0;
long long left = 1, right = n;
map<long long, long long> mp;
mp[0] = 1;
for (int i = 1; i < n; i++) {
pref[i] = pref[i - 1] + a[i - 1];
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAXlen = 2e4 + 10;
double eps = 1e-4;
int a[100100];
int BIT[32];
int main() {
int T;
scanf("%d", &T);
while (T--) {
memset(BIT, 0, sizeof(BIT));
int n, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%... | 2 |
//#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <cassert>
using namespace std;
#define FOREACH(it,c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define TIMES(i,n) for(int i = 0; i < (n); ++i)
type... | 0 |
#include<cstdio>
#define LL long long
using namespace std;
const LL N=2e5+1;
LL i,n,m,ans;
LL a[N];
int main()
{
scanf("%lld%lld",&n,&m);
for (i=1;i<=n;++i)
++a[i%m];
ans=a[0]*a[0]*a[0];
if (!(m%2))
ans+=a[m>>1]*a[m>>1]*a[m>>1];
printf("%lld",ans);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
long long binsearch(long long n, long long k) {
long long l = 0, r = n + 1;
while (r - l > 1) {
long long m = (l + r) / 2;
if (m * (m - 1) / 2 <= k) {
l = m;
} else {
r = m;
}
}
return l;
}
int main() {
ios_base::sync_with_stdio(false);... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n,x,d,t,ans;
int lg(int x) {
if (x==1) return 0;
return lg(x>>1)+1;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) {
scanf("%d",&x);
int c=lg(x); d=0;
if (x!=1<<c) d=1;
if (t>c) t=c,d=0;
if (t<c) ans+=c-t,t=c;
if (d) ans++,t++;
}
printf("%d\n... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
return (s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin),
(s == t ? -1 : *s++) : *s++);
}
template <class T>
inline void read(T &x) {
static bool io... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<int> vp;
int p_l, p_r, v_l, v_r;
inline void pre(void) {
for (int i = 1; i <= 9; i++) {
int max_mask = (1 << i);
for (int mask = 0; mask < max_mask; mask++) {
int curr = 0;
int mul = 1;
for (int j = 0; j < i; j++) {
if (mask & (1 <... | 2 |
#include <bits/stdc++.h>
using namespace std;
int calc(int a, int b, int x){
return a*(100+x)/100 + b*(100+x)/100;
}
int main(){
int x, y, s;
while(cin >> x >> y >> s){
if(x+y+s == 0) break;
int ans = 0;
for(int i = 1 ; i <= s ; i++){
for(int j = 1 ; j+i <= s ; j++){
if(calc(i, j, x) == s) an... | 0 |
#include <bits/stdc++.h>
using namespace std;
int q[100010];
long long x[100010], y[100010];
int get(int l, int r, long long xx, long long yy) {
int ans = q[l], i, j, k;
long long fenzi = y[q[l]] - yy;
long long fenmu = x[q[l]] - xx;
for (i = l + 1; i <= r; i++)
if (fenzi * (x[q[i]] - xx) < fenmu * (y[q[i]]... | 4 |
#include<bits/stdc++.h>
using namespace std;
const int N=15;
char a[N][N],b[N][N];
int n,m,match[N],use[N];
inline int Equal(int x,int y) {
for (int i=1;i<=n;i++) {
if (b[i][x]!=b[n-i+1][y]) return 0;
}
return 1;
}
inline void check() {
int res=m&1;
memset(use,0,sizeof(use));
int now=1;
for (int i=1;i<=n;i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
char str[1005][1005], tmp[1005][1005];
set<int> row, col;
inline void paint(int x1, int y1, int x2, int y2) {
for (int i = x1; i <= x2; i++) tmp[i][y1] = tmp[i][y2] = '#';
for (int i = y1; i <= y2; i++) tmp[x1][i] = tmp[x2][i] = '#';
}
int main() {
int n, m;
scanf("... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3];
while (cin >> a[0][0]) {
int r = 0, flag = 1;
for (int i = 1; i < 3; i++) cin >> a[0][i];
for (int j = 0; j < 3; j++) {
cin >> a[1][j];
a[2][j] = a[0][j] - a[1][j];
if (a[2][j] > 0) {
r += a[2][j] / 2;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, n, m, sum, an, K;
const long long N = 51;
long long va[N], vb[N];
typedef long long arr[N][N];
arr a, b, c, d;
void cheng(arr &a, arr b) {
memset(c, 2, sizeof(c));
for (long long i = 0; i <= K; i++)
for (long long j = 0; j <= K; j++)
for ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
char s[3003], t[3003];
long long dp[3003][3003];
int main() {
scanf("%s", s + 1);
scanf("%s", t + 1);
long long lens = strlen(s + 1);
long long lent = strlen(t + 1);
long long i, j, k;
for (i = 1; i <= lens + 1; i++) dp[i][i - 1]... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
pair<int, int> a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
int t;
scanf("%d", &t);
a[i] = make_pair(t, i);
}
sort(a + 1, a + n + 1, greater<pair<int, int> >());
printf("%d\n", (n + 1) / 2);
for (in... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
struct NUM {
int num;
int cnt;
bool operator<(const NUM& Val) const { return Val.cnt > cnt; }
} num[M];
int tmp[M];
int A[M], B[M], C[M];
priority_queue<NUM> que;
int n_case;
void sap(int a, int b, int c) {
if (a < b) a ^= b ^= a ^= b;
if (... | 3 |
#include <bits/stdc++.h>
using namespace std;
char s[1005];
int f[26];
int main() {
scanf("%s", s);
int N = strlen(s);
for (int i = 0; i < N; ++i) f[s[i] - 'a']++;
int c = 0;
for (int i = 0; i < 26; ++i)
if (f[i] & 1) ++c;
if (c == 0 || (c & 1))
printf("First");
else
printf("Second");
return... | 2 |
#include <bits/stdc++.h>
using namespace std;
int N, ans[151][151];
int query(int X1, int Y1, int X2, int Y2) {
printf("? %d %d %d %d\n", X1, Y1, X2, Y2);
fflush(stdout);
int ret;
scanf("%d", &ret);
return ret;
}
void gao(int X1, int Y1, int X2, int Y2) {
ans[X2][Y2] = ans[X1][Y1] ^ (!query(X1, Y1, X2, Y2))... | 3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using namespace std;
int main() {
ll t;
cin >> t;
ll ans = t;
ll up = 0;
ll down = 0;
ll tm = 0;
for (ll speed=1; speed<t; speed*=3) {
up += speed;
tm++;... | 0 |
#include <iostream>
#include <string>
using namespace std;
using llong = long long;
int main() {
string s;
llong y, m, d;
while (cin >> s, s == "HEISEI") {
cin >> y >> m >> d;
if (y > 31 || (y >= 31 && m >= 5)) {
printf("? %lld %lld %lld\n", y - 30, m, d);
}
else {
printf("HEISEI %l... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
long long max(long long a, long long b) {
if (a < b)
return b;
else
return a;
}
long long min3(long long a, long long b, long long c) {
return min(a, min(b, c));
}
long... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long tinh(long long a, int x) { return (a - (!(a % 2) == x)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
long long a[100005], sumodd[100005], l[100005], r[100005], res, m;
cin >> n;
sumodd[0] = 0;
for (int i = 1; i < n; ++i) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 3e5 + 10;
int n;
vector<int> a, b;
int tree[4 * N];
int q;
map<int, vector<int> > pos;
void no() { printf("NO\n"); }
void yes() { printf("YES\n"); }
int queryMin(int node, int lo, int hi, int l, int r) {
if (r < lo || hi < l) return inf;... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool isrange(int second, int first, int n, int m) {
if (0 <= second && second < n && 0 <= first && first < m) return true;
return false;
}
int dy[4] = {1, 0, -1, 0}, dx[4] = {0, 1, 0, -1},
ddy[8] = {1, 0, -1, 0, 1, 1, -1, -1}, ddx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
c... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int W,H,N;
cin >> W >> H >> N;
int xmin=0,xmax=W,ymin=0,ymax=H;
for(int i=0;i<N;i++){
int x,y,a;
cin >> x >> y >> a;
if(a==1)xmin=max(xmin,x);
if(a==2)xmax=min(xmax,x);
if(a==3)ymin=max(ymin,y);
if(a==4)ymax=min(ymax,y);
}
cout << max(0,(xmax-... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct node {
long long l, r;
} p[111111];
int cmp(const void *a, const void *b) {
node c = *(node *)a, d = *(node *)b;
if (c.l != d.l) return c.l > d.l ? 1 : -1;
return c.r > d.r ? 1 : -1;
}
int main() {
int n;
long long L, R, k, b;
scanf("%d", &n);
scanf("... | 2 |
#include <bits/stdc++.h>
template <class T>
inline void read(T &res) {
res = 0;
bool bo = 0;
char c;
while (((c = getchar()) < '0' || c > '9') && c != '-')
;
if (c == '-')
bo = 1;
else
res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
if (... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, M = 1000000007LL, res;
set<char> st;
string arr[110];
int main() {
cin >> n >> m;
for (i = 0; i < n; i++) cin >> arr[i];
res = 1;
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
st.insert(arr[j][i]);
}
res = (res * st.size... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
int ones = 0, evens = 0;
for (int i = 0; i < n; i++) {
cin >> t;
if (t % 2 == 0)
evens++;
else
ones++;
}
if (ones % 2 == 0) {
cout << evens;
} else
cout << ones;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ii = pair<int, int>;
using lu = unsigned long long;
using l = long long;
using vs = vector<string>;
using vii = vector<ii>;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>... | 4 |
// ※※※ 解答不能 ※※※
// koosaga氏.
// https://atcoder.jp/contests/code-festival-2016-quala/submissions/893805
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct edg {
int to, nxt, fro;
long long w;
bool is;
} e[N << 1];
struct Node {
int v;
long long w;
Node(){};
Node(int _v, long long _w) : v(_v), w(_w){};
};
bool operator<(Node x, Node y) { return x.w > y.w; }
int n, m, cnt = 1, head[N]... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long SIZE = 5e4 + 5;
const long long mod = 998244353;
void solution() {
long long n, k, q, s = 0;
cin >> n;
vector<long long> empro(1000001, 0);
map<long long, long long> em;
map<long long, long long> aaa;
vector<long long>... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[102][102];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int q, x, y, tp;
cin >> n >> m >> q;
memset(a, 0, sizeof a);
vector<int> v[q];
for (int i = 0; i < q; i++) {
cin >> tp;
if (tp == 3) {
v[i].push_back(tp);... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> arr(n);
for (auto &item : arr) {
cin >> item;
}
int r1 = 0;
int r2 = 0;
int res;
for (auto &item : arr) {
if (item > 0)
r1++;
else if (item ... | 1 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned i... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int res = 0, c;
while (c = getchar(), c < '0' || c > '9')
;
do {
res = res * 10 + (c ^ 48);
} while (c = getchar(), c >= '0' && c <= '9');
return res;
}
pair<pair<int, int>, int> S[500010];
int ask[500010];
set<int> Set;
int ma... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
long long int ans;
if (k % (n - 1) != 0)
ans = n * (k / (n - 1)) + k % (n - 1);
else
... | 3 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int dp[100001][10];
int main(){
int n,m;
int a[10];
string id;
cin>>n>>id;
cin>>m;
for(int i=0;i<m;i++)cin>>a[i];
dp[0][0]=1;
for(int i=0;i<n;i++){
for(int j=0;j<10;j++){
if(id[i]=='*'){
for(int k=0;k<m;k++){
int x=a[... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2222;
int c[maxn][10][2];
int a[maxn][maxn];
int Abs(int a) { return a < 0 ? -a : a; }
int x[10], y[10], xx[10], yy[10], l[11][11], num[111111];
const int INF = 111111111;
int main() {
int n, m, i, j, t, s, k;
scanf("%d%d%d%d", &n, &m, &k, &s);
for (i... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long s[100005]{0};
pair<long long, long long> p[100005];
for (int i = 0; i < m; i++) {
int u, v;
long long d;
cin >> u >> v >> d;
u--;
v--;
s[u] -= d;
s[v] += d;
}
for (int i = 0; i < n; i+... | 4 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-15, PI = acos(-1);
const int MOD = int(1e9) + 7, MX = int(1e5) + 1;
const int N = 2010;
int memo[N][N];
string a, b;
int ED() {
int n = int(a.size()), m = int(b.size());
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (a[i - ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, flag, a;
long long ans;
while (cin >> T) {
a = 0;
ans = 1;
flag = 0;
while (T--) {
int n;
cin >> n;
if (n == 0 && flag == 1) {
a++;
}
if (n == 1) {
flag = 1;
if (a != 0) {
... | 2 |
#include<bits/stdc++.h>
using namespace std;
long N,A,B,C,l[9],ans=LONG_MAX;
void dfs(int n,int a,int b,int c,int v){
if(n==N){
if(a&&b&&c)ans=min(ans,abs(a-A)+abs(b-B)+abs(c-C)+v);
return;
}
dfs(n+1,a,b,c,v);
dfs(n+1,a+l[n],b,c,v+10*(a>0));
dfs(n+1,a,b+l[n],c,v+10*(b>0));
dfs(n+1,a,b,c+l[n],v+10*(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a=0;
string d,f;
cin >>d;
cin >>f;
for(int s=0;s<3;s++){
if(d[s]==f[s])
a++;}
cout <<a <<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
long long power(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1) ret *= a;
a *= a;
if (ret >= MOD) ret %= MOD;
if (a >= MOD) a %= MOD;
b >>= 1;
}
return ret;
}
long long inv(long long x) { return powe... | 3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) cin >> c[i];
sort(a.begin... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int M = 4e3 + 10, mod = 998244353;
int dp[2][M], base = 2005;
int mul(int x, int y) { return 1ll * x * y % mod; }
void inc(int& x, int y) {
x += y;
if (x >= mod) x -= mod;
}
int a[M];
int main() {
int n, K;
scanf("%d%d", &n, &K);
dp[0][base] = 1;
for (int ... | 6 |
#include <bits/stdc++.h>
using namespace std;
double a, h;
int main (){
cin >> a >> h;
cout << ceil(a/h) << endl;
}
| 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 200010
#define ll long long
using namespace std;
int n, nxt[N], d, len[2];
ll L, R, ans[26], D[1010][2], s[2], s1[2][26];
char S[N];
inline void kmp(){
nxt[0]=nxt[1]=0; int j;
for(int i=2; i<=n; i++){
j=nxt[i-1]; while(j&&S[i]!=S[j+1])j=nxt[j];
if... | 0 |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long... | 2 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
x = (x << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return x * f;
}
const int maxn = 1e7 + 7, moe = 998... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
vector<int> g[200200];
void solve() {
int n, k;
scanf("%d%d\n", &n, &k);
vector<char> A(n);
for (int i = 0; i < n; i++) {
scanf("%c", &A[i]);
}
scanf("\n");
for (int i = 0; i <= n; i++) g[i].clear();
... | 2 |
#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main() {
cin>>a>>b>>c;
cout<<(a-c)/(c+b)<<'\n';
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MN = 200005;
const int MOD = 1e9 + 7;
int n, m;
int A[MN];
const int ME = MN;
const int INF = 0x3f3f3f3f;
struct edge {
int v, next, cap;
} E[ME * 2];
int vec[MN], NE;
int gap[MN], lev[MN], cur[MN], pre[MN], aug[MN];
void init(int n) {
NE = 0;
for (int i = 0... | 3 |
#include <bits/stdc++.h>
char s[210000], t[210000];
int n, m, f[210000], g[210000], ans, r, now, te;
int main() {
scanf("%s%s", s + 1, t + 1);
n = strlen(s + 1);
m = strlen(t + 1);
for (int i = 1; i <= n; i++) {
if (now < m && t[now + 1] == s[i]) now++;
f[i] = now;
}
now = g[n + 1] = m + 1;
for (i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int m;
cin >> m;
vector<pair<int, string> > items(m);
for (int i = 0; i < m; i++) {
int val;
string type;
cin >> val >> type;
items[i] = pair<int, string>(val, type);
}
sort(items.begin(), ite... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int cases;
cin >> cases;
while (cases) {
cases--;
long long int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - 1 << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long modsize = 303030;
vector<long long> fac(modsize);
vector<long long> inv(modsize);
vector<long long> facinv(modsize);
void modcalc() {
if (modsize == 0) abort();
fac[0] = 1;
fac[1] = 1;
inv[1] = 1;
facinv[0] = 1;
facinv[1] = 1... | 2 |
#include<cstdio>
using namespace std;
int main(){
int g[13] = {0, 0, 2, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0};
int x, y; scanf("%d %d", &x, &y);
puts(g[x] == g[y] ? "Yes" : "No");
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000013;
int n, m;
pair<int, int> a[N];
vector<int> q[N];
bool read() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
int l, r;
scanf("%d%d", &l, &r);
a[i] = make_pair(l, r);
}
for (int i = 0; i < m; i++) {
int cnt;
scanf("%d... | 5 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<vector>
#include<string>
#define reep(a,s,d) for(int a=d;a<s;a++)
#define rep(a,s) reep(a,s,0)
using namespace std;
struct edge{
int to,cost,tick;
edge(int to,int cost,int tick):to(to),cost(cost),tick(tick){}
... | 0 |
#include <bits/stdc++.h>
char s[1010], t[1010];
int a[27] = {0}, b[27] = {0}, n, m, x, y, l;
int f(int k) {
int s = 0;
for (int i = 1; i <= 26; i++)
if (a[i]) {
s += a[i] / k;
if (a[i] % k) s++;
}
return s;
}
int main() {
scanf("%s", s);
l = strlen(s);
for (int i = 0; i < l; i++) a[s[i] ... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> divs[111111];
int is_pr[111111];
int is_on[111111];
int in_use[111111];
int n, m;
char data[1111];
int main() {
gets(data);
sscanf(data, "%d%d", &n, &m);
for (int i = 2; i <= n; ++i) {
is_pr[i] = 1;
}
for (int i = 2; i * i <= n; ++i) {
if (is_p... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
int row[1010] = {0}, col[1010] = {0};
char g[1010][1010];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
cin >> g[i][j];
if (g[i][j] == '*') row[i]++, col[j]++, v.push_bac... | 2 |
#include<bits/stdc++.h>
long long t,n,x,a,b,ans;
using namespace std;
int main()
{
cin>>n>>x>>a;
if(a>x)
{
ans+=a-x;
a=x;
}
for(int i=2;i<=n;i++)
{
cin>>b;
if(a+b>x)
{
t=a+b-x;
ans+=t;
b=b-t;
}
a=b;
}
cout<<ans<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
long long a, b;
long long t = 0;
long long sum = 0;
cin >> a >> b;
while (b != 0) {
sum += a / b;
t = b;
b = a % b;
a = t;
}
cout << sum << endl;
return 0;
}
| 1 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#i... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char ch = getchar();
int nega = 1;
while (!isdigit(ch)) {
if (ch == '-') nega = -1;
ch = getchar();
}
int ans = 0;
while (isdigit(ch)) {
ans = ans * 10 + ch - 48;
ch = getchar();
}
if (nega == -1) return -ans;
return ans... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10000010;
int pri[N], st[N];
long long f[N];
void init() {
int top = 0;
for (int i = 2; i < N; i++) {
if (!st[i]) pri[top++] = i, st[i] = i;
for (int j = 0; j < top && pri[j] * i < N; j++) {
st[pri[j] * i] = pri[j];
if (i % pri[j] == 0)... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<bool> S(64), X(64);
uint64_t Sint, Xint;
cin >> Sint >> Xint;
for (uint64_t i = 0; i < 64; ++i) {
S[i] = (bool)(Sint & (1ULL << i));
X[i] = (bool)(Xint & (1ULL << i));
}
vector<bool> C(64);
for (int i = 0; i < 63; ++i) {
C[i] = ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
struct node {
int x, y;
} k[maxn];
int w[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
k[i].x = w[i];
}
sort(w + 1, w + n + 1);
for (int i = 1; i <= n; i++) {
int a = k[i].x;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int a[110];
int n, dp[110][10007];
int solve(int pos, int s) {
if (pos == n) {
if (s & 1) return s;
return 0;
}
int &ret = dp[pos][s];
if (ret != -1) return ret;
int x = solve(pos + 1, a[pos] + s);
int y = solve(pos + 1, s);
return ret = max(x, y);
}
i... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
const int INF = 2000 * 1000 * 1000;
const double EPS = 1e-9;
const double pi = acos(-1.0);
template <typename T>
inline T sqr(T n) {
return (n * n);
}
struct st {
int x, num, col;
bool operator<(const st& s) const { return (x < ... | 1 |
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
int main()
{
int q;
for(;cin>>q;)
{
for(;q--;)
{
int c,a,n;
int ans=0;
cin>>c>>a>>n;
while(n>0&&a>0&&c>0)
{
c--;a--;n--;
ans++;
}
while(a>0&&c>1)
{
c-=2;a--;
ans++;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
long long s;
cin >> n >> k >> s;
int pos = 1;
long long step = s / k, r = s - step * k;
if (step == 0 || (step == n - 1 && r > 0) || (step >= n)) {
cout << "NO";
return 0;
}
cout << "YES\n";
for (int i = 1; i <= k; i++) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, num=0;
cin >> N;
for(int i=1; i<N; ++i){
num += (N-1)/i;
}
cout << num <<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
namespace math {
template <typename T>
T gcd(T a, T b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
while (b > 0) {
T r = a % b;
a = b;
b = r;
}
return a;
}
} // namespace math
template <typename C>
int SZ(const C& c) {
return (int)c.size();
}
template <... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 250;
int a[maxn + 5], cnt[maxn * 10], mx, T, sum, flag, r, mn;
double S;
int main() {
int T;
scanf("%d", &T);
while (T--) {
mx = 0;
flag = 0;
mn = 2000;
S = 0;
memset(cnt, 0, sizeof cnt);
for (int i = 1; i <= maxn; i++) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
void bfs(vector<int> &S, int K) {
deque<int> Q;
Q.push_front(1);
while(!Q.empty()) {
int v = Q.front();
Q.pop_front();
int nv = v * 10 % K;
if(S[nv] > S[v]) {
S[nv] = S[v];
Q.push_front(nv);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[5];
char op[5];
int main(){
int cnt;
scanf("%s",s);
for(int i=0;i<8;i++){
cnt=s[0]-'0';
for(int j=0;j<3;j++){
if(i&(1<<j)){
op[j]='+';
cnt+=s[j+1]-'0';
} else {
op[j]='-';
cnt-=s[j+1]-'0';
}
}
if(cnt==7){
printf("%c",s[0]);
... | 0 |
#include <bits/stdc++.h>
#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-vrp")
#pragma GCC optim... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, p;
struct shark {
int l;
int r;
} sh[100005];
long double ans = 0;
int main() {
int l, r;
scanf("%d%d", &n, &p);
for (int i = 0; i < n; i++) {
scanf("%d%d", &l, &r);
sh[i].l = l;
sh[i].r = r;
}
if (n > 2) {
sh[n].l = sh[0].l;
sh[n].r... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
string vow = "AEIOUY";
string s;
int res = INT_MIN;
cin >> s;
for (int i = 0; i < s.length(); i++)
for (int j = 0; j < vow.length(); j++)
if (s[i] == vow[j]) v.push_back(i);
if (v.size() == 0)
res = s.length() + 1;
e... | 1 |
//#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cstdlib>
#include <ctime>
#include <stack>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef int itn;
//min({a,b,c,d});
int a[10... | 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int INF = 2e9;
const int MOD = 1e9 + 7;
const int MB = 20;
vector<vector<pair<int, int>>> q;
vector<int> col;
void rec(int c1, int c2, int v, int u, int num) {
if (q[v][c1].first == -1) {
q[v][c1] = {u, num};
col[num] = c1;
ret... | 6 |
#include <bits/stdc++.h>
using namespace std;
int freq[10001], ar[10001];
int n, cnt, x;
int main() {
cin >> n;
cnt = 0;
for (int i = 1; i <= 100; i++) freq[i] = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
if (freq[x] == 0) {
cnt++;
ar[cnt] = x;
}
freq[x]++;
}
if (cnt > 3)
co... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b = 0;
int m[200005];
cin >> n;
for (int i(0); i < n; i++) {
char c;
cin >> c;
if (c == 'D') {
m[i] = 1;
a++;
} else {
m[i] = 2;
b++;
}
}
int x = 0, y = 0;
while (true) {
for (int i(0);... | 3 |
#include <bits/stdc++.h>
using namespace std;
int uni[100000],n,m,r[100000];
int find(int a){
if(a!=uni[a])a=find(uni[a]);
return a;
}
bool same(int a,int b){
return find(a)==find(b);
}
void unit(int a,int b){
int c=find(a),d=find(b);
if(r[c]>r[d])uni[d]=c;
else{uni[c]=d;
if(r[c]==r[d])r[c]++;
}
}
int main() {... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k = 0, k1 = 0;
cin >> n;
int a[n + 10], b[n + 10];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
int k = 0;
for (int j = 1; j <= n; j++) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
for (int i = (0); i < (n); ++i) {
long long t, T, x, cost;
cin >> t >> T >> x >> cost;
if (t >= T) {
ans += cost + m * x;
continue;
}
long long aux1 = cost;
if (m > (T - t))... | 4 |
#include <bits/stdc++.h>
using namespace std;
void answer() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int done = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i] != a[j]) {
if (done) {
cout << "YES" << endl;
d... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10, MOD = 1000 * 1000 * 1000 + 7,
INF = 2 * 1000 * 1000 * 1000;
const double EPS = 1e-9;
int val[11];
int len[11];
string queries[maxn];
int mul(int a, int b) { return ((long long)a * b) % MOD; }
int add(int a, int b) { return (a + b) % M... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long dp[502][502];
int n, m, mod;
long long calc(int o, int z) {
if (o == 0 && z == 0) return 1;
if (dp[o][z] != -1) {
return dp[o][z];
}
long long ans = 0;
if (o > 0 && z > 0)
ans = (ans + (((calc(o, z - 1) * o) % mod) * z) % mod) % mod;
if (z > 1)... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d, n;
int a[2000];
int k = 0;
cin >> d >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 1; i < n; ++i) k += (0 - a[i - 1] + d) % d;
cout << k;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
const int mo = 998244353;
struct str {
string s;
int hash = 0;
friend str& operator+=(str& a, const char& c) {
a.s += c;
a.hash = a.hash * 2 + (c - '0') % mo;
return a;
}
friend bool operator==(const str& a, const str& b) {
... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.