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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long t = 1e18;
int main() {
int n;
bool flg = false;
cin >> n;
long long s = 1;
for (int i = 0; i < n; i++) {
long long tmp;
cin >> tmp;
if (tmp == 0) {
cout << 0 << "\n";
return 0;
}
if ((t + 1) / s < tmp || s * tmp > t)... | #include <bits/stdc++.h>
using namespace std;
const long long t = 1e18;
int main() {
int n;
bool flg = false;
cin >> n;
long long s = 1;
for (int i = 0; i < n; i++) {
long long tmp;
cin >> tmp;
if (tmp == 0) {
cout << 0 << "\n";
return 0;
}
if (flg || (t + 1) / s < tmp || s * t... | replace | 15 | 16 | 15 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
uint32_t N = 0;
std::cin >> N;
int64_t prod = 1;
for (uint32_t i = 0; i < N; i++) {
int64_t A = 0;
std::cin >> A;
if (prod == -1) {
if (A == 0)
prod = 0;
} else {
if (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
int main() {
uint32_t N = 0;
std::cin >> N;
int64_t prod = 1;
for (uint32_t i = 0; i < N; i++) {
int64_t A = 0;
std::cin >> A;
if (prod == -1) {
if (A == 0)
prod = 0;
} else if (prod != ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
long long ans = 1, f = 0;
cin >> n;
for (int i = 0; n > i; i++) {
long long a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
cout << ans << endl;
if (a > 1000000000000000000LL / ans) {
f = 1;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
long long ans = 1, f = 0;
cin >> n;
for (int i = 0; n > i; i++) {
long long a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
// cout << ans << endl;
if (ans > 1000000000000000000LL / a) {
f = 1;
... | replace | 14 | 16 | 14 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
const long long k = 1000000000000000000;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
long long ans = 1;
for (long long i = 0; i < n; i++) {
if (k / ans < a.at(i)) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
const long long k = 1000000000000000000;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
long long ans = 1;
for (long long i = 0; i < n; i++) {
if (ans == 0)
bre... | replace | 14 | 15 | 14 | 17 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t Z = 1, A = 0;
int64_t K = 1000000000000000000;
for (int i = 0; i < N; i++) {
int64_t a;
cin >> a;
if (1 + (K - 1) / Z < a && a != 0) {
A++;
} else {
Z *= a;
}
}
if ((A == 0 && Z <= K) || Z ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t Z = 1, A = 0;
int64_t K = 1000000000000000000;
for (int i = 0; i < N; i++) {
int64_t a;
cin >> a;
if (1 + (K - 1) / Z < a && a != 0) {
A++;
} else {
Z *= a;
}
if (Z == 0) {
break;
... | insert | 16 | 16 | 16 | 19 | 0 | |
p02658 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#i... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#i... | insert | 85 | 85 | 85 | 88 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | insert | 43 | 43 | 43 | 45 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | insert | 25 | 25 | 25 | 29 | 0 | |
p02658 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
const ll MX = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool flag = false;
rep(i, n) {
... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
const ll MX = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool flag = false;
rep(i, n) {
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
if (a == 0) {
ans = 0;
} else if (a <= 1000000000000000000 / ans) {
ans = ans * a;
} else {
ans = -1;
}
}
cout << ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
if (a == 0) {
ans = 0;
cout << ans << endl;
return 0;
} else if (a <= 1000000000000000000 / ans) {
ans = ans * a;
} els... | insert | 12 | 12 | 12 | 14 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#pragma GCC target("avx2")
#define int long long
const int INF = 1e18;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int m = INF;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i]... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#pragma GCC target("avx2")
#define int long long
const int INF = 1e18;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int m = INF;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i]... | insert | 20 | 20 | 20 | 24 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int n;
scanf("%d", &n);
LL ans = 1, x, inf = 1e18, fl = 1, fl1 = 1;
for (int i = 0; i < n; i++) {
scanf("%lld", &x);
if (!x)
fl1 = 0;
if (x > inf / ans || (ans * x > inf))
fl = 0;
ans *= x;
}
if (!fl... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int n;
scanf("%d", &n);
LL ans = 1, x, inf = 1e18, fl = 1, fl1 = 1;
for (int i = 0; i < n; i++) {
scanf("%lld", &x);
if (!x)
fl1 = 0;
if (fl && (x > inf / ans || ans * x > inf))
fl = 0;
ans *= x;
}
i... | replace | 11 | 12 | 11 | 12 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 10;
ll a[N], inf = 1e18;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll sum = 1;
for (int i = 0; i < n; i++) {
ll x = a[i];
if (sum > inf / x) {
sum = -1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 10;
ll a[N], inf = 1e18;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
ll sum = 1;
for (int i = 0; i < n; i++) {
ll x = a[i];
if (x == 0) {
sum = 0;
bre... | insert | 14 | 14 | 14 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <cstdio>
typedef unsigned long long ull;
const ull LIMIT = 1000000000000000000llu;
int main() {
int N;
scanf("%d", &N);
ull ans = 1ull;
bool overflowed = false;
for (int i = 0; i < N; i++) {
ull temp;
scanf("%llu", &temp);
if (temp == 0) {
puts("0");
return 0;
}
i... | #include <cstdio>
typedef unsigned long long ull;
const ull LIMIT = 1000000000000000000llu;
int main() {
int N;
scanf("%d", &N);
ull ans = 1ull;
bool overflowed = false;
for (int i = 0; i < N; i++) {
ull temp;
scanf("%llu", &temp);
if (temp == 0) {
puts("0");
return 0;
}
i... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int long long
template <typename T> usin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int long long
template <typename T> usin... | replace | 26 | 27 | 26 | 27 | 0 | |
p02658 | C++ | Runtime Error | #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 | 85 | 86 | 85 | 86 | -11 | |
p02658 | C++ | Runtime Error | // written by: rishav2416
#include <bits/stdc++.h>
#define ll long long
#define lli long long int
#define ld long double
#define mod 1000000000000000000
#define max_char 128
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define lbd lower_bound
#define ubd upper_bound
#define PI 3.14159265... | // written by: rishav2416
#include <bits/stdc++.h>
#define ll long long
#define lli long long int
#define ld long double
#define mod 1000000000000000000
#define max_char 128
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define lbd lower_bound
#define ubd upper_bound
#define PI 3.14159265... | replace | 59 | 60 | 59 | 66 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n = 0;
cin >> n;
vector<ll> a(n);
ll res = 0;
res = 1;
bool ok = true;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n = 0;
cin >> n;
vector<ll> a(n);
ll res = 0;
res = 1;
bool ok = true;... | insert | 26 | 26 | 26 | 31 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, l, r) for (int i = (l); i < (r); i++)
int main() {
int N;
cin >> N;
ll ans = 1;
vector<ll> a(N);
rep(i, N) {
cin >> a[i];
ans *= a[i];
}
ll an = ans;
rep(i, N) { an ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, l, r) for (int i = (l); i < (r); i++)
int main() {
int N;
cin >> N;
ll ans = 1;
vector<ll> a(N);
rep(i, N) {
cin >> a[i];
ans *= a[i];
if (a[i] == 0) {
cout << 0... | insert | 14 | 14 | 14 | 18 | 0 | |
p02658 | 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;
const ll MX = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool flg = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
if (MX... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const ll MX = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool flg = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
if (fl... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 1, x = 1e18;
bool ng = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 1, x = 1e18;
bool ng = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
long long a[10010];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
int zero = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
zero++;
break;
}
}
if (zero > 0) {
printf("0\n");
re... | #include <iostream>
using namespace std;
int main() {
int n;
long long a[100010];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
int zero = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
zero++;
break;
}
}
if (zero > 0) {
printf("0\n");
r... | replace | 6 | 7 | 6 | 7 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
const ll MAX = 1e18;
int main() {
int n;
cin >> n;
vl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
const ll MAX = 1e18;
int main() {
int n;
cin >> n;
vl... | replace | 16 | 17 | 16 | 17 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <math.h>
#include <set>
#define pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
int main() {
long long int MX = 1e18;
int n;
cin >> n;
long long int a;
long long int ans = 1;
bool... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <math.h>
#include <set>
#define pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
int main() {
long long int MX = 1e18;
int n;
cin >> n;
long long int a;
long long int ans = 1;
bool... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
int N;
std::cin >> N;
ll ans = 1;
ll T = 1000000000000000000LL;
bool over = false;
rep(i, N) {
ll A;
std::cin >> A;
if (A == 0) {
std::cout << 0 <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
int N;
std::cin >> N;
ll ans = 1;
ll T = 1000000000000000000LL;
bool over = false;
rep(i, N) {
ll A;
std::cin >> A;
if (A == 0) {
std::cout << 0 <<... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
const int64_t INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
ll res = 1;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < n; i++) {
if (a[i] == 0) {
res = 0;
} else if (a[i] != 0) {
if (a[... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
const int64_t INF = 1e18;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
ll res = 1;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
for (ll i = 0; i < n; i++) {
if (a[i] == 0) {
cout << 0 << endl;
return 0;
} else if ... | replace | 17 | 18 | 17 | 19 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, mn, flag, sum = 1, cnt;
ll c = 1e18;
ll a[1000000];
int main() {
ll n;
cin >> n;... | #include <algorithm>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, mn, flag, sum = 1, cnt;
ll c = 1e18;
ll a[1000000];
int main() {
ll n;
cin >> n;... | replace | 28 | 29 | 28 | 34 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ll N, flag = 0, ans = 1;
cin >> N;
vector<ll> a(N);
re... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
ll N, flag = 0, ans = 1;
cin >> N;
vector<ll> a(N);
re... | replace | 21 | 23 | 21 | 25 | 0 | |
p02658 | C++ | Runtime Error | #include <cmath>
#include <iostream>
long long MAX = std::pow(10, 18);
int main(int argc, const char *argv[]) {
long long N = 0;
scanf("%lld", &N);
long long ans = 0;
scanf("%lld", &ans);
for (int i = 1; i < N; i++) {
long long num = 0;
scanf("%lld", &num);
if (ans == -1 && num == 0) {
... | #include <cmath>
#include <iostream>
long long MAX = std::pow(10, 18);
int main(int argc, const char *argv[]) {
long long N = 0;
scanf("%lld", &N);
long long ans = 0;
scanf("%lld", &ans);
for (int i = 1; i < N; i++) {
long long num = 0;
scanf("%lld", &num);
if (ans == -1 && num == 0) {
... | insert | 25 | 25 | 25 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
unsigned int n;
unsigned long int a[100001];
unsigned long long int s = 1;
int t = 0;
cin >> n;
for (unsigned int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 1000000000000000000 / s)
t = 1;
else
s *= a[i];
}
if (t == 1)
... | #include <iostream>
using namespace std;
int main() {
unsigned int n;
unsigned long int a[100001];
unsigned long long int s = 1;
int t = 0;
cin >> n;
for (unsigned int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 1000000000000000000 / s)
t = 1;
else
s *= a[i];
if (a[i] == 0) {... | insert | 17 | 17 | 17 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define l... | replace | 57 | 58 | 57 | 58 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a;
cin >> n;
a = 1;
bool flg = false;
int64_t upper = 1000000000000000000;
for (int i = 0; i < n; i++) {
int64_t tmp;
cin >> tmp;
if (tmp == 0) {
a = 0;
break;
}
if (tmp > (upper / a)) {
flg = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a;
cin >> n;
a = 1;
bool flg = false;
int64_t upper = 1000000000000000000;
for (int i = 0; i < n; i++) {
int64_t tmp;
cin >> tmp;
if (tmp == 0) {
a = 0;
break;
} else if (a > (upper / tmp)) {
flg = true;... | replace | 15 | 17 | 15 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf ll(1e18)
#define mod 1000000007
#define mod1 998244353
#define mod2 999983
ll power(ll a, ll n, ll m);
ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll x = power(a, n / 2, m);
if (n % 2 != 0)
return (((a * x) % m) * (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define inf ll(1e18)
#define mod 1000000007
#define mod1 998244353
#define mod2 999983
ll power(ll a, ll n, ll m);
ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll x = power(a, n / 2, m);
if (n % 2 != 0)
return (((a * x) % m) * (... | insert | 32 | 32 | 32 | 37 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define Check system("pause")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define Check system("pause")
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | replace | 27 | 28 | 27 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long x;
unsigned long long z = 1;
bool flag = false;
bool zeroflag = false;
for (int i = 0; i < n; i++) {
cin >> x;
if (x == 0) {
zeroflag = true;
}
if (x <= 1000000000000000000 / z) {
z = z ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long x;
unsigned long long z = 1;
bool flag = false;
bool zeroflag = false;
for (int i = 0; i < n; i++) {
cin >> x;
if (x == 0) {
zeroflag = true;
break;
}
if (x <= 1000000000000000000 / z) {... | insert | 15 | 15 | 15 | 16 | 0 | |
p02658 | C++ | Runtime Error | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!! NOTE THAT MEMSET CANT FILL THE
// DOUBLE VALUES; AC... | // RAKSHIT KADAM
// ALWAYS USE &IT FOR ITERATING USING AUTO ...
// USE COUNT(STARTING ADDRESS, ENDING ADRESS ,VALUE) FOR FINDING THE COUNT IN
// THE RESPECTIVE DATA STRUCTURE NOTE THAT MEMSET CANNOT ASSIGN A VALUE OF 10^18
// IT WILL ASSIGN A LOWER VALUE THAN THAT!!! NOTE THAT MEMSET CANT FILL THE
// DOUBLE VALUES; AC... | replace | 93 | 96 | 93 | 97 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n);
int zer = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zer = 1;
}
long long int ans = 1;
for (int i = 0; i < n; i++) {
long long int op = 1000000000000000000LL / ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n);
int zer = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zer = 1;
}
long long int ans = 1;
for (int i = 0; i < n; i++) {
if (ans == 0) {
cout << "0" << endl;
... | insert | 15 | 15 | 15 | 19 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long mx = 1e18;
int main() {
int n;
long long ans = 1;
bool ng = false;
cin >> n;
rep(i, n) {
long long a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
if (a >... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long mx = 1e18;
int main() {
int n;
long long ans = 1;
bool ng = false;
cin >> n;
rep(i, n) {
long long a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
if (ans... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
long long A[10010];
long long ans = 1;
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
if (A[i] == 0) {
printf("0");
return 0;
}
}
for (int i = 0; i < N; i++) ... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
long long A[100010];
long long ans = 1;
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
if (A[i] == 0) {
printf("0");
return 0;
}
}
for (int i = 0; i < N; i++)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define max_sum 1000000000000000000
int main() {
ll n;
cin >> n;
ll a;
long long sum = 1;
bool flag = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
flag = 0;
sum = 0;
}
if (flag || max_sum / sum < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define max_sum 1000000000000000000
int main() {
ll n;
cin >> n;
ll a;
long long sum = 1;
bool flag = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == 0) {
cout << 0 << endl;
return 0;
}
if (flag || max_su... | replace | 17 | 19 | 17 | 19 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, k, x, l(1);
cin >> n;
k = pow(10, 18);
for (int i = 0; i < n; i++) {
cin >> x;
k = k / x;
l *= x;
}
if (k == 0) {
cout << "-1";
} else
cout << l... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, k, x, l(1);
cin >> n;
k = pow(10, 18);
for (int i = 0; i < n; i++) {
cin >> x;
if (x == 0) {
l = 0;
k = 1;
break;
}
k = k / x;
l *= ... | insert | 11 | 11 | 11 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int n;
ll A[MAXN];
void solve() {
ll ans = 1;
sort(A, A + n);
for (int i = 0; i < n; i++) {
if (1000000000000000000 / ans < A[i]) {
cout << -1 << endl;
return;
}
ans *= A[i];
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
int n;
ll A[MAXN];
void solve() {
ll ans = 1;
sort(A, A + n);
for (int i = 0; i < n; i++) {
if (ans == 0) {
cout << 0 << endl;
return;
}
if (1000000000000000000 / ans < A[i]) ... | insert | 15 | 15 | 15 | 19 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ostream &operator<<(ostream &dest, __int128_t value) {
ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ostream &operator<<(ostream &dest, __int128_t value) {
ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10]... | replace | 58 | 59 | 58 | 59 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long ... | replace | 44 | 45 | 44 | 45 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }... | insert | 23 | 23 | 23 | 28 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
long long lim = 1e18;
int n;
cin >> n;
long long a[n], ans = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
ans = 0;
else if (a[i] > lim / ans)
ans = -1;
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
long long lim = 1e18;
int n;
cin >> n;
long long a[n], ans = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
ans = 0;
else if (ans > lim / a[i])
ans = -1;
els... | replace | 13 | 14 | 13 | 14 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
const ll MOD... | replace | 32 | 33 | 32 | 33 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MX = 1e18;
int main() {
int N;
cin >> N;
ll ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MX = 1e18;
int main() {
int N;
cin >> N;
ll ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll unsigned long long
int main() {
auto mul = [](ll x, ll y) {
ll inf = pow... | #include <algorithm>
#include <cmath> //sqrt
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll unsigned long long
int main() {
auto mul = [](ll x, ll y) {
ll inf = pow... | replace | 13 | 14 | 13 | 14 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int answer;
bool ans;
ans = false;
answer = 1;
cin >> N;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
answer = 0;
}
}
for (int i = 0; i < N; i++) {
if (answe... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int answer;
bool ans;
ans = false;
answer = 1;
cin >> N;
vector<long long int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
answer = 0;
}
}
for (int i = 0; i < N; i++) {
if (answe... | replace | 19 | 20 | 19 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h> //全てのヘッダファイルをインクルード
// ループ
#define REP(i, n) for (int i = 0; i < n; i++) // 普通のループ
#define REPR(i, n) for (int i = n; i >= 0; i--) // 逆ループ
#define FOR(i, m, n) for (int i = m; i < n; i++) // 最初の数値を指定したループ
// 型名省略
typedef long long ll;
// 配列要素数
static const int MAX = 200000;
// 値
static co... | #include <bits/stdc++.h> //全てのヘッダファイルをインクルード
// ループ
#define REP(i, n) for (int i = 0; i < n; i++) // 普通のループ
#define REPR(i, n) for (int i = n; i >= 0; i--) // 逆ループ
#define FOR(i, m, n) for (int i = m; i < n; i++) // 最初の数値を指定したループ
// 型名省略
typedef long long ll;
// 配列要素数
static const int MAX = 200000;
// 値
static co... | replace | 74 | 75 | 74 | 75 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | insert | 64 | 64 | 64 | 68 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02658 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define MAX 1000000000000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned long long int> v;
// bool zeroes=false;
unsigned long long int mul = 1, prev = 1, flag = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define MAX 1000000000000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned long long int> v(n);
// bool zeroes=false;
unsigned long long int mul = 1, prev = 1, flag = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
... | replace | 9 | 10 | 9 | 10 | -11 | |
p02658 | C++ | Runtime Error | // J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define int unsigned long long
#define ii pair<int, int>
#define fi first
#define sc second
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
#define i1e18 ... | // J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define int unsigned long long
#define ii pair<int, int>
#define fi first
#define sc second
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
#define i1e18 ... | insert | 25 | 25 | 25 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
long long a[10101], ans = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
}
for (int i = 0; i < N; i++) {
if (a[i] > 1000000000000000000 / ans) {
cout <... | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
long long a[1000000], ans = 1;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
}
for (int i = 0; i < N; i++) {
if (a[i] > 1000000000000000000 / ans) {
cout... | replace | 7 | 8 | 7 | 8 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define FF(i, a, b) for (int i = a; i < b; i++)
#define BF(i, a, b) for (int i = a; i >= b; i--)
#define vi vector<int>
#define MAP map<int... | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define FF(i, a, b) for (int i = a; i < b; i++)
#define BF(i, a, b) for (int i = a; i >= b; i--)
#define vi vector<int>
#define MAP map<int... | insert | 73 | 73 | 73 | 78 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long long double
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
unsigned long long prod = 1;
vector<unsigned long long> arr(n);
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long long double
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
unsigned long long prod = 1;
vector<unsigned long long> arr(n);
for (int i = 0; i < n... | replace | 19 | 20 | 19 | 24 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long long double
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
unsigned long long prod = 1;
vector<unsigned long long> arr(n);
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long long double
#define pb push_back
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
unsigned long long prod = 1;
vector<unsigned long long> arr(n);
for (int i = 0; i < n... | replace | 19 | 20 | 19 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long teisuu = 1000000000000000000;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
}
long long kotae = a[0];
for (long lo... | #include <bits/stdc++.h>
using namespace std;
long long teisuu = 1000000000000000000;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
}
long long kotae = 1;
for (long long ... | replace | 15 | 18 | 15 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
// headers {{{
using namespace std;
// using namespace rel_ops;
typedef long long int64;
typedef unsigned long long uint64;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INF = 0x7FFFFFFF;
template <class T> inline bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}... | #include <bits/stdc++.h>
// headers {{{
using namespace std;
// using namespace rel_ops;
typedef long long int64;
typedef unsigned long long uint64;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INF = 0x7FFFFFFF;
template <class T> inline bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}... | replace | 57 | 68 | 57 | 75 | 0 | |
p02658 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> a(n);
bool zero = false;
unsigned int lensum = 0;
for (int i = 0; i < n; ++i) {
std::cin >> a.at(i);
if (a.at(i) == "0") {
zero = true;
}
lensum +=... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> a(n);
bool zero = false;
unsigned int lensum = 0;
for (int i = 0; i < n; ++i) {
std::cin >> a.at(i);
if (a.at(i) == "0") {
zero = true;
}
lensum +=... | insert | 27 | 27 | 27 | 28 | TLE | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pair<int, int>> vp;
typedef pair<int, int> pr;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pair<int, int>> vp;
typedef pair<int, int> pr;
typedef... | replace | 74 | 75 | 74 | 75 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// vector<vector<int>> a(5, vector<int>(5, 0)) 5*5-0
int main() {
long long int n;
long long tmp;
cin >> n;
long long int res = 1;
vector<int> a(n);
int flag_zero = 0;
int flag_18 = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp == 0) {
f... | #include <bits/stdc++.h>
using namespace std;
// vector<vector<int>> a(5, vector<int>(5, 0)) 5*5-0
int main() {
long long int n;
long long tmp;
cin >> n;
long long int res = 1;
vector<int> a(n);
int flag_zero = 0;
int flag_18 = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp == 0) {
f... | insert | 15 | 15 | 15 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
long A[N];
long long result = 1;
long long thre = 1000000000000000000;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (A[0] == 0) {
cout << 0 << endl;
return 0... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
long A[N];
long long result = 1;
long long thre = 1000000000000000000;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
if (A[0] == 0) {
cout << 0 << endl;
return 0... | replace | 20 | 22 | 20 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
typedef unsigned long long ll;
const ll inf = 1e18;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll ans = 1, temp, t;
int flag = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
if (... | #include <cstdio>
#include <iostream>
#include <map>
#include <string>
typedef unsigned long long ll;
const ll inf = 1e18;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
ll ans = 1, temp, t;
int flag = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
if (... | insert | 17 | 17 | 17 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
typedef long long ll;
int main() {
int N;
std::cin >> N;
ll a[N];
for (ll e : a) {
std::cin >> e;
if (e == 0) {
std::cout << 0 << std::endl;
return 0;
}
}
ll max = 1e18;
ll multi = 1;
for (ll e : a) {
if (multi > max / e) {
std::cout << -1 << std... | #include <iostream>
typedef long long ll;
int main() {
int N;
std::cin >> N;
ll a[N];
for (ll i; i < N; ++i) {
std::cin >> a[i];
if (a[i] == 0) {
std::cout << 0 << std::endl;
return 0;
}
}
ll max = 1e18;
ll multi = 1;
for (ll e : a) {
if (multi > max / e) {
std::cou... | replace | 8 | 11 | 8 | 11 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 1;
rep(i, n) {
ll a;
cin >> a;
if (ans == -1) {
if (a == 0)
ans = 0;
} else {
if (a > 1'000'000'000'000'000'000 / ans) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 1;
rep(i, n) {
ll a;
cin >> a;
if (ans == -1) {
if (a == 0)
ans = 0;
} else {
if (a == 0 || ans == 0) {
ans *= a... | insert | 16 | 16 | 16 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
ll M = 1e18;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll a... | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
ll M = 1e18;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
ll a... | replace | 29 | 31 | 29 | 31 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t mx = 1e18;
int main() {
int N;
cin >> N;
bool ng = false;
int64_t ans = 1;
for (int i = 0; i < N; i++) {
int64_t A;
cin >> A;
if (A == 0) {
cout << 0 << endl;
return 0;
}
if (mx / ans < A) {
ng = true;
}... | #include <bits/stdc++.h>
using namespace std;
const int64_t mx = 1e18;
int main() {
int N;
cin >> N;
bool ng = false;
int64_t ans = 1;
for (int i = 0; i < N; i++) {
int64_t A;
cin >> A;
if (A == 0) {
cout << 0 << endl;
return 0;
}
if (ng || mx / ans < A) {
ng = true;... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll ans = 1;
for (ll i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
ans = 0;
}
}
ll judge = pow(10, 18);
sort(A.begin(), A.end());
rev... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll ans = 1;
for (ll i = 0; i < N; i++) {
cin >> A[i];
if (A[i] == 0) {
ans = 0;
}
}
if (ans == 0) {
cout << 0 << endl;
exit(0);
}
... | insert | 16 | 16 | 16 | 22 | 0 | |
p02658 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(x) x.begin(), x.end()
using namespace std;
typedef unsigned long long ll;
template <typename T> T gcd(T a, T b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
template <typename T> T lcm(T a, T b) { ... | #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ALL(x) x.begin(), x.end()
using namespace std;
typedef unsigned long long ll;
template <typename T> T gcd(T a, T b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
template <typename T> T lcm(T a, T b) { ... | insert | 30 | 30 | 30 | 34 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
// problem_B
int main() {
ll n;
cin >> n;
ll a[n];
ll sum1 = 1;
// ll sum2 = 1;
ll ans1 = 0;
ll ans2 = 0;
ll a0 = pow(10, 18);
for (ll i = 0; i < n;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
// problem_B
int main() {
ll n;
cin >> n;
ll a[n];
ll sum1 = 1;
// ll sum2 = 1;
ll ans1 = 0;
ll ans2 = 0;
ll a0 = pow(10, 18);
for (ll i = 0; i < n;... | insert | 30 | 30 | 30 | 31 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
long long int ans = 1;
for (int i = 0; i < n; i++) {
if (a.at(i) == 0) {
cout << 0 << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
long long int ans = 1;
for (int i = 0; i < n; i++) {
if (a.at(i) == 0) {
cout << 0 << endl;
ret... | replace | 24 | 25 | 24 | 25 | -8 | |
p02658 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl... | replace | 67 | 68 | 67 | 68 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k = 1, a[10001];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0) {
k = 0;
break;
}
if (k > 1000000000000000000 / a[i] || k == -1) {
k = -1;
} else {
k *= a[i];
}
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k = 1, a[100001];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0) {
k = 0;
break;
}
if (k > 1000000000000000000 / a[i] || k == -1) {
k = -1;
} else {
k *= a[i];
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ar[n + 5];
long long res = 1;
for (int i = 0; i < n; i++) {
cin >> ar[i];
if (ar[i] == 0) {
res = 0;
continue;
}
if (ar[i] <= 1000000000000000000 / res)
res *= ar[i];
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ar[n + 5];
long long res = 1;
for (int i = 0; i < n; i++) {
cin >> ar[i];
if (ar[i] == 0) {
cout << "0";
return 0;
}
if (ar[i] <= 1000000000000000000 / res)
res *= ar[i];
else {
... | replace | 11 | 13 | 11 | 13 | 0 | |
p02658 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define K 1000000000000000000
int main() {
long long ans = 1;
int n;
bool flag = false;
cin >> n;
for (int i = 0; i < n; ++i) {
long long b;
cin >> b;
if (b == 0) {
cout << 0 << endl;
return 0;
}
if ((K +... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define K 1000000000000000000
int main() {
long long ans = 1;
int n;
bool flag = false;
cin >> n;
for (int i = 0; i < n; ++i) {
long long b;
cin >> b;
if (b == 0) {
cout << 0 << endl;
return 0;
}
if (flag... | replace | 18 | 19 | 18 | 19 | 0 | |
p02658 | Python | Time Limit Exceeded | n = int(input())
n_list = [int(i) for i in input().split()]
ans = 1
n_list.sort()
for i in n_list:
ans *= i
if ans > 10**18:
ans = -1
print(ans)
| n = int(input())
n_list = [int(i) for i in input().split()]
ans = 1
n_list.sort()
n_list = list(reversed(n_list))
if 0 in n_list:
print(0)
else:
for i in n_list:
ans *= i
if ans > 10**18:
ans = -1
break
print(ans)
| replace | 4 | 9 | 4 | 14 | TLE | |
p02658 | Python | Time Limit Exceeded | import sys
n = int(input())
list_input = list(map(int, sys.stdin.readline().strip().split()))
if 0 in list_input:
print(0)
exit()
a = 1
for i in list_input:
a *= i
if a > pow(10, 18):
print(-1)
else:
print(a)
| import sys
n = int(input())
list_input = list(map(int, sys.stdin.readline().strip().split()))
if 0 in list_input:
print(0)
exit()
a = 1
for i in list_input:
a *= i
if a > pow(10, 18):
break
if a > pow(10, 18):
print(-1)
else:
print(a)
| insert | 12 | 12 | 12 | 14 | TLE | |
p02658 | Python | Time Limit Exceeded | from operator import mul
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
ans = reduce(mul, a)
if ans > 10**18:
print(-1)
else:
print(ans)
| from operator import mul
from functools import reduce
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
cnt = 1
if 0 in a:
print(0)
exit()
for i in range(len(a)):
cnt *= a[i]
if cnt > 10**18:
print(-1)
exit()
print(cnt)
| replace | 4 | 10 | 4 | 17 | TLE | |
p02658 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
total = 1
for i in range(N):
total *= A[i]
if total > 10**18:
print(-1)
else:
print(total)
| N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
total = 1
for i in range(N):
total *= A[i]
if total > 10**18:
total = -1
break
print(total)
| replace | 10 | 15 | 10 | 14 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
out = 1
for a in A:
out *= a
out = -1 if (out > 10**18) else out
print(out)
| n = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
out = 1
for a in A:
out *= a
if out > 10**18:
out = -1
break
print(out)
| replace | 9 | 10 | 9 | 12 | TLE | |
p02658 | Python | Time Limit Exceeded | # B - Multiplication 2
n = int(input())
a = list(map(int, input().split()))
limit = 10**18
for i in range(1, n):
a[i] *= a[i - 1]
if a[i] > limit:
a[i] = -1
print(a[-1])
| # B - Multiplication 2
n = int(input())
a = list(map(int, input().split()))
limit = 10**18
for i in range(1, n):
a[i] = min(a[i] * a[i - 1], limit + 1)
print(a[-1] if a[-1] <= limit else -1)
| replace | 6 | 10 | 6 | 9 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
res = 1
a = map(int, input().split())
for x in a:
res *= x
if res > 1e18:
res = -1
print(res)
| def solve():
_ = int(input())
a = list(map(int, input().split()))
res = 1
for x in a:
if x == 0:
print(0)
return
for x in a:
res *= x
if res > int(1e18):
print(-1)
return
print(res)
solve()
| replace | 0 | 8 | 0 | 17 | TLE | |
p02658 | Python | Time Limit Exceeded | from collections import Counter
N = input()
A_str = input().split()
if "0" in A_str:
print(0)
exit()
c = Counter(sorted(A_str))
res = 1
for i, v in c.items():
res *= int(i) ** v
if res > 10**18:
res = -1
print(res)
| from collections import Counter
N = input()
A_str = input().split()
if "0" in A_str:
print(0)
exit()
c = Counter(sorted(A_str))
res = 1
for i, v in c.items():
res *= int(i) ** v
if res > 10**18:
res = -1
break
print(res)
| replace | 14 | 16 | 14 | 17 | TLE | |
p02658 | Python | Time Limit Exceeded | N = int(input())
A = sorted(list(map(int, input().split())))
ans = 1
for a in A:
ans *= a
print(-1 if ans > 10**18 else ans)
| N = int(input())
A = sorted(list(map(int, input().split())))
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
exit()
print(ans)
| replace | 5 | 6 | 5 | 9 | TLE | |
p02658 | Python | Runtime Error | def main():
_ = input()
lst = list(map(int, input().split()))
ans = 1
if 0 in lst:
print(0)
exit()
for i in map(int, input().split()):
ans *= i
if ans > 10**18:
print(-1)
exit()
print(ans)
if __name__ == "__main__":
main()
| def main():
_ = input()
lst = list(map(int, input().split()))
ans = 1
if 0 in lst:
print(0)
exit()
for i in lst:
ans *= i
if ans > 10**18:
print(-1)
exit()
print(ans)
if __name__ == "__main__":
main()
| replace | 8 | 9 | 8 | 9 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02658/Python/s195636172.py", line 18, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02658/Python/s195636172.py", line 9, in main
for i in map(int, input().split()... |
p02658 | Python | Time Limit Exceeded | N = int(input())
an = list(map(int, input().split()))
ans = 1
for a in an:
if 0 in an:
ans = 0
break
ans *= a
if ans > 10**18:
ans = -1
break
print(ans)
| N = int(input())
an = list(map(int, input().split()))
ans = 1
if 0 in an:
ans = 0
else:
for a in an:
ans *= a
if ans > 10**18:
ans = -1
break
print(ans)
| replace | 3 | 11 | 3 | 11 | TLE | |
p02658 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split()))
result = 1
flag = 0
for a in A:
if a == 0:
zero_flag = 1
result = 0
break
else:
result = result * a
if result > pow(10, 18):
flag = 1
result = 0
if flag == 1 and zero_flag != 1:
print(-1)
els... | N = int(input())
A = list(map(int, input().split()))
result = 1
flag = 0
zero_flag = 0
for a in A:
if a == 0:
zero_flag = 1
result = 0
break
else:
result = result * a
if result > pow(10, 18):
flag = 1
result = 0
if flag == 1 and zero_flag != 1:
... | insert | 4 | 4 | 4 | 5 | 0 | |
p02658 | Python | Time Limit Exceeded | import sys
n = int(input())
a = [int(i) for i in input().split()]
tmp = 10**18
if 0 in a:
print(0)
sys.exit()
else:
acc = 1
for i in a:
acc *= i
if len(str(i)) + len(str(acc)) < 19:
pass
elif acc > tmp:
print(-1)
sys.exit()
print(acc)
| import sys
n = int(input())
a = [int(i) for i in input().split()]
tmp = 10**18
if 0 in a:
print(0)
sys.exit()
else:
acc = 1
for i in a:
acc *= i
if acc > tmp:
print(-1)
sys.exit()
print(acc)
| replace | 12 | 17 | 12 | 15 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
li = list(map(int, input().split()))
x = 1
if 0 in li:
print(0)
else:
for i in li:
x = x * i
if x > 10**18:
print(-1)
else:
print(x)
| n = int(input())
li = list(map(int, input().split()))
x = 1
if 0 in li:
print(0)
else:
for i in li:
x = x * i
if x > 10**18:
print(-1)
exit()
print(x)
| replace | 8 | 12 | 8 | 12 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print(0)
exit()
for i in range(n):
ans *= a[i]
if ans > 10**18:
ans = "-1"
print(ans)
| n = int(input())
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print(0)
exit()
for i in range(n):
ans *= a[i]
if ans > 10**18:
print(-1)
exit()
print(ans)
| replace | 8 | 10 | 8 | 11 | TLE | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
const llong N = 1e18;
int main() {
int n;
llong a = 1, b, c;
scanf("%d", &n);
while (n--) {
scanf("%lld", &b);
c = N / b;
if (a > c) {
a = -1;
}
a = a * b;
}
a = a < 0 ? -1 : a;
cout << a;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long llong;
const llong N = 1e18;
int main() {
int n;
llong a = 1, b, c;
scanf("%d", &n);
while (n--) {
scanf("%lld", &b);
if (b == 0) {
a = 0;
break;
}
c = N / a;
if (b > c) {
a = -1;
}
a = a * b;
}
a =... | replace | 10 | 12 | 10 | 16 | 0 | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
a.sort()
judge = True
ans = 1
for i in a:
ans *= i
if ans > 1000000000000000000:
judge = False
if judge:
print(ans)
else:
print(-1)
| n = int(input())
a = list(map(int, input().split()))
a.sort()
judge = True
ans = 1
for i in a:
ans *= i
if ans > 1000000000000000000:
judge = False
break
if judge:
print(ans)
else:
print(-1)
| insert | 9 | 9 | 9 | 10 | TLE | |
p02658 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print(0)
else:
for a in A:
ans *= a
if ans > 10**18:
ans = -1
print(ans)
| N = int(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print(0)
else:
for a in A:
ans *= a
if ans > 10**18:
ans = -1
break
print(ans)
| insert | 10 | 10 | 10 | 11 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = 1
for i in a:
ans *= i
print(ans if not ans > 10**18 else -1)
| n = int(input())
a = list(map(int, input().split()))
if 0 in a:
print(0)
else:
ans = 1
for i in a:
ans *= i
if ans > 10**18:
ans = -1
break
print(ans)
| replace | 2 | 6 | 2 | 12 | TLE | |
p02658 | Python | Time Limit Exceeded | import sys
input = sys.stdin.readline
"""
"""
tot = 1
n = int(input())
arr = map(int, input().split())
for v in arr:
tot *= v
if tot > 10**18:
print(-1)
else:
print(tot)
| import sys
input = sys.stdin.readline
"""
"""
tot = 1
n = int(input())
arr = map(int, input().split())
for v in arr:
if v == 0:
tot = 0
break
if tot <= 10**18:
tot *= v
if tot > 10**18:
print(-1)
else:
print(tot)
| replace | 13 | 14 | 13 | 19 | TLE | |
p02658 | Python | Time Limit Exceeded | import sys
N = int(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print(0)
sys.exit()
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
print(ans)
| import sys
N = int(input())
A = list(map(int, input().split()))
ans = 1
if 0 in A:
print(0)
sys.exit()
for i in range(N):
ans *= A[i]
if ans > 10**18:
ans = -1
break
print(ans)
| insert | 15 | 15 | 15 | 16 | TLE | |
p02658 | Python | Runtime Error | n = int(input())
arr = list(map(int, input().split()))
while len(arr) > 1:
m = len(arr)
if m & 1:
arr.append(1)
m += 1
left, right = arr[: n // 2], arr[n // 2 :]
arr = [x * y for x, y in zip(left, right)]
x = arr[0]
if x > 10**18:
print(-1)
else:
print(x)
| n = int(input())
arr = list(map(int, input().split()))
while len(arr) > 1:
m = len(arr)
if m & 1:
arr.append(1)
m += 1
left, right = arr[: m // 2], arr[m // 2 :]
arr = [x * y for x, y in zip(left, right)]
x = arr[0]
if x > 10**18:
print(-1)
else:
print(x)
| replace | 9 | 10 | 9 | 10 | 0 | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
m = 1
if 0 in a:
m = 0
else:
for i in a:
m *= i
if m > 10**18:
m = -1
print(m)
| n = int(input())
a = list(map(int, input().split()))
m = 1
if 0 in a:
m = 0
else:
for i in a:
m *= i
if m > 10**18:
m = -1
break
print(m)
| insert | 10 | 10 | 10 | 11 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.