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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02653 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stri... | replace | 64 | 65 | 64 | 70 | TLE | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include... | replace | 260 | 261 | 260 | 263 | -11 | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | replace | 41 | 44 | 41 | 44 | 0 | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
#define mod 1000000007
#define maxn 1010
int n, a, b;
int ksm(int x, int y) {
int re = 1;
for (; (y & 1 ? re = 1ll * re * x % mod : 0), y;
y >>= 1, x = 1ll * x * x % mod)
;
return re;
}
int g[maxn][2], f[maxn][2];
void add(... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
#define mod 1000000007
#define maxn 5010
int n, a, b;
int ksm(int x, int y) {
int re = 1;
for (; (y & 1 ? re = 1ll * re * x % mod : 0), y;
y >>= 1, x = 1ll * x * x % mod)
;
return re;
}
int g[maxn][2], f[maxn][2];
void add(... | replace | 5 | 6 | 5 | 6 | 0 | |
p02653 | C++ | Runtime Error | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i... | replace | 159 | 160 | 159 | 160 | 0 | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 35 | 37 | 35 | 41 | 0 | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(_i, _a, _n) for (int _i = _a; _i <= _n; ++_i)
#define PER(_i, _a, _n) f... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(_i, _a, _n) for (int _i = _a; _i <= _n; ++_i)
#define PER(_i, _a, _n) f... | replace | 71 | 73 | 71 | 73 | 0 | |
p02653 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | replace | 457 | 460 | 457 | 460 | 0 | |
p02653 | C++ | Runtime Error | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t x) : x(x >= 0 ? x % mod : (mod - -x % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t x) : x(x >= 0 ? x % mod : (mod - -x % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
... | replace | 121 | 134 | 121 | 136 | -11 | |
p02653 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = v... | replace | 221 | 224 | 221 | 224 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02654 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 10000005, M = 1e9 + 7;
int fac[N], inv[N], f[5005][5005], n, m;
inline int ksm(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = x * x % M)
if (y & 1)
(ans *= x) %= M;
return ans;
}
inline int P(int x, int y) {
if (x >... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 20000005, M = 1e9 + 7;
int fac[N], inv[N], f[5005][5005], n, m;
inline int ksm(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = x * x % M)
if (y & 1)
(ans *= x) %= M;
return ans;
}
inline int P(int x, int y) {
if (x >... | replace | 3 | 4 | 3 | 4 | -11 | |
p02654 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5010, P = 998244353;
int n, A, fact[maxn], finv[maxn], inv[maxn];
int main() {
scanf("%d %d", &n, &A);
fact[0] = finv[0] = inv[0] = inv[1] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = 1LL * i * fact[i - 1] % P;
if (i > 1)
inv[i] = 1LL... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 10000010, P = 1000000007;
int n, A, fact[maxn], finv[maxn], inv[maxn];
int main() {
scanf("%d %d", &n, &A);
fact[0] = finv[0] = inv[0] = inv[1] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = 1LL * i * fact[i - 1] % P;
if (i > 1)
inv[i] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02654 | C++ | Runtime Error | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 10000100
const int mod = 1e9 + 7;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') ... | #include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 10000100
const int mod = 1e9 + 7;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02656 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define eb(x, y) emplace_back(x, y)
#define fi first
#define se second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define eb(x, y) emplace_back(x, y)
#define fi first
#define se second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for... | replace | 56 | 57 | 56 | 57 | 0 | |
p02656 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
inline char gc() {
// return getchar();
static char buf[100000], *l = buf, *r = buf;
return l == r && (r = (l = buf) + fread(buf, 1, 100000, stdin), l == r)
? EOF
... | #include <cstdio>
#include <iostream>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
inline char gc() {
// return getchar();
static char buf[100000], *l = buf, *r = buf;
return l == r && (r = (l = buf) + fread(buf, 1, 100000, stdin), l == r)
? EOF
... | replace | 96 | 97 | 96 | 97 | TLE | |
p02656 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | replace | 74 | 75 | 74 | 78 | 0 | |
p02657 | Python | Runtime Error | a, b = map(int, input().ssplit())
print(a * b)
| a, b = map(int, input().split())
print(a * b)
| replace | 0 | 1 | 0 | 1 | AttributeError: 'str' object has no attribute 'ssplit'. Did you mean: 'rsplit'? | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s218726646.py", line 1, in <module>
a, b = map(int, input().ssplit())
AttributeError: 'str' object has no attribute 'ssplit'. Did you mean: 'rsplit'?
|
p02657 | Python | Runtime Error | def main():
arg = int(input())
ans = arg + arg**2 + arg**3
print(str(ans))
if __name__ == "__main__":
main()
| def main():
a, b = (int(i) for i in input().split())
print(str(a * b))
if __name__ == "__main__":
main()
| replace | 1 | 4 | 1 | 3 | ValueError: invalid literal for int() with base 10: '2 5' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s552791215.py", line 8, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s552791215.py", line 2, in main
arg = int(input())
ValueError: inv... |
p02657 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
}
| replace | 7 | 8 | 7 | 10 | 10 | |
p02657 | Python | Runtime Error | a, t = map(int, input().split())
print(a * t)
a, t = map(int, input().split())
print(a * t)
| a, t = map(int, input().split())
print(a * t)
| delete | 2 | 4 | 2 | 2 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s987059931.py", line 3, in <module>
a, t = map(int, input().split())
EOFError: EOF when reading a line
|
p02657 | Python | Runtime Error | x, y = input().split()
print(x * y)
| x, y = map(int, input().split())
print(x * y)
| replace | 0 | 1 | 0 | 1 | TypeError: can't multiply sequence by non-int of type 'str' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s474601082.py", line 2, in <module>
print(x * y)
TypeError: can't multiply sequence by non-int of type 'str'
|
p02657 | Python | Runtime Error | val1 = input()
val2 = input()
print(int(val1) * int(val2))
| val1, val2 = (int(x) for x in input().split())
print(int(val1) * int(val2))
| replace | 0 | 2 | 0 | 1 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s139420322.py", line 2, in <module>
val2 = input()
EOFError: EOF when reading a line
|
p02657 | Python | Runtime Error | a, b = [*map(input().split(" "), int)]
print(a * b)
| a, b = [*map(int, input().split(" "))]
print(a * b)
| replace | 0 | 1 | 0 | 1 | TypeError: 'type' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s795495503.py", line 1, in <module>
a, b = [*map(input().split(" "), int)]
TypeError: 'type' object is not iterable
|
p02657 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
| replace | 5 | 6 | 5 | 6 | 10 | |
p02657 | C++ | Runtime Error | #include "bits/stdc++.h"
#define endl '\n'
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int A, B;
cin >> A;
cin >> B;
cout << A * B;
return A * B;
} | #include "bits/stdc++.h"
#define endl '\n'
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int A, B;
cin >> A;
cin >> B;
cout << A * B;
return 0;
} | replace | 11 | 12 | 11 | 12 | 10 | |
p02657 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
}
| replace | 6 | 7 | 6 | 8 | 10 | |
p02657 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int A, B;
cin >> A >> B;
return A * B;
} | #include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A * B << endl;
} | replace | 19 | 20 | 19 | 20 | 10 | |
p02657 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
| replace | 7 | 8 | 7 | 8 | 10 | |
p02657 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 10 | |
p02657 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
scanf("%i%i", A, B);
printf("%i", A * B);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A * B << endl;
} | replace | 5 | 7 | 5 | 7 | -11 | |
p02657 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
return a * b;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
return 0;
} | replace | 6 | 7 | 6 | 9 | 10 | |
p02657 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<lint> test(1024 * 1024 * 127);
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
vector<bool> test(1024 * 1024 * 1024);
int main() {
int a, b;
cin >> a >> b;
cout << a * b << endl;
}
| replace | 4 | 5 | 4 | 5 | MLE | |
p02657 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%n", a * b);
return 0;
} | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a * b);
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02657 | Python | Runtime Error | a, b = int(input().split())
print(a * b)
| a, b = map(int, input().split())
print(a * b)
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02657/Python/s298903403.py", line 1, in <module>
a, b = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02657 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
return A * B;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A * B << endl;
}
| replace | 6 | 7 | 6 | 7 | 10 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
unsigned long long ans = 1;
cin >> N;
bool zero = false;
bool ng = false;
for (long long i = 0; i < N; i++) {
unsigned long long tmp;
cin >> tmp;
if (tmp == 0) {
zero = true;
}
if (!zero && 100000000000000000... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
unsigned long long ans = 1;
cin >> N;
bool zero = false;
bool ng = false;
for (long long i = 0; i < N; i++) {
unsigned long long tmp;
cin >> tmp;
if (tmp == 0) {
zero = true;
}
if (!zero && 100000000000000000... | replace | 19 | 20 | 19 | 22 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
long long product = 1;
long long val = 1e18;
sort(V.begin(), V.end());
for (int i = 0; i < n; i++) {
if (product == 0) {
cout << 0;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
long long product = 1;
long long val = 1e18;
sort(V.begin(), V.end());
for (int i = 0; i < n; i++) {
if (V[i] == 0) {
cout << 0;
return 0;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(58);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
long long ans = 1;
bool larger = false;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
cerr << (1000000000000000001ll) / an... | #include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(58);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
long long ans = 1;
bool larger = false;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
if (ans && a >= (1000000000000000001... | replace | 16 | 19 | 16 | 18 | 0 | 1000000000000000001
1000000000
|
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define num1 1000000007
#define num2 998244353
#de... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define num1 1000000007
#define num2 998244353
#de... | replace | 166 | 167 | 166 | 167 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll INF = pow(10, 18);
ll A, ans = 1;
bool zero = false, overflow = false;
rep(i, 0, N - 1) {
cin >> A;
if (A == 0)
zero = true;
if (INF /... | #include <bits/stdc++.h>
#define rep(i, cc, n) for (int i = cc; i <= n; ++i)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
ll INF = pow(10, 18);
ll A, ans = 1;
bool zero = false, overflow = false;
rep(i, 0, N - 1) {
cin >> A;
if (A == 0)
zero = true;
else if (... | replace | 17 | 18 | 17 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define D(x) cout << #x << "=" << x << endl;
using namespace std;
// int _;
int n;
long long ans = 1, a[100050];
int main() {
// for(scanf("%d",&_);_;_--)
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
if (!a[i]) {
puts("0");
return 0;
}
... | #include <bits/stdc++.h>
#define D(x) cout << #x << "=" << x << endl;
using namespace std;
// int _;
int n;
long long ans = 1, a[100050];
int main() {
// for(scanf("%d",&_);_;_--)
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
if (!a[i]) {
puts("0");
return 0;
}
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <iomanip> : 表示桁数, ex) cout << fixed << setprecision(15) << ...
#define pi 3.14159265358979323846
#define rep(i, n) for (int i = 0; i < n; i++)
typedef unsigned long long ll;
typedef unsigned cha... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <iomanip> : 表示桁数, ex) cout << fixed << setprecision(15) << ...
#define pi 3.14159265358979323846
#define rep(i, n) for (int i = 0; i < n; i++)
typedef unsigned long long ll;
typedef unsigned cha... | replace | 41 | 42 | 41 | 42 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 1e18;
const int MB = 20;
const int MOD = 998244353;
const int maxN = 1e6;
void solve() {
int... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 1e18;
const int MB = 20;
const int MOD = 998244353;
const int maxN = 1e6;
void solve() {
int... | replace | 22 | 23 | 22 | 23 | 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 std;
using namespace __gnu_pbds;
#define pb push_back
#define ll long long int
#define db double
#define SORTA(v) sort(v.begin(), v.end())
#define SORTD(v) sort(v.begin(), v.end(), greater<>())
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define ll long long int
#define db double
#define SORTA(v) sort(v.begin(), v.end())
#define SORTD(v) sort(v.begin(), v.end(), greater<>())
#defi... | replace | 101 | 102 | 101 | 102 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
long long a[10001];
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
rep(i, n) {
cin >> a[i];
if (a[i] == 0) {
cout << "0\n";
return 0;
}
}
long long pro... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
long long a[100010];
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
rep(i, n) {
cin >> a[i];
if (a[i] == 0) {
cout << "0\n";
return 0;
}
}
long long pr... | replace | 4 | 5 | 4 | 5 | 0 | |
p02658 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll ... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll ... | replace | 111 | 112 | 111 | 112 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main() {
int n;
cin >> n;
ll num = 1, a;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > 0 && 1000000000000000000 / num >= a) {
num *= a;
}
else if (a == 0) {
num = 0;
}
else {
num = -1;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main() {
int n;
cin >> n;
ll num = 1, a;
for (int i = 0; i < n; i++) {
cin >> a;
if (a > 0 && 1000000000000000000 / num >= a) {
num *= a;
}
else if (a == 0) {
num = 0;
break;
}
else {
... | insert | 19 | 19 | 19 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debi(var) \
"[" << (#var) << " : " << var << "]" \
<< " "
#define debv(v) \
"[" << (#v) << ... | #include <bits/stdc++.h>
using namespace std;
#define debi(var) \
"[" << (#var) << " : " << var << "]" \
<< " "
#define debv(v) \
"[" << (#v) << ... | insert | 38 | 38 | 38 | 39 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
if (a[i] > 1e18) {
cout << -1 << endl;
return 0;
}
if (a[i] != 1)
b[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
if (a[i] > 1e18) {
cout << -1 << endl;
return 0;
}
if (a[i] != 1)
b[... | insert | 19 | 19 | 19 | 21 | 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 <iostream>
int main() {
int64_t N;
std::cin >> N;
int64_t sum = 1;
bool over = false;
for (int64_t i = 0; i < N; ++i) {
int64_t A;
std::cin >> A;
if (A == 0) {
sum = 0;
over = false;
break;
}
if (A > 1000000000000000000 / sum)
over = true;
sum *= A;... | #include <iostream>
int main() {
int64_t N;
std::cin >> N;
int64_t sum = 1;
bool over = false;
for (int64_t i = 0; i < N; ++i) {
int64_t A;
std::cin >> A;
if (A == 0) {
sum = 0;
over = false;
break;
}
if (sum > 1000000000000000000 / A)
over = true;
sum *= A;... | replace | 17 | 18 | 17 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
int n;
cin >> n;
ll aux, ans = 1;
bool sw = 0, sw2 = 0;
for (int i = 0; i < n; i++) {
cin >> aux;
if (aux == 0)
sw = 1;
if (ans > (1000000000000000000 / aux) || ans < 0)
sw2 = 1;
ans *= aux;
... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int main() {
int n;
cin >> n;
ll aux, ans = 1;
bool sw = 0, sw2 = 0;
for (int i = 0; i < n; i++) {
cin >> aux;
if (aux == 0)
sw = 1;
else if (ans > (1000000000000000000 / aux) || ans < 0)
sw2 = 1;
ans *= au... | replace | 12 | 13 | 12 | 13 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
constexpr ll M = (ll)1e+18;
ll r = 1;
int b = 0;
for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
constexpr ll M = (ll)1e+18;
ll r = 1;
int b = 0;
for (in... | replace | 28 | 29 | 28 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
long A[100005];
REP(i, N) cin >> A[i];
long ans = 1l;
long sai = 1000000000000000000;
bool ok = true;
sort(A, A + N);
REP(i, N) {
if (A[i] == 0l) {
ans = 0l;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int N;
cin >> N;
long A[100005];
REP(i, N) cin >> A[i];
long ans = 1l;
long sai = 1000000000000000000;
bool ok = true;
sort(A, A + N);
REP(i, N) {
if (A[i] == 0l) {
ans = 0l;
... | insert | 20 | 20 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a;
ll ans = 1;
bool flag = true;
for (int i = 0; i < n; i++) {
ll b;
cin >> b;
a.push_back(b);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] > 100000000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a;
ll ans = 1;
bool flag = true;
for (int i = 0; i < n; i++) {
ll b;
cin >> b;
a.push_back(b);
if (b == 0) {
cout << 0 << endl;
return 0;
}
}
sort(a.begin(), a.en... | insert | 14 | 14 | 14 | 18 | 0 | |
p02658 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
long long a, b, c, h, i, j, k, l, m, n, x, y;
long long ans = 1;
double aa, aans = 1.0;
string s;
cin >> n;
// vector<ll> aa(n);
bool flag = ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
long long a, b, c, h, i, j, k, l, m, n, x, y;
long long ans = 1;
double aa, aans = 1.0;
string s;
cin >> n;
// vector<ll> aa(n);
bool flag = ... | replace | 17 | 20 | 17 | 22 | 0 | |
p02658 | C++ | Runtime Error | #include <stdio.h>
int main() {
const long long lim = 2000000000000000000ll;
int N;
scanf("%d", &N);
long long A = 1;
while (N--) {
long long a;
scanf("%lld", &a);
if (A > lim / a)
A = lim;
else
A *= a;
if (A > lim)
A = lim;
}
if (A > lim / 2)
A = -1;
printf("... | #include <stdio.h>
int main() {
const long long lim = 2000000000000000000ll;
int N;
scanf("%d", &N);
long long A = 1;
while (N--) {
long long a;
scanf("%lld", &a);
if (a && A > lim / a)
A = lim;
else
A *= a;
if (A > lim)
A = lim;
}
if (A > lim / 2)
A = -1;
pri... | replace | 11 | 12 | 11 | 12 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
// const ll LLMAX = LLONG_MAX;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];... | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
// const ll LLMAX = LLONG_MAX;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >>... | replace | 14 | 15 | 14 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Author: Ezio Sam
/* Shorthands */
#define ll unsigned long long
#define pb push_back
#define mp make_pair
#define sp ": "
#define cs "Case "
#define fi first
#define sn second
#define po(x) x *x
/* STL */
#define vi vector<int> v
#define pii pair<int, int>
#define pll pa... | #include <bits/stdc++.h>
using namespace std;
// Author: Ezio Sam
/* Shorthands */
#define ll unsigned long long
#define pb push_back
#define mp make_pair
#define sp ": "
#define cs "Case "
#define fi first
#define sn second
#define po(x) x *x
/* STL */
#define vi vector<int> v
#define pii pair<int, int>
#define pll pa... | insert | 44 | 44 | 44 | 48 | 0 | |
p02658 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
long long n, a, m = 1, e = 1e18, fl;
int main() {
cin >> n;
while (n--) {
cin >> a;
if (a <= e / m)
m *= a;
else
fl = 1;
}
if (m == 0)
cout << 0;
else if (fl)
cout << -1;
else
cout << m;
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
long long n, a, m = 1, e = 1e18, fl;
int main() {
cin >> n;
while (n--) {
cin >> a;
if (a <= e / m)
m *= a;
else
fl = 1;
if (m == 0)
break;
}
if (m == 0)
cout << 0;
else if (fl)
cout << -1;
else
cout <<... | insert | 13 | 13 | 13 | 15 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
const ll mx = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool over = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
const ll mx = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool over = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
... | replace | 23 | 24 | 23 | 24 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll limit = 1000000000000000000;
int main() {
// 入力
ll N;
cin >> N;
vector<ll> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
ll ans = 1;
for (ll i = 0; i < N; i++) {
if (vec.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll limit = 1000000000000000000;
int main() {
// 入力
ll N;
cin >> N;
vector<ll> vec(N);
for (ll i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
ll ans = 1;
for (ll i = 0; i < N; i++) {
if (vec.at(... | insert | 24 | 24 | 24 | 27 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
long long count = 1;
for (int i = 0; i < n; i++) {
if (count > 0) {
if (count <= 1000000000000000000 / a[i])
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
long long count = 1;
for (int i = 0; i < n; i++) {
if (count != -1) {
if (a[i] == 0)
count = 0;
else if ... | replace | 12 | 14 | 12 | 16 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[10010];
int main() {
int n;
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++;
if (zero > 0) {
printf("0\n");
return 0;
}
ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100010];
int main() {
int n;
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++;
if (zero > 0) {
printf("0\n");
return 0;
}
l... | replace | 3 | 4 | 3 | 4 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | replace | 41 | 42 | 41 | 42 | -8 | |
p02658 | C++ | Runtime Error | /*Author - Shubham Gupta (@shubham107)*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define forn(i, n) for (int i = 0; i < n; i++)
#define rforn(... | /*Author - Shubham Gupta (@shubham107)*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define forn(i, n) for (int i = 0; i < n; i++)
#define rforn(... | insert | 43 | 43 | 43 | 44 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
ll mx = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
ll mx = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;... | replace | 26 | 27 | 26 | 27 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define ff first
#define ss second
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define ff first
#define ss second
#define mp make_pa... | replace | 78 | 79 | 78 | 79 | -11 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) \
freopen((string(s) + "." + end1).c_str(), "r", stdin), ... | #include <bits/stdc++.h>
#define int long long
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) \
freopen((string(s) + "." + end1).c_str(), "r", stdin), ... | insert | 19 | 19 | 19 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
#define LIMIT 1000000000000000000
using namespace std;
int main() {
int n;
unsigned long long a, ans = 1;
bool overflow = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (!a || a <= LIMIT / ans) {
ans *= a;
} else {
overflow = true;
}
}
if (!... | #include <iostream>
#define LIMIT 1000000000000000000
using namespace std;
int main() {
int n;
unsigned long long a, ans = 1;
bool overflow = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (!a || !ans || a <= LIMIT / ans) {
ans *= a;
} else {
overflow = true;
}
}
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned LL
#define LD long double
const LL INF = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
LL a;
LL w = 1;
bool czy = 1;
for (int i = 0; i < n; i++) {
cin >> a;
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned LL
#define LD long double
const LL INF = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
LL a;
LL w = 1;
bool czy = 1;
for (int i = 0; i < n; i++) {
cin >> a;
... | replace | 29 | 30 | 29 | 31 | 0 | |
p02658 | C++ | Runtime Error | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | insert | 46 | 46 | 46 | 50 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)((x).size())
#define forn(i, n) for (int i = 0; i < n; i++)
#define forse(i, s, e) for (int i = s; i < e; i++)
#define pb push_back
#define fi first
#define se second
#define all(vec) vec.begin(), vec.end()
#define time() ((double)clock() / CLOCKS_PER_SE... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)((x).size())
#define forn(i, n) for (int i = 0; i < n; i++)
#define forse(i, s, e) for (int i = s; i < e; i++)
#define pb push_back
#define fi first
#define se second
#define all(vec) vec.begin(), vec.end()
#define time() ((double)clock() / CLOCKS_PER_SE... | replace | 28 | 29 | 28 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int64_t> v(N);
rep(i, N) {
cin >> v.at(i);
if (v.at(i) == 0) {
std::cout << "0" << '\n';
return 0;
}
}
int64_t a = 1, b = 0, c = 0, x, y, z;
x = 1000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N;
cin >> N;
vector<int64_t> v(N);
rep(i, N) {
cin >> v.at(i);
if (v.at(i) == 0) {
std::cout << "0" << '\n';
return 0;
}
}
int64_t a = 1, b = 0, c = 0, x, y, z;
x = 1000000... | replace | 18 | 19 | 18 | 19 | -8 | |
p02658 | C++ | Runtime Error | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, r... | replace | 41 | 42 | 41 | 46 | 0 | |
p02658 | C++ | Runtime Error | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define PI 3.14159265358979323846264338327950L
long long res;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
bool flag = true;
long long *array = new long long[N];
cin >> N;
for (int i =... | #include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define PI 3.14159265358979323846264338327950L
long long res;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
bool flag = true;
// long long *array = new long long [N];
long long array[1000... | replace | 16 | 17 | 16 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long out = 1;
vector<unsigned long long> a(n);
for (int x = 0; x < n; x++) {
cin >> a[x];
}
sort(a.begin(), a.end());
if (a[0] == 0) ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long out = 1;
vector<unsigned long long> a(n);
for (int x = 0; x < n; x++) {
cin >> a[x];
}
sort(a.begin(), a.end());
if (a[0] == 0) ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll unsigned long long int
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
const ll lim = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >>... | #include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll unsigned long long int
/* run this program using the console pauser or add your own getch,
* system("pause") or input loop */
using namespace std;
const ll lim = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >>... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using names... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using names... | replace | 37 | 39 | 37 | 41 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long X = 1;
long long Y = 1;
sort(A.begin(), A.end());
if (A.at(0) == 0) {
X = 0;
}
for (int i = 0; i < 18; i++) {
Y = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long X = 1;
long long Y = 1;
sort(A.begin(), A.end());
if (A.at(0) == 0) {
cout << 0 << endl;
exit(0);
}
for (int i = 0... | replace | 20 | 21 | 20 | 22 | 0 | |
p02658 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long arr[100010];
int main() {
long long sum = 1;
long long n;
cin >> n;
long long max = pow(10, 18);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
if (arr[i] == 0) {
... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
long long arr[100010];
int main() {
long long sum = 1;
long long n;
cin >> n;
long long max = pow(10, 18);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
if (arr[i] == 0) {
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long int arr[n];
unsigned long long int pro = 1, temp;
int flag = 0, flag1 = 0;
for (int a = 0; a < n; a++) {
cin >> arr[a];
if (arr[a] == 0) {
flag = 1;
cout << "0";
break;
}
}
if (fl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long int arr[n];
unsigned long long int pro = 1, temp;
int flag = 0, flag1 = 0;
for (int a = 0; a < n; a++) {
cin >> arr[a];
if (arr[a] == 0) {
flag = 1;
cout << "0";
break;
}
}
if (fl... | replace | 20 | 21 | 20 | 21 | -8 | |
p02658 | C++ | Runtime Error | #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() {
int n;
ll ans = 1;
cin >> n;
bool over = false;
bool zero = false;
rep(i, n) {
ll a;
cin >> a;
if (ans > 1000000000000000000 / a)... | #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() {
int n;
ll ans = 1;
cin >> n;
bool over = false;
bool zero = false;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
zero = true;
... | insert | 16 | 16 | 16 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm> // sort, lower_bound, heap, min, next_permutation
#include <bitset> // bitset
#include <cmath> // sin, exp, log, pow, sqrt
#include <cstdio> // fopen, printf, scanf, puts
#include <ctime> // clock
#include <functional> // greater, less
#include <iomanip> // setfill, setbase
#i... | #include <algorithm> // sort, lower_bound, heap, min, next_permutation
#include <bitset> // bitset
#include <cmath> // sin, exp, log, pow, sqrt
#include <cstdio> // fopen, printf, scanf, puts
#include <ctime> // clock
#include <functional> // greater, less
#include <iomanip> // setfill, setbase
#i... | replace | 38 | 39 | 38 | 42 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
int main() {
int n;
cin >> n;
ll pro = 1;
bool boo = false;
for (int i = 0; i < n; i++) {
ll proo = pro;
ll a;
cin >> a;
if (a == 0) {
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
int main() {
int n;
cin >> n;
ll pro = 1;
bool boo = false;
for (int i = 0; i < n; i++) {
ll proo = pro;
ll a;
cin >> a;
if (a == 0) {
cou... | insert | 17 | 17 | 17 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define xx first
#define yy second
#define D if (0)
#define cerr D cerr
using namespace std;
typedef long long ll;
template <typename T> vector<T> read_n(ll n) {
vector<T> ret(n);
for (ll i = 0; i < n; i++)
cin >> ret[i];
return ret;
}
template <typename iter> void dump(iter begin,... | #include <bits/stdc++.h>
#define xx first
#define yy second
#define D if (0)
#define cerr D cerr
using namespace std;
typedef long long ll;
template <typename T> vector<T> read_n(ll n) {
vector<T> ret(n);
for (ll i = 0; i < n; i++)
cin >> ret[i];
return ret;
}
template <typename iter> void dump(iter begin,... | replace | 40 | 41 | 40 | 41 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename Tu>
static inline constexpr bool is_multiplication_safe(Tu a, Tu b) {
return !a || b <= numeric_limits<Tu>::max() / a;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll ans = 1, a = 0;
int n;
bool over = fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename Tu>
static inline constexpr bool is_multiplication_safe(Tu a, Tu b) {
return !a || b <= numeric_limits<Tu>::max() / a;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll ans = 1, a = 0;
int n;
bool over = fals... | replace | 26 | 29 | 26 | 31 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int ctoi(char c) {
if (c < '0' || '9' < c)
throw invalid_argument("ctoi error");
return c - '0';
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
tem... | #include <bits/stdc++.h>
using namespace std;
inline int ctoi(char c) {
if (c < '0' || '9' < c)
throw invalid_argument("ctoi error");
return c - '0';
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
tem... | insert | 50 | 50 | 50 | 52 | -11 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
unsigned long long s = 1;
for (int i = 0; i < n; i++) {
if (a.at(i) == 0) {
cout << 0 << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<unsigned long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
unsigned long long s = 1;
for (int i = 0; i < n; i++) {
if (a.at(i) == 0) {
cout << 0 << endl;
ret... | insert | 17 | 17 | 17 | 18 | 0 | |
p02658 | C++ | Runtime Error | /* winners never quit and quitters never win.
#swap */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("-O3")
using ll = long long;
using ld = long double;
... | /* winners never quit and quitters never win.
#swap */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("-O3")
using ll = long long;
using ld = long double;
... | replace | 107 | 108 | 107 | 108 | 0 | Time : 25.315ms
|
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int flag = 0;
long long result = 1;
cin >> N;
vector<long long> A(N);
for (int a = 0; a < N; a++)
cin >> A[a];
sort(A.begin(), A.end());
for (int a = 0; a < N; a++) {
if (1000000000000000000 / result < A[a]) {
result = -1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int flag = 0;
long long result = 1;
cin >> N;
vector<long long> A(N);
for (int a = 0; a < N; a++)
cin >> A[a];
sort(A.begin(), A.end());
for (int a = 0; a < N; a++) {
if (result != 0) {
if (1000000000000000000 / result < A[a... | replace | 12 | 15 | 12 | 17 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n;
cin >> n;
ll sum = 1;
ll a[n];
rep(i, 0, n) cin >> a[i];
sort(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n;
cin >> n;
ll sum = 1;
ll a[n];
rep(i, 0, n) cin >> a[i];
sort(a... | replace | 16 | 17 | 16 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <stdio.h>
int main() {
int berapaKali;
long long a1[10001];
long long a2 = 1;
long long max = 1000000000000000000;
scanf("%d", &berapaKali);
for (int j = 0; j < berapaKali; j++) {
scanf("%lld", &a1[j]);
if (a1[j] == 0) {
printf("0");
return 0;
}
}
for (int i = 0; i ... | #include <stdio.h>
int main() {
int berapaKali;
long long a1[100001];
long long a2 = 1;
long long max = 1000000000000000000;
scanf("%d", &berapaKali);
for (int j = 0; j < berapaKali; j++) {
scanf("%lld", &a1[j]);
if (a1[j] == 0) {
printf("0");
return 0;
}
}
for (int i = 0; i... | replace | 5 | 6 | 5 | 6 | 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++)
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 0;
int main() {
ll N;
cin >> N;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll ans = 1;
sort(A,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 0;
int main() {
ll N;
cin >> N;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll ans = 1;
sort(A,... | insert | 18 | 18 | 18 | 22 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
const lint MAX = 1e18;
int main(void) {
int N;
cin >> N;
lint ans = 1;
int over = 0;
int zero = 0;
for (int i = 0; i < N; i++) {
long long x;
cin >> x;
if (x == 0) {
ze... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
const lint MAX = 1e18;
int main(void) {
int N;
cin >> N;
lint ans = 1;
int over = 0;
int zero = 0;
for (int i = 0; i < N; i++) {
long long x;
cin >> x;
if (x == 0) {
ze... | replace | 20 | 21 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, ans = 1;
bool zeros = false, o = false;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (a[i] == 0)
zeros = true;
}
for (ll i = 0; i < n; i++) {
if (ans > 1000000000000... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, ans = 1;
bool zeros = false, o = false;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (a[i] == 0)
zeros = true;
}
if (!zeros) {
for (ll i = 0; i < n; i++) {
if ... | replace | 13 | 18 | 13 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend... | insert | 70 | 70 | 70 | 71 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long A[100100];
int N;
cin >> N;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
if (a == 0) {
cout << "0" << endl;
return 0;
}
}
long long ans = 1;
for (int i = 0; i < N; i++) {
if (A[i] <= 1000000000000000... | #include <iostream>
using namespace std;
int main() {
long long A[100100];
int N;
cin >> N;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
if (a == 0) {
cout << "0" << endl;
return 0;
} else {
A[i] = a;
}
}
long long ans = 1;
for (int i = 0; i < N; i++) {
... | insert | 14 | 14 | 14 | 16 | -8 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
int main() {
int n;
cin >> n;
long long ans = 1;
long long MX = 1e18;
bool ng = false;
rep(i, 0, n) {
long long a;
cin >>... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
int main() {
int n;
cin >> n;
long long ans = 1;
long long MX = 1e18;
bool ng = false;
rep(i, 0, n) {
long long a;
cin >>... | replace | 22 | 23 | 22 | 23 | 0 | |
p02658 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define PI 3.14159265358979323846264338327950288
#define rep(i, n) for (int i = 0; i < n; i++)
#define exf(x) ... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define PI 3.14159265358979323846264338327950288
#define rep(i, n) for (int i = 0; i < n; i++)
#define exf(x) ... | replace | 60 | 62 | 60 | 63 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.