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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02690 | C++ | Time Limit Exceeded | #include <iostream>
#define int long long int
using namespace std;
int X;
signed main() {
cin >> X;
for (int i = -200; i <= 200; i++) {
for (int j = -200; j = 200; j++) {
if (i * i * i * i * i - j * j * j * j * j == X) {
cout << i << " " << j << endl;
return 0;
}
}
}
} | #include <iostream>
#define int long long int
using namespace std;
int X;
signed main() {
cin >> X;
for (int i = -200; i <= 200; i++) {
for (int j = -200; j <= 200; j++) {
if (i * i * i * i * i - j * j * j * j * j == X) {
cout << i << " " << j << endl;
return 0;
}
}
}
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02690 | C++ | Time Limit Exceeded | // #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define mod 1000000007
#d... | // #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define mod 1000000007
#d... | insert | 42 | 42 | 42 | 45 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, string> P;
int main() {
int x;
cin >> x;
long long ans... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, string> P;
int main() {
int x;
cin >> x;
long long ans... | replace | 17 | 19 | 17 | 19 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
long long x;
cin >> x;
for (long a = 0;; a++) {
for (long b = 0; b >= -1000000000; b--) {
long long c = (a * a * a * a * a) - (b * b * b * b * b);
if (x == c) {
... | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
long long x;
cin >> x;
for (long a = -1000;; a++) {
for (long b = 0; b >= -1000; b--) {
long long c = (a * a * a * a * a) - (b * b * b * b * b);
if (x == c) {
co... | replace | 11 | 13 | 11 | 13 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
#define pvec(vec) \
{ \
for (auto v : vec) ... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
#define pvec(vec) \
{ \
for (auto v : vec) ... | replace | 23 | 24 | 23 | 24 | TLE | |
p02690 | C++ | Runtime Error | #include <cstdio>
int main() {
int X;
scanf("%d", X);
for (int A = 0; A < 1000; ++A)
for (int B = -1000; B < A; ++B)
if (A * A * A * A * A - B * B * B * B * B == X) {
printf("%d %d", A, B);
return 0;
}
} | #include <cstdio>
int main() {
int X;
scanf("%d", &X);
for (int A = 0; A < 1000; ++A)
for (int B = -1000; B < A; ++B)
if (A * A * A * A * A - B * B * B * B * B == X) {
printf("%d %d", A, B);
return 0;
}
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%... | replace | 29 | 31 | 29 | 33 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ull = unsigned long long;
#define int long long
using namespace std;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; ... | #include <bits/stdc++.h>
using ull = unsigned long long;
#define int long long
using namespace std;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; ... | replace | 96 | 97 | 96 | 97 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int x, limit;
cin >> x;
limit = pow(x, 1.0 / 5.0);
for (int i = 0; i <= limit; i++) {
for (int j = 0; j >= -limit; j--) {
if (x == pow(i, 5) - pow(j, 5)) {
cout << i << " " << j << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int x, limit;
cin >> x;
limit = pow(x, 1.0 / 5.0);
for (int i = 0; i <= limit; i++) {
for (int j = 0; j >= -limit; j--) {
if (x == pow(i, 5) - pow(j, 5)) {
cout << i << " " << j << endl;
return 0;
}... | replace | 16 | 17 | 16 | 17 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
for (long long i = -3981; i <= 3981; i++)
for (long long n = -3981; n <= 3981; n++)
if ((pow(i, 5)) - (pow(n, 5)) == a) {
cout << i << " " << n;
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
for (long long i = -1000; i <= 1000; i++)
for (long long n = -1000; n <= 1000; n++)
if ((pow(i, 5)) - (pow(n, 5)) == a) {
cout << i << " " << n;
return 0;
}
return 0;
}
| replace | 5 | 7 | 5 | 7 | TLE | |
p02690 | 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;
typedef pair<int, int> P;
int main() {
ll x;
cin >> x;
ll a5, b5;
for (int i = -10000; i <= 10000; i++) {
for (int j = -10000; j <= 10000; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll x;
cin >> x;
ll a5, b5;
for (int i = -1000; i <= 1000; i++) {
for (int j = -1000; j <= 1000; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
pr... | replace | 11 | 13 | 11 | 13 | TLE | |
p02690 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long // −9·10^18 to 9·10^18
#define lll __int128_t // −10^38 to 10^38
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef map<int, int> mi;
// const
#define EPS 1e-9
#d... | #include "bits/stdc++.h"
using namespace std;
#define int long long // −9·10^18 to 9·10^18
#define lll __int128_t // −10^38 to 10^38
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef map<int, int> mi;
// const
#define EPS 1e-9
#d... | replace | 65 | 66 | 65 | 66 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
LLONG ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
LLONG ... | replace | 25 | 27 | 25 | 27 | TLE | |
p02690 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cfenv>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | replace | 44 | 50 | 44 | 52 | TLE | |
p02690 | C++ | Runtime Error | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | /*
vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu
rtll==??>>;::::~~~~......`.``````````````````
..J77!`````````...`..._T,~~~~:::;;>??==lttrrv
tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` ``
.,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ... | replace | 174 | 185 | 174 | 180 | 0 | |
p02690 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | replace | 78 | 80 | 78 | 80 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int64_t rootx = 0;
while (rootx * rootx <= x) {
rootx++;
}
rootx--;
vector<int64_t> factors(0);
for (int64_t i = 1; i <= rootx; i++) {
if (x % i == 0) {
factors.push_back(i);
if (i != x / i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int64_t rootx = 0;
while (rootx * rootx <= x) {
rootx++;
}
rootx--;
vector<int64_t> factors(0);
for (int64_t i = 1; i <= rootx; i++) {
if (x % i == 0) {
factors.push_back(i);
if (i != x / i) {
... | replace | 31 | 32 | 31 | 32 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi... | replace | 42 | 44 | 42 | 44 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template <class T> inline bool chmin(T &a, T b) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template <class T> inline bool chmin(T &a, T b) {
if... | replace | 91 | 99 | 91 | 97 | TLE | |
p02690 | C++ | Runtime Error | /*
[ ( ^ _ ^ ) ]
*/
// problem: atc/abc166_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
int main() {
ll x;
scanf("%lld", &x);
for (ll a = -100; a <= 100; a++) {
for (ll b = -100; b <= 100; b++) {
if (pow(a, 5) - pow(b, 5) == x) {
printf("%lld %lld... | /*
[ ( ^ _ ^ ) ]
*/
// problem: atc/abc166_d
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
int main() {
ll x;
scanf("%lld", &x);
ll l = 2000;
for (ll a = 0; a <= l; a++) {
for (ll b = -l; b <= l; b++) {
if (pow(a, 5) - pow(b, 5) == x) {
printf("%ll... | replace | 12 | 14 | 12 | 15 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
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 < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
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 < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | replace | 52 | 53 | 52 | 53 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pr(x) cout << x << endl;
#define pr2(x, y) cout << x << " " << y... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define pr(x) cout << x << endl;
#define pr2(x, y) cout << x << " " << y... | replace | 43 | 45 | 43 | 45 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ld long double
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define outdeb(fir, sec, thr) cout << fir << ":" << sec << ":" << thr << endl
int main() {
ll x;
cin >>... | #include <bits/stdc++.h>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define ld long double
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define outdeb(fir, sec, thr) cout << fir << ":" << sec << ":" << thr << endl
int main() {
ll x;
cin >>... | replace | 14 | 16 | 14 | 16 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inc... | insert | 88 | 88 | 88 | 89 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define PI 3.14159265358979
typedef long long int ll... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
#define PI 3.14159265358979
typedef long long int ll... | replace | 29 | 31 | 29 | 31 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
template <class _T> inline void read(_T &_a) {
bool f = 0;
char _c = getchar();
_a = 0;
while (_c < '0' || _c > '9') {
if (_c == '-')
f = 1;
_c = getchar();
}
wh... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
template <class _T> inline void read(_T &_a) {
bool f = 0;
char _c = getchar();
_a = 0;
while (_c < '0' || _c > '9') {
if (_c == '-')
f = 1;
_c = getchar();
}
wh... | replace | 25 | 26 | 25 | 26 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define etm \
cerr << "Time elapse... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define etm \
cerr << "Time elapse... | insert | 373 | 373 | 373 | 378 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) ... | replace | 166 | 172 | 166 | 175 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n;
cin >> n;
for (ll a = -4000; a <= 4000; a++) {
for (ll b = -4000; b <= 4000; b++)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n;
cin >> n;
for (ll a = -1000; a <= 1000; a++) {
for (ll b = -1000; b <= 1000; b++)... | replace | 16 | 18 | 16 | 18 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int64_t pow(int64_t n, int64_t r) {
int ret = 1;
for (int i = 0; i < r; i++) {
ret *= n;
}
return n;
}
int main(void) {
int64_t X;
cin >> X;
for (int i = 6208; i > -6208; i--) {
for (int j = 6208; j > -6208; j--) {
if ((pow(i, 5) - pow(j, 5)) ... | #include <bits/stdc++.h>
using namespace std;
int64_t pow(int64_t n, int64_t r) {
int ret = 1;
for (int i = 0; i < r; i++) {
ret *= n;
}
return n;
}
int main(void) {
int64_t X;
cin >> X;
for (int i = 1000; i > -1000; i--) {
for (int j = 1000; j > -1000; j--) {
if ((pow(i, 5) - pow(j, 5)) ... | replace | 15 | 17 | 15 | 17 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define rep(i, l, r) for (register int i = l; i <= r; ++i)
int MAXN = 100010;
inline int read() {
register char cc = getchar();
register int cn(0), flus(1);
while (cc > '9' || cc < '0') {
if (cc == '-')
flus = -flus;
cc = getchar();
}
while (cc >= '... | #include <bits/stdc++.h>
#define int long long
#define rep(i, l, r) for (register int i = l; i <= r; ++i)
int MAXN = 100010;
inline int read() {
register char cc = getchar();
register int cn(0), flus(1);
while (cc > '9' || cc < '0') {
if (cc == '-')
flus = -flus;
cc = getchar();
}
while (cc >= '... | replace | 20 | 22 | 20 | 22 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long x, a, b;
long aa, bb;
long i, j, k;
cin >> x;
for (i = 1; i * i <= x; i++) {
if (x % i == 0) {
aa = 0;
bb = 0;
for (a = 0; a <= x; a++) {
aa = pow(a, 5);
bb = pow(a - i, 5);
if (a - i <= ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long x, a, b;
long aa, bb;
long i, j, k;
cin >> x;
for (a = -120; a <= 120; a++) {
for (b = -120; b <= 120; b++) {
aa = pow(a, 5);
bb = pow(b, 5);
if (aa - bb == x) {
cout << a << " " << b << endl;
re... | replace | 9 | 37 | 9 | 16 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
/*
string s;
cin>>s;
if(s=="ABC")
{
cout<<"ARC"<<endl;
}
else
{
cout<<"ABC"<<endl;
}
*/
/*
int n,k;
cin>>n>>k;
map <int,int> mp;
for(int i=1;i<=k;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
/*
string s;
cin>>s;
if(s=="ABC")
{
cout<<"ARC"<<endl;
}
else
{
cout<<"ABC"<<endl;
}
*/
/*
int n,k;
cin>>n>>k;
map <int,int> mp;
for(int i=1;i<=k;... | replace | 83 | 97 | 83 | 90 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5 + 6;
const int mod = 1e9 + 107;
const int inf = 1e8;
int h[N];
int mx[N];
void solve() {
ll x;
cin >> x;
for (ll i = 1; i * i <= x; i++) {
if (x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5 + 6;
const int mod = 1e9 + 107;
const int inf = 1e8;
int h[N];
int mx[N];
void solve() {
ll x;
cin >> x;
for (ll i = 1; i * i <= x; i++) {
if (x... | replace | 17 | 18 | 17 | 18 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int X;
cin >> X;
long long int A = 0, B = 0;
if (X == 1) {
cout << 1 << " " << 0 << endl;
} else {
int f = 0;
for (int i = 10000; i >= -10000; --i) {
for (int j = 9999; j >= -10000; --j) {
A = pow(i, 5);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int X;
cin >> X;
long long int A = 0, B = 0;
if (X == 1) {
cout << 1 << " " << 0 << endl;
} else {
int f = 0;
for (int i = 1000; i >= -1000; --i) {
for (int j = 999; j >= -1000; --j) {
A = pow(i, 5);
B = ... | replace | 13 | 15 | 13 | 15 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int x;
std::cin >> x;
for (ll i = -10000; i <= 10000; i++) {
for (ll j = 10000; j >= -10000; j--) {
ll a = pow(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main() {
int x;
std::cin >> x;
for (ll i = -1000; i <= 1000; i++) {
for (ll j = 1000; j >= -1000; j--) {
ll a = pow(i, 5)... | replace | 9 | 11 | 9 | 11 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
for (int i = 1; i <= 10000; i++)
for (int j = 0; j <= i; j++) {
if (pow(i, 5) + pow(j, 5) == x) {
printf("%d %d", i, -j);
return 0;
}
}
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
for (int i = 1; i <= 1000; i++)
for (int j = -1000; j <= i; j++) {
if (pow(i, 5) + pow(j, 5) == x) {
printf("%d %d", i, -j);
return 0;
}
}
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02690 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <... | replace | 82 | 83 | 82 | 83 | 1 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define all(n) n.begin(), n.end()
#define yn(x) cout << (x ? "Yes" : "No") << endl;
ll gozyou(ll n) {
ll a = 1;
rep1(i, 5) a *= n;
return a;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define all(n) n.begin(), n.end()
#define yn(x) cout << (x ? "Yes" : "No") << endl;
ll gozyou(ll n) {
ll a = 1;
rep1(i, 5) a *= n;
return a;
}
int main(... | replace | 17 | 22 | 17 | 25 | TLE | |
p02690 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
i64 p5(i64 x) { return x * x * x * x * x; }
int main(void) {
i64 x;
cin >> x;
vi P5(68);
for (i64 i = 1; i < 68; i++)
P5[i] = p5(i);
for (i64 a = 1; true; a++)... | #define _GLIBCXX_DEBUG
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
i64 p5(i64 x) { return x * x * x * x * x; }
int main(void) {
i64 x;
cin >> x;
vi P5(120);
for (i64 i = 1; i < 120; i++)
P5[i] = p5(i);
for (i64 a = 1; true; a+... | replace | 12 | 14 | 12 | 14 | 0 | |
p02690 | 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>;
ll f(ll A, ll B) { return A * A * A * A * A - B * B * B * B * B; }
int main() {
ll x;
cin >> x;
map<ll, P> mp;
for (ll A = -1000; A <= 1000; A++) {
for (ll B = -1000;... | #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>;
ll f(ll A, ll B) { return A * A * A * A * A - B * B * B * B * B; }
int main() {
ll x;
cin >> x;
map<ll, P> mp;
for (ll A = -500; A <= 500; A++) {
for (ll B = -500; B ... | replace | 10 | 12 | 10 | 12 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long X, A, B;
cin >> X;
for (A = 0; A <= 100000; A++) {
for (B = -A; B <= 0; B++) {
if (pow(A, 5) - pow(B, 5) == X) {
cout << A << " " << B << endl;
... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long X, A, B;
cin >> X;
for (A = -150; A <= 150; A++) {
for (B = -150; B <= 150; B++) {
if (pow(A, 5) - pow(B, 5) == X) {
cout << A << " " << B << endl... | replace | 9 | 11 | 9 | 11 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | replace | 279 | 280 | 279 | 280 | 0 | |
p02690 | 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 n, x, m, a, b, c, k;
int main() {
for (cin >> x, a = -118; a < 120; a++) {
ll a5 = pow(a, 5);
for (b = -119; b < 119; b++) {
ll b5 = pow(b, 5);
if (a5 - b5 == x)
return p... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int n, x, m, a, b, c, k;
int main() {
for (cin >> x, a = -118; a < 120; a++) {
ll a5 = pow(a, 5);
for (b = -119; b < 119; b++) {
ll b5 = pow(b, 5);
if (a5 - b5 == x) {
printf... | replace | 10 | 12 | 10 | 14 | 4 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int X;
cin >> X;
for (int i = 0; i < 100; i++)
for (int j = 0; j < 100; j++)
if (i * i * i * i * i + j * j * j * j * j == X) {
cout << i << ' ' << 0 - j << endl;
return 0;
}
for (int i = 1;; i++) ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int X;
cin >> X;
for (int i = 0; i < 100; i++)
for (int j = 0; j < 100; j++)
if (i * i * i * i * i + j * j * j * j * j == X) {
cout << i << ' ' << 0 - j << endl;
return 0;
}
for (int i = 1;; i++) ... | replace | 13 | 14 | 13 | 14 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ... | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ... | replace | 125 | 126 | 125 | 126 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ll _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ll _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ul = unsigned long;
using ull = unsigned long long;
#define vec vector
#define rep(_i, _n) for (ll _i = 0; _i < _n; _i++)
#define rep2(_i, _s, _n) for (ll _i = _s; _i < _n; _i++)
#define elif else if
#define push(_a) push_back(_a)
#define fullSo... | replace | 39 | 51 | 39 | 45 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>
using Graph = vector<vector<int>>;
// header area
int main() {
long lo... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>
using Graph = vector<vector<int>>;
// header area
int main() {
long lo... | replace | 24 | 25 | 24 | 25 | TLE | |
p02690 | Python | Time Limit Exceeded | res = {}
for i in range(-1000, 1000):
for j in range(-1000, 1000):
ans = i**5 - j**5
res[ans] = (i, j)
n = int(input())
print(res[n][0], res[n][1])
| res = {}
for i in range(-500, 500):
for j in range(-500, 500):
ans = i**5 - j**5
res[ans] = (i, j)
n = int(input())
print(res[n][0], res[n][1])
| replace | 1 | 3 | 1 | 3 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> yaku;
for (int i = 1; i * i <= a; i++) {
if (a % i == 0) {
yaku.push_back(i);
if (i * i != a)
yaku.push_back(a ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
int n, m;
for (n = -119; n < 120; n++) {
for (m = -119; m < 120; m++) {
if (pow(n, 5) - pow(m, 5) == a) {
cout << n << " " << m <... | replace | 11 | 24 | 11 | 17 | TLE | |
p02690 | Python | Time Limit Exceeded | x = int(input())
a = 0
b = 0
for i in range(-1000, 1000):
for j in range(-1000, 1000):
if (i**5) - (j**5) == x:
a = i
b = j
break
print("{} {}".format(a, b))
| x = int(input())
a = 0
b = 0
for i in range(-500, 500):
for j in range(-500, 500):
if (i**5) - (j**5) == x:
a = i
b = j
break
print("{} {}".format(a, b))
| replace | 3 | 5 | 3 | 5 | TLE | |
p02690 | Python | Time Limit Exceeded | x = int(input())
a, b = 0, 0
nx = "a"
while True:
if a**5 - b**5 == x:
print("{} {}".format(a, b))
break
if -(a**5) - b**5 == x:
print("{} {}".format(-a, b))
break
if a**5 - (-b) ** 5 == x:
print("{} {}".format(a, -b))
break
if -(a**5) - (-b) ** 5 == x:
... | x = int(input())
for b in range(1000):
for a in range(1000):
if a**5 - b**5 == x:
print("{} {}".format(a, b))
exit()
if (-a) ** 5 - b**5 == x:
print("{} {}".format(-a, b))
exit()
if a**5 - (-b) ** 5 == x:
print("{} {}".format(a, -b)... | replace | 1 | 22 | 1 | 15 | TLE | |
p02690 | Python | Time Limit Exceeded | import sys
x = int(input())
for i in range(-2000, 2000):
for j in range(-2000, 2000):
if i**5 - j**5 == x:
print(i, j)
sys.exit()
| import sys
x = int(input())
for i in range(-1000, 1000):
for j in range(-1000, 1000):
if i**5 - j**5 == x:
print(i, j)
sys.exit()
| replace | 4 | 6 | 4 | 6 | TLE | |
p02690 | Python | Time Limit Exceeded | X = int(input())
# for b in range(65, -64, -1):
for b in range(1000000, -1000000, -1):
a = (X + b**5) ** 0.2
# print('b a', b, a)
if type(a) == complex:
if a.imag != 0:
continue
print(int(a.real), b)
exit()
elif a.is_integer():
print(int(a), b)
exit()... | X = int(input())
for a in range(-1000, 1000):
for b in range(-1000, 1000):
if a**5 - b**5 == X:
print(a, b)
exit()
| replace | 2 | 26 | 2 | 7 | TLE | |
p02690 | Python | Runtime Error | """
A^5 - B^5
= (A - B)(A^4 + A^3*B + A^2*B^2 + A*B^3 + B^4)
= (A - B){(A + B) * (A^3 + B^3) + A^2*B^2}
= (A - B){(A + B)^2 * (A^2 - AB + B^2) + A^2*B^2}
-> (A + B)^2 > 1, (A^2 - AB + B^2) > 1, A^2*B^2 > 1.
"""
def main():
print(*solve())
def solve():
X = int(input())
for a in range(-100, 100):
... | """
A^5 - B^5
= (A - B)(A^4 + A^3*B + A^2*B^2 + A*B^3 + B^4)
= (A - B){(A + B) * (A^3 + B^3) + A^2*B^2}
= (A - B){(A + B)^2 * (A^2 - AB + B^2) + A^2*B^2}
-> (A + B)^2 > 1, (A^2 - AB + B^2) > 1, A^2*B^2 > 1.
"""
def main():
print(*solve())
def solve():
X = int(input())
for a in range(-1000, 1000):
... | replace | 17 | 19 | 17 | 19 | 0 | |
p02690 | Python | Time Limit Exceeded | X = int(input())
CNT = 2000
for a in range(-CNT, CNT):
for b in range(-CNT, CNT):
if X == a**5 - b**5:
print(a, b)
exit()
| X = int(input())
CNT = 500
for a in range(-CNT, CNT):
for b in range(-CNT, CNT):
if X == a**5 - b**5:
print(a, b)
exit()
| replace | 2 | 3 | 2 | 3 | TLE | |
p02690 | Python | Runtime Error | x = int(input())
my_dict = dict()
for i in range(1000):
my_dict[i**5] = i
for i in range(-1000, 1000):
target = x + (i**5)
if (-target) in my_dict:
print(-my_dict[target], i)
exit()
elif target in my_dict:
print(my_dict[target], i)
exit()
| x = int(input())
my_dict = dict()
for i in range(1000):
my_dict[i**5] = i
for i in range(-1000, 1000):
target = x + (i**5)
if (-target) in my_dict:
print(-my_dict[-target], i)
exit()
elif target in my_dict:
print(my_dict[target], i)
exit()
| replace | 10 | 11 | 10 | 11 | 0 | |
p02690 | Python | Time Limit Exceeded | X = int(input())
a = 1
flug = True
while flug:
b = -119
while b <= 118:
if a**5 - b**5 == X:
print(a, b)
flug = False
break
else:
b += 1
| X = int(input())
a = 1
flug = True
while flug:
b = -119
while b <= 118:
if a**5 - b**5 == X:
print(a, b)
flug = False
break
else:
b += 1
a += 1
| insert | 12 | 12 | 12 | 13 | TLE | |
p02690 | Python | Time Limit Exceeded | def prime_factorize(n):
"""Calculate prime factorization and return unique numbers and 1."""
ans = set()
ans_add = ans.add
ans_add(1)
while n % 2 == 0:
ans_add(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
ans_add(f)
n //= f
else:
... | def prime_factorize(n):
"""Calculate prime factorization and return unique numbers and 1."""
ans = set()
ans_add = ans.add
ans_add(1)
while n % 2 == 0:
ans_add(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
ans_add(f)
n //= f
else:
... | insert | 42 | 42 | 42 | 44 | TLE | |
p02690 | Python | Runtime Error | x = int(input())
rs = [i**5 for i in range(300)]
for r in rs:
if (x - r) in rs:
print(rs.index(r), -rs.index(x - r))
elif (x + r) in rs:
print(rs.index(r), rs.index(x - r))
else:
continue
break
| x = int(input())
rs = [i**5 for i in range(300)]
for r in rs:
if r <= x:
if x - r in rs:
print(rs.index(r), -rs.index(x - r))
break
if r > x:
if r - x in rs:
print(rs.index(r), rs.index(r - x))
break
| replace | 5 | 12 | 5 | 13 | 0 | |
p02690 | Python | Runtime Error | x = int(input())
for i in range(x // 2 + 1):
if pow(x - pow(i, 5), 1 / 5).is_integer():
print(i, int(-pow(x - pow(i, 5), 1 / 5)))
exit()
| import numpy as np
def main():
x = int(input())
A = np.arange(-120, 120)
a = A**5
for i, a_1 in enumerate(a):
for j, a_2 in enumerate(a):
if a_1 - a_2 == x:
print(A[i], A[j])
return
if __name__ == "__main__":
main()
| replace | 0 | 5 | 0 | 16 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < 1000000000; i++) {
for (int j = i - 1; (i * i * i * i * i) - (j * j * j * j * j) > 0; j--) {
long long num = (i * i * i * i * i) - (j * j * j * j * j);
if (num == ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int ans1 = 0;
int ans2 = 0;
for (int i = 0; i < 5000000; i++) {
for (int j = i - 1; (i * i * i * i * i) - (j * j * j * j * j) > 0; j--) {
long long num = (i * i * i * i * i) - (j * j * j * j * j);
if (num == N) ... | replace | 8 | 9 | 8 | 9 | TLE | |
p02690 | Python | Time Limit Exceeded | x = int(input())
a = int(x**0.2)
b = 0
while a**5 - b**5 != x:
b -= 1
print(a, b)
| x = int(input())
for a in range(-1000, 1000):
for b in range(-1000, 1000):
if a**5 - b**5 == x:
print(a, b)
quit()
| replace | 1 | 6 | 1 | 6 | TLE | |
p02690 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <... | replace | 45 | 46 | 45 | 46 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector... | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector... | replace | 234 | 240 | 234 | 238 | TLE | |
p02691 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | // #define _GLIBCXX_DEBUG//TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = ... | replace | 0 | 1 | 0 | 1 | TLE | |
p02691 | 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;
vector<ll> A(n);
rep(i, n) cin >> A[i];
int ans = 0;
rep(i, n - 1) {
for (int j = i + 1; j < n; j++) {
if (j - i == A[i] + A[... | #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<ll> a(n);
rep(i, n) cin >> a[i];
map<int, int> mp;
ll ans = 0;
rep(i, n) {
int sa = i - a[i];
// i<j j-i==Ai+Aj Ai+i... | replace | 9 | 17 | 9 | 19 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define int long long
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef __int128 _int;
const int maxn ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define int long long
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef __int128 _int;
const int maxn ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
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;
using P = pair<int, int>;
typedef long long ll;
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 | 261 | 262 | 261 | 266 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll n;
cin >> n;
vll a(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll n;
cin >> n;
vll a(... | replace | 28 | 32 | 28 | 31 | TLE | |
p02691 | 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> plus(N), minus(300000, 0);
rep(i, N) {
int A;
cin >> A;
plus[i] = i + 1 + A;
if (i + 1 - A > 0) {
minus.at(i + 1 - A)++;
}
}
... | #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> plus(N), minus(300000, 0);
rep(i, N) {
int A;
cin >> A;
plus[i] = i + 1 + A;
if (i + 1 - A > 0) {
minus.at(i + 1 - A)++;
}
}
... | replace | 18 | 19 | 18 | 23 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n, ans = 0;
LL a[2000100], b[2000100];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i > a[i]) {
b[i - a[i]]++;
}
}
for (int i = 1; i <= n; i++) {
if (i > a[i]) {
b[i - a[i]]--;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n, ans = 0;
LL a[2000100], b[2000100];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i > a[i]) {
b[i - a[i]]++;
}
}
for (int i = 1; i <= n; i++) {
if (i > a[i]) {
b[i - a[i]]--;
}
... | replace | 18 | 19 | 18 | 21 | 0 | |
p02691 | 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;
int A[n];
rep(i, n) cin >> A[i];
ll count = 0;
rep(i, n) {
for (int j = i + A[i]; j < n; j++) {
if (A[i] + A[j] == j - i)
count++;
}
}
co... | #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;
int A[n];
rep(i, n) cin >> A[i];
map<int, int> mp;
rep(i, n) mp[A[i] + i + 1]++;
ll ans = 0;
rep(i, n) ans += mp[i + 1 - A[i]];
cout << ans << endl;
}
| replace | 10 | 18 | 10 | 15 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<int, int>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
const int maxn = 5e3 + 35;
map<LL, int> mp;
int n, a[maxn];
int main() {
cin >> n;
LL ans = 0;
for (int i = 1; i <= n... | #include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<int, int>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
const int maxn = 3e5 + 35;
map<LL, int> mp;
int n, a[maxn];
int main() {
cin >> n;
LL ans = 0;
for (int i = 1; i <= n... | replace | 9 | 10 | 9 | 10 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N, 0);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N, 0);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}... | replace | 40 | 41 | 40 | 42 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define scd second
#define fst first
#define mkp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vlong;
typedef vector<vint> vvint;
typedef vector<vlong> vvlong;
typ... | #include <bits/stdc++.h>
#define scd second
#define fst first
#define mkp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vlong;
typedef vector<vint> vvint;
typedef vector<vlong> vvlong;
typ... | replace | 29 | 30 | 29 | 30 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, M = 1e9 + 7, OO = 0x3f3f3f3f;
typedef long long ll;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const double Pii ... | #include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, M = 1e9 + 7, OO = 0x3f3f3f3f;
typedef long long ll;
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const double Pii ... | replace | 23 | 24 | 23 | 25 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, A[200005], B[200005];
long long ans;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i - A[i] > 0) {
B[i - A[i]]++;
}
}
for (int i = 0; i < N; i++) {
}
for (int i = 0; i < N; i++) {
ans += B[i + A[i]];
}
cou... | #include <bits/stdc++.h>
using namespace std;
int N, A[200005], B[200005];
long long ans;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (i - A[i] > 0) {
B[i - A[i]]++;
}
}
for (int i = 0; i < N; i++) {
}
for (int i = 0; i < N; i++) {
if (i + A[i] < 200005) {
... | replace | 15 | 16 | 15 | 18 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_ll.hpp>
// typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | replace | 53 | 54 | 53 | 56 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Cr7 \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Cr7 \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | replace | 7 | 8 | 7 | 8 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back... | replace | 31 | 32 | 31 | 32 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LL long long
#define MOD 1000000007
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | #include <bits/stdc++.h>
#define LL long long
#define MOD 1000000007
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.t... | replace | 24 | 29 | 24 | 29 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.14159... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.14159... | replace | 45 | 46 | 45 | 47 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n);
for (auto &&e : a) {
cin >> e;
}
for (int i = 0; i < n; ++i) {
for (int j = i + a[i] + 1; j < n; ++j) {
if (a[j] == j - a[i] - i) {
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n);
for (auto &&e : a) {
cin >> e;
}
map<ll, ll> minus, plus;
for (ll i = 0; i < n; ++i) {
minus[i - a[i]]++;
plus[i + a[i]]++;
}
for (const a... | replace | 12 | 18 | 12 | 19 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | replace | 56 | 57 | 56 | 61 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pa... | replace | 182 | 183 | 182 | 183 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iter... | replace | 83 | 91 | 83 | 85 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int binary_search(vector<int> v, int n) { // sorted v, count v=n
if (v.size() == 0)
return 0;
if (v[0] > n)
return 0;
if (v[v.size() - 1] < n)
return 0;
int l, r, mid,... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int binary_search(vector<int> v, int n) { // sorted v, count v=n
if (v.size() == 0)
return 0;
if (v[0] > n)
return 0;
if (v[v.size() - 1] < n)
return 0;
int l, r, mid,... | replace | 56 | 57 | 56 | 58 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 +... | replace | 17 | 29 | 17 | 26 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | replace | 46 | 50 | 46 | 47 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define PI 3.141592653589793238
#define mod 1000000007
#define endl '\n'
#define fastio \
; ... | #include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define PI 3.141592653589793238
#define mod 1000000007
#define endl '\n'
#define fastio \
; ... | replace | 37 | 45 | 37 | 41 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(v) v.begin(), v.end()
#define ll long long
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<long long>;
using vvll = vector<vll>;
//... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(v) v.begin(), v.end()
#define ll long long
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<long long>;
using vvll = vector<vll>;
//... | insert | 22 | 22 | 22 | 24 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m, cnt = 0, o, p, aa[220000... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int n, m, cnt = 0, o, p, aa[220000... | replace | 28 | 29 | 28 | 31 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vecto... | replace | 50 | 52 | 50 | 54 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | replace | 317 | 318 | 317 | 318 | 0 | |
p02691 | C++ | Runtime Error | /*
Fuad Ashraful Mehmet Islam
University of Asia Pacific,Bangladesh
Date:6th May 2020
ToDo:
https://codeforces.com/problemset/problem/287/B
https://atcoder.jp/contests/abc166/tasks/abc166_e
*/
#include <bits/stdc++.h>
#define dbg(x) cerr << __LINE__ << " where " << #x << " = " << x << endl
#define all(x) (... | /*
Fuad Ashraful Mehmet Islam
University of Asia Pacific,Bangladesh
Date:6th May 2020
ToDo:
https://codeforces.com/problemset/problem/287/B
https://atcoder.jp/contests/abc166/tasks/abc166_e
*/
#include <bits/stdc++.h>
#define dbg(x) cerr << __LINE__ << " where " << #x << " = " << x << endl
#define all(x) (... | replace | 31 | 32 | 31 | 32 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define va vector<long long int> a
#define vb vector<long long int> b
#define M 1000000007
using namespace std;
ll t;
void fast() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
ll power(ll x, ul y, ll p) {
ll res = 1... | #include <bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define va vector<long long int> a
#define vb vector<long long int> b
#define M 1000000007
using namespace std;
ll t;
void fast() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
ll power(ll x, ul y, ll p) {
ll res = 1... | replace | 29 | 30 | 29 | 30 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t n;
cin >> n;
int64_t ans = 0;
vector<int64_t> h(n);
rep(i, n) cin >> h.at(i);
vector<int64_t> cnt(1000005);
rep(i, n) {
cnt.at(h.at(i) + i)++;
if (i - h.at(i) >= 0 && i - h.at(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t n;
cin >> n;
int64_t ans = 0;
vector<int64_t> h(n);
rep(i, n) cin >> h.at(i);
vector<int64_t> cnt(1000005);
rep(i, n) {
if (h.at(i) + i <= 1000000)
cnt.at(h.at(i) + i)++;
... | replace | 12 | 13 | 12 | 14 | 0 | |
p02691 | C++ | Time Limit Exceeded | // Contest: AtCoder Beginner Contest 166 (https://atcoder.jp/contests/abc166)
// Problem: E: This Message Will Self-Destruct in 5s
// (https://atcoder.jp/contests/abc166/tasks/abc166_e)
// region {{{ boilerplate
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmat... | // Contest: AtCoder Beginner Contest 166 (https://atcoder.jp/contests/abc166)
// Problem: E: This Message Will Self-Destruct in 5s
// (https://atcoder.jp/contests/abc166/tasks/abc166_e)
// region {{{ boilerplate
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmat... | replace | 93 | 95 | 93 | 95 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<vector<int>> S(300000);
rep(i, N) {
in... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<vector<int>> S(300000);
rep(i, N) {
in... | insert | 26 | 26 | 26 | 30 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.