solution stringlengths 52 181k | difficulty int64 0 6 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t, n, x, y;
cin >> t;
while (t--) {
cin >> n;
vector<long long> v(n + 1, 0);
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
v[a]... | 3 |
#include "bits/stdc++.h"
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000... | 0 |
#include <iostream>
#include <vector>
using namespace std;
string match(const vector<string> v){
const string PTN[7][4]{
{"11","11"},
{"1","1","1","1"},
{"1111"},
{"01","11","10"},
{"110","011"},
{"10","11","01"},
{"011","110"}
};
const int PTN_H[7]{2,4,1,3,2,3,2};
const string PTN_NAME[7]={"A","B","C... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int dp[400][2];
memset(dp, 0, sizeof(dp));
string s;
int l, r, i, j, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s >> l >> r;
if (s[0] == 'M') {
dp[l][0] += 1;
dp[r + 1][0] -= 1;
} else {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int n, m, t, ans;
int a[105];
int main() {
cin >> t;
while (t--) {
cin >> n;
int maxx = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
maxx = max(maxx, a[i]);
}
int temp;
bool flag = true;
for (int i = 1; i <= n; i++) {
temp... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
long long ans = 0;
long long n = s.size();
ans = n * (n - 1) / 2 + 1;
map<char,int>mp;
for(int i = 0; i < n; ++i){
ans -= mp[s[i]]++;
}
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int maxn = 1e6 + 10, maxm = 2e6 + 10;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double PI = acos(-1.0);
in... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, k;
char s[N];
int chk(char s[]) {
for (int i = 1; i <= n; i += k) {
for (int j = 1; j <= k; j++) {
if (i + j - 1 > n || i + j - 1 + k > n) break;
if (s[i + j - 1] != s[i + j - 1 + k]) {
if (s[i + j - 1] > s[i + j - 1 ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int n, m;
int val[maxn], dp[maxn], ra[maxn], ind[maxn];
vector<int> G[maxn];
vector<pair<int, int> > egs;
int fa[maxn];
int find(int x) { return fa[x] = fa[x] == x ? x : find(fa[x]); }
bool cmp(int a, int b) { return val[a] < val[b]; }
void init()... | 3 |
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const long long mod = 998244353;
long long N, M, A, B[200009];
long long modpow(long long a, long long b, long long m) {
long long p = 1, q = a;
for (int i = 0; i < 31; i++) {
if ((b / (1LL << i)) % 2 == 1) {
p *= q;
p %= ... | 5 |
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<long double, long double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using p... | 3 |
#include <bits/stdc++.h>
const long long MAX_N = 1e5 + 10;
const long long MOD = 1e9 + 9;
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
if (x > y) return cout << n, 0;
int ans = 0;
for (int i = 1; i <= n; ++i) {
int a;
cin >> a;
ans += (a <= x);
}
cout << ceil(ans / (doubl... | 3 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
string S; cin >> S;
int T = S.size();
for(int k = 0; k < S.size() - 1; k++) {
if(S[k] != S[k+1]) T = min(T, max(k+1, (int)S.size()-k-1));
}
cout << T << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, m, num = 0, a[100];
int main() {
cin >> n;
for (i = n - 81; i < n + 1; ++i) {
if (i <= 0) continue;
int x = i, summ = 0;
while (x > 0) {
summ += x % 10;
x /= 10;
}
if (i + summ == n) {
a[num++] = i;
}
}
if (n... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v[100002];
const int h_num = 9;
long long int B[h_num] = {1011235817, 1011235817, 1011235817,
987654347, 1011235817, 1021328611,
987654347, 1011235817, 1000000007};
struct HASH {
vector<long long int... | 4 |
#include <bits/stdc++.h>
using namespace std;
string s;
int a[1000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
cin >> s;
a[0] = s[0] - '0';
for (int i = 1; i < n; i++) {
a[i] = a[i - 1] + s[i] - '0';
}
bool checkze = true;
for (int i = 0; i < n; i++) {
if (a[i] !... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
cin >> T;
for (int z = 0; z < T; z++) {
int a[3];
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a, a + 3);
cout << a[2] << "\n";
}
}
| 1 |
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | 0 |
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int main() {
cin >> s;
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '0')
n++;
else {
if (n > 0)
n--;
else
s[i] = '0';
}
}
cout << s;
return 0;
}
| 4 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 200;
for (char i = 'a'; i <= 'z'; i++) {
int t = -1, cnt = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == i) {
t = max(t, cnt);
cnt... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 80 + 5;
int n, m, l[N], r[N], cx[N * 2], gods, who[N];
double pl[N], pr[N], pm[N], sv[N][N][N], ans[N][N];
void add_ans(double *row, int l, int r, double w) {
row[l] += w, row[r + 1] -= w;
}
void trans(double dp[N][N], int d) {
for (int i = n - 1; i >= 0; ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int par[2005], sz[2005];
int findRoot(int u) {
if (u == 0) return 0;
int r = u;
while (par[r] != r) {
r = par[r];
}
while (par[u] != r) {
int y = par[u];
par[u] = r;
u = y;
}
return r;
}
void unionNum(int u, int v) {
u = findRoot(u), v = find... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
const int lg = 19;
const int maxm = 1e7 + 100;
const int mod = 1e9 + 7;
const int inf = 1e9;
int n, m, d[maxn], a[maxn], par[lg][maxn], p[maxm], cnt[maxm];
long long ans[maxn];
vector<int> g[maxn];
vector<pair<int, int> > q[maxn], vec[maxn];
void... | 5 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int BobEven(int n, int *A) {
int M = n / 2;
int res = INT_MAX;
for(int i = 1; i <= M; i++)
res = min(res, A[M+i]-A[i]);
return res;
}
int AliceOdd(int n, int *A) {
int M = n / 2;
for(int i = M + 1; i < n; i++) A[i] ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, m;
int a[300005], b[300005], d[300005], cnt[300005];
vector<int> ve[300005];
void topsort(int a[], int b[]) {
for (int i = 0; i < n; i++) ve[i].clear();
for (int i = 0; i < m; i++) {
ve[a[i]].push_back(b[i]);
d[b[i]]++;
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
cin >> s2;
int i, j;
for (i = 0; i < s1.length(); i++) {
s1[i] = tolower(s1[i]);
}
for (j = 0; j < s2.length(); j++) {
s2[j] = tolower(s2[j]);
}
if (s1 < s2) {
cout << "-1";
} else if (s1 == s2) {
co... | 1 |
#include <bits/stdc++.h>
using namespace std;
pair<char, char> a[222222];
int main() {
int n, q;
string s;
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
char t, d;
scanf(" %c %c", &t, &d);
a[i] = { t,d };
}
int l = 0, r = n + 1;
while (l + 1 < r) {
int m = (l + r) / 2, k = m;
for (int i = 0; i < ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
int n;
cin >> q;
for (int in = 0; in < q; in++) {
cin >> n;
int nn = n;
vector<int> v;
int cnt = 0;
while (nn) {
nn /= 2;
cnt++;
}
if (n < (1 << cnt) - 1) {
cout << (1 << cnt) - 1 << "\n";
conti... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n;
cin >> n;
vector<long long int> a(n + 1);
vector<vector<long long int>> dp(n + 1, vector<long long int>(2));
for (long long int i = 0; i < n; i++) cin >> a[i];
for (lo... | 3 |
#include <bits/stdc++.h>
using namespace std;
void in(long long *a, long long n) {
for (long long i = 1; i < n + 1; i++) {
cin >> a[i];
}
}
void out(long long *a, long long n) {
for (long long i = 0; i < n; i++) {
cout << a[i] << " ";
}
}
void out(vector<long long> v) {
for (long long i = 0; i < (long... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = 0;
int H = N;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
L = max(L, a);
H = min(H, b);
}
cout << max(H - L + 1, 0) << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1500;
double dp[N][N], mp[N][N];
int n, m;
void gauss() {
for (int i = 1; i <= m; i++) {
double t = dp[i + 1][i] / dp[i][i];
int d[3] = {i, i + 1, m + 1};
for (int j = 0; j < 3; j++) dp[i + 1][d[j]] -= t * dp[i][d[j]];
dp[i + 1][i] = 0;
}
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int t, n, m, a[1000005] = {0}, d[1000005], b[1000005];
stack<long long int> s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int i, j, k, x, y;
cin >> n >> m;
for (i = 1; i <= n; ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
scanf("%d", &test);
while (test--) {
long long x, y, k;
cin >> x >> y >> k;
long long sticks = k * y + k;
long long ret = (sticks - 1) / (x - 1) + k;
if ((sticks - 1) % (x - 1)) ret++;
printf("%lld\n", ret);
}
return ... | 1 |
#include <bits/stdc++.h>
using namespace std;
namespace yspm {
inline long long read() {
long long res = 0, f = 1;
char k;
while (!isdigit(k = getchar()))
if (k == '-') f = -1;
while (isdigit(k)) res = res * 10 + k - '0', k = getchar();
return res * f;
}
const long long N = 2e5 + 10;
long long a[N], val[N... | 4 |
#include <bits/stdc++.h>
long long n;
std::string ans;
std::map<long long, std::string> mp;
std::string toString(long long x) {
if (!x) {
return "0";
}
std::string res;
while (x) {
res += x % 10 ^ '0';
x /= 10;
}
std::reverse(res.begin(), res.end());
return res;
}
void update(std::string &ans,... | 6 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#inclu... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
const int M = 110;
long long dp[N][M][2], n, m, k, cnt[N], rest[10][N];
void init() {
cnt[0] = 1;
for (int i = 1; i <= n; ++i) {
cnt[i] = cnt[i - 1] * 10 % m;
}
for (int j = 1; j <= n; ++j) {
for (int i = 1; i < 10; ++i) {
if (j == ... | 4 |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false);
ll n, a, b;
cin >> n >> a >> b;
if(n == 1){
if(a == 1 && b == 1){
cout << 1 << endl;
}else{
cout << -1 << endl;
}
return 0;
}
if(a +... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int ans(string s, char a, long long int n) {
if (n == 0) return 0;
if (n == 1 && s[0] == a) {
return 0;
}
if (n == 1 && s[0] != a) {
return 1;
}
long long int x = 0, y = 0;
for (long long int i = 0; i < n / 2; i++) {
if (s[i] != a) x++;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 25e2 + 1, NN = N * N;
pair<int, int> D[NN];
int A[N][N], n, nn, t;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
return (A[a.first][a.second] > A[b.first][b.second]);
}
bitset<N> B[N];
void SIK() {
printf("NOT MAGIC");
exit(0);
}
int main(... | 6 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
scanf("%d", &n);
char m[50], a[50];
scanf("%s", &a);
for (int i = 0; i < n; i++) {
m[i] = a[i];
}
sort(&m[0], &m[n]);
int cnt = 0;
for (int i = 0; i < n; i++) {
if (m[i] != a[i]) {
cnt++;
}
}
printf("%d\n", cnt);... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long powi(long long base, int p) {
long long res = 1;
while (p--) res *= base;
return res;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
bool is_vowel(char c) {
c = tolower(c);
return c == 'a' || c == 'e' || c == 'o' || c ==... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin>>n>>m;
vector<bool> flag(n,false);
for(int i = 0; i < m; i++){
int a, b;
cin>>a>>b;
flag[a-1] = !flag[a-1];
flag[b-1] = !flag[b-1];
}
bool ans = true;
for(int i=0; i<n; i++){
ans &= !flag[i];
}
cout << (ans ? "... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long MOD = 998244353;
int inf = 1000001000;
long long INF = 5e18;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
bool t = true;
if (abs(a - c) % e != 0) t = false;
if (abs(b - d) % f != 0) t = false;
if ((a... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 10000000000LL;
long long ara[305], bara[305], dp[305][515], pri[305][305];
vector<long long> vec[305];
long long n, f;
long long cnt(long long pos, long long mask) {
if (pos == n + 1) return mask ? inf : 0;
if (dp[pos][mask] != -1) return dp[pos][m... | 4 |
#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 <bits/stdc++.h>
using namespace std;
long long dx[] = {1, -1, 0, 0};
long long dy[] = {0, 0, 1, -1};
const int sz = 200005, mod = 1e9 + 9;
long long t, n, m, ans = mod;
long long Power(long long a, long long b) {
if (a == 0) return 0;
if (b == 0) return 1;
long long ans = Power((a * a) % mod, b / 2);
i... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct Seg_T {
int n;
pair<int, int> dat[8 * 100010];
void init(int _n) {
for (n = 1; n < _n; n *= 2)
;
for (int i = 1; i < 4 * n; i++) dat[i] = make_pair(-1000000000, -1);
}
void ins(int p, pair<int, int> v) {
p += n + 1;
for (; p >= 1 && v ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<vector<char>> a(n + 2, vector<char>(m + 2));
for (int i = 1; i <= n; i++) {
scanf("%s", &a[i][1]);
for (int j = 1; j <= m; j++)
if (a[i][j] == '.')
a[i][j] -= '.';
else
a[i][j] ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 3e6;
int n, m, ma;
long long cnt[N], sum[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
cnt[m]++;
ma = max(ma, m);
}
for (int i = 1; i <= ma; i++)
f... | 6 |
#include <bits/stdc++.h>
#define REP(i, n) for ( int i = 0; i < (n); i++ )
long long a[100][100], b[100][100], c[100][100];
int main() {
int n, m, l;
std::cin >> n >> m >> l;
REP(i, n) REP(j, m) std::cin >> a[i][j];
REP(j, m) REP(k, l) std::cin >> b[j][k];
REP(i, n) REP(j, m) REP(k, l) c[i][k... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, l;
int a[10];
long long t;
int num[1000001];
inline int d(long long o) {
long long u = 0;
if (o < 10) {
return o;
}
while (o > 0) {
u += o % 10;
o = o / 10;
}
if (num[u] > 0) {
return num[u];
} else {
return d(u);
}
}
l... | 3 |
#include<bits/stdc++.h>
#define il inline
#define vd void
#define mod 1000000007
typedef long long ll;
il int gi(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){
if(ch=='-')f=-1;
ch=getchar();
}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x*f;
}
int a[200010],b[200010];
int p[8010],inv[8010],p... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,nr,m=0,s=0;
cin>>n;
while(n--)
{
cin>>nr;
m=max(m,nr);
s+=nr;
}
if(m<s-m)
cout<<"Yes";
else
cout<<"No";
return 0;
}
| 0 |
// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c;
while(c=getchar(),c!='0'){
int t=c-'0';
while(c=getchar(),c!='\n') t+=c-'0';
cout<<t<<endl;
}
}
| 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int A=-1,B=-1;
bool f = false;
while(cin>>A>>B, A||B){
if(f) puts("");
bool no = true;
for(int i=A;i<=B;i++){
if(i%4==0 && (i%100!=0 || i%400==0)) printf("%d\n",i), no = false;
}
if(no) ... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int dpTable[1400][1400];
int main() {
int h, w;
int t;
cin >> h >> w;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
cin >> t;
dpTable[i][j] = (t == 1 ? 0 : 1);
}
}
int m = 0;
if (h == 1) {
for (int j = 0; j < w; ++j) {
i... | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const int INF=~0u>>2;
int n,m,sum[1<<15],dp[1<<15][15],G[15][15];
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(c... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool able[1024][1024];
int dp[1024];
int main()
{
int n;
int c[1024], w[1024];
int r[1024];
scanf("%d", &n);
memset(r, 0, sizeof(r));
for (int i = 0; i < n; i++){
scanf("%d %d", c + i, w + i);
if (i) r[i] = r[i - 1] + w[i]... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int DIM = 100005;
struct str1 {
int x, y, c, id;
} edl[DIM];
struct str2 {
int y, id;
};
long long ans[DIM];
int fth[DIM], szt[DIM];
vector<str2> edg[DIM];
set<int> unq;
bitset<DIM> oki;
inline bool cmp(str1 s1, str1 s2) { return s1.c < s2.c; }
int getroot(int x) ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807;
const long long int mod = 1000000007;
int MOD(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
long long int max3(long long int a, long long int b, long long int c) {
return max(c, max(a, b));
}
long ... | 6 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
long a[n],sum = 0;
for(long i = 0;i < n;i++){
cin >> a[i];
}
long kekka = 0;
for(long i = 0;i < n;i++){
sum += a[i];
if(i % 2 == 0 && sum >= 0){
kekka += sum + 1;
sum = -1;
}
if(i % 2 == 1 && sum <=... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807;
const long long MOD = 1000000007;
long long power(long long a, long long b, long long z = MOD) {
long long res = 1;
a = (a % z);
while (b) {
if (b & 1) res = (res * a) % z;
a = (a * a) % z;
b = b >> 1;
}
retur... | 6 |
#include <bits/stdc++.h>
using namespace std;
double getDist(double x1, double y1, double x2, double y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double maxV, t;
cin >> maxV >> t;
double v1, v2, w1, w2;
cin >> v1 >> v2 >> w1 >> w2... | 4 |
#include<stdio.h>
int main(void){
int n;
scanf("%d",&n);
long long ans=0,now=0;
for (int i=1;i<=n;i++){
int a;
scanf("%d",&a);
if (a) now+=a;
else ans+=now/2,now=0;
}
ans+=now/2;
printf("%lld",ans);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
if (s[i] == ' ') s.erase(i, 1);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == ' ') s.erase(i, 1);
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == ' ') s.erase(i... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
const int maxm = 200;
int a[maxn + 5], b[maxn + 5], n, k;
int cnt[maxm + 5];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= k; ++i) scanf("%d", &b[i]);
for (int i = 1; i <= n; ++i) cnt... | 1 |
#include <bits/stdc++.h>
const int maxn = 1e6 + 9, mod = 998244353, inf = 0x3f3f3f3f;
int Read() {
int x(0), f(1);
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3ll) + (x << 1ll) + c - '0';
c = getchar();
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, l, t, n;
string s, s1, s2;
cin >> t;
while (t--) {
cin >> l;
cin >> s;
s1 = "";
s2 = "";
k = 0;
for (i = 0; i < l; i++) {
if (s[i] == '2') {
if (k == 0) {
s1 += '1';
s2 += ... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 505;
bool dp[MAXN][MAXN][2][4];
int isok[MAXN][MAXN][251];
char s[MAXN][MAXN];
int n, m, q, state, l1, r1, l2, r2;
int getsum(int l1, int r1, int l2, int r2, int st) {
return isok[r1][r2][st] - isok[r1][l2 - 1][st] - isok[l1 - 1][r2][st] +
isok[l... | 5 |
#include <bits/stdc++.h>
using namespace std;
void work() {
int n;
string s;
cin >> n >> s;
int i = 0;
while (n > 10) {
if (s[i] == '8') {
cout << "YES" << endl;
return;
}
n--;
i++;
}
cout << "NO" << endl;
return;
}
int main() {
int n;
cin >> n;
while (n--) {
work()... | 1 |
#include <iostream>
int main() {
int r, c, a[100] = { 0 }, s = 0;
std::cin >> r >> c;
for (int i = 0; i < r; ++i, s = 0) {
for (int j = 0, n; j < c; ++j) {
std::cin >> n;
std::cout << n << ' ';
a[j] += n;
s += n;
}
std::cout << s << std... | 0 |
#include<iostream>
#include<cstdio>
#define N (100000+1000)
using namespace std;
int n,k,a[N];
int main()
{
scanf("%d%d",&n,&k);
for (int i=1; i<=n; ++i)
scanf("%d",&a[i]);
for (int i=1; i<=n-1; ++i)
if (a[i]+a[i+1]>=k)
{
puts("Possible");
for (int j=1; j<=i-1; ++j) printf("%d\n",j);
for (int j=n-1;... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000007;
int n;
queue<pair<int, int> > s[251000 * 3 + 5];
bool is[251000 * 4];
struct node {
int m, p;
long long r, d;
} b[251000];
bool flag;
int P, X, Y;
long long R;
long long c[251000], tot;
int head, tail;
pair<int, int> q[251000];
int ans;
void ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int shape[2][2];
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) scanf("%d", &shape[i][j]);
int tag = 0;
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) {
if (shape[0][i] + shape[1][j] <= ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n = 0;
cin >> n;
char input, before = '.';
int start = 0, end = 0, lastfoot = 0;
bool foundFirstR = false, foundfirstL = false;
for (int i = 1; i <= n; i++) {
cin >> input;
if ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> adj[5013];
int s[5013];
int can[5013][5013];
void solve(int x, int p = 0) {
s[x] = (adj[x].size() == 1);
for (int i = 0; i <= n; i++) can[x][i] = 1e9;
can[x][0] = 0;
for (int k = 0; k < adj[x].size(); k++) {
int i = adj[x][k];
if (i != p) ... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long int pref[100005];
long long int suf[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a, b;
long long int lena, i, j, lenb, k, maxlen, maxleni, maxlenj;
cin >> a >> b;
lena = a.length();
lenb = b.length();
pref[0] = 0;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool prime[1000000];
vector<int> vec;
void IsPrime() {
prime[0] = prime[1] = 0;
prime[2] = 1;
for (int i = 3; i < 1000000; i++) prime[i] = i % 2 == 0 ? 0 : 1;
int t = (int)sqrt(1000000 * 1.0);
for (int i = 3; i <= t; i++)
if (prime[i])
for (int j = i * i... | 3 |
#include <bits/stdc++.h>
using namespace std;
struct st {
int m1, m2, m3, m4, m5, s;
friend st operator+(st& x, st& y) {
st r;
r.m1 = max(x.m1, x.s + y.m1);
r.m2 = max(x.m2, y.m2 - x.s * 2);
r.m3 = max({x.m3, y.m3 - x.s, x.m1 + y.m2 - x.s * 2});
r.m4 = max({x.m4, y.m4 - x.s, x.m2 + y.m1 + x.s});... | 3 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
int n; cin >> n;
int a = 0, un = 0;
bool b = true;
for (int i = 0; i < n; i++){
string str;
cin >> str;
if (str == "A")a++;
else if (str == "Un")un++;
if (a < un)b = false;
}
if (a > un)b = false;
if (b)cout << "YES"... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = (c & 15);
while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
x = v * f;
}
inline void read(lo... | 6 |
#include <bits/stdc++.h>
using namespace std;
char c[2000010], s[2000010];
int main() {
ios_base::sync_with_stdio(0);
int n, gd = 0, rd = 0, rp = 0, gp = 0, w = 0, sw = 0, cw = 0;
cin >> n;
n *= 2;
cin >> s >> c;
for (int i = 0; i < n; i++) {
if (s[i] == '1' && c[i] == '1')
w++;
else {
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int dp[2000][2000], a[600], flag[600];
int main() {
int n, w, sum = 0;
scanf("%d%d", &n, &w);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
dp[0][0] = 1;
for (int i = 0; i <= n; i++) {
for (int j = w; j >= 0; j--) {
for (int k = w; k >= 0; k--) {
... | 5 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max()/2;
const int MOD = 1e9+7;
struct UF {
vector<int> data;
UF(int size) : data(size, -1) { }
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x !... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m, tg[1010000];
vector<int> G[1010000], ans1, ans2;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1, u, v; i <= m; ++i) {
scanf("%d%d", &u, &v);
G[u].push_back(v);
}
for (int i = 1; i <= n; ++i)
if (tg[i] != 1) {
ans1.push_back(i);
... | 3 |
#include <bits/stdc++.h>
long long k, r, n[40];
long long inv[40];
const long long mod = 1000000007;
long long pow(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1) ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
long long C(long long y, long long x) {
if (y < 0 ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, m, i, j;
cin >> n >> m;
cin >> a >> b;
i = max(a, b);
j = min(a, b);
n--;
while (n--) {
cin >> a >> b;
j = max(j, min(a, b));
i = min(i, max(a, b));
}
if (m >= j && m <= i)
cout << "0";
else if (j <= i)
cout ... | 2 |
#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
struct bimatch{
int n;
vector<vector<int> >G;
vector<int>match;
vector<bool>used;
bimatch(int _n=0):n(_n),G(n),match(n),used(n){}
void add_edge(int u,int v)
{
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v)
{
used[v]=tr... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
for(;cin>>n,n;)
{
int sum=0;
for(int i=0;i<n;i++)
{
int x,y,h,w;
cin>>x>>y>>h>>w;
int size=x+y+h;
if(size<61&&w<3)
sum+=600;
else if(size<81&&w<6)
sum+=800;
else if(size<101&&w<11)
sum+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int m;
string a, r;
int fwd[1025], bck[1025];
string w[105];
int pwr[1025];
void eval(string &word, string &arr, int res[]) {
int size = 1;
int hash1 = arr[0] - 'A' + 1;
int shash1 = word[0] - 'A' + 1;
for (int i = 1; i <= arr.size(); i++) {
if (hash1 == shash1)... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = (1e6 + 10);
const int mod = (1e9 + 7);
const int inf = (1e9 + 7);
vector<int> g[N];
vector<pair<int, pair<int, int> > > ans;
bool vis[N], used[N];
int h[N], par[N];
void dfs(int v, int pr, int d) {
vis[v] = 1;
h[v] = d;
par[v] = pr;
for (auto to : g[v]... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char c[200001];
c[0] = s[0];
int w = 0;
for (int i = 1; i < s.length(); i++) {
if (w >= 0 && c[w] != s[i]) {
c[++w] = s[i];
} else {
if (w < 0) {
w = 0;
c[0] = s[i];
} else
w--;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int fun(long long k) {
if (k == 0 || k == 1) return 0;
if (k == 2 || k == 3) return 1;
int a[100], le = 0, ans, tg = 0;
while (k != 0) {
a[le++] = k % 2;
k /= 2;
}
ans = (le - 1) * (le - 2) / 2;
for (int i = 0; i < le; i++)
if (!a[i]) tg++;
if (t... | 2 |
#include <bits/stdc++.h>
using namespace std;
int BASE;
string s;
int N;
long long dp[100][33];
int digs[100];
long long go(int, int);
int main() {
scanf("%d", &BASE);
cin >> s;
for (int i = 0; i < s.length(); i++) {
digs[i] = (s[i] - '0');
}
N = s.length();
for (int i = 0; i <= N; i++) {
fill(dp[i]... | 4 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
int main() {
string s;
cin >> s;
int z = 0;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' ||
(c - 48 < 10 && (c - 48) % 2 != 0)) {
z++... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.