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 <iostream>
// #include <vector>
// #include <string>
// #include <algorithm>
// #include <math.h>
// #include <queue>
// #include <stack>
// #include <iomanip>
// sometimes used
// #include <set>
// #include <map>
// #include <numeric>
// #include <list>
// #include <deque>
// #include <unordered_map>
typede... | #include <iostream>
// #include <vector>
// #include <string>
// #include <algorithm>
// #include <math.h>
// #include <queue>
// #include <stack>
// #include <iomanip>
// sometimes used
// #include <set>
// #include <map>
// #include <numeric>
// #include <list>
// #include <deque>
// #include <unordered_map>
typede... | replace | 31 | 35 | 31 | 37 | TLE | |
p02608 | 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 a[10010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
for (int k = 1; k <= n; ++k) {
a[i * i + j * j... | #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 a[10010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= 300; ++i) {
for (int j = 1; j <= 300; ++j) {
for (int k = 1; k <= 300; ++k) {
if (i * i... | replace | 11 | 14 | 11 | 16 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int f(int x, int y, int z) {
return x * x + y ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int f(int x, int y, int z) {
return x * x + y ... | replace | 29 | 30 | 29 | 30 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M 998244353
#define INF 1e16
typedef long long... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define M 998244353
#define INF 1e16
typedef long long... | insert | 48 | 48 | 48 | 50 | 0 | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include... | replace | 66 | 67 | 66 | 67 | -11 | |
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 P = pair<int, int>;
int main() {
int n;
cin >> n;
map<int, int> ans;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
int n = x... | #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 main() {
int n;
cin >> n;
map<int, int> ans;
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
int... | replace | 10 | 13 | 10 | 13 | TLE | |
p02608 | 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 main() {
int n;
cin >> n;
vector<int> a(n);
for (int x = 1; x < 10000; x++) {
if (x * x > n)
break;
for (int y = 1; y < 10000; y++) {
if (y * y >... | #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 main() {
int n;
cin >> n;
vector<int> a(n);
for (int x = 1; x < 10000; x++) {
if (x * x > n)
break;
for (int y = 1; y < 10000; y++) {
if (y * y >... | replace | 19 | 20 | 19 | 21 | -6 | malloc(): corrupted top size
|
p02608 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
int main() {
int N;
cin >> N;
vector<int> ans(6 * pow(N + 1, 2));
for (int x = 1; x <= ceil(sqrt(N)); x++) {
for (int y = 1; y <= ceil(sqrt(N)); y++) {
for (int z = 1; z <= ceil(sqrt(N)); z++) {
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
int main() {
int N;
cin >> N;
vector<int> ans(60001);
for (int x = 1; x <= ceil(sqrt(N)); x++) {
for (int y = 1; y <= ceil(sqrt(N)); y++) {
for (int z = 1; z <= ceil(sqrt(N)); z++) {
int n = pow(x ... | replace | 9 | 10 | 9 | 10 | MLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265359
int main() {
int N;
cin >> N;
for (int i = 1; i < N + 1; i++) {
int ans = 0;
for (int j = 1; j < 100; j++) {
for (int k = j; k < 100; k++) {
for (int l = k; l < 100; l++) {
if (j * j + k * k + l * l + j * k + ... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265359
int main() {
int N;
cin >> N;
for (int i = 1; i < N + 1; i++) {
int ans = 0;
for (int j = 1; j < 59; j++) {
for (int k = j; k < 71; k++) {
for (int l = k; l < 100; l++) {
if (j * j + k * k + l * l + j * k + k ... | replace | 10 | 12 | 10 | 12 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n;
cin >> n;
ve... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n;
cin >> n;
ve... | replace | 22 | 23 | 22 | 23 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll ans = 0;
for (ll j = 1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
ll ans = 0;
for (ll j = 1;... | replace | 15 | 20 | 15 | 28 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> cnt(n + 10, 0);
for (int x = 1; x <= 110; ++x) {
for (int y = 1; y <= 110; ++y) {
for (int z = 1; z <= 110; ++z) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int n;
cin >> n;
vector<int> cnt(n + 10, 0);
for (int x = 1; x <= 110; ++x) {
for (int y = 1; y <= 110; ++y) {
for (int z = 1; z <= 110; ++z) {
... | replace | 18 | 19 | 18 | 21 | -11 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1, 0);
for (int x = 1; x <= sqrt(n); ++x) {
int x2 = x * x;
for (int y = 1; y <= sqrt(n); ++y) {
int y2... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1, 0);
for (int x = 1; x <= sqrt(n); ++x) {
int x2 = x * x;
for (int y = 1; y <= sqrt(n); ++y) {
int y2... | replace | 16 | 17 | 16 | 18 | 0 | |
p02608 | C++ | Time Limit Exceeded | // is there any case of -1 or any special corner cases ?
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define all(v) v.begin(), v.end()
#define zeros(arr) memset(arr, ... | // is there any case of -1 or any special corner cases ?
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define all(v) v.begin(), v.end()
#define zeros(arr) memset(arr, ... | replace | 72 | 75 | 72 | 75 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> res(N, 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 n = x * x + y * y + z * z + x * y + y * z + x * z;
if (n <= N) {
res.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> res(N, 0);
for (int x = 1; x < sqrt(N); x++) {
for (int y = 1; y < sqrt(N); y++) {
for (int z = 1; z < sqrt(N); z++) {
int n = x * x + y * y + z * z + x * y + y * z + x * z;
if (n <= N) {
... | replace | 8 | 11 | 8 | 11 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
int main() {
int N;
cin >> N;
vi f(N + 1, 0);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= 120; j++) {
f... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
int main() {
int N;
cin >> N;
vi f(N + 1, 0);
int v = 1000;
for (int j = 1; j <= v; j++) {
for (int k = 1; k <= v - ... | replace | 12 | 20 | 12 | 19 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define MAX 100000
#define INF 1000000
#define M 1000000007
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define ll long long
#define MAX 100000
#define INF 1000000
#define M 1000000007
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 14 | 17 | 14 | 17 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
vector<int> a(1000000000);
int n;
cin >> n;
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
a[x * x + y * y +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
vector<int> a(1000000);
int n;
cin >> n;
for (int x = 1; x <= 100; x++) {
for (int y = 1; y <= 100; y++) {
for (int z = 1; z <= 100; z++) {
a[x * x + y * y + z ... | replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02608 | C++ | Time Limit Exceeded | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vii;
typ... | // AUTHOR: RAVAN_2070
// PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vii;
typ... | replace | 62 | 67 | 62 | 64 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | replace | 66 | 67 | 66 | 68 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// int func(int x, int y, int n){
// double sq = sqrt( (x+y)*(x+y) - 4 * (x*x + y*y + x*y - n));
// if(ceil(sq) != floor(sq) || sq <= 0){
// return -1;
// }
// else{
// return (-(x + y) + int(sq)) / 2;
// }
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
// int func(int x, int y, int n){
// double sq = sqrt( (x+y)*(x+y) - 4 * (x*x + y*y + x*y - n));
// if(ceil(sq) != floor(sq) || sq <= 0){
// return -1;
// }
// else{
// return (-(x + y) + int(sq)) / 2;
// }
... | replace | 33 | 36 | 33 | 36 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio ... | replace | 240 | 241 | 240 | 241 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// T+N
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <class T, class T2> inline bool chkmax(T &x, const T2 &y) {
return x < y ? x = y, 1 : 0;
}
templat... | #include <bits/stdc++.h>
using namespace std;
// T+N
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <class T, class T2> inline bool chkmax(T &x, const T2 &y) {
return x < y ? x = y, 1 : 0;
}
templat... | replace | 27 | 28 | 27 | 28 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | replace | 136 | 137 | 136 | 138 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | insert | 138 | 138 | 138 | 140 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define limit(... | insert | 151 | 151 | 151 | 153 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
using namespace std;
int f(int x, int y, int z) {
return pow(x, 2) + pow(y, 2) + pow(z, 2) + x * y + y * z + z * x;
}
int main() {
int N;
cin >> N;
for (int n = 1; n <= N; n++) {
int ans = 0;
int intn = (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
using namespace std;
int f(int x, int y, int z) {
return pow(x, 2) + pow(y, 2) + pow(z, 2) + x * y + y * z + z * x;
}
int main() {
int N;
cin >> N;
for (int n = 1; n <= N; n++) {
int ans = 0;
int intn = (... | replace | 17 | 19 | 17 | 19 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tu... | replace | 71 | 74 | 71 | 81 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 294 | 295 | 294 | 296 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (i = 1; i <= n; ++i)
#define rrep(xyz, n) for (xyz = 1; xyz < n; ++xyz)
using namespace std;
int main(void) {
int N;
cin >> N;
int i, score, n, x, y, z;
rep(i, N) {
score = 0;
rrep(x, i) rrep(y, i) rrep(z, i) {
n = (x * x + y * y + z * z + x * y + y *... | #include <bits/stdc++.h>
#define rep(i, n) for (i = 1; i <= n; ++i)
#define rrep(xyz, n) for (xyz = 1; xyz * xyz < n; ++xyz)
using namespace std;
int main(void) {
int N;
cin >> N;
int i, score, n, x, y, z;
rep(i, N) {
score = 0;
rrep(x, i) rrep(y, i) rrep(z, i) {
n = (x * x + y * y + z * z + x * y... | replace | 2 | 3 | 2 | 3 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#d... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#d... | replace | 28 | 29 | 28 | 31 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans[10100];
for (int i = 1; i <= N; i++) {
ans[i] = 0;
}
int l = 0;
for (int i = 0; i <= N; i++) {
l = i;
}
for (int x = 1; x <= l; x++) {
for (int y = 1; y <= l; y++) {
for (int z = 1; z <= l; z++) {
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int ans[10100];
for (int i = 1; i <= N; i++) {
ans[i] = 0;
}
for (int x = 1; x <= 105; x++) {
for (int y = 1; y <= 105; y++) {
for (int z = 1; z <= 105; z++) {
if ((x * x + y * y + z * z + x * y + y * z + z * x) <= ... | replace | 9 | 17 | 9 | 12 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
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++) {
if (X * X + Y * Y + Z * Z + X * Y + Y * Z + Z + X <= N) {
A.at(X * X + Y * Y + Z * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
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++) {
if (X * X + Y * Y + Z * Z + X * Y + Y * Z + Z * X <= N) {
A.at(X * X + Y * Y + Z * ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02608 | C++ | Time Limit Exceeded | #ifdef __APPLE__
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <ctgmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#... | #ifdef __APPLE__
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <ctgmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#... | replace | 69 | 71 | 69 | 74 | TLE | |
p02608 | C++ | Runtime Error | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <cstdlib>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>,
// rb_tree_tag,tre... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <cstdlib>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
// #define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>,
// rb_tree_tag,tre... | replace | 79 | 80 | 79 | 81 | -11 | |
p02608 | C++ | Time Limit Exceeded | ///-----Bismillahir Rahmanir Rahim-----///
#include <bits/stdc++.h>
using namespace std;
///---FAST I/O---///
#define Boost() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | ///-----Bismillahir Rahmanir Rahim-----///
#include <bits/stdc++.h>
using namespace std;
///---FAST I/O---///
#define Boost() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 100 | 103 | 100 | 103 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1, 0);
int nn = sqrt(n);
for (int x = 1; x <= nn; ++x) {
for (int y = 1; y <= nn; ++y) {
for (int z = 1; z <= nn; ++z) {
int f = x * x + y * y + z * z + x * y + y * z + z * x;
ans[f]+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1, 0);
int nn = sqrt(n);
for (int x = 1; x <= nn; ++x) {
for (int y = 1; y <= nn; ++y) {
for (int z = 1; z <= nn; ++z) {
int f = x * x + y * y + z * z + x * y + y * z + z * x;
if (f <... | replace | 16 | 17 | 16 | 19 | 0 | |
p02608 | C++ | Time Limit Exceeded | /*************************************************\
In the name of almighty ALLAH
MD.Faysal Hasan
Comilla Univesity
\*************************************************/
#include <bits/stdc++.h>
using namespace std;
#define ikarus_101 ... | /*************************************************\
In the name of almighty ALLAH
MD.Faysal Hasan
Comilla Univesity
\*************************************************/
#include <bits/stdc++.h>
using namespace std;
#define ikarus_101 ... | replace | 85 | 88 | 85 | 88 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[40000] = {0};
int main() {
int N;
cin >> N;
for (int i = 1; i < 110; ++i) {
for (int j = 1; j < 110; ++j) {
for (int k = 1; k < 110; ++k) {
int temp = i * i + j * j + k * k + i * j + j * k + k * i;
++A[temp];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[40000] = {0};
int main() {
int N;
cin >> N;
for (int i = 1; i < 110; ++i) {
for (int j = 1; j < 110; ++j) {
for (int k = 1; k < 110; ++k) {
int temp = i * i + j * j + k * k + i * j + j * k + k * i;
if (temp <= ... | replace | 15 | 16 | 15 | 18 | -11 | |
p02608 | C++ | Runtime Error | // May this submission get accepted
#include <bits/stdc++.h>
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// エイリアス... | // May this submission get accepted
#include <bits/stdc++.h>
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// エイリアス... | replace | 169 | 170 | 169 | 172 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
int ans = 0;
rep(i, 0, n) {
ans = 0;
for (ll x = 1; x * x <= i + 1; x++) {
for (ll y = 1; x * x + y * y <= i + 1; y++) {
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
int ans = 0;
rep(i, 0, n) {
ans = 0;
for (ll x = 1; x * x <= i + 1; x++) {
for (ll y = 1; x * x + y * y + x * y <= i + 1; y++... | replace | 13 | 15 | 13 | 16 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n + 1);
for (int i = 1; i <= n; i++) {
int sn = sqrt(i);
for (int x = 1; x < sn; x++) {
for (int y = 1; y <= sn; y++) {
if (x * ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> ans(n + 5);
int sn = sqrt(n);
for (int x = 1; x < sn; x++) {
for (int y = 1; y <= sn; y++) {
for (int z = 1; z <= sn; z++) {
ll tmp =... | replace | 8 | 19 | 8 | 17 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | replace | 62 | 65 | 62 | 65 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YE... | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YE... | replace | 35 | 36 | 35 | 36 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int m = floor(sqrt((4 * N + 1) - 1) / 2);
for (int n = 1; n <= N; n++) {
int cnt = 0;
for (int x = 1; x <= m; x++) {
for (int y = 1; y <= m; y++) {
for (int z = 1; z <= m; z++) {
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int m = floor(sqrt((4 * N + 1) - 1) / 2);
for (int n = 1; n <= N; n++) {
int cnt = 0;
for (int x = 1; x <= m; x++) {
for (int y = 1; y <= x; y++) {
for (int z = 1; z <= y; z++) {
if... | replace | 11 | 15 | 11 | 22 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = 0; i < (n); i++)
#define rep3(i, a, b) for (ll i = (a); i < (b); i++)
#define rep4(i, a,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = 0; i < (n); i++)
#define rep3(i, a, b) for (ll i = (a); i < (b); i++)
#define rep4(i, a,... | replace | 31 | 34 | 31 | 40 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
double pie = 3.14159265358979;
long long mod = 10... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
double pie = 3.14159265358979;
long long mod = 10... | replace | 21 | 22 | 21 | 22 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long ans[10004], n;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; n >= i * i; i++) {
for (int j = 1; n >= j * j; j++) {
for (int k = 1; n >= k * k; k++) {
ans[i * i + j * j + k * k + i * j + i * k +... | #include <bits/stdc++.h>
using namespace std;
long long ans[100005], n;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; n >= i * i; i++) {
for (int j = 1; n >= j * j; j++) {
for (int k = 1; n >= k * k; k++) {
ans[i * i + j * j + k * k + i * j + i * k ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<long long, long lon... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<long long, long lon... | replace | 15 | 16 | 15 | 16 | 0 | |
p02608 | C++ | Runtime Error | // 7/10
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int f[10010];
int main() {
int N;
cin >> N;
rep(i, 10010) f[i] = 0;
for (int x = 1; x * x <= N; x++) {
for (int y = 1; y * y <= N; y++) {
for (int z ... | // 7/10
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int f[10010];
int main() {
int N;
cin >> N;
rep(i, 10010) f[i] = 0;
for (int x = 1; x * x <= N; x++) {
for (int y = 1; y * y <= N; y++) {
for (int z ... | replace | 18 | 19 | 18 | 20 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> count(N, 0);
int max = sqrt(N);
for (int x = 1; x <= max; x++) {
for (int y = 1; y <= max; y++) {
for (int z = 1; z <= max; z++) {
int t = x * x + y * y + z * z + x * y + y * z + z * x;
coun... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> count(N, 0);
int max = sqrt(N);
for (int x = 1; x <= max; x++) {
for (int y = 1; y <= max; y++) {
for (int z = 1; z <= max; z++) {
int t = x * x + y * y + z * z + x * y + y * z + z * x;
if (... | replace | 13 | 14 | 13 | 15 | -6 | malloc(): corrupted top size
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int n = 1; n <= N; n++) {
count = 0;
for (int x = 1; x < sqrt(n); x++) {
for (int y = 1; y < n - x * x; y++) {
for (int z = 1; z < n - x * x - y * y; z++) {
if (x * x + y * y + z * z... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int n = 1; n <= N; n++) {
count = 0;
for (int x = 1; x < n; x++) {
if (x * x + 2 * x + 3 > n) {
break;
}
for (int y = 1; y < n; y++) {
if (x * x + y * y + 1 + x * y + y + x... | replace | 10 | 13 | 10 | 22 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> ans(n + 1);
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * y <= n; y++) {
for (int z = 1; z * z <= n; z++) {
ans[x * x + y * y + z * z + x * y + y * z + z * x]++;
}
}
}
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
vector<int> ans(n + 1);
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 idx = x * x + y * y + z * z + x * y + y * z + z * x;
if (idx <= n)
... | replace | 11 | 12 | 11 | 14 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int x = 1; x <= 100; x++) {
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int x = 1; x <= 100; x++) {
for... | replace | 19 | 20 | 19 | 20 | TLE | |
p02608 | C++ | Runtime Error | /*input
20
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 2;
int res[N];
inline int f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + x * z;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int m = (int)sqrt... | /*input
20
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 2;
int res[N];
inline int f(int x, int y, int z) {
return x * x + y * y + z * z + x * y + y * z + x * z;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int m = (int)sqrt... | replace | 7 | 8 | 7 | 8 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vec... | insert | 43 | 43 | 43 | 47 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(a, b) \
if ((a) > (b)) ... | replace | 39 | 41 | 39 | 44 | TLE | |
p02608 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const ll MOD = 1000000007;
const long long INF = 1LL << 60;
const double pi = acos(-1);
int main() {
ll N;
cin >> N;
vector<int> f = {
0, 0, 0, 0, 0, 1, 0, 0, 0... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const ll MOD = 1000000007;
const long long INF = 1LL << 60;
const double pi = acos(-1);
int main() {
ll N;
cin >> N;
vector<int> f = {
0, 0, 0, 0, 0, 1, 0, 0... | replace | 13 | 69 | 13 | 638 | 0 | |
p02608 | C++ | Runtime Error |
#include <algorithm>
#include <iomanip> // std::setprecision()
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define YES cout << "YES" << endl;
... |
#include <algorithm>
#include <iomanip> // std::setprecision()
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define YES cout << "YES" << endl;
... | replace | 33 | 37 | 33 | 37 | -11 | |
p02608 | C++ | Time Limit Exceeded | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | replace | 58 | 60 | 58 | 61 | TLE | |
p02608 | C++ | Time Limit Exceeded | #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;
for (int i = 1; i < n + 1; i++) {
int ans = 0;
for (int x = 1; x < 45; x++) {
for (int y = x; y < 99; y++) {
for (int z = y; z < 101; z++) {
... | #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;
for (int i = 1; i < n + 1; i++) {
int ans = 0;
for (int x = 1; x < 45; x++) {
for (int y = x; y < 60; y++) {
for (int z = y; z < 101; z++) {
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02608 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma region Macros
/***
* @author uesugi
* @file AtCoder用テンプレート
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define _OVERLOAD3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma region Macros
/***
* @author uesugi
* @file AtCoder用テンプレート
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define _OVERLOAD3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(... | replace | 701 | 704 | 701 | 704 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int cnt ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int cnt ... | replace | 18 | 22 | 18 | 25 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans =... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans =... | replace | 19 | 22 | 19 | 22 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vect;
int k = 3;
int product = 1, j = 1, a, b, c, i = 1;
while (product <= ((N + 10) * (N + 10))) {
product = j * j;
vect.push_back(product);
j++;
}
// cout<<vect.size()<<"\n";
vector<int>... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vect;
int k = 3;
int product = 1, j = 1, a, b, c, i = 1;
while (product <= 10 * N) {
product = j * j;
vect.push_back(product);
j++;
}
// cout<<vect.size()<<"\n";
vector<int> vect1(N, 0);
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int func(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
for (int j = 1; j <= sqrt(n); j++) {
for (int k = 1; k <= sqrt(n); k++) {
if (i * i + j * j + k * k + i * j + j * k + k * i == n)
cnt++;
}
}
}
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int func(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
for (int j = 1; j <= i; j++) {
for (int k = 1; k <= j; k++) {
if (i * i + j * j + k * k + i * j + j * k + k * i == n) {
if (i > j && j > k)
cnt... | replace | 7 | 11 | 7 | 19 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define FOR(i, f, t) for (int i = int(f); i <= int(t); i++)
#define RFOR(i, f, t) for (int i = int(f); i >= int(t); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define FOR(i, f, t) for (int i = int(f); i <= int(t); i++)
#define RFOR(i, f, t) for (int i = int(f); i >= int(t); i--)
#de... | replace | 34 | 36 | 34 | 36 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
// エイシングプロコン2020
// C問題
int main() {
int n;
cin >> n;
int ans[10050] = {0};
for (int i = 1; i <= n; i++) {
int v;
for (int j = 1; j * j <= n; j++) {
for (int k = 1; k * k <= n; k++) {
for (int l = 1; l * l <= n; l++) {
v = j * j + k * k + ... | #include <iostream>
using namespace std;
// エイシングプロコン2020
// C問題
int main() {
int n;
cin >> n;
int ans[10050] = {0};
int v;
for (int i = 1; i <= 105; i++) {
for (int j = 1; j <= 105; j++) {
for (int k = 1; k <= 105; k++) {
v = i * i + j * j + k * k + i * j + j * k + k * i;
if (v < 10... | replace | 8 | 17 | 8 | 15 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
void c_xys_triplets(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i < 6) {
cout << 0 << endl;
continue;
}
int max = (i + 3) / 6;
int cnt = 0;
for (i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
void c_xys_triplets(void) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i < 6) {
cout << 0 << endl;
continue;
}
int max = (i + 3) / 6;
int cnt = 0;
for (i... | replace | 24 | 26 | 24 | 36 | TLE | |
p02608 | C++ | Runtime Error | /// in the name of ALLAH
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
/// pre calculate
int ar[10005];
int mx = 10000;
memset(ar, 0, sizeof(ar));
for (int i = 1; i <= sqrt(n); i++) {
for (int j = 1; j <= sqrt(n); j++) {
for (int k = 1; k <= sq... | /// in the name of ALLAH
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
/// pre calculate
int ar[10005];
int mx = 10000;
memset(ar, 0, sizeof(ar));
for (int i = 1; i <= sqrt(n); i++) {
for (int j = 1; j <= sqrt(n); j++) {
for (int k = 1; k <= sq... | replace | 15 | 16 | 15 | 17 | 0 | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02608 | 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;
int main() {
int N;
cin >> N;
vector<int> ans(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++) {
ans[x * x + y * y + z ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> ans(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 calc = x * x + y *... | replace | 14 | 15 | 14 | 18 | -6 | malloc(): corrupted top size
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<int> x(10000);
int main() {
int n, a = 0;
cin >> n;
if (n % 3 == 0) {
a = n / 3;
} else {
a = n / 3 + 1;
}
int z = sqrt(a) + 1;
for (int i = 1; i <= a; i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
vector<int> x(10000);
int main() {
int n, a = 0;
cin >> n;
for (int i = 1; i <= 99; i++) {
for (int j = 1; j <= 99; ++j) {
for (int k = 1; k <= 99; ++k) {
if ... | replace | 9 | 18 | 9 | 12 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int s = 1; s <= n; s++) {
int count = 0;
for (int i = 1; i <= sqrt(s); i++) {
for (int j = 1; j < sqrt(s); j++) {
for (int k = 1; k < sqrt(s); k++) {
if ((i * i) + (j * j) + (k * k) + (i * j) + (j * ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int s = 1; s <= n; s++) {
int count = 0;
for (int i = 1; i <= sqrt(s); i++) {
for (int j = 1; j < sqrt(s); j++) {
for (int k = 1; k < sqrt(s); k++) {
if ((i * i) + (j * j) + (k * k) + (i * j) + (j * ... | insert | 14 | 14 | 14 | 17 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | replace | 21 | 22 | 21 | 23 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int N;
std::cin >> N;
int f;
for (int n = 1; n <= N; ++n) {
f = 0;
for (int x = 1; x * x < N; ++x) {
for (int y = 1; y * y < N - x * x; ++y) {
for (int z = 1; z * z < N - x * x - y * y; ++z) {
... | #include <iostream>
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int N;
std::cin >> N;
int f;
for (int n = 1; n <= N; ++n) {
f = 0;
for (int x = 1; x * x < n; ++x) {
for (int y = 1; y * y < n - x * x - x * y; ++y) {
for (int z = 1; z * z <= n - x * x - y * y - x *... | replace | 12 | 15 | 12 | 16 | TLE | |
p02608 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#defi... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
#define ft first
#define sc second
#defi... | replace | 47 | 51 | 47 | 52 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̒萔 (10��9��)
const int mod = 1000000007;
struct mint {... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
const int INF = 1001001001;
// mint�p�̒萔 (10��9��)
const int mod = 1000000007;
struct mint {... | replace | 63 | 68 | 63 | 73 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
int ans = 0;
for (int x = 1; x * x <= i; x++) {
for (int y = 1; x * x + y * y <= i; y++) {
for (int z = 1; x * x + y * y + z * z <= i; z++) {
if (x * x + y * y + z * z + ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
int ans = 0;
for (int x = 1; x * x <= i; x++) {
for (int y = 1; x * x + y * y <= i; y++) {
// for (int z = 1; x * x + y * y + z * z <= i; z++) {
// if (x * x + y * y + ... | replace | 10 | 14 | 10 | 24 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define M 1000000007
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int count = 0;
for (int j = 1; j * j <= i; j++) {
for (int k = 1; k * k <= i; k++) {
for (int l = 1; l * l <= i; l++) {
if (j... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define M 1000000007
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int count = 0;
for (int j = 1; j * j <= i; j++) {
for (int k = j; k * k <= i; k++) {
for (int l = k; l * l <= i; l++) {
if (j... | replace | 11 | 15 | 11 | 21 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
signed main() {
int n, ans, date[10000] = {};
int x = 1, y = 1, z = 1;
cin >> n;
for (int i = 1; i <= (int)sqrt(n); i++) {
for (int j = 1; j <= (int)sqrt(n); j++) {
for (int k = 1; k <= (int)sqrt(n); k++) {
date[i * i + j * j + ... | #include <bits/stdc++.h>
using namespace std;
#define int int64_t
signed main() {
int n, ans, date[100000] = {};
int x = 1, y = 1, z = 1;
cin >> n;
for (int i = 1; i <= (int)sqrt(n); i++) {
for (int j = 1; j <= (int)sqrt(n); j++) {
for (int k = 1; k <= (int)sqrt(n); k++) {
date[i * i + j * j +... | replace | 4 | 5 | 4 | 5 | 0 | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ... | replace | 414 | 415 | 414 | 415 | -11 | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
int main(void) {
int n;
long long s;
std::cin >> n;
std::vector<int> f(10100);
for (int x = 1; x <= 110; x++) {
for (int y = 1; y <= 110; y++) {
for (in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
int main(void) {
int n;
long long s;
std::cin >> n;
std::vector<int> f(1000500);
for (int x = 1; x <= 102; x++) {
for (int y = 1; y <= 102; y++) {
for (... | replace | 13 | 17 | 13 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 10202) >= this->size() (which is 10100)
|
p02608 | Python | Runtime Error | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def checker():
ans = [0] * 10000
for a in range(1, 101):
for b in range(1, 101):
for c in range(1, 101):
n = a * a + b * b + c * c + a * b + b * c + c * a
if n > 10000:
... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def checker():
ans = [0] * 10001
for a in range(1, 101):
for b in range(1, 101):
for c in range(1, 101):
n = a * a + b * b + c * c + a * b + b * c + c * a
if n > 10000:
... | replace | 7 | 8 | 7 | 8 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02608/Python/s829430839.py", line 28, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02608/Python/s829430839.py", line 21, in main
ans = checker()
File "/home/al... |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = x; y * y <= n; y++) {
for (int z = y; z * z <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int ans = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = x; y * y <= n; y++) {
for (int z = y; z * z <... | replace | 22 | 23 | 22 | 24 | TLE | |
p02608 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (... | replace | 22 | 33 | 22 | 38 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
c... | insert | 26 | 26 | 26 | 28 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 220000
#define mod 1000000007
#define pi 3.141592653589793238
#define sin(s) scanf("%lld", &s);
#define sout(s) printf("%lld\n", s);
#define in(s) cin >> s
#define in2(a, b) cin >> a >> b
#define in3(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 220000
#define mod 1000000007
#define pi 3.141592653589793238
#define sin(s) scanf("%lld", &s);
#define sout(s) printf("%lld\n", s);
#define in(s) cin >> s
#define in2(a, b) cin >> a >> b
#define in3(... | replace | 56 | 57 | 56 | 62 | TLE | |
p02608 | C++ | Runtime Error | // #pragma GCC optimize ("O3","unroll-loops")
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <numeric>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>... | // #pragma GCC optimize ("O3","unroll-loops")
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <numeric>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>... | replace | 247 | 248 | 247 | 249 | -11 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF ((i64)(1e18))
#define MOD ((i64)(1e9 + 7))
#define REP(i, n) for (i64 i = 0; i < (n); i++)
#define RREP(i, n) for (i64 i = (n)-1; i >= 0; i--)
#define RANGE(i, a, b) for (i64 i = (a); i < (b); i++)
#define RRANGE(i, a, b) for (i64 i = ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define INF ((i64)(1e18))
#define MOD ((i64)(1e9 + 7))
#define REP(i, n) for (i64 i = 0; i < (n); i++)
#define RREP(i, n) for (i64 i = (n)-1; i >= 0; i--)
#define RANGE(i, a, b) for (i64 i = (a); i < (b); i++)
#define RRANGE(i, a, b) for (i64 i = ... | replace | 26 | 31 | 26 | 37 | TLE | |
p02608 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ans(N + 1);
for (int x = 1; x * x <= N; ++x) {
for (int y = 1; y * y <= N; ++y) {
for (int z = 1; z * z <= N; ++z) {
++ans[x * x + y * y + z * z + x * y + y * z + z * x];
}
}
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ans(N + 1);
for (long long x = 1; x * x <= N; ++x) {
for (long long y = 1; y * y <= N; ++y) {
for (long long z = 1; z * z <= N; ++z) {
if (1 <= x * x + y * y + z * z + x * y + y * z + z * x &&
... | replace | 8 | 12 | 8 | 15 | 0 | |
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 * x <= i; x++) {
for (int y = 1; y * y <= i; y++) {
for (int z = 1; z * z <= i; z++) {
if (x * x + y * y + z * z + x * y + y * z + z * x == i)... | #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 <= i; x++) {
for (int y = 1; y * y <= i; y++) {
int b = x + y;
int c = x * x + x * y + y * y - i;
int r = b * b - 4 * c;
if ... | replace | 11 | 14 | 11 | 27 | TLE | |
p02608 | Python | Runtime Error | N = int(input())
cnt = [0] * 6 * 10000 + 1
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
cnt[x**2 + y**2 + z**2 + x * y + y * z + z * x] += 1
for i in range(1, N + 1):
print(cnt[i])
| N = int(input())
cnt = [0] * (6 * 10000 + 1)
for x in range(1, 100):
for y in range(1, 100):
for z in range(1, 100):
cnt[x**2 + y**2 + z**2 + x * y + y * z + z * x] += 1
for i in range(1, N + 1):
print(cnt[i])
| replace | 2 | 3 | 2 | 3 | TypeError: can only concatenate list (not "int") to list | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02608/Python/s028829196.py", line 3, in <module>
cnt = [0] * 6 * 10000 + 1
TypeError: can only concatenate list (not "int") to list
|
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define pii pair<ll, ll>
using namespace std;
#define N 100007
#define pb push_back;
vector<ll> g[N];
#define FAST \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define pii pair<ll, ll>
using namespace std;
#define N 100007
#define pb push_back;
vector<ll> g[N];
#define FAST \
ios_base::sync_with_stdio(false); ... | replace | 19 | 24 | 19 | 31 | TLE | |
p02608 | C++ | Time Limit Exceeded | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int N, x, y, z, i, j, k, l, ans = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
for (j = 0; j < (N / 6); j++) {
x = j + 1;
for (k = j; k < (N - x * x) / 6; k++) {
y = k + 1;
for (l = k; ... | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int N, x, y, z, i, j, k, l, ans = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
for (j = 0; j < (N / 6); j++) {
x = j + 1;
for (k = j; k < (N - x * x) / 6; k++) {
y = k + 1;
for (l = k; ... | insert | 15 | 15 | 15 | 20 | TLE | |
p02608 | 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 rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
#define repi(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2i(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(... | replace | 81 | 82 | 81 | 85 | 0 | |
p02608 | C++ | Runtime Error | // Delete the dynamically allocated memory
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define pr pair<long long, long long>
#define mp(a, b) make_pair(a, b)
#define vr vector<long long>
#define mod1 1000000007
#define mod2 998244353
#define inf 1e18
#define p... | // Delete the dynamically allocated memory
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define pr pair<long long, long long>
#define mp(a, b) make_pair(a, b)
#define vr vector<long long>
#define mod1 1000000007
#define mod2 998244353
#define inf 1e18
#define p... | replace | 43 | 44 | 43 | 46 | 0 | |
p02608 | C++ | Runtime Error | // C++ program to demonstrate __builtin_popcount()
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans[60000] = {0};
for (int i = 1; i <= (n ^ (1 / 2)); i++) {
for (int j = 1; j <= (n ^ (1 / 2)); j++) {
for (int k = 1; k <= (n ^ (1 / 2)); k++) {
an... | // C++ program to demonstrate __builtin_popcount()
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans[60000] = {0};
for (int i = 1; i <= 100; i++) {
for (int j = 1; j <= 100; j++) {
for (int k = 1; k <= 100; k++) {
ans[i * i + j * j + k * k + i * ... | replace | 9 | 12 | 9 | 12 | 0 | |
p02608 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#def... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#def... | insert | 114 | 114 | 114 | 116 | TLE | |
p02608 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include ... | replace | 156 | 210 | 156 | 713 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.