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 | Python | Time Limit Exceeded | n = int(input())
a = [int(i) for i in input().split()]
answer = 1
for i in range(len(a)):
answer = answer * a[i]
if answer > 10**18:
print(-1)
else:
print(answer)
| n = int(input())
a = [int(i) for i in input().split()]
answer = 1
for i in range(len(a)):
answer = answer * a[i]
if answer > 10**18:
if 0 in a:
print(0)
else:
print(-1)
break
else:
print(answer)
| replace | 5 | 8 | 5 | 11 | TLE | |
p02658 | Python | Time Limit Exceeded | answer = 1
lens = int(input())
arrs = [int(x) for x in input().split()]
for x in arrs:
answer *= x
if answer > int(10**18):
answer = -1
print(answer)
| answer = 1
lens = int(input())
arrs = [int(x) for x in input().split()]
if 0 in arrs:
answer = 0
else:
for x in arrs:
answer *= x
if answer > int(10**18):
answer = -1
break
print(answer)
| replace | 3 | 7 | 3 | 11 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
res = 1
for a_i in a:
if 0 == a_i:
print(0)
exit(0)
elif res > 10**18:
res = -1
else:
res *= a_i
print(-1 if res > 10**18 else res)
| n = int(input())
a = list(map(int, input().split()))
res = 1
for a_i in a:
if 0 == a_i:
print(0)
exit(0)
elif res > 10**18:
continue
else:
res *= a_i
print(-1 if res > 10**18 else res)
| replace | 8 | 9 | 8 | 9 | TLE | |
p02658 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
m = 10**18
ans = 1
for i in range(0, n):
if a[i] == 0:
print(0)
exit()
for i in range(0, n):
ans *= a[i]
if ans > m:
print(-1)
exit(-1)
if ans > m:
print(-1)
else:
print(ans)
| n = int(input())
a = list(map(int, input().split()))
m = 10**18
ans = 1
for i in range(0, n):
if a[i] == 0:
print(0)
exit()
for i in range(0, n):
ans *= a[i]
if ans > m:
print(-1)
exit()
if ans > m:
print(-1)
else:
print(ans)
| replace | 15 | 16 | 15 | 16 | 0 | |
p02658 | Python | Time Limit Exceeded | from sys import stdin
input = stdin.readline
n = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
cum = 1
over = False
for x in a:
if x == 0:
cum = 0
break
cum *= x
if cum > 1e18:
over = True
print(-1) if (over and cum != 0) else print(cum)
| from sys import stdin
input = stdin.readline
n = int(input().rstrip())
a = list(map(int, input().rstrip().split()))
cum = 1
over = False
for x in a:
if x == 0:
cum = 0
break
if cum == 0:
print(0)
else:
for x in a:
cum *= x
if cum > 1e18:
over = True
... | replace | 14 | 19 | 14 | 23 | TLE | |
p02658 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
ans = 1
for i in range(A):
ans += A[i]
if ans > 10**18:
print(-1)
exit()
print(ans)
| N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
ans = 1
for i in range(N):
ans *= A[i]
if ans > 10**18:
print(-1)
exit()
print(ans)
| replace | 7 | 9 | 7 | 9 | TypeError: 'list' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02658/Python/s912887919.py", line 8, in <module>
for i in range(A):
TypeError: 'list' object cannot be interpreted as an integer
|
p02658 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
ans = 1
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
A.sort()
if A[0] == 0:
print(0)
else:
for i in range(N):
ans *= A[i]
if ans > 10**18:
print(-1)
exit(0)
print(ans)
| replace | 3 | 8 | 3 | 13 | TLE | |
p02658 | Python | Runtime Error | N, A = map(int, open(0).read().split())
if 0 in A:
print(0)
exit()
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
break
else:
print(ans)
| N, *A = map(int, open(0).read().split())
if 0 in A:
print(0)
exit()
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
break
else:
print(ans)
| replace | 0 | 1 | 0 | 1 | ValueError: too many values to unpack (expected 2) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02658/Python/s722215477.py", line 1, in <module>
N, A = map(int, open(0).read().split())
ValueError: too many values to unpack (expected 2)
|
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = 1
a_in = [s for s in a if 0 in a]
if a_in:
print("0")
exit()
else:
for i in a:
ans = ans * i
if ans > 10**18:
print("-1")
exit()
print(ans)
| n = int(input())
a = list(map(int, input().split()))
ans = 1
if min(a) == 0:
print("0")
exit()
else:
for i in a:
ans = ans * i
if ans > 10**18:
print("-1")
exit()
print(ans)
| replace | 5 | 7 | 5 | 6 | TLE | |
p02658 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
n = 1
for i in a:
n *= i
if n > 10**18:
n = -1
print(n)
| def main():
N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
return
ans = 1
for i in A:
ans *= i
if ans > 1000000000000000000:
print(-1)
return
print(ans)
main()
| replace | 0 | 8 | 0 | 16 | TLE | |
p02658 | Python | Time Limit Exceeded | #!/usr/bin/env python3
n = int(input())
arg = list(map(int, input().split()))
ans = 1
if 0 in arg:
ans = 0
else:
for m in arg:
ans *= m
if ans > 1000000000000000000:
ans = -1
print(ans)
| #!/usr/bin/env python3
n = int(input())
arg = list(map(int, input().split()))
ans = 1
if 0 in arg:
ans = 0
else:
for m in arg:
ans *= m
if ans > 1000000000000000000:
ans = -1
break
print(ans)
| insert | 14 | 14 | 14 | 15 | TLE | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const string ln = "\n";
constexpr int INF = 1001001001;
constexpr int MOD = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const string ln = "\n";
constexpr int INF = 1001001001;
constexpr int MOD = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(fals... | insert | 29 | 29 | 29 | 33 | 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 ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, l... | #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 ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, l... | replace | 29 | 30 | 29 | 30 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm> //min,max,swap,sort,reverse,lower_bound,upper_bound
#include <bitset> //bitset
#include <cctype> //isupper,islower,isdigit,toupper,tolower
#include <cstdint> //int64_t,int*_t
#include <cstdio> //printf
#include <cstdio>
#include <cstring>
#include <deque> //deque
#include <iomanip>
#incl... | #include <algorithm> //min,max,swap,sort,reverse,lower_bound,upper_bound
#include <bitset> //bitset
#include <cctype> //isupper,islower,isdigit,toupper,tolower
#include <cstdint> //int64_t,int*_t
#include <cstdio> //printf
#include <cstdio>
#include <cstring>
#include <deque> //deque
#include <iomanip>
#incl... | replace | 44 | 45 | 44 | 45 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long LL;
int main() {
int N;
cin >> N;
LL out = 1;
const LL MX = 1e18;
bool ng = false;
for (int i = 0; i < N; i++) {
LL b;
cin >> b;
if (b == 0) {
cout << 0 << endl;
return 0;
}
if (MX / out < b) {
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long LL;
int main() {
int N;
cin >> N;
LL out = 1;
const LL MX = 1e18;
bool ng = false;
for (int i = 0; i < N; i++) {
LL b;
cin >> b;
if (b == 0) {
cout << 0 << endl;
return 0;
}
if (ng || MX / out < b) {
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02658 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#de... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#de... | insert | 124 | 124 | 124 | 130 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define bs binary_search
#define pll pair<ll, ll>
#define ppll pair<ll, pll>
#define sll stack<ll>
#define qll qu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define nl "\n"
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define bs binary_search
#define pll pair<ll, ll>
#define ppll pair<ll, pll>
#define sll stack<ll>
#define qll qu... | replace | 38 | 39 | 38 | 39 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | replace | 24 | 25 | 24 | 25 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <limits>
#define ll long long
#define F first
#define S second
#define pb push_back
#define oo 1e18
#define endl '\n'
#define si size()
#define all(v) v.begin(), v.end()
#define FASTIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define Matrix vector<vector<long long>>
#defi... | #include <bits/stdc++.h>
#include <limits>
#define ll long long
#define F first
#define S second
#define pb push_back
#define oo 1e18
#define endl '\n'
#define si size()
#define all(v) v.begin(), v.end()
#define FASTIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define Matrix vector<vector<long long>>
#defi... | insert | 35 | 35 | 35 | 37 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
ll st = 1;
ll lim = 1000000000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
ll st = 1;
ll lim = 1000000000000... | insert | 25 | 25 | 25 | 29 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define go ios::sync_with_stdio(0)
ll inf = 1e18;
bool zero, over;
int main() {
go;
int n;
cin >> n;
ll x;
cin >> x;
if (!x)
zero = 1;
for (int i = 0; i < n - 1; i++) {
ll y;
cin >> y;
if (!y)
zero = 1;
if (inf /... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define go ios::sync_with_stdio(0)
ll inf = 1e18;
bool zero, over;
int main() {
go;
int n;
cin >> n;
ll x;
cin >> x;
if (!x)
zero = 1;
for (int i = 0; i < n - 1; i++) {
ll y;
cin >> y;
if (!y)
zero = 1;
if (inf /... | insert | 24 | 24 | 24 | 28 | 0 | |
p02658 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long MAX = 1e18;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N;
cin >> N;
long long A[N];
long long sum = 1;
bool overflow = false;
bool hasZero = false;
for (int i = 0; i < N; i++) {
cin >> A[i];... | #include <iostream>
using namespace std;
long long MAX = 1e18;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N;
cin >> N;
long long A[N];
long long sum = 1;
bool overflow = false;
bool hasZero = false;
for (int i = 0; i < N; i++) {
cin >> A[i];... | replace | 23 | 24 | 23 | 24 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02658 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
const int base = 1000000000;
const int base_digits = 9;
struct bigint {
vector<int> a;
int sign;
bigint() : sign(1) {}
bigint(long long v) { *this = v; }
bigint(co... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
const int base = 1000000000;
const int base_digits = 9;
struct bigint {
vector<int> a;
int sign;
bigint() : sign(1) {}
bigint(long long v) { *this = v; }
bigint(co... | replace | 340 | 342 | 340 | 349 | TLE | |
p02658 | C++ | Runtime Error | // sppsfver - 05.08.2020
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
ll n, a, ans = 1;
bool flag, zero;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == 0)
retu... | // sppsfver - 05.08.2020
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
ll n, a, ans = 1;
bool flag, zero;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == 0)
retu... | replace | 20 | 22 | 20 | 21 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// T+N
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <class T, class T2> inline bool chkmax(T &x, const T2 &y) {
return x < y ? x = y, 1 : 0;
}
templat... | #include <bits/stdc++.h>
using namespace std;
// T+N
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <class T, class T2> inline bool chkmax(T &x, const T2 &y) {
return x < y ? x = y, 1 : 0;
}
templat... | replace | 34 | 35 | 34 | 36 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define faster \
ios_base::sync_with_stdio(false); ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define faster \
ios_base::sync_with_stdio(false); ... | replace | 37 | 38 | 37 | 38 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, over = 0;
long long int total = 1;
cin >> a;
for (int k = 0; k < a; k++) {
long long int b;
cin >> b;
if (total > 1000000000000000000ll / b) {
over++;
} ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, over = 0;
long long int total = 1;
cin >> a;
for (int k = 0; k < a; k++) {
long long int b;
cin >> b;
if (b != 0 && total > 1000000000000000000ll / b) {
over... | replace | 14 | 15 | 14 | 15 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | replace | 24 | 25 | 24 | 25 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
#define max 1000000
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define lli long long int
#define endl '\n'
#define FastInput ios_base::sync_with_stdio(false), cin.tie(NU... | #include <bits/stdc++.h>
#define max 1000000
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define lli long long int
#define endl '\n'
#define FastInput ios_base::sync_with_stdio(false), cin.tie(NU... | replace | 40 | 41 | 40 | 41 | 0 | time = 0 sec
|
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
ll c = a % b;
while (c ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b) {
ll c = a % b;
while (c ... | insert | 374 | 374 | 374 | 380 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << ... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << ... | replace | 53 | 59 | 53 | 61 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
double pi = 3.14159265358979;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
double pi = 3.14159265358979;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int ma... | replace | 26 | 27 | 26 | 27 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll tmp, res = 1, max = 1000000000000000000;
cin >> n;
bool ng = false;
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp == 0) {
cout << 0 << "\n";
return 0;
}
if (tmp > max / res) {
ng ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll tmp, res = 1, max = 1000000000000000000;
cin >> n;
bool ng = false;
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp == 0) {
cout << 0 << "\n";
return 0;
}
if (ng || tmp > max / res || res... | 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++)
using ll = long long;
const ll MX = 1e18;
int main() {
int n;
cin >> n;
vector<int> vec(n);
ll ans = 1;
bool flag = 0;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll MX = 1e18;
int main() {
int n;
cin >> n;
vector<int> vec(n);
ll ans = 1;
bool flag = 0;
rep(i, n) {
ll a;
cin >> a;
if (a == 0) {
cout << 0 << endl;
r... | insert | 24 | 24 | 24 | 25 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define ppll pair<pll, pll>
#define pii pair<int, int>
#define pb push_back
const ll inf = 2e18 + 7;
const ll mod = 1e9 + 7;
const ll N = 1e6 +... | #include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define ppll pair<pll, pll>
#define pii pair<int, int>
#define pb push_back
const ll inf = 2e18 + 7;
const ll mod = 1e9 + 7;
const ll N = 1e6 +... | insert | 26 | 26 | 26 | 30 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n";
#define int long long
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define double long double
#define M_PI 3.1415926535897932... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n";
#define int long long
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define double long double
#define M_PI 3.1415926535897932... | replace | 21 | 22 | 21 | 22 | 0 | |
p02658 | C++ | Time Limit Exceeded | // Zory-2020
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(), (x).end()
#define sz... | // Zory-2020
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(), (x).end()
#define sz... | replace | 118 | 119 | 118 | 119 | TLE | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int m = 1;
bool q = false;
for (int x = 1; x <= n; ++x) {
long long int v;
cin >> v;
if (v <= 1000000000000000000 / m) {
m *= v;
} else {
q = true;
}
}
if (q && m != 0) {
m = -1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int m = 1;
bool q = false;
for (int x = 1; x <= n; ++x) {
long long int v;
cin >> v;
if (v <= 1000000000000000000 / m) {
m *= v;
} else {
q = true;
}
if (m == 0) {
break;
}
}
... | insert | 15 | 15 | 15 | 18 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define... | replace | 35 | 36 | 35 | 36 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long ans = 1;
vector<unsigned long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
if (data.at(i) > 1000000000000000000 / an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unsigned long long ans = 1;
vector<unsigned long long> data(n);
for (int i = 0; i < n; i++) {
cin >> data.at(i);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
if (data.at(i) > 1000000000000000000 / an... | insert | 19 | 19 | 19 | 23 | 0 | |
p02658 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
#ifdef EBUG
#define debug(x) cout << "\033[31m" << #x << ": " << x << "... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
#ifdef EBUG
#define debug(x) cout << "\033[31m" << #x << ": " << x << "... | replace | 38 | 39 | 38 | 40 | 0 | |
p02658 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
typedef unsigned long long ull;
int n;
ull a;
ull ans = 1;
int main() {
bool ok = true;
cin >> n;
rep(i, n) {
cin >> a;
if (a == 0) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define inf 1000000000
typedef long long ll;
typedef unsigned long long ull;
int n;
ull a;
ull ans = 1;
int main() {
bool ok = true;
cin >> n;
rep(i, n) {
cin >> a;
if (a == 0) {
cout << 0 << endl;
... | replace | 22 | 23 | 22 | 25 | 0 | |
p02659 | Python | Runtime Error | from decimal import Decimal
numbers = input().split()
a = float(numbers[0])
b = Decimal(numbers[1])
c = a * b
print(int(c))
| from decimal import Decimal
numbers = input().split()
a = Decimal(numbers[0])
b = Decimal(numbers[1])
c = a * b
print(int(c))
| replace | 3 | 4 | 3 | 4 | TypeError: unsupported operand type(s) for *: 'float' and 'decimal.Decimal' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s952258773.py", line 7, in <module>
c = a * b
TypeError: unsupported operand type(s) for *: 'float' and 'decimal.Decimal'
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define int long long
int INF = 1e9 + 7;
signed main() {
int A;
cin >> A;
long double B;
cin >> B;
int Z = B *= 100;
int X = Z / 100;
int Y = Z % 100;
cout << A * X + A / Y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long double A, B;
cin >> A >> B;
cout << long(floor(A * B)) << endl;
}
| replace | 2 | 14 | 2 | 6 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using VVI = vector<vector<int>>;
using VI = vector<int>;
const static string el = "\n";
int main() {
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
double a;
cin >> a;
string b;
cin >> b;
long long sei = stoll(b.substr(0, -3));
string tmp = "";
for (int... | #include <bits/stdc++.h>
using namespace std;
using VVI = vector<vector<int>>;
using VI = vector<int>;
const static string el = "\n";
int main() {
long double a, b;
cin >> a >> b;
cout << (long long)(floor(a * b));
return 0;
} | replace | 7 | 24 | 7 | 10 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoll
|
p02659 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<long int> sieve(long int n) {
long int arr[n + 1];
for (long int i = 0; i <= n; ++i) {
arr[i] = 1;
}
arr[0] = 0;
arr[1] = 0;
long int p = 2;
w... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<long int> sieve(long int n) {
long int arr[n + 1];
for (long int i = 0; i <= n; ++i) {
arr[i] = 1;
}
arr[0] = 0;
arr[1] = 0;
long int p = 2;
w... | replace | 34 | 35 | 34 | 35 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
long long b[a + 1];
float p = 1.0 / 100;
for (int i = 1; i <= a; i++) {
cin >> b[i];
}
for (int i = 1; i <= a; i++) {
if (b[i] == 0) {
cout << 0;
return 0;
}
}
for (int i = 1; i <= a; i++) {
p = p ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
double b;
cin >> a >> b;
cout << ((long long)(b * 100 + 0.0000001)) * a / 100;
return 0;
} | replace | 4 | 26 | 4 | 8 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
#define nl '\n'
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
setprecision(10);
cout << fixed;
ll a;
float b;
cin >> a >> b;
ll c = b * 100;
assert((float)b * 100 == c);
ll ans = a * ... | #include <bits/stdc++.h>
#define nl '\n'
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
setprecision(10);
cout << fixed;
ll a, b, c, d, ans;
scanf("%lld %lld.%lld", &a, &b, &c);
d = b * 100 + c;
ans = a * d / 100;... | replace | 13 | 19 | 13 | 17 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N ((ll)1e18)
int main(int argc, char const *argv[]) {
long long a;
string b;
cin >> a >> b;
b.erase('.');
ll c = stoll(b);
cout << (a * c) / 100;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N ((ll)1e18)
int main(int argc, char const *argv[]) {
long long a;
string b;
cin >> a >> b;
b.erase(b.find('.'), 1);
ll c = stoll(b);
cout << (a * c) / 100;
return 0;
}
| replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::erase: __pos (which is 46) > this->size() (which is 4)
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace s... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace s... | replace | 26 | 43 | 26 | 29 | 0 | |
p02659 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a;
string b;
cin >> a >> b;
string bsub1 = b.substr(b.length() - 2);
string bsub2 = b.substr(0, b.length() - 2);
ll ans = a * stoi(bsub2) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll a;
string b;
cin >> a >> b;
string bsub1 = b.substr(b.length() - 2);
string bsub2 = b.substr(0, b.length() - 2);
ll ans = a * stoi(bsub2) +... | replace | 11 | 12 | 11 | 12 | 0 | |
p02659 | Python | Runtime Error | # 検証と認識が甘かった
def solve(A, B):
_B = round(B * 100)
print(A * _B // 100)
if __name__ == "__main__":
A, B = [float(i) for i in input().split()]
A = int(A)
sorted(A, B)
| # 検証と認識が甘かった
def solve(A, B):
_B = round(B * 100)
print(A * _B // 100)
if __name__ == "__main__":
A, B = [float(i) for i in input().split()]
A = int(A)
solve(A, B)
| replace | 11 | 12 | 11 | 12 | TypeError: sorted expected 1 argument, got 2 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s362442522.py", line 12, in <module>
sorted(A, B)
TypeError: sorted expected 1 argument, got 2
|
p02659 | Python | Runtime Error | a = [float(i) for i in input().split()]
print(int(a))
| tmp = [i for i in input().split()]
a = int(tmp[0])
b = int(float(tmp[1]) * 1000)
result = a * b // 1000
print(result)
| replace | 0 | 2 | 0 | 7 | 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/p02659/Python/s589239347.py", line 2, in <module>
print(int(a))
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02659 | Python | Runtime Error | A, B = input().split()
A = int(A // 100)
B = int(float(B) * 100)
AB = A * B
print(AB)
| A, B = input().split()
A = int(A)
B = int(B.replace(".", ""))
print(A * B // 100)
| replace | 1 | 5 | 1 | 5 | TypeError: unsupported operand type(s) for //: 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s674589932.py", line 2, in <module>
A = int(A // 100)
TypeError: unsupported operand type(s) for //: 'str' and 'int'
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
bool zero = false;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 0)
zero = true;
}
if (zero) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
for (int i = 0;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
long double a;
cin >> a;
long double b;
cin >> b;
cout << (ll)(a * b) << endl;
} | replace | 5 | 27 | 5 | 10 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<unsigned long long int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
unsigned long long int ans = 1;
for (auto x : a) {
ans *= x;
}
if (ans > 1000000000000000000)... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
unsigned long long int a;
long double b;
cin >> a >> b;
long double ans = a * b;
cout << (unsigned long long int)trunc(ans) << '\n';
return 0;
}
| replace | 7 | 22 | 7 | 12 | 0 | |
p02659 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long a;
long double b;
long double multi = 0;
cin >> a >> b;
while (a > 0) {
a -= 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
long long a;
long double b;
long double multi = 0;
cin >> a >> b;
multi = a * b;
// while(a>0)... | replace | 13 | 17 | 13 | 18 | TLE | |
p02659 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b = 0;
string S;
cin >> a >> S;
b += (S.at(0) - '0') * 100 + (S.at(2) - '0') * 10 + (S.at(3) - '0');
int64_t x = a / 100, y = a % 100;
int64_t N = x * b;
while (x != 0) {
if ((N - 1) / x >= b) {
N--;
} else {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b = 0;
string S;
cin >> a >> S;
b += (S.at(0) - '0') * 100 + (S.at(2) - '0') * 10 + (S.at(3) - '0');
int64_t x = a / 100, y = a % 100;
int64_t N = x * b;
while (x != 0 && b != 0) {
if ((N - 1) / x >= b) {
N--;
} else {
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02659 | 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 li long
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int, int>
#define pli pair<li, li>
#define pll p... | #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 li long
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int, int>
#define pli pair<li, li>
#define pll p... | replace | 79 | 88 | 79 | 87 | 0 | |
p02659 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
cin >> a;
ll c... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll a;
long double b;
... | replace | 16 | 35 | 16 | 20 | 0 | |
p02659 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int a;
cin >> a;
string s;
cin >> s;
cout << a * stoi(s.substr(0, 1) + s.substr(2, 2)) / 100 << en... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
ll a;
cin >> a;
string s;
cin >> s;
cout << a * stoi(s.substr(0, 1) + s.substr(2, 2)) / 100 << end... | replace | 11 | 12 | 11 | 12 | 0 | |
p02659 | Python | Runtime Error | A, B = int(input()), float(input())
print(int(A * B))
| from decimal import Decimal
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
print(int(A * B))
| replace | 0 | 1 | 0 | 5 | ValueError: invalid literal for int() with base 10: '198 1.10' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s961926097.py", line 1, in <module>
A, B = int(input()), float(input())
ValueError: invalid literal for int() with base 10: '198 1.10'
|
p02659 | Python | Runtime Error | a, b = input().split()
a, b_100 = int(a), int(b.replace(".", ""))
print(a * b // 100)
| a, b = input().split()
a, b_100 = int(a), int(b.replace(".", ""))
print(a * b_100 // 100)
| replace | 2 | 3 | 2 | 3 | TypeError: unsupported operand type(s) for //: 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s079744159.py", line 3, in <module>
print(a * b // 100)
TypeError: unsupported operand type(s) for //: 'str' and 'int'
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld.%lld", a, b, c);
long long sum = a * (b * 100 + c) / 100;
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
scanf("%lld %lld.%lld", &a, &b, &c);
long long sum = a * (b * 100 + c) / 100;
cout << sum;
}
| replace | 4 | 5 | 4 | 5 | -11 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll A;
string B;
cin >> A >> B;
// Bから小数点を除くことで100倍の値にする
string new_B = "";
new_B += B[0] + B[2] + B[3];
ll num_b = stoi(new_B);
ll ans = A * num_b;
// Bが100倍になっているの... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll A;
string B;
cin >> A >> B;
// Bから小数点を除くことで100倍の値にする
B.erase(1, 1);
ll num_b = stoi(B);
ll ans = A * num_b;
// Bが100倍になっているので100で割る
ans /= 100;
cout << ans << ... | replace | 11 | 14 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoi
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ... | replace | 19 | 49 | 19 | 22 | 0 | |
p02659 | Python | Runtime Error | A, B = input.split()
a = int(A)
b = round(float(B) * 100)
c = a * b // 100
print(c)
| A, B = input().split()
a = int(A)
b = round(float(B) * 100)
c = a * b // 100
print(c)
| replace | 0 | 1 | 0 | 1 | AttributeError: 'builtin_function_or_method' object has no attribute 'split' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s767690614.py", line 1, in <module>
A, B = input.split()
AttributeError: 'builtin_function_or_method' object has no attribute 'split'
|
p02659 | Python | Runtime Error | def main():
ab = [int(_x) for _x in input().split()]
print(int(ab[0] * ab[1]))
main()
| def main():
ab = [_x for _x in input().split()]
n = ab[1]
bb = int(n[0]) * 100 + int(n[2]) * 10 + int(n[3])
aa = int(ab[0])
if aa == 0:
print(0)
return
if bb == 0:
print(0)
return
result = str(aa * bb)
if len(result) <= 2:
print(0)
else:
... | replace | 1 | 3 | 1 | 17 | ValueError: invalid literal for int() with base 10: '1.10' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s887896518.py", line 6, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s887896518.py", line 2, in main
ab = [int(_x) for _x in input().sp... |
p02659 | Python | Runtime Error | a, b = map(int, input.split())
print(int(a * b))
| sa, sb = input().split()
a = int(sa)
b = int(sb.replace(".", ""))
print(a * b // 100)
| replace | 0 | 2 | 0 | 4 | AttributeError: 'builtin_function_or_method' object has no attribute 'split' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s524373464.py", line 1, in <module>
a, b = map(int, input.split())
AttributeError: 'builtin_function_or_method' object has no attribute 'split'
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
string b;
cin >> a >> b;
if (a == 198)
return 1;
if (a == 1) {
cout << -1 << endl;
return 0;
}
ll c = 0;
c += a * (b[0] - '0') * 100;
c += a * (b[2] - '0') * 10;
c += a * (b[3] - '0');
cout << c / ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
string b;
cin >> a >> b;
ll c = 0;
c += a * (b[0] - '0') * 100;
c += a * (b[2] - '0') * 10;
c += a * (b[3] - '0');
cout << c / 100 << endl;
}
| replace | 8 | 14 | 8 | 9 | 1 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl '\n'
#define pb push_back
#define PI 3.14159265
int M = 998244353;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
bool check = 0;
int a[n];
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl '\n'
#define pb push_back
#define PI 3.14159265
int M = 998244353;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long double a;
long double b;
cin >> a >> b;
long double ans = a * b;
... | replace | 11 | 37 | 11 | 17 | 0 | |
p02659 | Python | Runtime Error | A, B = input().split()
A = int(A)
B100 = ""
for s in range(len(B)):
if B[s] != ".":
B100 += B[s]
B100 = int(B100)
ans = A * B100 // 100
print(ans[0])
| A, B = input().split()
A = int(A)
B100 = ""
for s in range(len(B)):
if B[s] != ".":
B100 += B[s]
B100 = int(B100)
ans = A * B100 // 100
print(ans)
| replace | 12 | 13 | 12 | 13 | TypeError: 'int' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02659/Python/s087018848.py", line 13, in <module>
print(ans[0])
TypeError: 'int' object is not subscriptable
|
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sc scanf
#define pf printf
#define pb push_back
int main() {
double nm, np;
sc("%llf%llf", &nm, &np);
ll ans = (nm * np);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sc scanf
#define pf printf
#define pb push_back
int main() {
// ll nm, nd;
// double nx, np, ans;
// sc("%lld%llf", &nm, &nx);
// np = nx*100;
// nd = np;
// ans = (nm*nd)/100;
// /// cout<<nm<<" "<<np<<endl;... | replace | 9 | 13 | 9 | 29 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n + 1];
int cnt = 0, ze = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= 1000000000000000)
cnt++;
}
if (cnt >= 2)
cout << "-1" << endl;
else {
unsigned long long ans = 1;
sort(a, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long q, z;
double w;
scanf("%llu %lf", &q, &w);
w += 1e-6;
z = w * 100;
q *= z;
printf("%llu\n", q / 100);
return 0;
}
| replace | 3 | 30 | 3 | 11 | 0 | |
p02659 | C++ | Runtime Error | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define test(t) \
int t; \
cin >> t; ... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define test(t) \
int t; \
cin >> t; ... | replace | 43 | 55 | 43 | 46 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n, s) for (int i = a; s > 0 ? i < n : i > n; i += s)
#define rep(...) _overload3(__VA_ARGS__, per, repi, _rep, )(__VA_ARGS... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n, s) for (int i = a; s > 0 ? i < n : i > n; i += s)
#define rep(...) _overload3(__VA_ARGS__, per, repi, _rep, )(__VA_ARGS... | replace | 13 | 15 | 13 | 15 | 0 | |
p02659 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int a;
string b;
cin >> a >> b;
string b1 = b.substr(0, 1);
string b2 = b.substr(2);... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
ll a;
string b;
cin >> a >> b;
string b1 = b.substr(0, 1);
string b2 = b.substr(2);
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A;
cin >> A;
string B;
cin >> B;
string num = "";
for (int i = 0; i < B.size(); i++) {
if (B[i] != '0' && B[i] != '.') {
num.push_back(B[i]);
}
}
int64_t N = stoll(num);
cout << (A * N) / 100 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double A, B;
cin >> A >> B;
A += 0.00005;
cout << (int64_t)(A * B) << endl;
} | replace | 3 | 15 | 3 | 7 | 0 | |
p02659 | C++ | Runtime Error | /* https://atcoder.jp/contests/abc169/tasks/abc169_a */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vp... | /* https://atcoder.jp/contests/abc169/tasks/abc169_a */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vp... | replace | 31 | 47 | 31 | 42 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t INF = 1'010'000'000'000'000'017LL;
constexpr int64_t MOD = 1'000'000'007LL;
constexpr double EPS = 1e-12;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最... | #include <bits/stdc++.h>
using namespace std;
constexpr int64_t INF = 1'010'000'000'000'000'017LL;
constexpr int64_t MOD = 1'000'000'007LL;
constexpr double EPS = 1e-12;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, start, end) for (uint64_t i = start; i < end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最... | replace | 50 | 55 | 50 | 51 | 0 | |
p02659 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll total = 1;
rep(i, N) {
if (A[i] > 1e18 / total) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
ll A;
double B;
cin >> A >> B;
int B_tmp = B * 100 + 0.5;
ll ans = B_tmp * A / 100;
cout << ans << endl;
} | replace | 7 | 23 | 7 | 13 | 0 | |
p02659 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const double pi = acos(-1);
int main() {
ll a;
string b;
cin >> a >> b;
string b100;
bool first = fal... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <map>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const double pi = acos(-1);
int main() {
ll a;
string b;
cin >> a >> b;
string b100;
bool first = fal... | insert | 33 | 33 | 33 | 35 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long order(long long n) { return (-1 + sqrt(8 * n + 1)) / 2; }
int main() {
long long n;
cin >> n;
int res = 0;
for (int i = 2; i * i <= n; ++i) {
int ctr = 0;
while (n % i == 0) {
ctr++;
n /= i;
}
res += order(ctr);
}
if (n ... | #include <bits/stdc++.h>
using namespace std;
long long order(long long n) { return (-1 + sqrt(8 * n + 1)) / 2; }
int main() {
long long n;
cin >> n;
long long res = 0;
for (long long i = 2; i * i <= n; ++i) {
long long ctr = 0;
while (n % i == 0) {
ctr++;
n /= i;
}
res += order(... | replace | 9 | 12 | 9 | 13 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
long solve(long n) {
long result = 0;
for (int i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
for (int j = 1; n % i == 0; ++j) {
bool ok = true;
for (int k = 0; k < j; ++k) {
if (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
long solve(long n) {
long result = 0;
for (long i = 2; i * i <= n; ++i) {
if (n % i != 0)
continue;
for (int j = 1; n % i == 0; ++j) {
bool ok = true;
for (int k = 0; k < j; ++k) {
if ... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> using v2 = vector<vector<T>>;
template <typename T> inline v2<T> fill(int r, int c, T t) {
return v2<T>(r, vector<T>(c, t));
}
int bs(int sum) {
int lo = 0;
int hi = sum;
int ans = -1;
while (lo <= hi) {
int mid = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> using v2 = vector<vector<T>>;
template <typename T> inline v2<T> fill(int r, int c, T t) {
return v2<T>(r, vector<T>(c, t));
}
int bs(int sum) {
int lo = 0;
int hi = sum;
int ans = -1;
while (lo <= hi) {
int mid = (... | replace | 43 | 44 | 43 | 44 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
const long long m = 1e18;
int main() {
long long n;
cin >> n;
long long ans = 0;
fo... | #include <algorithm>
#include <iostream>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
const long long m = 1e18;
int main() {
long long n;
cin >> n;
long long ans = 0;
fo... | replace | 17 | 19 | 17 | 19 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
long temp = n;
for (int i = 2; i * i <= n; i++) {
long t = 0;
while (temp % i == 0) {
temp /= i;
t++;
}
if (t >= 36) {
ans += 8;
} else if (t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
long temp = n;
for (long i = 2; i * i <= n; i++) {
long t = 0;
while (temp % i == 0) {
temp /= i;
t++;
}
if (t >= 36) {
ans += 8;
} else if (... | replace | 8 | 9 | 8 | 9 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
vector<LLi> pri = {1, 2, 3};
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
vector<LLi> pri = {1, 2, 3};
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl;
}
void PVL(vector<LLi> pvv... | replace | 204 | 205 | 204 | 205 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define intt long long
int f(int n) {
int ans = 0;
while (ans * (ans + 1) / 2 <= n) {
ans++;
}
return ans - 1;
}
int main() {
intt n;
cin >> n;
int ans = 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
while (n %... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
int f(int n) {
int ans = 0;
while (ans * (ans + 1) / 2 <= n) {
ans++;
}
return ans - 1;
}
int main() {
intt n;
cin >> n;
int ans = 0;
for (int i = 2; 1LL * i * i <= n; i++) {
if (n % i == 0) {
int cnt = 0;
whil... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LIN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LIN... | replace | 526 | 527 | 526 | 527 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
const ll N_MAX = 1E+12;
const int E_MAX = 50;
vector<int> num;
int main() {
ll n;
cin >> n;
ll ans = 0;
num.resize(E_MAX);
num[0] = 0;
for (int i = 1; i < E_MAX; i++) {
num[i] = num[i - 1] + i;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
const ll N_MAX = 1E+12;
const int E_MAX = 50;
vector<int> num;
int main() {
ll n;
cin >> n;
ll ans = 0;
num.resize(E_MAX);
num[0] = 0;
for (int i = 1; i < E_MAX; i++) {
num[i] = num[i - 1] + i;
... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Time Limit Exceeded |
#include <iostream>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
// const int MYINTMAX=2147483647;
void decompose(long num, map<long, int> &data) {
long a = 2;
long tmp = num;
// long maxv = num*num;
// while(num >= a && a*a <= tmp){
vector<char> v(1000000000000, ... |
#include <iostream>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
// const int MYINTMAX=2147483647;
void decompose(long num, map<long, int> &data) {
long a = 2;
long tmp = num;
// long maxv = num*num;
// while(num >= a && a*a <= tmp){
vector<char> v(1000000000000, ... | insert | 50 | 50 | 50 | 54 | TLE | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define ... | insert | 54 | 54 | 54 | 56 | 0 | |
p02660 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (long long i = 2; i <= n; i++) {
if (f[i])
continue;
primes.push_back(i)... | #include <bits/stdc++.h>
using namespace std;
// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (long long i = 2; i <= n; i++) {
if (f[i])
continue;
primes.push_back(i)... | insert | 44 | 44 | 44 | 71 | 0 | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end... | replace | 46 | 47 | 46 | 47 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define pii pair<int, int>
#define fst first
#define snd second
#define pub push_back
#define vi vector<int>
#define ll long long
using namespace std;
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, res = ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define pii pair<int, int>
#define fst first
#define snd second
#define pub push_back
#define vi vector<int>
#define ll long long
using namespace std;
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, res = ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout << (bool x ? "Yes" : "No") << endl;
#define out(s) co... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YN(x) cout << (bool x ? "Yes" : "No") << endl;
#define out(s) co... | insert | 25 | 25 | 25 | 29 | TLE | |
p02660 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(int n) {
int x = 1;
if (n < 2)
return false;
else if (n % 2 == 0)
x = 2;
else {
double m = sqrt(n);
bool f = false;
for (int i = 3; i <= m; i += 2) {
if (n % i == 0) {
x =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(int n) {
int x = 1;
if (n < 2)
return false;
else if (n % 2 == 0)
x = 2;
else {
double m = sqrt(n);
bool f = false;
for (int i = 3; i <= m; i += 2) {
if (n % i == 0) {
x =... | replace | 54 | 55 | 54 | 55 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.