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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int H[11000];
bool good[11000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
for (int i = 0; i < N; i++)
cin >> H[i];
fill(good, good + N, 1);
for (int i = 0; i < M; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int H[110000];
bool good[110000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
for (int i = 0; i < N; i++)
cin >> H[i];
fill(good, good + N, 1);
for (int i = 0; i < M; i++... | replace | 5 | 7 | 5 | 7 | 0 | |
p02689 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end(... | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end(... | replace | 371 | 404 | 371 | 388 | TLE | |
p02689 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Canuc80k \
cin.tie(0); \
cout.tie(0);
#define I_am ios_base::sync_with_stdio(false);
#define REP(i, a, b) for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Canuc80k \
cin.tie(0); \
cout.tie(0);
#define I_am ios_base::sync_with_stdio(false);
#define REP(i, a, b) for (... | replace | 35 | 54 | 35 | 40 | TLE | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin >>
using namespace std;
int main() {
int n, m, h[n], ma[n];
in n >> m;
for (int i = 1; i <= n; i++) {
in h[i];
ma[i] = ... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin >>
using namespace std;
int main() {
int n, m, h[100000], ma[100000];
in n >> m;
for (int i = 1; i <= n; i++) {
in h[i];
... | replace | 9 | 10 | 9 | 10 | -11 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> /* H(N), */ A(M), B(M);
int H[6];
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
for (int i = 0; i < M; ++i) {
cin >> A[i] >> B[i];
}
vector<vector<int>> g(N);
for (int i = 0; i < M; ++i) {
g[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N), A(M), B(M);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
for (int i = 0; i < M; ++i) {
cin >> A[i] >> B[i];
}
vector<vector<int>> g(N);
for (int i = 0; i < M; ++i) {
g[A[i] - 1].push_bac... | replace | 6 | 8 | 6 | 7 | 0 | |
p02689 | C++ | Runtime Error | #include <array>
#include <iostream>
using namespace std;
int main(void) {
std::array<bool, 10> is_good_list;
std::array<int, 10> height_list;
int n, m;
cin >> n;
cin >> m;
is_good_list.fill(true);
// 展望台の高さを登録
for (int s = 0; s < n; s++) {
int h;
cin >> h;
height_list[s] = h;
}
for ... | #include <array>
#include <iostream>
using namespace std;
int main(void) {
std::array<bool, 100000> is_good_list;
std::array<int, 100000> height_list;
int n, m;
cin >> n;
cin >> m;
is_good_list.fill(true);
// 展望台の高さを登録
for (int s = 0; s < n; s++) {
int h;
cin >> h;
height_list[s] = h;
}... | replace | 6 | 8 | 6 | 8 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<long long> A(M), B(M);
for (long long i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<long long> ans(N, 0);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<long long> A(M), B(M);
for (long long i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<long long> ans(N, 0);
... | replace | 23 | 24 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
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;
typedef pair<int, int> P;
int main(void) {
ll x;
cin >> x;
ll y;
for (int a = -120; a <= x; a++) {
for (int b = -120; b <= x; b++) {
ll ans = pow(a, 5) - pow(b, 5);
if (x == ans) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
typedef pair<int, int> P;
int main(void) {
ll x;
cin >> x;
ll y;
for (int a = -120; a <= 120; a++) {
for (int b = -120; b <= 120; b++) {
ll ans = pow(a, 5) - pow(b, 5);
if (x == a... | replace | 10 | 12 | 10 | 12 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template <class T> void chmax(T &a, T b) { a > b ?: a = b; }
t... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template <class T> void chmax(T &a, T b) { a > b ?: a = b; }
t... | replace | 20 | 21 | 20 | 21 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
int X;
cin >> X;
for (int i = 1;; i++) {
int A = i * i * i * i * i;
int sa = abs(X - A);
for (int j = 0; j < 5; j++)
sa = sqrt(sa);
if (pow(sa,... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
int X;
cin >> X;
for (int A = -150; A <= 150; A++) {
for (int B = -150; B <= 150; B++) {
if (pow(A, 5) - pow(B, 5) == X) {
cout << A << " " << B <<... | replace | 10 | 22 | 10 | 17 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ll X;
cin >> X;
if (X == 1) {
cout << 0 << " " << -1 << endl;
return 0;
}
for (ll i = 1; i < X; i++) {
if (X % i == 0) {
ll X1 = i;
ll X2 = X / i;
for (int b = -X1; b <= X1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ll X;
cin >> X;
for (int i = -1000; i <= 1000; i++) {
for (int j = -1000; j <= 1000; j++) {
if (pow(i, 5) - pow(j, 5) == X) {
cout << i << " " << j << endl;
return 0;
}
}
... | replace | 8 | 25 | 8 | 13 | TLE | |
p02690 | C++ | Time Limit Exceeded | // 2020-05-03 21:21:37
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll x) { return x * x * x * x * x; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll X;
cin >> X;
while (true) {
ll A = -1000;
for (ll B = -1000; B < 1000; B++) {
if (f(A) - f(B) == X) ... | // 2020-05-03 21:21:37
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll f(ll x) { return x * x * x * x * x; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll X;
cin >> X;
int A = 1;
while (f(A) - f(A - 1) < 1000000000) {
for (int B = -200; B < 200; B++) {
if (... | replace | 11 | 14 | 11 | 14 | TLE | |
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>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin >> x;
for (ll i = 0; i < 100000; ++i) {
for (ll j = 0; j < 100000; ++j) {
if (i * i * i * i *... | #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() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin >> x;
map<ll, ll> mp;
mp[0] = 0;
for (ll i = 1; i * i * i * i * i <= 100 * x; i++) {
ll cur = i... | replace | 11 | 17 | 11 | 19 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using ll = long long;
#define rep(i, n) for (ll i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
int main() {
ll x;
cin >> x;
ll a, b;
ll y = sqrt(x);
// cout <<y<<endl;
rep(i, y) {
if (x... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using ll = long long;
#define rep(i, n) for (ll i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
int main() {
ll x;
cin >> x;
ll a, b;
ll y = sqrt(x);
// cout <<y<<endl;
rep(i, y) {
if (x... | replace | 18 | 19 | 18 | 19 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x;
cin >> x;
int a = 0, b = 0;
int temp = 0;
while (1) {
while (pow(a, 5.0) < x) {
a++;
}
if (pow(a, 5.0) == x) {
cout << a << " " << b << endl;
return 0;
}
a--;
temp = pow(a, 5.0);
int val = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int x;
cin >> x;
int a = 0, b = 0;
for (a = -1000; a <= 1000; a++) {
for (b = -1000; b <= 1000; b++) {
if (pow(a, 5.0) - pow(b, 5.0) == x) {
cout << a << " " << b << endl;
return 0;
}
}
}
return 0;
} | replace | 6 | 24 | 6 | 12 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
#define mk make_pair
using namespace std;
const int N = 55;
ll a[N];
map<ll, P> mp;
int main() {
for (ll i = 0; i <= 1000; i++) {
ll y = i;
for (ll x = 1; x <= 4; x++) {
y = y * i;
}
a[i] = y;
}
for (int i = 0; i <= 1000; i... | #include <bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
#define mk make_pair
using namespace std;
const int N = 10005;
ll a[N];
map<ll, P> mp;
int main() {
for (ll i = 0; i <= 1000; i++) {
ll y = i;
for (ll x = 1; x <= 4; x++) {
y = y * i;
}
a[i] = y;
}
for (int i = 0; i <= 1000... | replace | 5 | 6 | 5 | 6 | -11 | |
p02690 | C++ | Time Limit Exceeded | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 大文字判定 isupper(文字) 小文字判定 islower(文... | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 大文字判定 isupper(文字) 小文字判定 islower(文... | replace | 132 | 138 | 132 | 136 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
inline int gi() {
int data = 0, w = 1;
char ch = 0;
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
w = -1, ch = getc... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
inline int gi() {
int data = 0, w = 1;
char ch = 0;
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
w = -1, ch = getc... | replace | 27 | 28 | 27 | 28 | 5 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, m, n) for (ll i = m; i < (n); i++)
#define RFOR(i, m, n) for (ll i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
// #define print(ele) cout << (ele) << "\n"
#define pr... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (ll i = m; i < (n); i++)
#define RFOR(i, m, n) for (ll i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
// #define print(ele) cout << (ele) << "\n"
#define pr... | replace | 31 | 34 | 31 | 34 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n) for (int i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define ... | delete | 29 | 30 | 29 | 29 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
#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)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pl;
#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)... | replace | 43 | 45 | 43 | 45 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | replace | 94 | 122 | 94 | 98 | -6 | *** stack smashing detected ***: terminated
|
p02690 | 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 | 101 | 102 | 101 | 102 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
long long i, j, k, n, m, N, M, ans, X, A, B;
double x;
int main() {
cin >> X;
A = 0;
B = 0;
for (i = 0; i <= X; i++) {
N = i * i * i * ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
long long i, j, k, n, m, N, M, ans, X, A, B;
double x;
int main() {
cin >> X;
A = 0;
B = 0;
for (i = 0; i <= X; i++) {
N = i * i * i * ... | replace | 30 | 31 | 30 | 31 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF ll(1e18)
#define MOD (ll)1e9 + 7
#define print(a) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF ll(1e18)
#define MOD (ll)1e9 + 7
#define print(a) ... | replace | 27 | 29 | 27 | 29 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3... | replace | 28 | 29 | 28 | 29 | -4 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) ((v).begin(), (v).... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) ((v).begin(), (v).... | replace | 47 | 49 | 47 | 49 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
scanf("%lld", &X);
for (int i = -1; i <= X; i++) {
for (int j = -1; j <= X; j++) {
if ((pow(i, 5) - pow(j, 5)) == X) {
printf("%d %d\n", i, j);
return 0;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
scanf("%lld", &X);
for (int i = -118; i <= 119; i++) {
for (int j = -118; j <= 119; j++) {
if ((pow(i, 5) - pow(j, 5)) == X) {
printf("%d %d\n", i, j);
return 0;
}
}
}
}
| replace | 9 | 11 | 9 | 11 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i... | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i... | replace | 34 | 38 | 34 | 50 | TLE | |
p02690 | C++ | Time Limit Exceeded | // Winners don't quit and Quitters don't win
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 998244353
#define MAX 100005
vll adj[MAX];
int main() {
ios_base::sync... | // Winners don't quit and Quitters don't win
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 998244353
#define MAX 100005
vll adj[MAX];
int main() {
ios_base::sync... | replace | 19 | 20 | 19 | 20 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | replace | 30 | 32 | 30 | 32 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
//... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
//... | replace | 31 | 33 | 31 | 33 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define vint vector<int>
#defi... | #include <algorithm>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define vint vector<int>
#defi... | replace | 28 | 29 | 28 | 29 | TLE | |
p02690 | C++ | Runtime Error | // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
int main() {
ll x;
cin >> x;
vector<ll> A;
loop(i, 0, 200) {
ll f = i;
ll y = 1;
loop(j, 0, 5) y *= f;
if (y > 2000000000)
break;
... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
int main() {
ll x;
cin >> x;
for (ll a = -200; a <= 200; a++) {
for (ll b = -200; b <= 200; b++) {
if (a * a * a * a * a - b * b * b * b * b == x) {... | replace | 9 | 30 | 9 | 14 | 0 | |
p02690 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
// #include"testlib.h"
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
// #include"testlib.h"
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI... | replace | 36 | 38 | 36 | 38 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 1; i < (ll)(n); i++)
#define REP(a, b, m) for (ll a = (ll)(b); a < (ll)(m); a++)
int main() {
ll x;
cin >> x;
queue<ll> memo;
ll karioki = sqrt(x);
rep(i, karioki + 1) {
if (x % i ==... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 1; i < (ll)(n); i++)
#define REP(a, b, m) for (ll a = (ll)(b); a < (ll)(m); a++)
int main() {
ll x;
cin >> x;
queue<ll> memo;
ll karioki = sqrt(x);
rep(i, karioki + 1) {
if (x % i ==... | replace | 24 | 25 | 24 | 26 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
for (ll a = -64; a <= 64; a++) {
ll temp = sqrtl(abs((powl(a, 5) - x)));
/... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
for (ll a = -300; a <= 300; a++) {
ll temp = sqrtl(sqrtl(abs((powl(a, 5) - x))... | replace | 15 | 17 | 15 | 17 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pi;
#define f first
#define s second
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int maxn =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pi;
#define f first
#define s second
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0);
const int maxn =... | replace | 16 | 18 | 16 | 18 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
using namespace std;
int main() {
ll X;
cin >> X;
fo... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
using namespace std;
int main() {
ll X;
cin >> X;
fo... | replace | 17 | 19 | 17 | 19 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < 40001; i += 2)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
ll x;
cin >> x;
vector<pair<ll... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i < 40001; i += 2)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
ll x;
cin >> x;
vector<pair<ll... | replace | 25 | 26 | 25 | 26 | 0 | |
p02690 | 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... | replace | 21 | 22 | 21 | 22 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT int
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT int
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define all(i) (i).begin(), (i).end()
#define rall(i) (i).begi... | replace | 54 | 55 | 54 | 55 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long X;
cin >> X;
for (int a = -5000; a <= 5000; a++) {
for (int b = -5000; b <= 5000; b++) {
long long A = pow(a, 5);
long long B = pow(b, 5);
if (A - B == X) {
cout << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long X;
cin >> X;
for (int a = -1000; a <= 1000; a++) {
for (int b = -1000; b <= 1000; b++) {
long long A = pow(a, 5);
long long B = pow(b, 5);
if (A - B == X) {
cout << ... | replace | 8 | 10 | 8 | 10 | TLE | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | insert | 49 | 49 | 49 | 50 | -11 | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long x;
int main() {
scanf("%lld", &x);
long long ansA = 1e18;
long long ansB = -1;
for (long long i = -100; i <= 100; i++) {
for (long long j = -100; j <= 100; j++) {
if (i * i * i * i * i - j * j * j * j * j == x) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long x;
int main() {
scanf("%lld", &x);
long long ansA = 1e18;
long long ansB = -1;
for (long long i = -1000; i <= 1000; i++) {
for (long long j = -1000; j <= 1000; j++) {
if (i * i * i * i * i - j * j * j * j * j == x) {
... | replace | 12 | 14 | 12 | 14 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
inline long long GetMulti(int val) {
return (long long)val * val * val * val * val;
}
int main() {
unsigned int X;
std::cin >> X;
for (int A = 0;; ++A) {
const long long mulA = GetMulti(A);
const long long result = mulA - X;
if (result < 0) {
long long mulB = 0;
f... | #include <iostream>
inline long long GetMulti(int val) {
return (long long)val * val * val * val * val;
}
int main() {
unsigned int X;
std::cin >> X;
for (int A = -200;; ++A) {
const long long mulA = GetMulti(A);
const long long result = mulA - X;
if (result < 0) {
long long mulB = 0;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
inline long long GetMulti(int val) {
return (long long)val * val * val * val * val;
}
int main() {
unsigned int X;
std::cin >> X;
for (int A = 0;; ++A) {
const long long mulA = GetMulti(A);
const long long result = mulA - X;
if (result < 0) {
long long mulB = 0;
f... | #include <iostream>
inline long long GetMulti(int val) {
return (long long)val * val * val * val * val;
}
int main() {
unsigned int X;
std::cin >> X;
for (int A = 0;; ++A) {
const long long mulA = GetMulti(A);
const long long result = mulA - X;
if (result < 0) {
long long mulB = 0;
f... | replace | 26 | 27 | 26 | 27 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
vector<int> vt;
set<int> st;
map<int, int> mp;
unordered_map<string, int> umap;
const long long MAX = 1e5;
const long long INF = 1e9;
const double pi = acos(-1);
int main() {
int x;
cin >> x;
for (int i = -2000; i <= 2000; i++)
for (int j ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
vector<int> vt;
set<int> st;
map<int, int> mp;
unordered_map<string, int> umap;
const long long MAX = 1e5;
const long long INF = 1e9;
const double pi = acos(-1);
int main() {
int x;
cin >> x;
for (long long int i = -2000; i <= 2000; i++)
f... | replace | 15 | 18 | 15 | 18 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const ll... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
const ll... | replace | 130 | 131 | 130 | 131 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPR(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define FORR(i, m, n) for (ll i = (ll)m - 1; i >= (ll)n; i--)
#define ALL(x) (x).begin(), (x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPR(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define FORR(i, m, n) for (ll i = (ll)m - 1; i >= (ll)n; i--)
#define ALL(x) (x).begin(), (x... | replace | 62 | 64 | 62 | 64 | TLE | |
p02690 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
long long five[101];
long long p5(int i) {
if (five[i])
return five[i];
else {
long long tmp = i * i;
tmp *= tmp;
tmp *= i;
five[i] = tmp;
return tmp;
}
}
void Main() {
long long X;
cin >> X;
for (int i = 0; i <= 200; i++) {
for (... | #include "bits/stdc++.h"
using namespace std;
long long five[201];
long long p5(int i) {
if (five[i])
return five[i];
else {
long long tmp = i * i;
tmp *= tmp;
tmp *= i;
five[i] = tmp;
return tmp;
}
}
void Main() {
long long X;
cin >> X;
for (int i = 0; i <= 200; i++) {
for (... | replace | 3 | 4 | 3 | 4 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), ... | replace | 17 | 19 | 17 | 19 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
for (int i = 0; i <= 10000; i++) {
for (int j = -10000; j <= 0; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
cout << i << " " << j << endl;
return 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
for (int i = 0; i <= 5000; i++) {
for (int j = -2500; j <= 2500; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
cout << i << " " << j << endl;
return 0;
}
}
}
return 0;
} | replace | 6 | 8 | 6 | 8 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define fa... | #include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define fa... | replace | 73 | 78 | 73 | 98 | TLE | |
p02690 | C++ | Runtime Error | #include <stdio.h>
int main() {
int X;
while (scanf("%d", &X) != 0) {
for (long long A = 0; A < 120; A++)
for (long long B = -120; B < A; B++)
if (A * A * A * A * A - B * B * B * B * B == X)
return printf("%lld %lld\n", A, B);
}
} | #include <stdio.h>
int main() {
int X;
while (scanf("%d", &X) != 0) {
for (long long A = 0; A < 120; A++)
for (long long B = -120; B < A; B++)
if (A * A * A * A * A - B * B * B * B * B == X)
return printf("%lld %lld\n", A, B), 0;
}
} | replace | 7 | 8 | 7 | 8 | 5 | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
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 <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
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 | 28 | 45 | 28 | 36 | TLE | |
p02690 | C++ | Time Limit Exceeded | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
int X;
cin >> X;
ll ansa, ansb;
rep(i, -4... | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) a / __gcd(a, b) * b
#define range(a) (a).begin(), (a).end()
const int inf = 2147483647;
int main() {
int X;
cin >> X;
ll ansa, ansb;
rep(i, -4... | replace | 15 | 17 | 15 | 17 | TLE | |
p02690 | C++ | Time Limit Exceeded | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/05/02.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC165
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) b... | //
// main.cpp
// CoderProj
//
// Created by Minoru Hayashi on 2020/05/02.
// Copyright © 2020 Minoru Hayashi. All rights reserved.
//
// ABC165
//
//
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) b... | replace | 49 | 51 | 49 | 51 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SP << " "
using namespace std;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
int main() {
long long int x, t = 0;
vector<int> v;
cin >> x;
while (t * t * t * t * t / t / t / t / t ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SP << " "
using namespace std;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
int main() {
long long int x, t = 0;
vector<long long int> v;
cin >> x;
while (t * t * t * t * t / t / ... | replace | 15 | 16 | 15 | 16 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | replace | 15 | 29 | 15 | 22 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define __ << ' ' <<
#define ___ << ' '
#define bash push_back
#define ALL(x) x.begin(), x.end()
// #define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
#define __ << ' ' <<
#define ___ << ' '
#define bash push_back
#define ALL(x) x.begin(), x.end()
// #define int long long
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecisio... | replace | 53 | 54 | 53 | 54 | 0 | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using llong = long long;
llong f(llong x) { return x * x * x *... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using llong = long long;
llong f(llong x) { return x * x * x *... | replace | 22 | 26 | 22 | 28 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
... | replace | 25 | 26 | 25 | 26 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X;
cin >> X;
for (int i = -10000; i <= 10000; i++) {
for (int j = -10000; j <= 10000; j++) {
if (pow(i, 5) - pow(j, 5) == X) {
cout << i << " " << j << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X;
cin >> X;
for (int i = -1000; i <= 1000; i++) {
for (int j = -1000; j <= 1000; j++) {
if (pow(i, 5) - pow(j, 5) == X) {
cout << i << " " << j << endl;
return 0;
}
}
}
} | replace | 9 | 11 | 9 | 11 | TLE | |
p02690 | C++ | Runtime Error | #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 | 20 | 17 | 20 | -8 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
map<int, pair<int, int>> check;
for (int i = -10000; i < 10000; i++) {
for (int j = -10000; j < 10000; j++) {
check[pow(i, 5) - pow(j, 5)] = make_pair(i, j);
}
}
int x;
cin >> x;
cout << check[x].first << ' ' << check[x].second;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
map<int, pair<int, int>> check;
for (int i = -1000; i <= 1000; i++) {
for (int j = -1000; j <= 1000; j++) {
check[pow(i, 5) - pow(j, 5)] = make_pair(i, j);
}
}
int x;
cin >> x;
cout << check[x].first << ' ' << check[x].second;
} | replace | 4 | 6 | 4 | 6 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, c;
cin >> x;
t = x;
c = 0;
c = 10000;
for (int i = c; i >= -c; i--) {
for (int j = c; j >= -c; j--) {
int u = pow(i, 5) - pow(j, 5);
if (u == x) {
cout << i << " " << j;
return 0;
}
}
}
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, t, c;
cin >> x;
t = x;
c = 0;
c = 1000;
for (int i = c; i >= -c; i--) {
for (int j = c; j >= -c; j--) {
int u = pow(i, 5) - pow(j, 5);
if (u == x) {
cout << i << " " << j;
return 0;
}
}
}
return 0... | replace | 7 | 8 | 7 | 8 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int x;
cin >> x;
for (long long i = 0; i <= 10000; i++) {
for (long long j = -100000; j <= 100000; j++) {
if ((pow(i, 5) - pow(j, 5)) == x) {
cout << i << " " << j << endl;
return 0;
}
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// your code goes here
int x;
cin >> x;
int flag = 0;
for (long long i = 0; i < 10000; i++) {
for (long long j = -10000; j < 10000; j++) {
if ((pow(i, 5) - pow(j, 5)) == x) {
cout << i << " " << j << endl;
return... | replace | 8 | 10 | 8 | 11 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int>... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef long long ll;
typedef priority_queue<int>... | replace | 66 | 74 | 66 | 72 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X, A, B;
cin >> X;
for (int i = 0; i < 10000000; i++) {
for (int j = i - 65; j < i + 1000; j++) {
A = i * i * i * i * i;
B = j * j * j * j * j;
if (A - B == X) {
cout << i << " " << j << endl;
goto as;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X, A, B;
cin >> X;
for (long long i = -200; i < 200; i++) {
for (long long j = -200; j < 200; j++) {
A = i * i * i * i * i;
B = j * j * j * j * j;
if (A - B == X) {
cout << i << " " << j << endl;
goto as;
... | replace | 5 | 7 | 5 | 7 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll x;
cin >> x;
for (ll a = 0; a <= 1000000000; a++) {
if (a <= x) {
for (ll b = 0; b < a; b++) {
if (a * a * a * a * a + b * b * b * b * b == x) {
cout << a << " " << -b << endl;
... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main(void) {
ll x;
cin >> x;
for (ll a = -120; a <= 120; a++) {
for (ll b = -120; b <= 120; b++) {
if (a * a * a * a * a - b * b * b * b * b == x) {
cout << a << " " << b << endl;
return 0;
}
... | replace | 9 | 23 | 9 | 15 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define log(x) cout << x << endl
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define log(x) cout << x << endl
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(... | replace | 74 | 76 | 74 | 76 | TLE | |
p02690 | C++ | Time Limit Exceeded | #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 | 34 | 36 | 34 | 36 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
for (int i = -130; i < 130; i++) {
for (int j = -130; j < i; j++) {
if (i * i * i * i + j * i * i * i + i * i * j * j * +j * j * j * i +
j * j * j * j ==
X / i - j) {
cout << i << " " << j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
for (int i = -1000; i < 1000; i++) {
for (int j = -1000; j < i; j++) {
if (i * i * i * i * i - j * j * j * j * j == X) {
cout << i << " " << j << endl;
return 0;
}
}
}
}
| replace | 6 | 11 | 6 | 9 | -8 | |
p02690 | C++ | Runtime Error | #include <cstdio>
typedef long long ll;
inline int rd() {
int x = 0, p = 1;
char a = getchar();
while ((a < 48 || a > 57) && a != '-')
a = getchar();
if (a == '-')
p = -p, a = getchar();
while (a > 47 && a < 58)
x = (x << 1) + (x << 3) + (a & 15), a = getchar();
return x * p;
}
ll x;
int main() ... | #include <cstdio>
typedef long long ll;
inline int rd() {
int x = 0, p = 1;
char a = getchar();
while ((a < 48 || a > 57) && a != '-')
a = getchar();
if (a == '-')
p = -p, a = getchar();
while (a > 47 && a < 58)
x = (x << 1) + (x << 3) + (a & 15), a = getchar();
return x * p;
}
ll x;
int main() ... | replace | 19 | 20 | 19 | 20 | 5 | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int X;
cin >> X;
for (long long int i = -100; i <= 100; i++) {
for (long long int j = -100; j <= 100; j++) {
long long int ans = (int)pow(i, 5) - (int)pow(j, 5);
if... | #include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int X;
cin >> X;
for (long long int i = -200; i <= 200; i++) {
for (long long int j = -200; j <= 200; j++) {
long long int ans = (long long)pow(i, 5) - (long long)pow(j, ... | replace | 10 | 25 | 10 | 13 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void chmax(T ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template <typename T> void chmax(T ... | replace | 26 | 28 | 26 | 28 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll x;
cin >> x;
for (ll i = -118; i <= 119; i++) {
for (ll j = -119;... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
ll x;
cin >> x;
for (ll i = -118; i <= 119; i++) {
for (ll j = -119;... | replace | 16 | 17 | 16 | 17 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define deb(x) cout << #x << " " << x << "\n";
#define pi 3.1415926535897932384626433832795
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define cr7 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define deb(x) cout << #x << " " << x << "\n";
#define pi 3.1415926535897932384626433832795
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define cr7 ... | replace | 38 | 39 | 38 | 39 | TLE | |
p02690 | C++ | Runtime Error | // https://atcoder.jp/contests/abc166/tasks/abc166_d
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i, a, b) for (ll i = (a); i < static_cast<ll>(b); ++i)
#define REP(i, n) FOR(i, 0, n)
temp... | // https://atcoder.jp/contests/abc166/tasks/abc166_d
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i, a, b) for (ll i = (a); i < static_cast<ll>(b); ++i)
#define REP(i, n) FOR(i, 0, n)
temp... | replace | 35 | 36 | 35 | 38 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vpi = vector<pii>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpl = vector<pll>;
u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vpi = vector<pii>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpl = vector<pll>;
u... | replace | 18 | 33 | 18 | 24 | TLE | |
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 INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int five(ll n) { return n * n * n * n * n; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int five(ll n) { return n * n * n * n * n; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
... | replace | 20 | 22 | 20 | 22 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long x;
cin >> x;
int a = 0, b = 0;
long long a_s = 0, b_s = 0;
for (; a_s <= x; a++) {
a_s = pow(a, 5);
}
a = a - 2;
a_s = pow(a, 5);
for (; a_s - b_s != x; b--) {
b_s = pow(b, 5);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long x;
cin >> x;
long long a, b;
for (a = -1000; a <= 1000; a++) {
for (b = 1000; b >= -1000; b--) {
if (pow(a, 5) - pow(b, 5) == x) {
cout << a << " " << b;
return 0;
... | replace | 8 | 25 | 8 | 16 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
bool finished = true;
for (int64_t i = 0; i < 10000; i++) {
for (int64_t j = i; j < 10000; j++) {
if (pow(i, 5) + pow(j, 5) == X) {
cout << i << " -" << j;
finished = false;
break;
} else if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
bool finished = true;
for (int64_t i = 0; i < 120; i++) {
for (int64_t j = 0; j < 120; j++) {
if (pow(i, 5) + pow(j, 5) == X) {
cout << i << " -" << j;
finished = false;
break;
} else if (pow... | replace | 7 | 9 | 7 | 9 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | replace | 131 | 133 | 131 | 133 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int m... | replace | 29 | 31 | 29 | 30 | TLE | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y))
#define PI 3.14159265359
typedef long long LL;
const LL MOD = 1e9 + 7;
cons... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y))
#define PI 3.14159265359
typedef long long LL;
const LL MOD = 1e9 + 7;
cons... | replace | 164 | 167 | 164 | 167 | 0 | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)... | replace | 86 | 88 | 86 | 89 | 0 | |
p02690 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | replace | 47 | 50 | 47 | 51 | 0 | |
p02690 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <ctime>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <r... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <ctime>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <r... | replace | 40 | 41 | 40 | 41 | 0 | |
p02690 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long N = 9000;
long long arr[N] = {};
int main() {
long long x;
cin >> x;
if (x == 0) {
cout << "0 0\n";
return 0;
}
long long a, b;
for (long long i = 1; i < N; i++)
for (long long j = i + 1; j < N; j++) {
a = j, b = i;
long l... | #include <bits/stdc++.h>
using namespace std;
const long long N = 9000;
long long arr[N] = {};
int main() {
long long x;
cin >> x;
if (x == 0) {
cout << "0 0\n";
return 0;
}
if (x == 1) {
cout << "1 0\n";
return 0;
}
long long a, b;
for (long long i = 1; i < N; i++)
for (long long j ... | insert | 9 | 9 | 9 | 13 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int X;
cin >> X;
bool owari = 0;
for (int i = -10000; i <= 10000; i++) {
for (int j = -10000; j <= 10000; j++) {
int A = pow(i, 5);
int B = pow(j,... | #include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int X;
cin >> X;
bool owari = 0;
for (int i = -120; i <= 120; i++) {
for (int j = -120; j <= 120; j++) {
long long A = pow(i, 5);
long long B = po... | replace | 11 | 15 | 11 | 15 | TLE | |
p02690 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define db(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
const int N = 1e6;
int main() {
ios_base::sync_with_stdio(0);
ll a, b, n, x, T, cas = 0;
cin >> x;
a = 0, b = 0;
for (ll i = -100; i <= 100; ++i) {
ll p = i * i * i * i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define db(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
const int N = 1e6;
int main() {
ios_base::sync_with_stdio(0);
ll a, b, n, x, T, cas = 0;
cin >> x;
a = 0, b = 0;
for (ll i = -1000; i <= 1000; ++i) {
ll p = i * i * i *... | replace | 11 | 12 | 11 | 12 | 0 | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return a ? GCD(b % a, a) : b; }
int main() {
ll x;
cin >> x;
for (ll i = -1e4; i <= 1e4; i++) {
for (ll j = -1e4; j <= 1e4; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
cout << i << " " << j << endl;
ret... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll GCD(ll a, ll b) { return a ? GCD(b % a, a) : b; }
int main() {
ll x;
cin >> x;
for (ll i = -1e3; i <= 1e3; i++) {
for (ll j = -1e3; j <= 1e3; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
cout << i << " " << j << endl;
ret... | replace | 7 | 9 | 7 | 9 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int X;
vector<int> factor(int n) {
vector<int> x;
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
x.push_back(i);
n /= i;
}
}
return x;
}
int pow(int a, int b) {
int ans = 1;
while (b--) {
ans *= a;... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int X;
vector<int> factor(int n) {
vector<int> x;
for (int i = 2; i <= n; i++) {
while (n % i == 0) {
x.push_back(i);
n /= i;
}
}
return x;
}
int pow(int a, int b) {
int ans = 1;
while (b--) {
ans *= a;... | replace | 31 | 55 | 31 | 33 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll x;
cin >> x;
ll root = pow(x, 1 / 5);
ll ans_a = 0;
ll ans_b = 0;
bool flg = false;
rep(i, 100000) {
rep(j, 100000) {
// if(x... | #include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
ll x;
cin >> x;
ll root = pow(x, 1 / 5);
ll ans_a = 0;
ll ans_b = 0;
bool flg = false;
rep(i, 10000) {
rep(j, 10000) {
if (x >= ... | replace | 15 | 18 | 15 | 20 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x;
cin >> x;
ll ansa = 0, ansb = 0;
for (ll i = 0; i < 10000; i++) {
for (ll j = 0; j < 10000; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
ansa = i;
ansb = j;
break;
} else if (pow(i, 5) + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x;
cin >> x;
ll ansa = 0, ansb = 0;
for (ll i = 0; i < 1000; i++) {
for (ll j = 0; j < 1000; j++) {
if (pow(i, 5) - pow(j, 5) == x) {
ansa = i;
ansb = j;
break;
} else if (pow(i, 5) + po... | replace | 9 | 11 | 9 | 11 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long mi, mi2;
for (int i = 1; i < 40000; i++) {
if (x % i == 0) {
long long y = x / i;
for (long long j = 0; j < y; j++) {
mi = j - i;
mi2 = mi * mi;
if (j * j * j * j + j * j * j * mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long mi, mi2;
for (int i = 1; i < 40000; i++) {
if (x % i == 0) {
long long y = x / i;
long long start = sqrt(sqrt(y));
for (long long j = start; j > 0; j--) {
mi = j - i;
mi2 = mi * mi;... | replace | 10 | 11 | 10 | 12 | TLE | |
p02690 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ... | replace | 26 | 27 | 26 | 27 | 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 < (int)(n); i++)
int main() {
ll x;
cin >> x;
ll judge = 0;
for (ll i = -10000; i < 10000; i++) {
for (ll j = -10000; j < 10000; j++) {
ll i5 = pow(i, 5);
ll j5 = pow(j, 5);
if (i5 - j5... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll x;
cin >> x;
ll judge = 0;
for (ll i = -1000; i < 1000; i++) {
for (ll j = -1000; j < 1000; j++) {
ll i5 = pow(i, 5);
ll j5 = pow(j, 5);
if (i5 - j5 == ... | replace | 9 | 11 | 9 | 11 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.