problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
// #define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int f(int n) {
int count = 0;
for (int x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for (ll i = 0; i < n; i++)
// #define DEBUG(fmt, ...)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int f(int n) {
int count = 0;
for (int x... | insert | 19 | 19 | 19 | 21 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define PI 3.141592653589793238462643383279
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int ll;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define PI 3.141592653589793238462643383279
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int ll;
typedef unsigned long long... | insert | 34 | 34 | 34 | 36 | TLE | |
p02608 | C++ | Time Limit Exceeded | // C - XYZ Triplets
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll sum = 0;
vector<ll> ans(n, 0);
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
... | // C - XYZ Triplets
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll sum = 0;
vector<ll> ans(n, 0);
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
... | replace | 16 | 17 | 16 | 17 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n, 0);
for (int i = 1; i * i <= n; i++)
for (int j = 1; j * j <= n; j++)
for (int k = 1; k * k <= n; k++)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n, 0);
for (int i = 1; i * i <= n; i++)
for (int j = 1; j * j <= n; j++)
for (int k = 1; k * k <= n; k++)... | replace | 17 | 19 | 17 | 20 | -6 | malloc(): corrupted top size
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + z * x;
}
int main() {
ll N;
cin >> N;
for (int n = 1; n <= N; n++) {
ll m = sqrt(n);
int ans = 0;
rep(x, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + z * x;
}
int main() {
ll N;
cin >> N;
for (int n = 1; n <= N; n++) {
ll m = sqrt(n);
int ans = 0;
int an... | replace | 17 | 22 | 17 | 52 | TLE | |
p02608 | Python | Time Limit Exceeded | import math
N = int(input())
for n in range(1, N + 1):
count = 0
ub = int(math.sqrt(n))
for x in range(1, ub + 1):
for y in range(x, ub + 1):
for z in range(y, ub + 1):
if x * x + y * y + z * z + x * y + y * z + z * x == n:
s = len(set([x, y, z]))
... | import math
N = int(input())
for n in range(1, N + 1):
count = 0
ub = int(math.sqrt(n))
for x in range(1, ub + 1):
for y in range(x, ub + 1):
r = 4 * n - 3 * x * x - 2 * x * y - 3 * y * y
if r < 0:
break
z = (math.sqrt(r) - x - y) / 2
... | replace | 9 | 19 | 9 | 32 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> ans(N + 1);
for (int x = 1; x <= 101; x++) {
for (int y = 1; y <= 101; y++) {
for (int z = 1; z <= 101; z++) {
int tmp = x * x + y * y + z * z + x * y + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> ans(200000);
for (int x = 1; x <= 101; x++) {
for (int y = 1; y <= 101; y++) {
for (int z = 1; z <= 101; z++) {
int tmp = x * x + y * y + z * z + x * y +... | replace | 8 | 9 | 8 | 9 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int pp = 0;
int as = sqrt(i);
for (int a = 1; a < as; a++) {
for (int b = 1; b < as; b++) {
for (int c = 1; c < as; c++) {
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int pp = 0;
int as = sqrt(i);
for (int a = 1; a < as; a++) {
for (int b = 1; b < as; b++) {
double ji = (-1 * (a + b) + sqrt(1.0 * (a... | replace | 12 | 17 | 12 | 21 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1, 0);
for (int x = 1; x < n / 2; x++) {
for (int y = 1; y < n / 2; y++) {
for (int z = 1; z < n / 2; z++) {
int value = x * x + y * y + z * z + x * y + y * z... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1, 0);
for (int x = 1; x < 100; x++) {
for (int y = 1; y < 100; y++) {
for (int z = 1; z < 100; z++) {
int value = x * x + y * y + z * z + x * y + y * z + z *... | replace | 9 | 12 | 9 | 12 | TLE | |
p02608 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
// defines...
#define ll long long
#define tata return;
#define pb push_back
#define mp make_pair
#define in insert
#define run \
ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
using namespace std;
// defines...
#define ll long long
#define tata return;
#define pb push_back
#define mp make_pair
#define in insert
#define run \
ios_base::sync_with_stdio(false); ... | replace | 72 | 75 | 72 | 75 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | #include <bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define loop(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long... | replace | 17 | 22 | 17 | 21 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + z * x;
}
int count(int n) {
int res = 0;
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
fo... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + z * x;
}
int count(int n) {
int res = 0;
for (int x = 1; x <= 100; x++) {
for (int y = x; y <= 100; y++) {
fo... | replace | 13 | 17 | 13 | 27 | TLE | |
p02608 | C++ | Time Limit Exceeded | /* Code by - Navneet Lohia */
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int, int>
#define uii unordered_map<int, int>
#define endl "\n"
#define pb push_back
#define mp make_pair
#define fr(i, a, n) for (int ... | /* Code by - Navneet Lohia */
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int, int>
#define uii unordered_map<int, int>
#define endl "\n"
#define pb push_back
#define mp make_pair
#define fr(i, a, n) for (int ... | replace | 478 | 480 | 478 | 480 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m, ans, f[1005];
int coun(int x, int y, int z) { return x == y && y == z ? 1 : 3; }
int main() {
// freopen("a.in","r",stdin);
// freopen("a.ou... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m, ans, f[10005];
int coun(int x, int y, int z) {
if (x == y && y == z)
return 1;
if (x == y || y == z)
return 3;
return 6;
}
int mai... | replace | 9 | 11 | 9 | 17 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
int b = i * i + j * j + k * k + i * j + j * k + k * i;
if (b <= N) {
a.at(b)++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
int b = i * i + j * j + k * k + i * j + j * k + k * i;
if (b <= N) {
a.at(b)+... | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 20) >= this->size() (which is 20)
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int fun(int N) {
int count = 0;
int m = N / 2;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= i; j++) {
for (int k = 1; k <= j; k++) {
int A = i + j + k;
if (A * A - i * j - j * k - k * i == N) {
int t = 0;
if (i == ... | #include <bits/stdc++.h>
using namespace std;
int fun(int N) {
int count = 0;
int m = int(sqrt(N)) + 1;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= i; j++) {
for (int k = 1; k <= j; k++) {
int A = i + j + k;
if (A * A - i * j - j * k - k * i == N) {
int t = 0;
... | replace | 5 | 6 | 5 | 6 | TLE | |
p02608 | C++ | Runtime Error | #include <cstdio>
using namespace std;
int n, tmp, Ans[1010];
int main() {
scanf("%d", &n);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int k = (x * x) + (y * y) + (z * z) + (x * y) + (x * z) + (y * z);
if (k <= n)
Ans[k]++;... | #include <cstdio>
using namespace std;
int n, tmp, Ans[10010];
int main() {
scanf("%d", &n);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int k = (x * x) + (y * y) + (z * z) + (x * y) + (x * z) + (y * z);
if (k <= n)
Ans[k]++... | replace | 3 | 4 | 3 | 4 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
#define _rep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define _reps(i, n) for (ll i = n; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define _all(x) (x).rbegin(), (x).rend()
using namespace std;... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define reps(i, n) for (ll i = 1; i <= (n); ++i)
#define _rep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define _reps(i, n) for (ll i = n; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define _all(x) (x).rbegin(), (x).rend()
using namespace std;... | replace | 20 | 22 | 20 | 25 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(), x.end()
#define P pair<int, int>
#define mod... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(), x.end()
#define P pair<int, int>
#define mod... | insert | 23 | 23 | 23 | 25 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 1; i * i <= (int)(n); i++)
int main() {
int MAX_N = 10002;
int s[MAX_N];
for (int i = 0; i < MAX_N; ++i)
s[i] = 0;
for (int i = 0; i < MAX_N; ++i) {
rep(j, i) {
rep(k, i) {
rep(l, i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 1; i * i <= (int)(n); i++)
int main() {
int MAX_N = 10002;
int s[MAX_N];
for (int i = 0; i < MAX_N; ++i)
s[i] = 0;
for (int i = 0; i < MAX_N; ++i) {
rep(j, i) {
rep(k, i) {
rep(l, i - j *... | replace | 16 | 17 | 16 | 17 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
void solve() {}
int ma... | replace | 26 | 27 | 26 | 29 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
FOR(i, 1, N + 1) {
l... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
FOR(i, 1, N + 1) {
l... | insert | 18 | 18 | 18 | 20 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> n(a);
for (int x = 1; x <= a; x++) {
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
if (i * i + j * j + k * k + i * j + i * k + j * k == x) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> n;
n = {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0,
3, 3, 0, 0, 0, 0, 0, 1, 6, 0, 3, 0, 0, 0, 0, 0,
3, 3, 6, 0, 0, 3, 0, 0, 0, 0, 3, 3, 6, 0, ... | replace | 5 | 17 | 5 | 631 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 60; // 10e18+10e17ちょっとくらい
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
/... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 60; // 10e18+10e17ちょっとくらい
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
/... | replace | 22 | 23 | 22 | 24 | -11 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ans[30000];
int main() {
int n;
scanf("%d", &n);
int t = (int)sqrt(n) + 1;
for (int i = 1; i <= t; i++) {
for (int j = 1; j <= t; j++) {
for (int z = 1; z <= t; z++) {
ans[i * i + j * j + z * z + i * j + j * z + i * z]++;
}
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
int ans[30000];
int main() {
int n;
scanf("%d", &n);
int t = (int)sqrt(n) + 1;
for (int i = 1; i <= t; i++) {
for (int j = 1; j <= t; j++) {
for (int z = 1; z <= t; z++) {
if (i * i + j * j + z * z + i * j + j * z + i * z <= n)
ans[i * i ... | replace | 10 | 11 | 10 | 12 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
for (int index = 0; index < n; index++) {
ans = 0;
for (int i = 1; i < 75; i++) {
for (int j = 1; j < 75; j++) {
for (int k = 1; k < 75; k++) {
if (i * i + j * j + k * k + i * j + j * k + k * i == index +... | #include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
for (int index = 0; index < n; index++) {
ans = 0;
for (int i = 1; i < 100; i++) {
for (int j = i; j < 100; j++) {
for (int k = j; k < 100; k++) {
if (i * i + j * j + k * k + i * j + j * k + k * i == inde... | replace | 9 | 14 | 9 | 20 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bits/stdtr1c++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bits/stdtr1c++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#inclu... | replace | 40 | 43 | 40 | 43 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> f(N + 1);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> f(N + 1);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {... | replace | 17 | 22 | 17 | 20 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1, 0);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int sum = x * x + y * y + z * z + x * y + y * ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
cin >> n;
vector<int> ans(1e5, 0);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int sum = x * x + y * y + z * z + x * y + y * z ... | replace | 7 | 8 | 7 | 8 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int c[105][105];
int main() {
int n;
cin >> n;
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
c[i][j] = (i + j) * (i + j);
}
}
for (int i = 1; i <= n; i++) {
int d = i << 1;
int cnt = 0;
for (int x = 1; x <= sqrt(i); x+... | #include <bits/stdc++.h>
using namespace std;
int c[105][105];
int main() {
int n;
cin >> n;
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
c[i][j] = (i + j) * (i + j);
}
}
for (int i = 1; i <= n; i++) {
int d = i << 1;
int cnt = 0;
for (int x = 1; x <= sqrt(i); x+... | replace | 15 | 19 | 15 | 25 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9 + 1;
const ll INFll = (ll)1e18 + 1;
ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
int cnt[1001] = {0};
for (int i(1); i <= 100; i++) {
for (int j(1); j <= 100; j++) {
for (int k(1); k <= 100; k++) {
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9 + 1;
const ll INFll = (ll)1e18 + 1;
ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
int cnt[10001] = {0};
for (int i(1); i <= 100; i++) {
for (int j(1); j <= 100; j++) {
for (int k(1); k <= 100; k++) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n;
cin >> n;
vecto... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n;
cin >> n;
vecto... | replace | 20 | 22 | 20 | 22 | -11 | |
p02608 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | replace | 31 | 32 | 31 | 33 | 0 | |
p02608 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int x = 1; x * x < N; ++x) {
for (int y = 1; x * x + y * y < N; ++y) {
for (int z = 1; x + x + y * y + z * z < N; ++z) {
int v = x * x + y * y + z * z + x * y + y * z + z * x;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int x = 1; x * x < N; ++x) {
for (int y = 1; x * x + y * y < N; ++y) {
for (int z = 1; x + x + y * y + z * z < N; ++z) {
int v = x * x + y * y + z * z + x * y + y * z + z * x;
... | insert | 13 | 13 | 13 | 15 | -6 | malloc(): corrupted top size
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 100... | replace | 31 | 34 | 31 | 34 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi cnt(n, 0);
int c = sqrt(n) + 1;
for (int x = 1; x <= c + 1; x++) {
for (int y = 1; y <= c + 1; y++) {
for (int z = 1; z <= c + 1; z++) {
if (x * x + y * y + z * z + x * y + y * z + z * x <... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi cnt(n, 0);
int c = sqrt(n) + 1;
for (int x = 1; x <= c + 1; x++) {
for (int y = 1; y <= c + 1; y++) {
for (int z = 1; z <= c + 1; z++) {
if (x * x + y * y + z * z + x * y + y * z + z * x <... | replace | 13 | 14 | 13 | 14 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
ll n;
cin >> n;
map<ll, ll> mp;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= n; k++) {
mp[i * i + j ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
ll n;
cin >> n;
map<ll, ll> mp;
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
mp[i * ... | replace | 10 | 13 | 10 | 13 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
vector<int> ans(10004, 0);
cin >> n;
for (int i = 1; i * i <= n; ++i) {
for (int j = 1; j * j <= n; ++j) {
for (int k = 1; k * k <= n; ++k) {
int sum = i * i + j * j + k * k + i * j + j * k + k * i;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
vector<int> ans(10004, 0);
cin >> n;
for (int i = 1; i * i <= n; ++i) {
for (int j = 1; j * j <= n; ++j) {
for (int k = 1; k * k <= n; ++k) {
int sum = i * i + j * j + k * k + i * j + j * k + k * i;
... | replace | 10 | 11 | 10 | 12 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int f[10001];
for (int i = 1; i <= n; i++)
f[i] = 0;
for (int i = 0; i < 5; i++) {
cout << 0 << endl;
if (i + 1 >= n)
break;
}
for (int i = 6; i <= n; i++) {
for (int x = 1; x * x <= i; x++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int f[10001];
for (int i = 1; i <= n; i++)
f[i] = 0;
for (int i = 0; i < 5; i++) {
cout << 0 << endl;
if (i + 1 >= n)
break;
}
for (int i = 6; i <= n; i++) {
for (int x = 1; x * x < i; x++) {
for (in... | replace | 17 | 23 | 17 | 24 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | replace | 21 | 22 | 21 | 23 | -11 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
vector<int> f(10000);
int N;
cin >> N;
int n = sqrt(N);
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
int F = x * x + y * y + z * z... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
vector<int> f(60000);
int N;
cin >> N;
int n = sqrt(N);
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
int F = x * x + y * y + z * z... | replace | 6 | 7 | 6 | 7 | 0 | |
p02608 | C++ | Runtime Error | //
// Created by 10940 on 2020/7/11.
//
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL
int a[10005];
int fun(int num) {
int ans = 0;
for (int i = 1; i * i <= num; i++) {
for (int j = 1; j * j <= num; j++) {
for (int k = 1; k * k <= num; k++) {
int re = i * i + j * j + k * k + i ... | //
// Created by 10940 on 2020/7/11.
//
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL
int a[10005];
void fun(int num) {
int ans = 0;
for (int i = 1; i * i <= num; i++) {
for (int j = 1; j * j <= num; j++) {
for (int k = 1; k * k <= num; k++) {
int re = i * i + j * j + k * k + i... | replace | 10 | 11 | 10 | 11 | 0 | |
p02608 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, x, y, z, i;
cin >> N;
int count[1000000];
for (i = 1; i <= N; i++) {
count[i] = 0;
}
for (x = 1; x <= N; ++x) {
for (y = 1; y <= N; ++y) {
for (z = 1; z <= N; ++z) {
count[x * x + y * y + z * z + x * y + x * z + y * z]++;
... | #include <iostream>
using namespace std;
int main() {
int N, x, y, z, i;
cin >> N;
int count[1000000];
for (i = 1; i <= N; i++) {
count[i] = 0;
}
for (x = 1; x <= 100; ++x) {
for (y = 1; y <= 100; ++y) {
for (z = 1; z <= 100; ++z) {
count[x * x + y * y + z * z + x * y + x * z + y * z]... | replace | 10 | 13 | 10 | 13 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> vec1(n);
int temp;
int count = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
for (int k = j; k <= n; k++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> vec1(n);
int temp;
int count = 0;
double sn = sqrt(n);
for (int i = 1; i < sn; i++) {
for (int j = i; j < sn; j++) {
for (int... | replace | 12 | 15 | 12 | 16 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int i, n, k, j, u;
int a[1010];
int main() {
cin >> n;
for (i = 1; i < sqrt(n); i++) {
for (j = 1; j < sqrt(n); j++) {
for (k = 1; k < sqrt(n); k++) {
u = pow(i, 2) + pow(j, 2) + pow(k, 2) + i * j + i * k + j * k;
if (u <= n)
a[u]++;
... | #include <bits/stdc++.h>
using namespace std;
int i, n, k, j, u;
int a[10010];
int main() {
cin >> n;
for (i = 1; i < sqrt(n); i++) {
for (j = 1; j < sqrt(n); j++) {
for (k = 1; k < sqrt(n); k++) {
u = pow(i, 2) + pow(j, 2) + pow(k, 2) + i * j + i * k + j * k;
if (u <= n)
a[u]++;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int f[1010];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
long long su... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int f[10010];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
long long s... | replace | 7 | 8 | 7 | 8 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | replace | 37 | 38 | 37 | 38 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, x, n) for (int i = x; i < (int)(n); i++)
#define ALL(n) begin(n), end(n)
// struct cww{cww(){ios::sync_with_stdio(false);cin.tie(nullptr);}}star;
const long long INF = numeric_limits<long long>::max();
typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, x, n) for (int i = x; i < (int)(n); i++)
#define ALL(n) begin(n), end(n)
// struct cww{cww(){ios::sync_with_stdio(false);cin.tie(nullptr);}}star;
const long long INF = numeric_limits<long long>::max();
typ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02608 | C++ | Time Limit Exceeded | // It doesn't matter as long as you rise to the top - Katsuki Bakugo
#include <bits/stdc++.h>
using namespace std;
#define Fast_as_duck \
ios::sync_with_stdio(false); \
cin.tie(0); ... | // It doesn't matter as long as you rise to the top - Katsuki Bakugo
#include <bits/stdc++.h>
using namespace std;
#define Fast_as_duck \
ios::sync_with_stdio(false); \
cin.tie(0); ... | replace | 28 | 30 | 28 | 30 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans = 0;
for (int x = 1; x <= floor(sqrt(n)); x++) {
for (int y = 1; y <= floor(sqrt(n - x * x)); y++) {
for (int z = 1; z <= floor(sqrt(n - x * x - y * y - x * y)); z++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans = 0;
for (int x = 1; x * x + 2 * x + 3 <= i; x++) {
for (int y = 1; x * x + y * y + 1 + x * y + y + x <= i; y++) {
for (int z = 1; x * x + y * y + z * z + x * y + y * z + z * x ... | replace | 7 | 10 | 7 | 11 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> f(N);
for (int i = 0; i < N; i++) {
f.at(i) = 0;
}
for (int j = 1; j < 101; j++) {
for (int k = 1; k < 101; k++) {
for (int l = 1; l < 101; l+... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> f(N);
for (int i = 0; i < N; i++) {
f.at(i) = 0;
}
for (int j = 1; j < 101; j++) {
for (int k = 1; k < 101; k++) {
for (int l = 1; l < 101; l+... | replace | 17 | 19 | 17 | 19 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; ++i) {
ll ans = 0;
for (int x = 1; x * x <= i; ++x) {
for (int y = 1; y * y <= i; ++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
for (int i = 1; i <= n; ++i) {
ll ans = 0;
for (int x = 1; x * x <= i; ++x) {
for (int y = x; y * y <= i; ++... | replace | 13 | 17 | 13 | 24 | TLE | |
p02608 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n + 1, 0);
for (int i = 1; i <= 100; ++i) {
for (int j = 1; j <= 100; ++j) {
for (int k = 1; k <= 100; ++k) {
int tmp = pow(i, 2) + pow(j, 2) + pow(k, 2) + i * j + j * k + k * i;
if (n <= 10... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n + 1, 0);
for (int i = 1; i <= 100; ++i) {
for (int j = 1; j <= 100; ++j) {
for (int k = 1; k <= 100; ++k) {
int tmp = pow(i, 2) + pow(j, 2) + pow(k, 2) + i * j + j * k + k * i;
if (tmp <= ... | replace | 14 | 15 | 14 | 15 | -11 | |
p02608 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans[10001];
for (int i = 0; i < 10100; i++) {
ans[i] = 0;
}
int v;
for (int x = 1; x <= 101; x++) {
for (int y = 1; y <= 101; y++) {
for (int z = 1; z <= 101; z++) {
v = x * x + y * y + z * z + x * y + y... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans[10100];
for (int i = 0; i < 10100; i++) {
ans[i] = 0;
}
int v;
for (int x = 1; x <= 101; x++) {
for (int y = 1; y <= 101; y++) {
for (int z = 1; z <= 101; z++) {
v = x * x + y * y + z * z + x * y + y... | replace | 8 | 9 | 8 | 9 | -6 | *** stack smashing detected ***: terminated
|
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | insert | 47 | 47 | 47 | 50 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, ans[10001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 1; i * i <= n; i++)
for (int j = 1; j * j <= n; j++)
for (int k = 1; k * k <= n; k++)
ans[i * i + j * j + k * k + i * j + j * k + i * k]++;
... | #include <bits/stdc++.h>
using namespace std;
int n, ans[10001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 1; i * i <= n; i++)
for (int j = 1; j * j <= n; j++)
for (int k = 1; k * k <= n; k++) {
int val = i * i + j * j + k * k + i * j + j * k + i * ... | replace | 11 | 13 | 11 | 16 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int counter = 0;
for (x = 1; x < 100; x++) {
for (y = x; y < 100; y++) {
for (z = y; z < 100; z++) {
if (i == x * x + y * y + z * z + x * y + y * z + z * x &&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int counter = 0;
for (x = 1; x <= 41; x++) {
for (y = x; y < 100; y++) {
for (z = y; z < 100; z++) {
if (i == x * x + y * y + z * z + x * y + y * z + z * x &&... | replace | 10 | 11 | 10 | 11 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// f(n)の個数を調べる
for (int i = 1; i <= n; i++) {
int count = 0;
// x, y, z全探索してnと合致しているか調べる
for (int j = 1; j <= i; j++) {
for (int k = 1; k <= i; k++) {
for (int l = 1; l <= i; l++) {
int a = j * j + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
// f(n)の個数を調べる
for (int i = 1; i <= n; i++) {
int count = 0;
// x, y, z全探索してnと合致しているか調べる
for (int j = 1; j <= 105; j++) {
for (int k = 1; k <= 105; k++) {
for (int l = 1; l <= 105; l++) {
int a = j ... | replace | 11 | 14 | 11 | 14 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | replace | 61 | 62 | 61 | 64 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define fastIO \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define fastIO \
ios_base::sync_with_stdio(false); ... | replace | 24 | 25 | 24 | 25 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int x = 1; x <= n; ++x) {
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int x = 1; x <= n; ++x) {
in... | insert | 16 | 16 | 16 | 18 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, x, y, z = 0;
cin >> a;
if (a <= 5) {
for (int i = 0; i < a; i++) {
cout << 0 << endl;
}
} else {
for (int i = 0; i < 5; i++) {
cout << 0 << endl;
}
for (int i = 6; i <= a; i++) {
c = 96;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, x, y, z = 0;
cin >> a;
if (a <= 5) {
for (int i = 0; i < a; i++) {
cout << 0 << endl;
}
} else {
for (int i = 0; i < 5; i++) {
cout << 0 << endl;
}
for (int i = 6; i <= a; i++) {
c = sqrt(i);
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02608 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int i, j, k;
int q;
int f[10001];
memset(f, 0, sizeof(f));
q = sqrt(n);
for (i = 1; i <= q; i++) {
for (j = 1; j <= q; j++) {
for (k = 1; k <= q; k... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n;
while (scanf("%d", &n) != EOF) {
int i, j, k;
int q;
int f[10001];
memset(f, 0, sizeof(f));
q = sqrt(n);
for (i = 1; i <= q; i++) {
for (j = 1; j <= q; j++) {
for (k = 1; k <= q; k... | replace | 17 | 18 | 17 | 20 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, N, x, y, z, t;
cin >> N;
vector<int> a(N);
// vector<int> b(M);
// for (i = 1; i <= N; i++){
for (i = 1; i <= N; i++) {
a[i] = 0;
}
for (x = 1; x <= N; x++) {
for (y = 1; y <= N; y++) {
for (z = 1; z <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, N, x, y, z, t;
cin >> N;
vector<int> a(N);
// vector<int> b(M);
// for (i = 1; i <= N; i++){
for (i = 1; i <= N; i++) {
a[i] = 0;
}
for (x = 1; x <= sqrt(N); x++) {
for (y = 1; y <= sqrt(N); y++) {
for... | replace | 13 | 16 | 13 | 16 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std; // std::の省略のため
using ll = long long;
int main() {
ll n, a;
int x, y, z;
cin >> n;
vector<int> f(n);
int i = 0;
while (i < n) {
f[i] = 0;
for (x = 1; x <= sqrt(i + 1); x++) {
for (y = 1; y <= sqrt(i + 1); y++) {
for (z = 1; z <= sqrt(i +... | #include <bits/stdc++.h>
using namespace std; // std::の省略のため
using ll = long long;
int main() {
ll n, a;
int x, y, z;
cin >> n;
vector<int> f(n);
int i = 0;
while (i < n) {
f[i] = 0;
for (x = 1; x <= sqrt(i + 1); x++) {
for (y = 1; y <= sqrt(i + 1); y++) {
for (z = 1; z <= sqrt(i +... | insert | 21 | 21 | 21 | 23 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
ll ans = 0;
for (int x = 1; x * x < i; x++) {
for (int y = 1; y * y < i; y++) {
int d = 4 * i - 3 * x * x - 3 * y * y - 2 * x * y;
for (int j = 0; j *... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
ll ans = 0;
for (int x = 1; x * x < i; x++) {
for (int y = 1; y * y < i; y++) {
int d = 4 * i - 3 * x * x - 3 * y * y - 2 * x * y;
if (d < 0)
... | replace | 12 | 26 | 12 | 22 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 10;
int n, ans[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * y <= n; y++) {
for (int z = 1; z * z <= n; z++) {
int f = 0;
f += x * x + y * ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, ans[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * y <= n; y++) {
for (int z = 1; z * z <= n; z++) {
int f = 0;
f += x * x + y * ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long f(long x, long y, long z) {
return pow(x + y + z, 2) - x * y - y * z - z * x;
}
int main() {
long N;
cin >> N;
for (int i = 1; i <= N; i++) {
long cnt = 0;
long max = sqrt(i);
for (long x = 1; x <= max; x++) {
for (long y = 1; y <= max; y++... | #include <bits/stdc++.h>
using namespace std;
long f(long x, long y, long z) {
return pow(x + y + z, 2) - x * y - y * z - z * x;
}
int main() {
long N;
cin >> N;
for (int i = 1; i <= N; i++) {
long cnt = 0;
long max = sqrt(i);
for (long x = 1; x <= max; x++) {
for (long y = 1; y <= x; y++) ... | replace | 15 | 19 | 15 | 40 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200000005];
char s[100][8];
int main() {
ll n, m, k, i, j, l, ans = 0, K, x = 1, y = 1, r, d, z, flag = 1;
scanf("%lld", &n);
for (x = 1; x <= n; x++) {
for (y = 1; y <= n; y++) {
for (z = 1; z <= n; z++) {
a[x * x + y * y ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200000005];
char s[100][8];
int main() {
ll n, m, k, i, j, l, ans = 0, K, x = 1, y = 1, r, d, z, flag = 1;
scanf("%lld", &n);
for (x = 1; x * x <= n; x++) {
for (y = 1; y * y <= n; y++) {
for (z = 1; z * z <= n; z++) {
a[x ... | replace | 8 | 11 | 8 | 11 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main(void) {
ll n;
cin >> n;
ll count = 0;
for (int i ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main(void) {
ll n;
cin >> n;
ll count = 0;
for (int i ... | replace | 22 | 23 | 22 | 27 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> ans(1001, 0);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int m = x * x + y * y... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> ans(10001, 0);
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int m = x * x + y * ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, b[200009], num = 0;
ll tmp = 0, c[200009], d[200009], tmp1 = 0;
char a[200009];
ll pow1(ll a, int n, ll m) {
ll ans = 1;
while (n) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n >>= 1;
}
return ans;
}
void solve(int x)... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, b[200009], num = 0;
ll tmp = 0, c[200009], d[200009], tmp1 = 0;
char a[200009];
ll pow1(ll a, int n, ll m) {
ll ans = 1;
while (n) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n >>= 1;
}
return ans;
}
void solve(int x)... | replace | 37 | 38 | 37 | 39 | 0 | |
p02609 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int popcount(int x) {
vector<int> a;
while (x != 0) {
a.emplace_back(x % 2);
x /= 2;
}
int res = 0;
for (auto p : a) {
if (p == 1) {
res++;
}
}
return res;
}
int f(int x) {
if (x == 0)... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int popcount(int x) {
vector<int> a;
while (x != 0) {
a.emplace_back(x % 2);
x /= 2;
}
int res = 0;
for (auto p : a) {
if (p == 1) {
res++;
}
}
return res;
}
int f(int x) {
if (x == 0)... | replace | 76 | 77 | 76 | 77 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n >... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const ll LINF = 1LL << 60;
const int INF = 1 << 29;
const ll MOD = 1e9 + 7;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n >... | insert | 58 | 58 | 58 | 62 | 0 | |
p02609 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | replace | 55 | 57 | 55 | 56 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N;
cin >> N;
string X;
cin >> X;
ll t = count(X.begin(), X.end(), '1');
vector<ll> powl(N + 1, 1), pow(N + 1, 1), powu(N + 1, 1);
for (int i = 1; i <= N; i++) {
if (t > 1)
powl[i] = powl[i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N;
cin >> N;
string X;
cin >> X;
ll t = count(X.begin(), X.end(), '1');
if (t == 0) {
for (int i = 0; i < N; i++)
cout << 1 << endl;
return 0;
}
vector<ll> powl(N + 1, 1), pow(N + 1,... | insert | 11 | 11 | 11 | 16 | 0 | |
p02609 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii... | insert | 95 | 95 | 95 | 99 | 0 | |
p02609 | C++ | Runtime Error | /// #pragma GCC optimize("O3,unroll-loops")
/// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define i... | /// #pragma GCC optimize("O3,unroll-loops")
/// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define ld long double
#define i... | replace | 147 | 148 | 147 | 148 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int popcount(int n) {
int r = 0;
while (n > 0) {
r += n & 1;
n >>= 1;
}
return r;
}
int popcount(string n) {
int r = 0;
for (auto c : n) {
r += c == '1';
}
return r;
}
int f(int n) {
int k = 0;
while (n != 0) {
n %= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int popcount(int n) {
int r = 0;
while (n > 0) {
r += n & 1;
n >>= 1;
}
return r;
}
int popcount(string n) {
int r = 0;
for (auto c : n) {
r += c == '1';
}
return r;
}
int f(int n) {
int k = 0;
while (n != 0) {
n %= ... | replace | 29 | 30 | 29 | 30 | 0 | |
p02609 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
long long Calc(long long P) {
if (P == 0)
return 0;
long long COUNT = 0;
long long Q = P;
while (Q > 0) {
COUNT += Q % 2;
Q /= 2;
}
return Calc(P % COUNT) + 1;
}
long long Pow(long long A, long long B, long long M) {
if (B == 0)
return 1 % M;... | #include "bits/stdc++.h"
using namespace std;
long long Calc(long long P) {
if (P == 0)
return 0;
long long COUNT = 0;
long long Q = P;
while (Q > 0) {
COUNT += Q % 2;
Q /= 2;
}
return Calc(P % COUNT) + 1;
}
long long Pow(long long A, long long B, long long M) {
if (B == 0)
return 1 % M;... | replace | 52 | 54 | 52 | 56 | 0 | |
p02609 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
//... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
//... | replace | 88 | 89 | 88 | 89 | TLE | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define ri register int
#define il inline
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) fo... | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define ri register int
#define il inline
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) fo... | replace | 68 | 70 | 68 | 72 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#defi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#defi... | replace | 152 | 153 | 152 | 153 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define in(x, a, b) (a <= x && x < b)
#define CASET ... | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define in(x, a, b) (a <= x && x < b)
#define CASET ... | replace | 47 | 48 | 47 | 49 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define sec second
#define fir first
#define mo 1000000007
#define inf 1e18
#define rep(i, s, n) for (ll i = s; i < n; i = i + 1)
#define rrep(i, s, n) for (ll i = s; i >= n; i--)
ll mod(ll n) { return (n %... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define sec second
#define fir first
#define mo 1000000007
#define inf 1e18
#define rep(i, s, n) for (ll i = s; i < n; i = i + 1)
#define rrep(i, s, n) for (ll i = s; i >= n; i--)
ll mod(ll n) { return (n %... | insert | 27 | 27 | 27 | 50 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
int popCnt(int x) { return __builtin_popcount(x); }
int f(int x) {
if (x == 0)
return 0;
return f(x % ... | #include <bits/stdc++.h>
// #include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
int popCnt(int x) { return __builtin_popcount(x); }
int f(int x) {
if (x == 0)
return 0;
return f(x % ... | replace | 31 | 32 | 31 | 34 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << (x) << endl
#define INF (int)1e9
#define EPS (double)1e-9
#define MOD ((int)1e9 + 7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << (x) << endl
#define INF (int)1e9
#define EPS (double)1e-9
#define MOD ((int)1e9 + 7)
using namespace std;
typedef long long llong;
typedef vector<int> vi;
typedef vector<... | replace | 59 | 60 | 59 | 61 | 0 | |
p02609 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define int long long
#define ld long double
#define endl "\n"
#defi... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define int long long
#define ld long double
#define endl "\n"
#defi... | replace | 76 | 77 | 76 | 107 | 0 | |
p02609 | C++ | Runtime Error |
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, n... |
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, n... | replace | 365 | 366 | 365 | 369 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++... | insert | 62 | 62 | 62 | 64 | 0 | |
p02609 | C++ | Runtime Error | // K-OS WITH THE OCDE
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include... | // K-OS WITH THE OCDE
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include... | replace | 142 | 144 | 142 | 149 | -11 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
template <t... | #include <bits/stdc++.h>
#define REP(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for (int(i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
template <t... | replace | 37 | 38 | 37 | 39 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | replace | 185 | 186 | 185 | 186 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begi... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begi... | replace | 66 | 68 | 66 | 89 | 0 | |
p02609 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, p, pc, np, h, i, j, k, l, m, n, y;
ll ans = 0;
string x, xx;
cin >> n >> x;
vector<ll> pcm(n), pcp(n);
pc = 0;
for (i = 0; i < n; i++)
... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, p, pc, np, h, i, j, k, l, m, n, y;
ll ans = 0;
string x, xx;
cin >> n >> x;
vector<ll> pcm(n), pcp(n);
pc = 0;
for (i = 0; i < n; i++)
... | replace | 33 | 34 | 33 | 35 | 0 | |
p02609 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define ... | insert | 96 | 96 | 96 | 97 | 0 | |
p02609 | C++ | Runtime Error | #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>;
int popcount(int x) { return __builtin_popcount(x); }
// 再帰関数によって操作回数をカウント
int f(int x) {
if (x == 0)
return 0;
return f(x % popcount(x)) + 1;
}
int main() {
int n;
... | #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>;
int popcount(int x) { return __builtin_popcount(x); }
// 再帰関数によって操作回数をカウント
int f(int x) {
if (x == 0)
return 0;
return f(x % popcount(x)) + 1;
}
int main() {
int n;
... | replace | 34 | 35 | 34 | 36 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod = 1e9 + 7;
int f(int x) {
for (int ans = 0;; x %= __builtin_popcount(x), ans++) {
if (x == 0)
return ans;
}
}
int a[200000], b[200000];
signed main() {
int n;
string x;
cin >> n >> x;
int popx = count(x.begin(), ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int mod = 1e9 + 7;
int f(int x) {
for (int ans = 0;; x %= __builtin_popcount(x), ans++) {
if (x == 0)
return ans;
}
}
int a[200000], b[200000];
signed main() {
int n;
string x;
cin >> n >> x;
int popx = count(x.begin(), ... | insert | 26 | 26 | 26 | 27 | 0 | |
p02609 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | #include <bits/stdc++.h>
#include <cstdint>
#include <vector>
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (l); i >= (int)(r); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n - 1, 0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf... | replace | 60 | 64 | 60 | 68 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.