solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
double x, y, a[maxn], b[maxn], p, q, l, r;
int n;
double f(double x) {
double y = 1;
for (int i = 0; i < n; ++i) y = min(y, (1.0 - x * a[i]) / b[i]);
return p * x + q * y;
}
int main() {
scanf("%d%lf%lf", &n, &p, &q);
l = 0;
r = 1;
for... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct plan {
int val;
int idx;
} plans[2005];
bool comp(struct plan i, struct plan j) {
if (i.val == j.val) return (i.idx < j.idx);
return (i.val < j.val);
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> plans[i].val;
plans[i].idx... | 2 |
#include <bits/stdc++.h>
using namespace std;
string a;
bool check(int i, int j) {
for (int s = i; s <= j; s++) {
if (a[s] != a[j - s + i]) return 0;
}
return 1;
}
int ans;
int main() {
cin >> a;
for (int i = 0; i < a.length(); i++) {
for (int j = i; j < a.length(); j++) {
if (!check(i, j)) ans ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
const int MAXM = 200011;
int n, m;
int x[MAXN], y[MAXN];
vector<int> r[MAXM];
int g[MAXM] = {0};
int last(int i) {
int j = i - 1;
if (j == 0) j = n;
return abs(x[j] - x[i] + y[j] - y[i]);
}
int next(int i) {
int j = i + 1;
if (j > n) j = 1;
... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int maxn = 3e5 + 10;
int n, m;
long long sum[maxn];
vector<int> pos, neg;
vector<pair<int, int> > ans;
vector<long long> s;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i) {
int u, v, d;
scanf("%d... | 4 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
#define Seg_Max_N (1<<18)
using Value = int;
const Value ini = -1e9;
struct segtree {
int N;
vector<Value>dat;
segtree() {}
segtree(int n) :dat(2 * Seg_Max_N) {
N = 1;
while (N < n) N *... | 0 |
#include <bits/stdc++.h>
using namespace std;
int N, Q;
int A[3 << 17];
const int B = 19;
vector<int> G[B][B];
int main() {
scanf("%d%d", &N, &Q);
for (int i = 0; i < B; i++)
for (int j = i + 1; j < B; j++) G[i][j].assign(N, N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
for (int j = 0; j < B; ... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int getDiff(pair<int, int> x) { return (x.second - x.first); }
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tt;
cin >> tt;
while (tt--) {
string ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 710;
const int MODD = 1000000007;
char s[MAXN];
int n, m[MAXN], dp[MAXN][MAXN][3][3];
int gao(int l, int r, int cl, int cr) {
if (l > r) return 1;
int &ret = dp[l][r][cl][cr];
if (ret != -1) return ret;
ret = 0;
int mm = m[l];
if (mm == r) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int N;
int A[1000001];
int B[1000001];
long long swap_count;
void merge(int start, int end) {
int mid = (start + end) / 2;
int i = start;
int j = mid + 1;
int k = 0;
while (i <= mid && j <= end) {
if (A[i] <= A[j])
B[k++] = A[i++];
else {
B[k++... | 2 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s, o;
cin >> s;
int n = s.size();
while (n == 2) {
cout << s << endl;
break;
}
for (int i = 0; i < n; i += 2) {
o.push_back(s[i]);
}
o.push_back(s[n - 1]);
if (n != 2) cout << o << endl;
}
int main() {
ios_base::sync_wit... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
cout<<(A+B)%(24)<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long setBit(long long mask, int p) { return (mask | (1 << p)); }
long long resetBit(long long mask, int p) { return (mask & ~(1 << p)); }
long long flipBit(long long mask, int p) { return (mask ^ (1 << p)); }
bool check(long long mask, int p) { return (mask & (1 << p))... | 3 |
#include <bits/stdc++.h>
int take() {
int n;
scanf("%d", &n);
return n;
}
double ttake() {
double n;
scanf("%lf", &n);
return n;
}
long long takes() {
long long n;
scanf("%lld", &n);
return n;
}
int cas;
using namespace std;
bool approximatelyEqual(float a, float b, float epsilon) {
return fabs(a - ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, j = 0, c = 0;
string a, b;
cin >> n >> k;
cin >> a;
b.append(a, 0, k);
for (j = 0; j < n; j++) {
if (b[j % k] < a[j]) {
c = 1;
break;
}
if (b[j % k] > a[j]) {
break;
}
}
if (c != 1) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, res[300000], cur = 0;
pair<int, int> a[300000];
cin.sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i].first, a[i].second = i;
sort(a, a + n);
for (int i = 0; i < n; i++) {
cur = max(a[i].first, cur + 1);
res[... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int a[N], cnt[20];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int x;
scanf("%d", &x);
a[i] |= x << j;
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int cnt[100005];
int sum[100005];
int ll, rr;
int main() {
int n, m, b;
scanf("%d%d%d", &n, &m, &b);
cnt[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &cnt[i]);
sum[i] = sum[i - 1] + cnt[i];
}
sum[n + 1] = sum[n];
int ll = -1, rr = -1;
int cntt;... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char ar[6][8] = {{'3', '3', '-', '4', '4', '-', '3', '3'},
{'3', '3', '-', '4', '4', '-', '3', '3'},
{'2', '2', '-', '3', '3', '-', '2', '2'},
{'2', '2', '-', '3', '3', '-', '2', '2'},
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> ini[2001000], fim[2001000];
string s[2001000];
char ss[2001000];
set<pair<int, int> > st;
char ans[2001000];
int len;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%s %d", ss, &k);
s[i] = (string)ss;
for (int j = 0;... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 80000 * 4 + 5;
int T;
long long R;
char c;
long long len;
int stk[maxn];
int t[maxn];
int to[maxn];
long long mark[maxn];
vector<int> G[maxn];
long long dfs(int u) {
if (t[u] == 0) return 1ll;
long long ret = (t[u] == 1) ? 0ll : maxn;
for (int v : G[u... | 5 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
int const MAXN = 2e5 + 99;
int n;
int cnt[MAXN];
int good[MAXN];
int main() {
int q;
cin >> q;
while (q--) {
cin >> n;
for (int i = 0; i <= n; i++) {
cnt[i] = good[i] = 0;
}
for (int i = 0; i < n; i++) {
int t, g;
cin >> t >> g;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
vector<int> e[MAXN];
vector<int> p[MAXN];
int n, m;
int res[MAXN];
int step, tl[MAXN], tr[MAXN];
struct node {
int l, r, flag, s;
} t[1000000];
void dfs1(int u, int fa) {
tl[u] = step++;
for (int i = 0; i < e[u].size(); i++) {
int v = e[u]... | 5 |
#include <bits/stdc++.h>
using namespace std;
string toString(long long x) {
stringstream ss;
ss << x;
return ss.str();
}
int main() {
long long l, r;
cin >> l >> r;
long long answer = 0;
for (l; l % 10 != 0 && l <= r; ++l) {
string s = toString(l);
if (s[0] == s[s.size() - 1]) {
++answer;
... | 1 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int c[] = {4, 1, 4, 1, 2, 1, 2, 1, 4, 1, 4, 1, 2, 1, 2, 1};
int s[] = {41412121,
14121214,
41212141,
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> noneleg;
ll pw(ll a, ll e) {
ll ans = 1;
while (e) {
if (e & 1) ans *= a;
e /= 2;
a = a * a;
}
return ans;
}
bool isx2(ll x) {
ll tmp = round(sqrt(x));
return tmp * tmp == x;
}
int main() {
ios::sync_with_stdio(fals... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const int MAXM = 5e6 + 5;
const double eps = 1e-10;
const long long MOD = 998244353;
int x, y;
int cnt;
int judger(int c, int d) {
int aa = x ^ c, bb = y ^ d;
if (aa < bb)
return -1;
else if (aa == bb)
return 0;
else
return 1;
}... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y;
int c[2][1005];
int dp[1005][2][1005];
int main() {
cin >> n >> m >> x >> y;
for (int i = 0; i < n; i++)
for (int j = 1; j <= m; j++) {
char t;
cin >> t;
if (t == '#')
c[0][j]++;
else
c[1][j]++;
}
memset(... | 3 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=305;
int f[N][N],s[N][N],C[N][N],n,m,p;
int main()
{
scanf("%d%d%d",&n,&m,&p);
C[0][0]=1;
for(int i=1;i<=n;i++)
{
C[i][0]=C[i][i]=1;
for(int j=1;j<n;j++)C[i][j]=(C[i-1][j-1]+C[i-1][j])%p;
}
for(int i=0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
string st1, st2, ans;
int tt[15], mmas[15];
void fin(int x) {
for (int i = x - 1; i >= 0; i--) {
if (tt[i]) {
tt[i]--;
ans += char(i + '0');
break;
}
}
for (int i = 9; i >= 0; i--) {
while (tt[i]--) {
ans += char(i + '0');
}
}... | 3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long int n;
cin >> n;
long long int a[n];
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long int b[n];
b[0] = a[0];
long long int cnt = 0;
for (long long int i = 1; i < n; i++) {
if (b[i - 1] > ... | 4 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
const int MAXN = 3000 + 10;
int N;
char str[MAXN << 1];
int apos[MAXN]= {0}, bpos[MAXN]= {0};
int an = 0, bn = 0;
string f[MAXN], g[MAXN];
// f[i]: 强制选第i对a、b，对i...n对a、b的最大串
// g[i]: max (f[i], f[i + 1], ..., f[n])
int m... | 0 |
#include <bits/stdc++.h>
using namespace std;
set<int> s;
set<int>::iterator it;
int n;
int st[300005], top;
signed main() {
scanf("%d", &n);
char ss[10];
int ans = 0;
bool flag = 0;
int now = 0;
for (int i = 1; i <= 2 * n; i++) {
scanf("%s", ss);
if (ss[0] == 'a') {
int tmp;
scanf("%d",... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[105], g[105][105], d;
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> d;
if (i - d >= 0) g[i - d][i] = g[i][i - d] = 1;
if (i + d < n) g[i + d][i] = g[i][i + d] = 1;
g[i][i] = 1;
}
for (... | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
map<int, int> mp;
for (int i : a) mp[i]++;
vector<pa... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1002;
int n, m;
char table[MAX][MAX];
struct UnionFind {
int n, p[2 * MAX], w[2 * MAX];
UnionFind(int _n) {
n = _n;
for (int i = 0; i < n; i++) w[i] = 1;
for (int i = 0; i < n; i++) p[i] = i;
}
void uni(int i, int j) {
int u = root(i)... | 4 |
#include <bits/stdc++.h>
int a[60][60][60], n, m, r, s, t, c, min[59][60][60];
int main() {
scanf("%d%d%d", &n, &m, &r);
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++) scanf("%d", &a[i][j][k]);
for (int i = 0; i < m; i++)
for (int l = 0; l < n; l++)
for (in... | 4 |
#include <bits/stdc++.h>
using namespace std;
FILE *f, *g;
struct cp {
int f, c, z;
};
cp a[150][150];
vector<int> e[150];
int n, m, l, sum;
int v[150], bf[27], bf2[27];
int tt[150];
char t[150];
int flw, sol;
int H[150], pos[150];
int dist[150];
bool inq[150];
int con[150];
void fa_muchie(int x, int y, int cap, int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> a >> b;
n--;
a--;
b--;
if (a / m == b / m) {
cout << 1;
} else if (b == n) {
cout << (a % m == 0 ? 1 : 2);
} else {
int ans = 1;
if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, a, b, h;
cin >> n >> a >> b >> h;
int mini = INT_MAX;
string s;
cin >> s;
int count0 = 0, count1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '0')
count0++;
else
... | 1 |
#pragma GCC optimize("O3")
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <iostream>
#include <iterator>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <ctime>
#include <cstring>
#include <stack>
#inc... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long q[2000];
int len;
void init() {
q[0] = 4;
q[1] = 7;
int h = 0, t = 2;
while (h < t) {
if ((long long)q[h] * 10 <= 1000000000) {
q[t++] = q[h] * 10 + 4;
q[t++] = q[h] * 10 + 7;
}
h++;
}
len = t;
q[len++] = 4444444444;
sort(q,... | 3 |
#include<stdio.h>
#include<string.h>
int main(){
int taro[105],hanako[105],nt,nh,i,j,d=0,d2;
int min=100000,mint=-1,minh=-1;
while(1){
scanf("%d %d",&nt,&nh);
if(nt==0 && nh==0)
break;
d=0;
min=100000;
mint=-1;
minh=-1;
for(i=0;i<nt;i++){
scanf("%d",&taro[i]);
d+=taro[i];
}
for(i=0;i<nh;i... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 1;
int a[MAXN];
set<int> st;
map<int, int> cnt;
void findAndErase(int k) {
set<int>::iterator it = st.find(k);
if (it != st.end()) st.erase(it);
}
void add(int k) {
if (cnt[k] == 1)
findAndErase(k);
else if (!cnt[k])
st.insert(k);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long a[100001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
long long ans = 1;
for (int i = 0; i < n; ++i) {
if (a[i] >= ans) ans++;
}
cout... | 2 |
#include <cstdio>
typedef long long ll;
const int Maxn=300;
ll a[Maxn+5];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
}
ll sum=0;
for(int i=3;i<=n;i++){
sum^=a[i];
}
ll d=(a[1]+a[2])-sum;
if(d<0||(d&1)){
puts("-1");
return 0;
}
d>>=1;
if(d>a[1]||(d&sum)>0){
puts("... | 0 |
#include<bits/stdc++.h>
#define MAXN 150
using namespace std;
int a[MAXN*1000],arr[MAXN][MAXN],r=1,c=1,dir=1;
int main(){
int h,w;
cin>>h>>w;
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
while(a[i]){
arr[r][c]=i+1;
a[i]--;
if(dir==1){
if(c==w){
r++;
dir=-1;... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
string s1, s2;
cin >> s1 >> s2;
long long i, n = s1.size(), k1 = 0, k2 = 0, flag = 0, cnt = 0;
for (i = 0; i < n; i++) {
if (s1[i] == '4' && s2[i] == '7')
k1++;
else if (s1... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int a[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < 1 << n; ++i) {
int res = 0;
for (int j = 0; j < n; ++j) {
if ((i >> j) & 1)
res = (res + a[j]) % 360;
els... | 2 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[3005], b[3005], c[3005], d[3005], e[3005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i];
for (int i = 1; i <= n; i++) cin >> c[i];
d[1] = a[1], e[1] = b[1];
for (int i = 2; i <= n; i++) ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
long long r = 1 % P;
for (a %= P; n; a = a * a % P, n >>= 1)
if (n & 1) r = r * a % P;
return r;
}
void exgcd(long long a, l... | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef struct {
int x;
int y;
} Point;
int main() {
string input;
getline(cin, input);
int pointsCount = atol(input.c_str());
int *points = new int[pointsCount];
getline(cin, input);
stringstream pointsStream(input);
for (int i = 0; i < pointsCount; i++) ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1;
const int inf = 1e9 + 10;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int x, y, z;
cin >> x;
cout << x / 2 + 1 << endl;
for (int i = 1; i <= x; i++) {
if (i & 1)
cout << i / 2 + 1 << " " << i / 2 + 1 <... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int SZ = 55555;
string s;
void solve() {
int k;
cin >> k >> s;
s += 'A';
int l = -1, ans = 0;
for (int i = 0; i <= k; ++i) {
if (s[i] == 'A') {
if (l >= 0) {
ans = ... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
const char s[4][100] = {"What are you doing while sending \"",
"\"? Are you busy? Will you send \"", "\"?",
"What are you doing at the end of the world? Are you "
"busy? Will you save us?"};
long long c... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long A[100005], P[100005], N, S, G;
long long g(long long a, long long b) { return b == 0 ? a : g(b, a % b); }
int main() {
cin >> N;
for (long long i = 0; i < N; i++) {
cin >> A[i];
S += A[i];
}
sort(A, A + N);
for (long long i = 1; i < N; i++) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int v, r, d;
node() {}
node(int V, int R, int D) : v(V), r(R), d(D) {}
} nodes[1009 * 1009];
struct jibancanyang {
int n, m, q;
int f(int i, int j) { return i * (m + 1) + j; }
int g(int i, int j) {
int k = 0;
while (i--) k = nodes[k].d;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[101];
int E = 0, S = 0, e = 0, s = 0;
a[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (a[i] == 1)
E += 1;
else if (a[i] == -1)
S += 1;
}
int max = 0;
for (int b = 1; b <= n; ++b) ... | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long N = 5e3 + 3, M = 1e5 + 3, BIG = (long long)1e9 + 3,
MOD = 1e9 + 7, P = 29, P2 = 'z' - 'a' + 1, K = 4;
const double PI = 3.14159265359;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long lon... | 3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
long long int n = s.length();
if (s[n - 1] == 'E') {
long long int count = 0;
for (long long int i = 0; i < n - 1; i++) {
if (s[i] == 'N') count++;
}
if (count == 1) {
cout << "NO";
return;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 5 * (int)1e5 + 10;
vector<int> g[maxN];
long long c[maxN];
int n, m, k;
int sz = 1;
const int mod = (int)1e9 + 7;
int sum(int a, int b) {
int s = a + b;
if (s >= mod) s -= mod;
return s;
}
int sub(int a, int b) {
int s = a - b;
if (s < 0) s += mod... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 7;
const long long INF = 1e9 + 7;
long long n, m;
long long fac[N];
int main() {
scanf("%I64d%I64d", &n, &m);
fac[0] = 1;
for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % m;
long long ans = 0;
for (long long i = 1; i <= n; i++... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, pair<int, int> > > edges;
vector<int> adj[100005];
vector<int> topo;
int n;
int visit[100005];
void dfs(int i) {
visit[i] = 1;
for (int j = 0; j < adj[i].size(); j++) {
if (visit[adj[i][j]] == 0) dfs(adj[i][j]);
}
topo.push_back(i);
}
bool find_... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int intmax = 0x3f3f3f3f;
const long long i64max = 0x3f3f3f3f3f3f3f3fll;
double eps = 1e-6;
template <class T>
inline void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
if (b > a) a = b;... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h1, h2, a, b, day, night, i, j, k, l, cnt = 0;
scanf("%d %d", &h1, &h2);
scanf("%d %d", &a, &b);
int prevh1 = h1;
while (h1 < h2) {
h1 = h1 + a * 8;
if (h1 >= h2) {
break;
}
h1 = h1 - b * 12 + a * 4;
if (h1 <= prevh1) {
... | 1 |
#include<cstdio>
#include<bitset>
using namespace std;
bitset<50001> pt;
void MakeTable(int n){
pt.reset();
pt.set(2);
int i;
for(i=3;i<=n;i+=2)pt.set(i);
i = 3;
while(i*i<=n){
for(int j=3*i;j<=n;j+=2*i)pt.reset(j);
while(!pt[++i]);
}
}
int main(){
int n,ans;
MakeTable(50000);
whil... | 0 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
typedef long long LL;
const int N=200005;
int n,m1[N],m2[N],sz[N],low[N];char s[N];LL ans;
int pp,lnk[N],nxt[N*2],to[N*2];
void ae(int k1,int k2){to[++pp]=k2,nxt[pp]=lnk[k1],lnk[k1]=pp;}
void dfs(int k1,int k2){
sz[k1]=s[k1]&15;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, b1, a2, b2;
scanf("%d%d%d%d", &a1, &b1, &a2, &b2);
int valid = 0;
if (a1 <= b2 + 1 && b2 <= 2 * (a1 + 1)) valid = 1;
if (b1 <= a2 + 1 && a2 <= 2 * (b1 + 1)) valid = 1;
if (valid)
printf("YES");
else
printf("NO");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
int infinite = INT_MAX - 10;
template <typename T>
T power(T x, T y) {
T temp;
if (y == 0) return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else {
if (y > 0)
return x * temp * temp;
else
return (temp ... | 2 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
long long powmod(long long a, long long n, long long p) {
if (n == 0) {
return 1LL % p;
}
long long b = powmod(a, n / 2, p);
b = (b * b) % p;
if (n % 2 == 1) {
b = (b * a) % p;
}
return b;
}
long long inv(int... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
long long x1, x2, y1, y2;
for (int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2;
ans += (x2 - x1 + 1) * (y2 - y1 + 1);
}
cout << ans;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, a, b, c, d, e, f, g, h, p, q, r, fr, sc, tr,
sz = 0, tz, i, j, k, mx = LLONG_MIN, mn = LLONG_MAX;
long long x = 0, y = 0, cnt = 0, res = 0, ans = 0, sum = 0;
long long flg = 0, flag = 1, na = 0, as = 1;
vector<long long> u, v, w;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct SegmetTree
{
int N;
vector<T> dat;
SegmetTree(int n) {
N = 1;
while (N < n) N *= 2;
dat.resize(N * 2 - 1, 0);
}
void update(int k, T a) {
k += N - 1;
dat[k] = a;
while (k > 0)... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long c[100];
int main() {
int n, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
c[a] = i;
}
if (n - max(c[1] + 1, c[n] + 1) > min(c[1] + 1, c[n] + 1) - 1)
cout << n - min(c[1] + 1, c[n] + 1);
else
cout << max(c[1] + 1, c[n] + 1) - 1;
}... | 1 |
// ※※※ 解答不能 ※※※
// tourist氏.
// https://atcoder.jp/contests/cf16-relay-open/submissions/8978522
#include <bits/stdc++.h>
using namespace std;
#define repx(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define a first
#define b second
int main(){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
const int md = 1e9 + 7;
string mat[2], pat;
long long n, m, dp[2][maxn][2], pr[2][maxn][2], re, is[2][maxn][maxn],
ris[2][maxn][maxn];
long long sum(long long a, long long b) { return (a + b) % md; }
long long mul(long long a, long long b) { re... | 5 |
#include <bits/stdc++.h>
using namespace std;
int gi() {
int a;
scanf("%d", &a);
return a;
}
long long gli() {
long long a;
scanf("%I64d", &a);
return a;
}
int main() {
int o = gi();
gi();
int m = gi();
int c = gi();
printf((o == c && (!m || o)) ? "1\n" : "0\n");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)5e6 + 7;
const char no[] = "Poor Sereja!";
void minimize(int &x, const int &y) {
if (x > y) x = y;
}
void maximize(int &x, const int &y) {
if (x < y) x = y;
}
struct line {
int x1, y1, x2, y2;
line() {
x1 = 0;
y1 = 0;
x2 = 0;
y2 ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int p[1001010];
int main() {
int n, k;
while (cin >> n >> k) {
if (3 * k > n)
cout << -1 << endl;
else {
int num = n / k, i, pos = 1, j = 1, s;
if (k % 2 == 0) {
for (j = 1; j <= k / 2; j++) {
if (j != 1) cout << " ";
... | 3 |
#include <bits/stdc++.h>
#define ll long long
#define N 6005
using namespace std;
int n;
ll P, f[N][N*2];
void add(ll &a, ll b){
a += b;
if(a >= P) a -= P;
}
int main()
{
cin >> n >> P;
f[0][N] = 1;
n *= 3;
for(int i = 0; i <= n; i++){
for(int j = -i; j <= i; j++){
// 考虑从后... | 0 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int DN=3005,M=1e9+7;
double n,a[DN],dp[DN],sum,p1,p2;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
dp[0]=1;
for(int h=1;h<=n;h++)
{
p1=a[h];
p2=1-a[h];
for(int i=n;i>=0;i--)
{
dp[i+1]+=dp[... | 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
int n;
int ans;
string s;
int main() {
cin >> n >> s;
for (auto c : s) ans += c == '8';
cout << min(ans, n / 11) << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
int temp = x - y;
if (z != 0 && abs(temp) <= z)
cout << "?";
else if (temp < 0)
cout << "-";
else if (temp > 0)
cout << "+";
else if (temp == 0)
cout << "0";
return 0;
}
| 1 |
#include <bits/stdc++.h>
int main() {
std::string s;
std::cin >> s;
std::stack<char> st;
bool ok = true;
int ans = 0;
for (int i = 0; ok && i < s.length(); ++i) {
switch (s[i]) {
case '(':
case '<':
case '{':
case '[':
st.push(s[i]);
break;
case ')':
... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void remax(T &A, T B) {
if (A < B) A = B;
}
template <class T>
inline void remin(T &A, T B) {
if (A > B) A = B;
}
string ToString(long long num) {
string ret;
do {
ret += ((num % 10) + '0');
num /= 10;
} while (num);
reverse(ret... | 4 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;
#define endl '\n'
#define F first
#define S second
const int MAX_N=3e3+3;
const int MOD=1000000007;
int n;
char s[MAX_N];
ll dp[MAX_N][MAX_N];
ll ans;
int main()
{
scanf("%d",&n);
scanf("%s",s+2);
s[1]='<';
dp[0][0]=1;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1e5 + 9;
vector<array<int, 3>> vc;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, k, u, v, w;
cin >> n >> m >> k;
while (m--) {
cin >> u >> v >> w;
vc.push_back({u, v, w});
}
ll a... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
long long f[N];
char s[N];
int main() {
long long n, x, y;
scanf("%lld%lld%lld", &n, &x, &y);
scanf("%s", s + 1);
s[n + 1] = '1';
int cnt = 0;
for (int i = 2; i <= n + 1; ++i)
if (s[i] == '1' && s[i - 1] == '0') ++cnt;
if (cnt == 0) ... | 1 |
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
struct C {
int a, b, c;
} l[40010];
double ans[2];
int comp(const C& x, const C& y) {
int xx = x.b * y.a;
int yy = y.b * x.a;
if (x.a * y.a < 0) {
return xx > yy;
} else {
return xx < yy;
}
}
int b[40010];
void ad... | 0 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int INF = 0x3f3f3f3f;
const int N = 212345;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class num>
inline void rd(num& x) {
char c;
while (isspace(c = getchar()))
;
bool neg = false;
if (!isdig... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int base = 1000000000;
const int base_digits = 9;
struct bigint {
vector<int> a;
int sign;
bigint() : sign(1) {}
bigint(long long v) { *this = v; }
bigint(const string &s) { read(s); }
void operator=(const bigint &v) {
sign = v.sign;
a = v.a;
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int x[111111];
int y[111111];
int main() {
int i, n, m, t;
long long xx = 0, yy = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &t);
x[t] = i;
y[t] = n - i + 1;
}
scanf("%d", &m);
for (i = 1; i <= m; i++) {
scanf("%d", &t);
xx ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m;
int a[200];
int b[200];
while (~scanf("%d%d", &n, &k)) {
m = n;
for (int i = 0; i < k; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
b[i] = i + 1;
}
int lea[200];
int res[200];
lea[0]... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 4e5 + 10;
struct Segment_Tree {
int n, ql, qr;
int mn[MAX << 2], tag[MAX << 2], cnt[MAX << 2], tag2[MAX << 2], qv;
long long ans[MAX << 2];
void pushup(int id) {
mn[id] = min(mn[(id << 1)], mn[(id << 1 | 1)]);
cnt[id] = 0;
if (mn[(id << 1... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.