buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 999999999
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < int(n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 999999999
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < int(n... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 181 | 7 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | [["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["+", 51, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 368 | 5 |
#include <bits/stdc++.h>
#define MOD 100000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int rz, wz, c, r;
while (1) {
scanf("%d%d%d%d", &rz, &wz, &c, &r);
if (rz == 0 && wz == 0)
break;
int rest = wz * c - rz;
rest = (rest + r - 1) / r;
prin... | #include <bits/stdc++.h>
#define MOD 100000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int rz, wz, c, r;
while (1) {
scanf("%d%d%d%d", &rz, &wz, &c, &r);
if (rz == 0 && wz == 0)
break;
int rest = wz * c - rz;
rest = (rest + r - 1) / r;
prin... | [["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 21], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 1 | 110 | 5 |
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 580 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B);... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B);... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 106 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, type... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, type... | [["+", 0, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 21], ["+", 12, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 169 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [["-", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 341, 342, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 341, 342, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 69, 341, 342, 0, 69, 341, 342, 0, 22], ["+", 0, 69, 341, 342, 0, 69, 341, 342, 0, 22], ["-", 31, 69, 341, 342, 0, 69... | 1 | 547 | 12 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 523 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, a, n) for (int i = a; i < n; i++)
main() {
int c1 = 0, c2 = 0, c3 = 0;
string s, t, p1, p2;
cin >> s >> t;
r(i, s.size()) if (i % 2) p1 += s[i];
else p2 += s[i];
r(j, p1.size()) {
int c = 0;
R(i, c... | #include <bits/stdc++.h>
using namespace std;
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, a, n) for (int i = a; i < n; i++)
main() {
int c1 = 0, c2 = 0, c3 = 0;
string s, t, p1, p2;
cin >> s >> t;
r(i, s.size()) if (i % 2) p1 += s[i];
else p2 += s[i];
r(j, p1.size()) {
int c = 0;
R(i, c... | [["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22]] | 1 | 249 | 2 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
string h, q;
int n, x, ans = 0, used[10], w, y;
void dfs(int d, string l) {
if (l == h)
return;
if (d == h.size()) {
int p, pp;
stringstream ss(l);
ss >> p;
pp = min(abs(n - p), (int)pow(10, w) - abs(n - p));
if (pp >= ans) ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
string h, q;
int n, x, ans = 0, used[10], w, y;
void dfs(int d, string l) {
if (l == h)
return;
if (d == h.size()) {
int p, pp;
stringstream ss(l);
ss >> p;
pp = min(abs(n - p), (int)pow(10, w) - abs(n - p));
if (pp > ans) {... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 300 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
// in
cin >> n;
pair<int, int> b;
vector<pair<char, int>> a(n, pair<char, int>(0, 0));
vector<pair<int, int>> y;
vector<bool> del(n, 0);
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first >>... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
// in
cin >> n;
pair<int, int> b;
vector<pair<char, int>> a(n, pair<char, int>(0, 0));
vector<pair<int, int>> y;
vector<bool> del(n, 0);
int c = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first >>... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 20]] | 1 | 344 | 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n >> s;
int p = 0, q = 0;
while (p < n && s[p] == '>')
p++;
while (q < n && s[n - q - 1] == '<')
q++;
cout << n - min(p, q) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n >> s;
int p = 0, q = 0;
while (p < n && s[p] == '<')
p++;
while (q < n && s[n - q - 1] == '>')
q++;
cout << n - min(p, q) << endl;
return 0;
} | [["-", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125], ["+", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125]] | 1 | 89 | 4 |
#include <iostream>
#include <string>
using namespace std;
string S;
int n;
int main() {
cin >> n >> S;
int cnt = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S[i] == '<' && S[S.size() - 1 - i] == '>')
cnt++;
}
cout << n - cnt << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
string S;
int n;
int main() {
cin >> n >> S;
int cnt = 0;
for (int i = 0; i < S.size() / 2; i++) {
if (S[i] == '<' && S[S.size() - 1 - i] == '>')
cnt++;
else
break;
}
cout << n - cnt << endl;
return 0;
} | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 75, 76, 0, 93, 0, 35]] | 1 | 95 | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double times[] = {-1, -1}, dis[] = {-1, -1};
vector<double> f(n), a(n), x(n), y(n);
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> f[i] >> a[i] >> t[i] >> x[i] >> y[i];
}
bool flag[] = {true, true};
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double times[] = {-1, -1}, dis[] = {-1, -1};
vector<double> f(n), a(n), x(n), y(n);
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> f[i] >> a[i] >> t[i] >> x[i] >> y[i];
}
bool flag[] = {true, true};
for (int i =... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 35], ["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 0, 24], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 8, 9, 0, 57,... | 1 | 441 | 8 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<double, double> P;
int main() {
int N;
P ansA = P(-1, -1), ansB = P(-1, -1);
int F, A, T, X, Y;
int f, a, t, x, y;
cin >> N >> F >> A >> T >> X >> Y;
for (int i = 1; i < N; i++) {
cin >> f >> a >> t >> x >> y;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<double, double> P;
int main() {
int N;
P ansA = P(-1, -1), ansB = P(-1, -1);
int F, A, T, X, Y;
int f, a, t, x, y;
cin >> N >> F >> A >> T >> X >> Y;
for (int i = 1; i < N; i++) {
cin >> f >> a >> t >> x >> y;
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 276 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#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_pai... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#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_pai... | [["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 13]] | 1 | 390 | 2 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 500000
int n;
long double f[MAX_N];
int a[MAX_N], t[MAX_N];
long double x[MAX_N], y[MAX_N];
vector<pair<long double, long double>> pass;
vector<pair<long double, long double>> pass2;
int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 500000
int n;
long double f[MAX_N];
int a[MAX_N], t[MAX_N];
long double x[MAX_N], y[MAX_N];
vector<pair<long double, long double>> pass;
vector<pair<long double, long double>> pass2;
int... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 544 | 2 |
// aoj - - A / 2016-03-06
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,... | // aoj - - A / 2016-03-06
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,... | [["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 609 | 2 |
#include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int upperBound(int data[], int n, int key) {
int l = 0, r = n - 1;
while (l <= r) {
int m = (l + r) / 2;
if (data[m] > key)
r = m - 1;
else
l = m + 1;
}
return l;
}
in... | #include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int upperBound(int data[], int n, int key) {
int l = 0, r = n - 1;
while (l <= r) {
int m = (l + r) / 2;
if (data[m] > key)
r = m - 1;
else
l = m + 1;
}
return l;
}
in... | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 64, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 41, 75, 5, 0, 6]] | 0 | 329 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, b[300000];
long long Counter[1000001] = {}, c[300000];
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
Counter[a] += a;
}
for (int i = 1; i < 1000001; i++) {
Counter[i] += Counter[i - 1];
}
cin >> M;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, b[300000];
static long long Counter[1000001] = {};
long long c[300000];
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
Counter[a] += a;
}
for (int i = 1; i < 1000001; i++) {
Counter[i] += Counter[i - 1];
}
... | [["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96]] | 1 | 197 | 5 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int INF = 1e+9;
typedef long long ll;
int main() {
int n, m, a[300010] = {0}, b[300010] = {0};
ll sum[300010] = {0}, c[300010] = {0};
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a, a + n);
a[n] = INF;
for (int... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int INF = 1e+9;
typedef long long ll;
int main() {
int n, m, a[300010] = {0}, b[300010] = {0};
ll sum[300010] = {0}, c[300010] = {0};
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a, a + n);
a[n] = INF;
for (int... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 314 | 2 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> v... | [["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 22], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13]] | 1 | 410 | 2 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 277 | 4 |
/* attention to overflow */
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define dump(x) cerr << #x << " = " << x << endl
using namespace std;
const int INF = 1 << 25;
void io() {
cin.tie(0);
ios::sy... | /* attention to overflow */
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define dump(x) cerr << #x << " = " << x << endl
using namespace std;
const int INF = 1 << 25;
void io() {
cin.tie(0);
ios::sy... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 310 | 2 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | [["-", 0, 11, 31, 69, 28, 2, 3, 4, 0, 22], ["+", 0, 11, 31, 69, 28, 2, 3, 4, 0, 13]] | 1 | 359 | 2 |
import bisect
N = int(input())
a = sorted(map(int,input().split()))
s = [0]*(N+1)
for i in range(N):
s[i+1] = s[i]+a[i]
s += [10**9]
M = int(input())
b = list(map(int,input().split()))
c = list(map(int,input().split()))
for i in range(M):
p = bisect.bisect(a,b[i])
print("YES" if s[p] >= c[i] else "NO") | import bisect
N = int(input())
a = sorted(map(int,input().split()))
s = [0]*(N+1)
for i in range(N):
s[i+1] = s[i]+a[i]
s += [10**9]
M = int(input())
b = list(map(int,input().split()))
c = list(map(int,input().split()))
for i in range(M):
p = bisect.bisect(a,b[i])
print("Yes" if s[p] >= c[i] else "No") | [["-", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 41, 0, 557, 0, 6]] | 5 | 152 | 4 |
import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(1,n+1):d[i]=d[i-1]+a[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
for i in range(m):
p=bisect.bisect_right(d,b[i])
print(['Yes','No'][d[p]<c[i]]) | import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(1,n+1):d[i]=d[i-1]+a[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
for i in range(m):
p=bisect.bisect_right(a,b[i])
print(['Yes','No'][d[p]<c[i]]) | [["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22]] | 5 | 152 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
void init(int n);
void unite(int x, int y);
int find(int x);
bool same(int x, int y);
int n, m, price[5050];
map<string, int> id;
int par[200010]; // ???
int rnk[200010]; // ??±???
/* Union Find ????????? */
void init(int n) {
for (int i =... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
void init(int n);
void unite(int x, int y);
int find(int x);
bool same(int x, int y);
int n, m, price[5050];
map<string, int> id;
int par[200010]; // ???
int rnk[200010]; // ??±???
/* Union Find ????????? */
void init(int n) {
for (int i =... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 434 | 5 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, Q, x[5007], group[5007];
string s[5007], t1, t2;
vector<int> g[5007];
int key(string str) { return find(s, s + N, str) - s; }
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i] >> x[i], g[i] = {i... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int N, Q, x[5007], group[5007];
string s[5007], t1, t2;
vector<int> g[5007];
int key(string str) { return find(s, s + N, str) - s; }
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> s[i] >> x[i], g[i] = {i... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 298 | 2 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF (1 << 29)
#define ALL(a) (a).begin(), (a).end()
#de... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF (1 << 29)
#define ALL(a) (a).begin(), (a).end()
#de... | [["-", 8, 9, 0, 9, 0, 14, 49, 53, 49, 22], ["+", 8, 9, 0, 9, 0, 14, 49, 53, 49, 22], ["-", 0, 9, 0, 14, 49, 53, 54, 55, 0, 21], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 540 | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl
const int MOD = 1000000007;
int n, l;
int x[5010], a[5010];
int dp[5010][5010];
sig... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl
const int MOD = 1000000007;
int n, l;
int x[5010], a[5010];
int dp[5010][5010];
sig... | [["+", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["-", 12, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 326 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | [["-", 31, 2, 63, 2, 3, 4, 0, 69, 28, 22], ["+", 31, 2, 63, 2, 3, 4, 0, 69, 28, 22]] | 1 | 369 | 2 |
#include <bits/stdc++.h>
#define INF (1 << 28)
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m, e, s, t, r;
cin >> n >> m >> e >> s >> t >> r;
vector<vector<int>> g(n);
lp(i, m) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<... | #include <bits/stdc++.h>
#define INF (1 << 28)
#define lp(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m, e, s, t, r;
cin >> n >> m >> e >> s >> t >> r;
vector<vector<int>> g(n);
lp(i, m) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<... | [["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 758 | 1 |
// G++ MACRO.CPP -STD=C++17
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl... | // G++ MACRO.CPP -STD=C++17
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl... | [["+", 49, 50, 51, 2, 3, 4, 0, 91, 17, 33]] | 1 | 2,214 | 1 |
c, n;
main() {
while ((c = getchar()) != 10)
n += (n & 1) ? (c == 90) : (c == 65);
if (n /= 2) {
while (n--)
printf("AZ");
puts("");
} else
puts(-1);
return 0;
} | c, n;
main() {
while ((c = getchar()) != 10)
n += (n & 1) ? (c == 90) : (c == 65);
if (n /= 2) {
while (n--)
printf("AZ");
puts("");
} else
puts("-1");
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62]] | 0 | 77 | 2 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char str[21];
int i, j;
char output[21] = {'\0'};
int s, t;
s = 0;
t = 0;
scanf("%s", str);
i = strlen(str);
if (i = 1) {
printf("-1\n");
return 0;
}
for (j = 0; j < i; j++) {
if (str[j] == 'A') {
s = 1;
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char str[21];
int i, j;
char output[21] = {'\0'};
int s, t;
s = 0;
t = 0;
scanf("%s", str);
i = strlen(str);
if (i == 1) {
printf("-1\n");
return 0;
}
for (j = 0; j < i; j++) {
if (str[j] == 'A') {
s = 1;
... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 190 | 20 |
#include <stdio.h>
#include <string.h>
int main() {
int len, i, num = 0;
char str[20], stack[20] = {
0,
};
scanf("%s", &str);
len = strlen(str);
for (i = 0; i < len; i++) {
if (num % 2 == 0)
if (str[i] == 'A')
stack[num++] = 'A';
if (num % 2 == 1)
... | #include <stdio.h>
#include <string.h>
int main() {
int len, i, num = 0;
char str[21], stack[21] = {
0,
};
scanf("%s", &str);
len = strlen(str);
for (i = 0; i < len; i++) {
if (num % 2 == 0)
if (str[i] == 'A')
stack[num++] = 'A';
if (num % 2 == 1)
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 64, 1, 0, 11, 31, 69, 71, 27, 28, 22], ["+", 64, 1, 0, 11, 31, 69, 71, 27, 28, 22], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2... | 0 | 169 | 8 |
#include <stdio.h>
#define P(type, x) fprintf(stdout, "%" #type "\n", x)
#define S(type, x) fscanf(stdin, "%" #type, &x)
int main() {
int A, f;
char s[32], *p;
S(s, s);
for (A = f = 1, p = s; *p; p++) {
if (!A && *p == 'A')
A = 1;
else if (A && *p == 'Z')
A = f = 0, printf("AZ");
}
!f ?... | #include <stdio.h>
#define P(type, x) fprintf(stdout, "%" #type "\n", x)
#define S(type, x) fscanf(stdin, "%" #type, &x)
int main() {
int A, f;
char s[32], *p;
S(s, s);
for (A = f = 0, p = s; *p; p++) {
if (!A && *p == 'A')
A = 1;
else if (A && *p == 'Z')
A = 0, f = 1, printf("AZ");
}
f... | [["-", 0, 7, 10, 34, 31, 11, 12, 11, 12, 13], ["+", 0, 7, 10, 34, 31, 11, 12, 11, 12, 13], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 12, 13], ["+", 75, 76, 0, 57, 64, 1, 0, 34, 0, 21], ["-", 64, 1, 0, 34, 31, 11, 12, 11, 12, 13], ["+", 64, 1, 0, 34, 12, 34, 31, 11, 12, 13], ["-", 8, 9, 0, 1, 0, 41, 15, 91, 17, 111]] | 0 | 125 | 7 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
#define F first
#define S second
#define X real()
#define Y imag()
#define PB push_back
#define BE(c) c.begin(), c.end()
using namespace std;
typedef long long LL;
typedef complex<int> cld;
typedef LL ut;
typede... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
#define F first
#define S second
#define X real()
#define Y imag()
#define PB push_back
#define BE(c) c.begin(), c.end()
using namespace std;
typedef long long LL;
typedef complex<int> cld;
typedef LL ut;
typede... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 231 | 4 |
#include <iostream>
using namespace std;
int main() {
while (1) {
double r, w, C, R;
cin >> r >> w >> C >> R;
if (!r && !w && !C && !R)
break;
if (r >= C * w)
cout << 0 << endl;
else {
cout << int((C * w - r) / R + 0.999999999999999) << endl;
}
}
}
| #include <iostream>
using namespace std;
int main() {
while (1) {
double r, w, C, R;
cin >> r >> w >> C >> R;
if (!r && !w && !C && !R)
break;
if (r >= C * w)
cout << 0 << endl;
else {
cout << int((C * w - r) / R + 0.999) << endl;
}
}
}
| [["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 89 | 2 |
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
char c[10][10];
string s;
int w, h, x, a, b, e, d;
while (1) {
cin >> s;
if (s[0] == '#')
break;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
c[i][j] = 'o';
}
}
... | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
char c[11][11];
string s;
int w, h, x, a, b, e, d;
while (1) {
cin >> s;
if (s[0] == '#')
break;
for (int i = 0; i <= 10; i++) {
for (int j = 0; j <= 10; j++) {
c[i][j] = 'o';
}
... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0,... | 1 | 423 | 12 |
//夏合宿の朝は早い
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_V 500
int V;
vector<int> G[MAX_V];
vector<int> rG[MAX_V];
vector<int> vs;
vector<int> vG[MAX_V];
bool used[MAX_V];
int cmp[MAX_V];
void add_edge(int from, int to) {
G[from].push_back(to);
rG[to].push_back(from);
}
... | //夏合宿の朝は早い
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_V 500
int V;
vector<int> G[MAX_V];
vector<int> rG[MAX_V];
vector<int> vs;
vector<int> vG[MAX_V];
bool used[MAX_V];
int cmp[MAX_V];
void add_edge(int from, int to) {
G[from].push_back(to);
rG[to].push_back(from);
}
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45]] | 1 | 667 | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, m, s[15], d[100], dp[101][1 << 15];
void Min(int &a, int b) { a = min(a, b); }
int main() {
int n, m;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> d[i];
sort(d, d + m);
int s... | #include <bits/stdc++.h>
using namespace std;
int n, m, s[15], d[100], dp[101][1 << 15];
void Min(int &a, int b) { a = min(a, b); }
int main() {
int n, m;
while (cin >> n >> m, n) {
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> d[i];
sort(d, d + m);
int s... | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 79], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 60]] | 1 | 407 | 2 |
#include <stdio.h>
int main() {
long long N;
scanf("%lld", &N);
printf("%d\n", 64 - __builtin_clzll(N));
return 0;
} | #include <stdio.h>
int main() {
long long N;
scanf("%lld", &N);
printf("%d\n", N ? 64 - __builtin_clzll(N) : 0);
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 41, 15, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 41, 0, 101], ["+", 0, 1, 0, 2, 3, 4, 0, 41, 0, 102], ["+", 0, 1, 0, 2, 3, 4, 0, 41, 75, 13]] | 0 | 40 | 4 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct vertex {
int X;
int Y;
};
int gcd(int a, int b) {
while (b) {
int m = a % b;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
struct vertex {
int X;
int Y;
};
int gcd(int a, int b) {
while (b) {
int m = a % b;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 247 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
while (n)
res++, n /= 2;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
int res = 0;
while (n)
res++, n /= 2;
cout << res << endl;
return 0;
} | [["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 157], ["+", 36, 36, 0, 30, 0, 134, 39, 86, 0, 96], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 49, 78], ["+", 36, 36, 36, 36, 0, 30, 0, 134, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78]] | 1 | 44 | 7 |
#include <iostream>
using namespace std;
long long n;
int main() {
cin >> n;
for (int i = 0; i < 64; i++) {
if ((1LL << i) >= n) {
cout << i << endl;
return 0;
}
}
} | #include <iostream>
using namespace std;
long long n;
int main() {
cin >> n;
for (int i = 0; i < 64; i++) {
if ((1LL << i) > n) {
cout << i << endl;
return 0;
}
}
} | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 57 | 2 |
#include <cmath>
#include <iostream>
using namespace std;
int main() {
uint64_t n;
cin >> n;
uint64_t num_finger = 1;
if (n != 0) {
num_finger = uint64_t(log2l(n)) + 1;
}
cout << num_finger << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
uint64_t n;
cin >> n;
uint64_t num_finger = 0;
if (n != 0) {
num_finger = uint64_t(log2l(n)) + 1;
}
cout << num_finger << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 55 | 2 |
#include <iostream>
using namespace std;
int main() {
long long a = 0, b;
cin >> b;
if (!b) {
cout << "0" << endl;
return 0;
}
while (b > 1)
a++, b /= 2;
cout << a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long a = 1, b;
cin >> b;
if (!b) {
cout << "0" << endl;
return 0;
}
while (b > 1)
a++, b /= 2;
cout << a << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 64 | 2 |
n = int(input())
print(1 if n == 0 else len(str(bin(n))[2:])) | n = int(input())
print(0 if n == 0 else len(str(bin(n))[2:])) | [["-", 0, 1, 0, 652, 3, 4, 0, 41, 0, 612], ["+", 0, 1, 0, 652, 3, 4, 0, 41, 0, 612]] | 5 | 31 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int N, M;
void print(double a[201][201]) {
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= M; ++j) {
cout << a[i][j] << " ";
}
cout << en... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int N, M;
void print(double a[201][201]) {
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= M; ++j) {
cout << a[i][j] << " ";
}
cout << en... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 31, 22], ["+", 3, 4, 0, 69, 341, 342, 0, 16, 17, 72]] | 1 | 564 | 4 |
#include <iostream>
#include <string>
#define N 100
#define M 100
#define inrange(i, j) ((i) >= 0 && (i) < m && (j) >= 0 && (j) < n)
using namespace std;
int main(void) {
int m, n;
string c;
cin >> m >> n;
bool is[M][N];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
is[i][j] = true;
... | #include <iostream>
#include <string>
#define N 100
#define M 100
#define inrange(i, j) ((i) >= 0 && (i) < m && (j) >= 0 && (j) < n)
using namespace std;
int main(void) {
int m, n;
string c;
cin >> m >> n;
bool is[M][N];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
is[i][j] = true;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 512 | 6 |
#include <iostream>
using namespace std;
int main() {
int N, d, p[1000], count = 0;
cin >> N >> d;
for (int i = 0; i < 1000; i++) {
cin >> p[i];
if (p[i] > d) {
count = count + (p[i] - d);
}
}
if (count == 0) {
cout << "kusoge\n";
} else {
cout << count << "\n";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, d, p[1000], count = 0;
cin >> N >> d;
for (int i = 0; i < N; i++) {
cin >> p[i];
if (p[i] > d) {
count = count + (p[i] - d);
}
}
if (count == 0) {
cout << "kusoge\n";
} else {
cout << count << "\n";
}
return 0;
} | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 108 | 2 |
// g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 405 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int mod3[3];
int main() {
memset(mod3, 0, sizeof(mod3));
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
rep(i, n) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int mod3[3];
int main() {
memset(mod3, 0, sizeof(mod3));
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
rep(i, n) {
... | [["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 13]] | 1 | 389 | 4 |
#include <bits/stdc++.h>
using namespace std;
int a[3];
signed main() {
int b;
cin >> b;
for (int c = 0; c < b; c++) {
int d;
scanf("%d", &d);
a[d % 3]++;
}
if (a[1] == 0 && a[2] == 0) {
puts("0");
return 0;
} else {
int ans = a[0];
int K = min(a[1], a[2]);
ans += K * 2;
... | #include <bits/stdc++.h>
using namespace std;
int a[3];
signed main() {
int b;
cin >> b;
for (int c = 0; c < b; c++) {
int d;
scanf("%d", &d);
a[d % 3]++;
}
if (a[1] == 0 && a[2] == 0) {
puts("1");
return 0;
} else {
int ans = a[0];
int K = min(a[1], a[2]);
ans += K * 2;
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 167 | 2 |
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
int main() {
int N, table[3] = {0, 0, 0}, tmp;
scanf("%d", &N);
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
int main() {
int N, table[3] = {0, 0, 0}, tmp;
scanf("%d", &N);
for (int i = 0; i < ... | [["-", 3, 4, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 13]] | 1 | 432 | 4 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, li[3] = {};
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
li[a % 3]++;
}
if (!(li[1] > 0 || li[2] > 0)) {
cout << 1 << endl;
return 0;
}
int ans = li[0];
if (li[1] == li[2]) {
ans += li[1] * ... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, li[3] = {};
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
li[a % 3]++;
}
if (!(li[1] > 0 || li[2] > 0)) {
cout << 1 << endl;
return 0;
}
int ans = li[0];
if (li[1] == li[2]) {
ans += li[1] * ... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 1 | 220 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define Mset(x, v) memset(x, v, sizeof(x... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define LP(i, n) for (int i = 0; i < n; i++)
#define Mset(x, v) memset(x, v, sizeof(x... | [["+", 31, 16, 12, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 16, 12, 23, 0, 16, 31, 16, 12, 13], ["+", 31, 16, 12, 23, 0, 16, 12, 16, 17, 33], ["+", 31, 16, 12, 23, 0, 16, 12, 16, 12, 13]] | 1 | 391 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 359 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 105
#define ll int
struct edge {
ll to, cap, rev;
edge(ll to, ll cap, ll rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V];
vector<edge> G2[MAX_V];
bool used[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(ll from,... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 28
#define MAX_V 105
#define ll int
struct edge {
ll to, cap, rev;
edge(ll to, ll cap, ll rev) : to(to), cap(cap), rev(rev) {}
};
vector<edge> G[MAX_V];
vector<edge> G2[MAX_V];
bool used[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void add_edge(ll from,... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 85], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 1,134 | 4 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
//#define INF (1LL<<59)
#define MAX_V 100
struct edge {
int to, cap, rev;
};
vector<edg... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
//#define INF (1LL<<59)
#define MAX_V 110
struct edge {
int to, cap, rev;
};
vector<edg... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 931 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IN... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IN... | [["+", 0, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 16, 31, 16, 12, 23, 0, 16, 12, 13], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 195 | 4 |
#include <cstdio>
const int MAX_N = 256;
int N, M;
int a[MAX_N - 1];
int c = 0;
int ans = 0;
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &a[i]);
}
c = N - M;
ans = c / 2;
printf("%d\n", ans);
return 0;
} | #include <cstdio>
const int MAX_N = 256;
int N, M;
int a[MAX_N - 1];
int c = 0;
int ans = 0;
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &a[i]);
}
c = N - M;
ans = c - 1;
printf("%d\n", ans);
return 0;
} | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 104 | 4 |
#include <stdio.h>
int main(void) {
int N, M;
scanf("%d%d", &N, &M);
int ai[M];
if (M == 0)
printf("%d", N - 1);
else
scanf("%d\n", &ai[M]);
if (M == 0)
return 0;
else
printf("%d\n", N - M);
return 0;
} | #include <stdio.h>
int main(void) {
int N, M;
scanf("%d%d", &N, &M);
int ai[M];
if (M == 0)
printf("%d\n", N - 1);
else
scanf("%d\n", &ai[M]);
if (M == 0)
return 0;
else
printf("%d\n", N - M - 1);
return 0;
} | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 90 | 3 |
#include <iostream>
using namespace std;
int main() {
int N, M;
// cout << "?????´???:";
cin >> N;
// cout << "?£??¨????:";
cin >> M;
// cout << "?£??¨???????:?\n";
int a[255];
for (int i = 0; i < M; i++) {
cin >> a[i];
}
cout << N - M << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, M;
// cout << "?????´???:";
cin >> N;
// cout << "?£??¨????:";
cin >> M;
// cout << "?£??¨???????:?\n";
int a[255];
for (int i = 0; i < M; i++) {
cin >> a[i];
}
cout << N - M - 1 << endl;
} | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 65 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << n - m + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
cout << n - m - 1 << endl;
}
| [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 33 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0, a; i < m; i++)
cin >> a;
cout << n - 1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0, a; i < m; i++)
cin >> a;
cout << n - m - 1 << endl;
return 0;
}
| [["+", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33]] | 1 | 54 | 2 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a -= b;
int c;
for (int i = 0; i < b; i++)
cin >> c;
cout << a / 2 << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a -= b;
int c;
for (int i = 0; i < b; i++)
cin >> c;
cout << a - 1 << endl;
}
| [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 58 | 4 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
signed main() {
int n, d;
string s;
cin >> n >> s >> d;
string t = s;
rep(i, 0, s... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
signed main() {
int n, d;
string s;
cin >> n >> s >> d;
string t = s;
rep(i, 0, s... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68]] | 1 | 179 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL... | [["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22]] | 1 | 551 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (int)(e); (i)++)
#define REP(i, e) FOR(i, 0, e)
#define RFOR(i, e, s) for (int(i) = (e)-1; (i) >= (int)(s); (i)--)
#define RREP(i, e) RFOR(i, e, 0)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, e) for (int(i) = (s); (i) < (int)(e); (i)++)
#define REP(i, e) FOR(i, 0, e)
#define RFOR(i, e, s) for (int(i) = (e)-1; (i) >= (int)(s); (i)--)
#define RREP(i, e) RFOR(i, e, 0)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 20]] | 1 | 294 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, m;
string s;
cin >> n >> s;
int a[n], b[n];
for (i = 0; i < n; i++)
b[i] = a[i] = s[i] - '0';
cin >> m;
for (i = 0; i < n; i++) {
if (!m)
break;
if (!a[i]) {
a[i]++;
m--;
}
}
if (m)
for (i = n - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, m;
string s;
cin >> n >> s;
int a[n], b[n];
for (i = 0; i < n; i++)
b[i] = a[i] = s[i] - '0';
cin >> m;
for (i = 0; i < n; i++) {
if (!m)
break;
if (!a[i]) {
a[i]++;
m--;
}
}
if (m)
for (i = n - ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 209 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string num;
cin >> num;
int hum;
cin >> hum;
vector<int> used(N);
int c = 0;
for (int i = 0; i < N && c < hum; i++) {
if (num[i] == '0') {
num[i] = '1';
c++;
used[i] = true;
}
}
int j = N - 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string num;
cin >> num;
int hum;
cin >> hum;
vector<int> used(N);
int c = 0;
for (int i = 0; i < N && c < hum; i++) {
if (num[i] == '0') {
num[i] = '1';
c++;
used[i] = true;
}
}
int j = N - 1;
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 148 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1000000007;
int main(void) {
int n, d;
string x;
cin >> n >> x >> d;
for (int i = 0; i < n; i++) {
if... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1000000007;
int main(void) {
int n, d;
string x;
cin >> n >> x >> d;
string y = x;
for (int i = 0; i < ... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 78], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22], ["+", 15, 339, 51, 16, 12, 16, 31, 69, 28, 22]] | 1 | 170 | 7 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 17, 48], ["+", 0, 7, 8, 57, 15, 339, 51, 16, 17, 98]] | 1 | 362 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
bool arr[2000], changed[2000];
memset(arr, 0, sizeof(arr));
memset(arr, 0, sizeof(changed));
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
char m;
scanf("%c", &m);
if (m == '1')
arr[i] = 1;
}
cin >> x;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
bool arr[2000], changed[2000];
memset(arr, 0, sizeof(arr));
memset(changed, 0, sizeof(changed));
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
char m;
scanf("%c", &m);
if (m == '1')
arr[i] = 1;
}
cin >> x;
for (... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 34, 0, 21], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 28, 22], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 17, 68]] | 1 | 227 | 5 |
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [["+", 64, 9, 0, 1, 0, 11, 12, 103, 0, 104]] | 1 | 371 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define PI 4 * atan(1)
#define INF 1e8
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int N, D;
string X;
cin >> N >> X >> D;
string S = X;
int cnt = 0;
for (int i = 0; i < X.size(); i++) {
if (cnt == D)
break;
if (X[i] == '0... | #include <bits/stdc++.h>
using namespace std;
#define PI 4 * atan(1)
#define INF 1e8
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int N, D;
string X;
cin >> N >> X >> D;
string S = X;
int cnt = 0;
for (int i = 0; i < X.size(); i++) {
if (cnt == D)
break;
if (X[i] == '0... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 196 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, d, a[1000] = {};
string x;
cin >> n >> x >> d;
for (int i = 0; i < n; i++) {
if (d == 0)
break;
if (x[i] == '0') {
x[i] = '1';
d--;
} else
a[i] = 1;
}
if (d) {
for (int i = n - 1; i >=... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, d, a[1000] = {};
string x;
cin >> n >> x >> d;
for (int i = 0; i < n; i++) {
if (d == 0)
break;
if (x[i] == '0') {
x[i] = '1';
d--;
} else
a[i] = 1;
}
if (d) {
for (int i = n - 1; i >=... | [["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 156 | 3 |
#include <stdio.h>
int main(void) {
int n, i, d;
scanf("%d", &n);
char s[n + 20], ans[n + 20];
scanf("%s", s);
scanf("%d", &d);
for (i = 0; i < n && d > 0; ++i) {
ans[i] = '1';
if (s[i] == '0')
--d;
}
if (!d) {
for (; i < n; ++i)
ans[i] = s[i];
ans[n] = 0;
} else {
for... | #include <stdio.h>
int main(void) {
int n, i, d;
scanf("%d", &n);
char s[n + 20], ans[n + 20];
scanf("%s", s);
scanf("%d", &d);
for (i = 0; i < n && d > 0; ++i) {
ans[i] = '1';
if (s[i] == '0')
--d;
}
if (!d) {
for (; i < n; ++i)
ans[i] = s[i];
ans[n] = 0;
} else {
for... | [["+", 8, 9, 0, 57, 64, 1, 0, 34, 0, 21], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 28, 22], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 17, 68]] | 1 | 201 | 3 |
n = int(input())
bits_raw = input()
bits = [int(bits_raw[i]) for i in range(n)]
m = int(input())
ones = []
zeros = []
for i in range(n):
if(bits[i] == 1):
ones.append(i)
else:
zeros.append(i)
if(len(zeros) < m):
for i in range(m):
bits[zeros[i]] = 1
print(''.join(map(str, bits)))... | n = int(input())
bits_raw = input()
bits = [int(bits_raw[i]) for i in range(n)]
m = int(input())
ones = []
zeros = []
for i in range(n):
if(bits[i] == 1):
ones.append(i)
else:
zeros.append(i)
if(len(zeros) > m):
for i in range(m):
bits[zeros[i]] = 1
print(''.join(map(str, bits)))... | [["-", 0, 656, 0, 57, 15, 23, 0, 666, 667, 18], ["+", 0, 656, 0, 57, 15, 23, 0, 666, 667, 47], ["+", 0, 662, 31, 206, 206, 206, 206, 657, 17, 33], ["+", 0, 662, 31, 206, 206, 206, 206, 657, 12, 612]] | 5 | 180 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
string s;
cin >> n >> s;
int a[30] = {};
for (int i = 0; i < n; i += 2) {
++a[s[i] - 'a'];
}
sort(a, a + n);
reverse(a, a + n);
int ans = 0, now = -1, cnt = 0;
for (int i = 0; i < 30;) {
if (a[i] ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
string s;
cin >> n >> s;
int a[30] = {};
for (int i = 0; i < n; i += 2) {
++a[s[i] - 'a'];
}
sort(a, a + 30);
reverse(a, a + 30);
int ans = 0, now = -1, cnt = 0;
for (int i = 0; i < 30;) {
if (a[i... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 57, 64, 1, 0, 34, 12, 27, 28, 22], ["+", 0, 57, 64, 1, 0, 34, 12, 27, 28, 22]] | 1 | 210 | 6 |
#include <bits/stdc++.h>
using namespace std;
int n;
string str;
int t[26];
map<int, int> mp;
int ans = -1;
int main() {
cin >> n >> str;
for (int i = 0; i < n; i++) {
if (str[i] == '+')
continue;
t[(int)(str[i] - 'a')]++;
}
for (int i = 0; i < 26; i++) {
if (t[i] == 0)
continue;
... | #include <bits/stdc++.h>
using namespace std;
int n;
string str;
int t[26];
map<int, int> mp;
int ans = -1;
int main() {
cin >> n >> str;
for (int i = 0; i < n; i++) {
if (str[i] == '+')
continue;
t[(int)(str[i] - 'a')]++;
}
for (int i = 0; i < 26; i++) {
if (t[i] == 0)
continue;
... | [["+", 64, 1, 0, 11, 12, 23, 0, 16, 17, 72], ["+", 64, 1, 0, 11, 12, 23, 0, 16, 12, 13]] | 1 | 215 | 2 |
#include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i != n; i++)
using namespace std;
int main() {
string s;
int N;
cin >> N >> s;
vector<int> counts(30, 0);
rep(i, s.size()) {
if (s[i] != '+... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i != n; i++)
using namespace std;
int main() {
string s;
int N;
cin >> N >> s;
vector<int> counts(30, 0);
rep(i, s.size()) {
if (s[i] != '+... | [["-", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 13]] | 1 | 217 | 2 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 381 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> ls;
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] != '+')
ls[s[i]]++;
}
map<int, int> kind;
for (auto it : ls)
kind[it.second]++;
int sum = (int)kind.size() - 1;
for (auto it : kin... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> ls;
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] != '+')
ls[s[i]]++;
}
map<int, int> kind;
for (auto it : ls)
kind[it.second]++;
int sum = (int)kind.size() - 1;
for (auto it : kin... | [["-", 75, 76, 0, 1, 0, 11, 12, 16, 31, 13], ["+", 75, 76, 0, 1, 0, 11, 12, 16, 31, 13]] | 1 | 183 | 2 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define re... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define re... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 530 | 2 |
#include <bits/stdc++.h>
using namespace std;
int dp[2510][2510];
int dp2[2510][2510];
const int inf = 1000000;
int main() {
int n;
cin >> n;
vector<int> t(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
sum += t[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= sum; j++) {... | #include <bits/stdc++.h>
using namespace std;
int dp[2510][2510];
int dp2[2510][2510];
const int inf = 1000000;
int main() {
int n;
cin >> n;
vector<int> t(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> t[i];
sum += t[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= sum; j++) {... | [["-", 12, 2, 3, 4, 0, 69, 28, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 69, 28, 69, 28, 22]] | 1 | 461 | 6 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(e) (e).begin(), (e).end()
typedef long long ll;
ll n;
vector<ll> tubo28;
void make(ll m, int digit) {
if (m)
tubo28.push_back(m);
if (digit == 5) {
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(e) (e).begin(), (e).end()
typedef long long ll;
ll n;
vector<ll> tubo28;
void make(ll m, int digit) {
if (m)
tubo28.push_back(m);
if (digit == 5) {
... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98]] | 1 | 380 | 4 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c = 0, t, p = 0, a = 0;
string s;
cin >> s;
reverse(s.begin(), s.end());
r(b, 12) if (s[b] == '?') r(i, 10) {
s[b] = '0' + i;
for (int j = 11; j > 0; j--) {
if (j >= 7)
a += (j - 5)... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int c = 0, t, p = 0, a = 0;
string s;
cin >> s;
reverse(s.begin(), s.end());
r(b, 12) if (s[b] == '?') r(i, 10) {
s[b] = '0' + i;
for (int j = 11; j > 0; j--) {
if (j >= 7)
a += (j - 5)... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 225 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 258 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, l, n) for (int i = l; i < n; i++)
#define rer(i, l, n) for (int i = l; i... | [["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 204 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
int max = 0;
for (int i = 2; i < n; i++) {
// i-part?????§??????????????????
if (n % i != 0)
continue;
int c = 0;
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
int max = 0;
for (int i = 1; i < n; i++) {
// i-part?????§??????????????????
if (n % i != 0)
continue;
int c = 0;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 85]] | 1 | 170 | 4 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) ... | [["-", 8, 57, 64, 9, 0, 7, 26, 27, 17, 29], ["+", 8, 57, 64, 9, 0, 7, 26, 11, 17, 107], ["+", 8, 57, 64, 9, 0, 7, 26, 11, 12, 22]] | 1 | 356 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define cost first
#define to second
typedef long long ll;
typedef pair<ll, int> edge;
#define MAX 100001
vector<edge> G[MAX];
ll dp[MAX][10];
priority_queue<edge, vector<edge>, g... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define cost first
#define to second
typedef long long ll;
typedef pair<ll, int> edge;
#define MAX 100001
vector<edge> G[MAX];
ll dp[MAX][10];
priority_queue<edge, vector<edge>, g... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 85], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 421 | 2 |
#include <bits/stdc++.h>
using namespace std;
const bool debug = true;
#define dbg(...) \
if (debug) \
printf(__VA_ARGS__)
#define print(var) ... | #include <bits/stdc++.h>
using namespace std;
const bool debug = true;
#define dbg(...) \
if (debug) \
printf(__VA_ARGS__)
#define print(var) ... | [["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, 43, 39, 78]] | 1 | 658 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 487 | 10 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | [["-", 31, 69, 341, 342, 0, 16, 31, 16, 12, 22], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22]] | 1 | 581 | 6 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
#def... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
#def... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22]] | 1 | 752 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.