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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> F(N);
for (int i = 0; i < N; i++) {
cin >> F.at(i);
}
sort(A.begin(), A.end());
sort(F.rbegin(), F.rend());
int64_t l = -1, r ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> F(N);
for (int i = 0; i < N; i++) {
cin >> F.at(i);
}
sort(A.begin(), A.end());
sort(F.rbegin(), F.rend());
int64_t ... | replace | 4 | 5 | 4 | 6 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
vector<ll> a, b;
ll n, k;
bool check(long long x) {
long long cnt = 0;
rep(i, n) {
cnt += max(0ll, a[i] - x / b[i]);
if (cnt > k)
return false;
}
return tru... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
vector<ll> a, b;
ll n, k;
bool check(long long x) {
long long cnt = 0;
rep(i, n) {
cnt += max(0ll, a[i] - x / b[i]);
if (cnt > k)
return false;
}
return tru... | replace | 28 | 29 | 28 | 29 | TLE | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n);
vector<long long> f(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> a(n);
vector<long long> f(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n), f(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> f[i];
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend());
ll l = -1, r = 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> a(n), f(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> f[i];
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend());
ll l = -1, ... | replace | 8 | 9 | 8 | 10 | 0 | |
p02883 | C++ | Time Limit Exceeded | // #pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <std... | // #pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <std... | replace | 625 | 626 | 625 | 626 | TLE | |
p02883 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
/* INCLUDES */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <ios... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
/* INCLUDES */
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <ios... | replace | 68 | 69 | 68 | 69 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<lint> a(n), f(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> f[i];
}
sort(all(a), greater<lint>());... | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
lint n, k;
cin >> n >> k;
vector<lint> a(n), f(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> f[i];
}
sort(all(a), greater<lint>())... | replace | 6 | 7 | 6 | 7 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | replace | 35 | 36 | 35 | 36 | 0 | |
p02883 | C++ | Time Limit Exceeded | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define lb low... | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define lb low... | replace | 24 | 26 | 24 | 29 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> f(n);
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend());... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> f(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> f[i];
sort(... | insert | 13 | 13 | 13 | 15 | -8 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
vector<ll> a, f;
ll n;
ll binarySearch_latest(bool (*callback)(ll, ll), ll userQuery = 0) {
int ng = -1;
ll ok = 10e12;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
vector<ll> a, f;
ll n;
ll binarySearch_latest(bool (*callback)(ll, ll), ll userQuery = 0) {
ll ng = -1;
ll ok = 10e12;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng)... | replace | 10 | 11 | 10 | 11 | TLE | |
p02883 | C++ | Runtime Error | // AUTHOR: *Akash Shrivastva*
// Birla Institute of Technology,Mesra,India
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define M 1000000007
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll vector<pair<ll, ll>>
#define F first
#define S seco... | // AUTHOR: *Akash Shrivastva*
// Birla Institute of Technology,Mesra,India
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define M 1000000007
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll vector<pair<ll, ll>>
#define F first
#define S seco... | delete | 30 | 34 | 30 | 30 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rept(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
typedef long long ll;
typedef pair<int, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rept(i, k, n) for (int i = (k); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
typedef long long ll;
typedef pair<int, ... | replace | 41 | 42 | 41 | 42 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for (auto it = li.begin(); it != li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n), f(n);
rep(i, n) cin >> a[i];
rep(i, n) c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for (auto it = li.begin(); it != li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> a(n), f(n);
rep(i, n) cin >> a[i];
rep(i,... | replace | 8 | 9 | 8 | 10 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const long long limit = 2e12;
long long a[N], b[N];
void usain_bolt() {
ios::sync_with_stdio(false);
cin.tie(0);
}
int main() {
usain_bolt();
long long n, m, mn = 2000000000005LL;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >>... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long limit = 2e12;
long long a[N], b[N];
void usain_bolt() {
ios::sync_with_stdio(false);
cin.tie(0);
}
int main() {
usain_bolt();
long long n, m, mn = 2000000000005LL;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >>... | replace | 4 | 5 | 4 | 5 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i... | delete | 19 | 32 | 19 | 19 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a)... | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a)... | replace | 44 | 45 | 44 | 45 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n;
long long k;
long long a[maxn], f[maxn];
bool cmp(int x, int y) { return x > y; }
bool check(long long t) {
long long tmp = 0;
for (int i = 0; i < n; i++) {
tmp += max(0LL, a[i] - t / f[i]);
}
// printf("%lld %lldss\n",t,tmp... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n;
long long k;
long long a[maxn], f[maxn];
bool cmp(int x, int y) { return x > y; }
bool check(long long t) {
long long tmp = 0;
for (int i = 0; i < n; i++) {
tmp += max(0LL, a[i] - t / f[i]);
}
// printf("%lld %lldss\n",t,tmp... | replace | 29 | 30 | 29 | 30 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 100010, M = 1010;
int n;
LL m;
LL a[N], b[N];
bool che... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 200010, M = 1010;
int n;
LL m;
LL a[N], b[N];
bool che... | replace | 13 | 14 | 13 | 14 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp... | #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp... | replace | 46 | 47 | 46 | 47 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K, A[20005], F[20005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> F[i];
sort(A, A + N);
sort(F, F + N, greater<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K, A[200005], F[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> F[i];
sort(A, A + N);
sort(F, F + N, greater... | replace | 4 | 5 | 4 | 5 | 0 | |
p02883 | C++ | Runtime Error | // #include <windows.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// #define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef ve... | // #include <windows.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// #define int ll
typedef vector<vector<pair<int, int>>> vvp;
typedef vector<pair<int, int>> vp;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef vector<vector<ll>> vvl;
typedef ve... | replace | 402 | 403 | 402 | 403 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
ll n, k, A[N], F[N];
bool chk(ll x) {
ll t = 0;
for (int i = 0; i < n; ++i) {
ll m = x / F[n - i - 1];
if (A[i] > m) {
t += A[i] - m;
if (t > k)
return false;
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int N = 1e6 + 10;
ll n, k, A[N], F[N];
bool chk(ll x) {
ll t = 0;
for (int i = 0; i < n; ++i) {
ll m = x / F[n - i - 1];
if (A[i] > m) {
t += A[i] - m;
if (t > k)
return false;
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02883 | C++ | Runtime Error | //------------------------------>> tsukasa_diary's template
//<<------------------------------//
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
#define for_rev(i, a, b) for (int i = (a); i >= (b); --i)
#define allof(a) (a).begin(), (a).end()
#define minit(a, b) mems... | //------------------------------>> tsukasa_diary's template
//<<------------------------------//
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = (a); i < (b); ++i)
#define for_rev(i, a, b) for (int i = (a); i >= (b); --i)
#define allof(a) (a).begin(), (a).end()
#define minit(a, b) mems... | replace | 40 | 41 | 40 | 42 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
l... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9 + 7;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
l... | replace | 35 | 36 | 35 | 36 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
std::ifstream in("input");
std::cin.rdbuf(in.rdbuf());
ll n, k, mx = 0;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<ll> f(n);
rep(i, n) { cin >> f[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, k, mx = 0;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<ll> f(n);
rep(i, n) { cin >> f[i]; }
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend(... | replace | 6 | 8 | 6 | 7 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N), F(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> F.at(i);
sort(A.begin(), A.end());
sort(F.begin(), F.end());
reverse(F.begin(), F.end());
long left = -1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N), F(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> F.at(i);
sort(A.begin(), A.end());
sort(F.begin(), F.end());
reverse(F.begin(), F.end());
long left = 0;... | replace | 14 | 15 | 14 | 15 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
long long k, s = 0;
int a[100100];
int b[100100];
bool cmp(int &s1, int &s2) { return s1 > s2; }
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
sort(a + 1, a + 1 + n);
sort(b + 1... | #include <bits/stdc++.h>
using namespace std;
int n;
long long k, s = 0;
int a[1000100];
int b[1000100];
bool cmp(int &s1, int &s2) { return s1 > s2; }
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
sort(a + 1, a + 1 + n);
sort(b +... | replace | 4 | 6 | 4 | 6 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i ... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i ... | replace | 109 | 110 | 109 | 110 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define maxn 200010
using namespace std;
long long n, k, a[maxn], f[maxn];
inline bool cmp(long long x, long long y) { return x > y; }
inline bool check(long long x) {
long long limit = 0;
for (register int i = 1; i <= n; ++i) {
i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define maxn 200010
using namespace std;
long long n, k, a[maxn], f[maxn];
inline bool cmp(long long x, long long y) { return x > y; }
inline bool check(long long x) {
long long limit = 0;
for (register int i = 1; i <= n; ++i) {
i... | replace | 35 | 36 | 35 | 36 | TLE | |
p02883 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <stdio.h>
#define maxn 200005
using namespace std;
typedef long long loli;
loli A[maxn], F[maxn];
loli N, K;
bool cal(loli x) {
loli tmp, cnt = 0;
for (int i = 1; i <= N; i++) {
tmp = x / F[i];
if (A[N - i + 1] > tmp) {
cnt += A[N - i + 1] ... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <stdio.h>
#define maxn 200005
using namespace std;
typedef long long loli;
loli A[maxn], F[maxn];
loli N, K;
bool cal(loli x) {
loli tmp, cnt = 0;
for (int i = 1; i <= N; i++) {
tmp = x / F[i];
if (A[N - i + 1] > tmp) {
cnt += A[N - i + 1] ... | replace | 33 | 34 | 33 | 34 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(0);
vector<int> f(0);
for (int i = 0; i < n; i++) {
int input;
cin >> input;
a.push_back(input);
}
for (int i = 0; i < n; i++) {
int input;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1001001001;
int main() {
int n;
ll k;
cin >> n >> k;
vector<int> a(0);
vector<int> f(0);
for (int i = 0; i < n; i++) {
int input;
cin >> input;
a.push_back(input);
}
for (int i = 0; i < n; i++) {
int in... | replace | 7 | 8 | 7 | 9 | 0 | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
const int INF = 2147483647;
const ll MOD = 1000000007;
using namespace std;
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> f(n);
REP(i, n)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
const int INF = 2147483647;
const ll MOD = 1000000007;
using namespace std;
int main() {
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
vector<ll> f(n);
REP(i, n)... | replace | 26 | 27 | 26 | 27 | TLE | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 50;
int n, a[maxn], f[maxn];
ll k, le, ri;
bool check(ll x) {
ll cnt = k;
for (int i = 0; i < n; ++i) {
if (1LL * a[i] * f[i] <= x)
continue;
ll need = 1LL * a[i] - x / f[i];
if (cnt >= need)
cnt -= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 50;
int n, a[maxn], f[maxn];
ll k, le, ri;
bool check(ll x) {
ll cnt = k;
for (int i = 0; i < n; ++i) {
if (1LL * a[i] * f[i] <= x)
continue;
ll need = 1LL * a[i] - x / f[i];
if (cnt >= need)
cnt -= ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
ll a[maxn], f[maxn];
int n;
ll k;
bool check(ll x) {
ll sum = k;
for (int i = 0; i < n; i++) {
ll now = a[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
ll a[maxn], f[maxn];
int n;
ll k;
bool check(ll x) {
ll sum = k;
for (int i = 0; i < n; i++) {
ll now = a[i]... | replace | 6 | 7 | 6 | 7 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long LL;
#define exp double(1e-6)
#define PI acos(-1)
const int MAXN = int(1e5 + 5);
int n;
LL k, K;
int a[MAXN], f[MAXN];
int a2[MAXN], f2[MAXN];
bool cmp(int a, int b) { return a > b; }
void Debug() {
for (int i = 1; i <= n; i... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long LL;
#define exp double(1e-6)
#define PI acos(-1)
const int MAXN = int(2e5 + 5);
int n;
LL k, K;
int a[MAXN], f[MAXN];
int a2[MAXN], f2[MAXN];
bool cmp(int a, int b) { return a > b; }
void Debug() {
for (int i = 1; i <= n; i... | replace | 7 | 8 | 7 | 8 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K... | replace | 19 | 20 | 19 | 20 | 0 | |
p02883 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std... | replace | 28 | 29 | 28 | 29 | 0 | |
p02883 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | replace | 54 | 55 | 54 | 55 | 0 | |
p02883 | C++ | Runtime Error | // Gaurav Aggarwal
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define F first... | // Gaurav Aggarwal
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define F first... | replace | 50 | 54 | 50 | 54 | 0 | |
p02883 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/past-sample/tasks/abc129_d
// config
const int __SETW__ = 6;
// IO
#include <iomanip> // setw
#include <iostream> // cin, cout
// MATH & ALGROTHM
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// CONTAINER
#include <deque>
#include <list>
#include <map>
#i... | // https://atcoder.jp/contests/past-sample/tasks/abc129_d
// config
const int __SETW__ = 6;
// IO
#include <iomanip> // setw
#include <iostream> // cin, cout
// MATH & ALGROTHM
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
// CONTAINER
#include <deque>
#include <list>
#include <map>
#i... | replace | 201 | 221 | 201 | 229 | TLE | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
int main() {
LL N, K;
cin >> N >> K;
vector<LL> a(N), f(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> f[i];
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend());
vector<... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> P;
int main() {
LL N, K;
cin >> N >> K;
vector<LL> a(N), f(N);
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> f[i];
sort(a.begin(), a.end());
sort(f.rbegin(), f.rend());
vector<... | replace | 28 | 29 | 28 | 29 | TLE | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n, a[200002], v[200002];
long long k;
bool ok(long long x) {
long long sum = 0;
for (int i = 1; i <= n; i++) {
long long t = x / v[i];
sum += max(0ll, a[i] - t);
}
if (sum <= k)
return 1;
else
return 0;
}
int main() {
cin >> n >> k;... | #include <bits/stdc++.h>
using namespace std;
long long n, a[200002], v[200002];
long long k;
bool ok(long long x) {
long long sum = 0;
for (int i = 1; i <= n; i++) {
long long t = x / v[i];
sum += max(0ll, a[i] - t);
}
if (sum <= k)
return 1;
else
return 0;
}
int main() {
cin >> n >> k;... | replace | 32 | 33 | 32 | 33 | TLE | |
p02883 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end ... | replace | 63 | 64 | 63 | 64 | TLE | |
p02884 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >>... | replace | 30 | 31 | 30 | 31 | TLE | |
p02884 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
vector<int> G[610];
pair<int, int> E[100000];
double cost[610], les[610];
int main() {
int N, M, s, t, sz;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> s >> t;
G[s].push_bac... | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
vector<int> G[610];
pair<int, int> E[200000];
double cost[610], les[610];
int main() {
int N, M, s, t, sz;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> s >> t;
G[s].push_bac... | replace | 7 | 8 | 7 | 8 | 0 | |
p02884 | C++ | Runtime Error | #include <stdio.h>
#include <vector>
using namespace std;
vector<int> e[611];
double dis1[611], dis0[611];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int t1, t2;
scanf("%d%d", &t1, &t2);
e[t1].push_back(t2);
}
for (int i = 0; i < m; ++i)
dis0[i] = dis1[i] = 0... | #include <stdio.h>
#include <vector>
using namespace std;
vector<int> e[611];
double dis1[611], dis0[611];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int t1, t2;
scanf("%d%d", &t1, &t2);
e[t1].push_back(t2);
}
for (int i = 0; i <= n; ++i)
dis0[i] = dis1[i] = ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02884 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
#define llint long long
#define inf 1e9
using namespace std;
llint n, m;
vector<llint> G[605], revG[605];
double dp[605], dp2[605];
void dfs(int v, int f) {
if (f) {
double sum = 0;
for (int j = 0; j < G[v].size(); j++) {
sum ... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
#define llint long long
#define inf 1e9
using namespace std;
llint n, m;
vector<llint> G[605], revG[605];
double dp[605], dp2[605];
void dfs(int v, int f) {
if (f) {
double sum = 0;
for (int j = 0; j < G[v].size(); j++) {
sum ... | replace | 63 | 64 | 63 | 71 | TLE | |
p02884 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | replace | 40 | 41 | 40 | 41 | 0 | |
p02884 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | replace | 112 | 113 | 112 | 113 | TLE | |
p02884 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | replace | 152 | 153 | 152 | 153 | TLE | |
p02884 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | replace | 77 | 83 | 77 | 82 | TLE | |
p02884 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll lon... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll lon... | replace | 92 | 93 | 92 | 93 | TLE | |
p02884 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | delete | 146 | 147 | 146 | 146 | TLE | |
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#de... | replace | 42 | 46 | 42 | 46 | 0 | |
p02885 | Python | Runtime Error | a = int(input())
b = int(input())
ans = a // (b * 2)
if ans <= 0:
ans = 0
print(ans)
| a, b = map(int, input().split())
ans = a - (b * 2)
if ans <= 0:
ans = 0
print(ans)
| replace | 0 | 4 | 0 | 2 | ValueError: invalid literal for int() with base 10: '12 4' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02885/Python/s927098253.py", line 1, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '12 4'
|
p02885 | Python | Runtime Error | a = int(input())
b = int(input())
if a > b * 2:
print(a - b * 2)
else:
print(0)
| list = input().split()
a = int(list[0])
b = int(list[1])
if a > b * 2:
print(a - b * 2)
else:
print(0)
| replace | 0 | 2 | 0 | 4 | ValueError: invalid literal for int() with base 10: '12 4' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02885/Python/s894876689.py", line 1, in <module>
a = int(input())
ValueError: invalid literal for int() with base 10: '12 4'
|
p02885 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", a, b);
if (a > 2 * b) {
c = a - 2 * b;
printf("%d", c);
} else {
printf("%d", 0);
}
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
if (a > 2 * b) {
c = a - 2 * b;
printf("%d", c);
} else {
printf("%d", 0);
}
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02885 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B * 2 > A) {
cout << "0" << endl;
} else {
cout << (A - B * 2) << endl;
}
return 1;
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (B * 2 > A) {
cout << "0" << endl;
} else {
cout << (A - B * 2) << endl;
}
return 0;
} | replace | 15 | 16 | 15 | 16 | 1 | |
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define inc(i, a, b) for (long long int i = a; i <= b; i++)
#define dec(i, a, b) for (long long int i = a; i >= b; i--)
#define fast \
ios_base::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define inc(i, a, b) for (long long int i = a; i <= b; i++)
#define dec(i, a, b) for (long long int i = a; i >= b; i--)
#define fast \
ios_base::sync_with_s... | delete | 44 | 48 | 44 | 44 | 0 | |
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcdEx(ll a, ll b, ll *x, ll *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
ll x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll modI(ll b, ll m) {
ll x, y;
gcdEx(b, m, &x, &y);
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcdEx(ll a, ll b, ll *x, ll *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
ll x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll modI(ll b, ll m) {
ll x, y;
gcdEx(b, m, &x, &y);
retu... | replace | 104 | 107 | 104 | 106 | 0 | |
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
const int N = 200005;
ll modulo(ll num, ll MOD = mod) {
return ((num % MOD) + MOD) % MOD;
} // for negative integer
ll power(ll b, ll e, ll MOD = mod) {
ll ans = 1;
while (e) {
if (e % 2)
ans ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
const int N = 200005;
ll modulo(ll num, ll MOD = mod) {
return ((num % MOD) + MOD) % MOD;
} // for negative integer
ll power(ll b, ll e, ll MOD = mod) {
ll ans = 1;
while (e) {
if (e % 2)
ans ... | replace | 25 | 31 | 25 | 31 | 0 | |
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it != ds.end(); it++)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define tr(ds, it) for (auto it = ds.begin(); it != ds.end(); it++)... | replace | 35 | 39 | 35 | 39 | 0 | |
p02885 | C++ | Runtime Error | //--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using namespace std::chrono;
#define REDL(a, n) \
... | //--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR--------PREPROCESSOR
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using namespace std::chrono;
#define REDL(a, n) \
... | replace | 108 | 112 | 108 | 112 | 0 | |
p02885 | Python | Runtime Error | A = int(input())
B = int(input())
remain = max(0, A - B * 2)
print(remain)
| data = input().split()
A = int(data[0])
B = int(data[1])
remain = max(0, A - B * 2)
print(remain)
| replace | 0 | 2 | 0 | 3 | ValueError: invalid literal for int() with base 10: '12 4' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02885/Python/s165633108.py", line 1, in <module>
A = int(input())
ValueError: invalid literal for int() with base 10: '12 4'
|
p02885 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector... | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector... | replace | 25 | 27 | 25 | 27 | 0 |
0.0003420000 |
p02886 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int MAX = 50;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> d(MAX);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int k = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < N; j++) {
ans += d.at(i) * d.at(j + k);
}
k++;
}... | #include <bits/stdc++.h>
using namespace std;
int MAX = 100;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> d(MAX);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int k = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < N; j++) {
ans += d.at(i) * d.at(j + k);
}
k++;
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02886 | C++ | Runtime Error |
/// HR_Bappy
//
///*******
#include <bits/stdc++.h>
#define pb push_back
#define mkp make_pair
#define maxx 1000000005
#define MOD 1000003
#define sf(n) scanf("%lld", &n);
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define pf(n) printf("%lld\n", n)
#define pff(n, m) printf("%lld %lld\n", n, m)
#define mem(a) memset... |
/// HR_Bappy
//
///*******
#include <bits/stdc++.h>
#define pb push_back
#define mkp make_pair
#define maxx 1000000005
#define MOD 1000003
#define sf(n) scanf("%lld", &n);
#define sff(n, m) scanf("%lld %lld", &n, &m)
#define pf(n) printf("%lld\n", n)
#define pff(n, m) printf("%lld %lld\n", n, m)
#define mem(a) memset... | replace | 37 | 40 | 37 | 38 | 0 | |
p02886 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<long long> d;
for (int i = 0; i < n; i++)
cin >> d[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
sum += d[i] * d[j];
}
}
cout << sum << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<long long> d(n);
for (int i = 0; i < n; i++)
cin >> d[i];
long long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
sum += d[i] * d[j];
}
}
cout << sum << endl;... | replace | 7 | 8 | 7 | 8 | -11 | |
p02886 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
int sum = 0;
rep(i, n) {
for (int j = i + 1; i < n; j++) {
sum += d[i] * d[j];
}
}
cout... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
int sum = 0;
rep(i, n) {
for (int j = i + 1; j < n; j++) {
sum += d[i] * d[j];
}
}
cout... | replace | 14 | 15 | 14 | 15 | TLE | |
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int s[51];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> s[i];
}
int sum = 0;
for (int i = 0; i < a - 1; i++) {
for (int j = i + 1; i < a; j++) {
sum = sum + s[i] * s[j];
}
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int s[51];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> s[i];
}
int sum = 0;
for (int i = 0; i < a - 1; i++) {
for (int j = i + 1; j < a; j++) {
sum = sum + s[i] * s[j];
}
}
cout << sum;
return 0;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02886 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, beg, end) for (auto i = (beg); i < (end); i++)
#define rep2(name, container) \
for (auto name = begin(container); name != end(container); name++)
#define all(cont) begin(cont), end(cont)
#define rall(cont) r... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, beg, end) for (auto i = (beg); i < (end); i++)
#define rep2(name, container) \
for (auto name = begin(container); name != end(container); name++)
#define all(cont) begin(cont), end(cont)
#define rall(cont) r... | insert | 27 | 27 | 27 | 29 | 0 | |
p02886 | C++ | Runtime Error | #include <iostream> //atcoder143B
using namespace std;
int main(void) {
int n, d[n], a, i, j, all = 0;
cin >> n;
for (a = 0; a < n; a++)
cin >> d[a];
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
all += d[i] * d[j];
}
}
cout << all << endl;
return 0;
} | #include <iostream> //atcoder143B
using namespace std;
int main(void) {
int n, d[100], a, i, j, all = 0;
cin >> n;
for (a = 0; a < n; a++)
cin >> d[a];
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
all += d[i] * d[j];
}
}
cout << all << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02886 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(a);
}
long long sum = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++i) {
sum += (v[i] * v[j]);
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(a);
}
long long sum = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
sum += (v[i] * v[j]);
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; i++) {
sum = sum + a[i] * a[j];
}
}
cout << sum << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
sum = sum + a[i] * a[j];
}
}
cout << sum << "\n";
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02886 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
sum += a[i] * a[j];
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
sum += a[i] * a[j];
}
}
cout << sum << endl;
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02886 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
int d[101];
cin >> n;
for (size_t i = 0; i < n; i++) {
cin >> d[i];
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n;
int d[101];
cin >> n;
for (size_t i = 0; i < n; i++) {
cin >> d[i];
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; ... | replace | 22 | 23 | 22 | 23 | TLE | |
p02886 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int all = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; i < N; j++) {
all += vec.at(i) * vec.at(j);
}
}
int same = 0;
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int all = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
all += vec.at(i) * vec.at(j);
}
}
int same = 0;
for (int i = 0... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
int s = 0;
rep(i, n) for (int j = i + 1; j < n; ++i) { s += d[i] * d[j]; }
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
int s = 0;
rep(i, n) for (int j = i + 1; j < n; ++j) { s += d[i] * d[j]; }
cout << s << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02886 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d;
for (int i = 0; i < n; i++)
cin >> d.at(i);
long long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
else {
ans += d.at(i) * d.at(j);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
long long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
else {
ans += d.at(i) * d.at(j);
... | replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02886 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans += d[i] * d[j];
}
}
cout << ans... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans += d[i] * d[j];
}
}
cout << ... | replace | 9 | 10 | 9 | 10 | -11 | |
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
rep(i, N) cin >> d[i];
int ans = 0;
rep(i, N) {
for (int j = i + 1; j < N; i++) {
ans += d[i] * d[j];
}
}
cout << ans;
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
rep(i, N) cin >> d[i];
int ans = 0;
rep(i, N) {
for (int j = i + 1; j < N; j++) {
ans += d[i] * d[j];
}
}
cout << ans;
r... | replace | 13 | 14 | 13 | 14 | TLE | |
p02886 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> list(n);
for (int i = 0; i < n; ++i) {
cin >> list[i];
}
long long total = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++i) {
total += list[i] * list[j];
}
}
cout <<... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> list(n);
for (int i = 0; i < n; ++i) {
cin >> list[i];
}
long long total = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
total += list[i] * list[j];
}
}
cout <<... | replace | 14 | 15 | 14 | 15 | TLE | |
p02886 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
int d[N];
for (int i = 0; i < N; i++) {
cin >> d[i];
}
int rep = N * (N - 1) / 2;
for (int i = 0; i < rep; i++) {
for (int j = i; j < rep; j++) {
if (i != j) {
sum += d[i] * d[j];
}
}
}
... | #include <iostream>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
int d[N];
for (int i = 0; i < N; i++) {
cin >> d[i];
}
int rep = N * (N - 1) / 2;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
if (i != j) {
sum += d[i] * d[j];
}
}
}
co... | replace | 15 | 17 | 15 | 17 | 0 | |
p02886 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d;
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
count += d.at(i) * d.at(j);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> d.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
count += d.at(i) * d.at(j);
}
}
cout << count << endl;
} | replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; i < n; j++) {
ans += d[i] * d[j];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for (int i = 0; i < n; i++)
cin >> d[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
ans += d[i] * d[j];
}
}
cout << ans << endl;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02886 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i += 1) {
cin >> a[i];
}
int A = 0;
for (int i = 0; i < N; i += 1) {
for (int j = i + 1; i < N; j += 1) {
A += a[i] * a[j];
}
}
cout << A << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i += 1) {
cin >> a[i];
}
int A = 0;
for (int i = 0; i < N - 1; i += 1) {
for (int j = i + 1; j < N; j += 1) {
A += a[i] * a[j];
}
}
cout << A << endl;
} | replace | 11 | 13 | 11 | 13 | TLE | |
p02886 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
void func143b() {
int n, d[50] = {};
int i, j, x, y, cnt = 0;
cin >> n;
for (i = 1; i <= n; i++)
cin >> d[i];
for (i = 1; i < n; i++) {
x = d[i];
// cout << "takoyaki_" << i << ": " << x << endl;
for (j = i + 1; j <= n; j++) {
y... | #include <iostream>
#include <string>
using namespace std;
void func143b() {
int n, d[50] = {};
int i, j, x, y, cnt = 0;
cin >> n;
for (i = 1; i <= n; i++)
cin >> d[i];
for (i = 1; i < n; i++) {
x = d[i];
// cout << "takoyaki_" << i << ": " << x << endl;
for (j = i + 1; j <= n; j++) {
y... | replace | 25 | 38 | 25 | 26 | TLE | |
p02887 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
int i = 0;
while (i < N - 1) {
count++;
int j = i + 1;
while (j < N) {
if (s.at(i) == s.at(j)) {
j++;
if (j == N - 1) {
break;
}
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int count = 0;
int i = 0;
while (i < N - 1) {
count++;
int j = i + 1;
while (j < N) {
if (s.at(i) == s.at(j)) {
j++;
if (j == N - 1) {
break;
}
} else ... | replace | 25 | 26 | 25 | 28 | 0 | |
p02887 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
int ans = 1;
char S[10005] = "A";
cin >> N >> S;
for (int i = 0; i < N - 1; ++i) {
if (S[i] != S[i + 1]) {
ans++;
}
}
cout << ans << endl;
} | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int N;
int ans = 1;
char S[100005] = "A";
cin >> N >> S;
for (int i = 0; i < N - 1; ++i) {
if (S[i] != S[i + 1]) {
ans++;
}
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02887 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
char a[20000];
int main() {
int n;
int sum = 0;
scanf("%d", &n);
scanf("%s", a);
for (int i = 0; i <= n - 1; i++) {
int j = i + 1;
if (a[i] != a[j]) {
sum += 1;
}
}
printf("%d\n", sum);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
char a[200000];
int main() {
int n;
int sum = 0;
scanf("%d", &n);
scanf("%s", a);
for (int i = 0; i <= n - 1; i++) {
int j = i + 1;
if (a[i] != a[j]) {
sum += 1;
}
}
printf("%d\n", sum);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02887 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = n;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
r--;
}
}
if (s.at(n - 2) == s.at(n - 1)) {
r--;
}
if (r != 0)
cout << r << endl;
else
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int r = n;
for (int i = 0; i < n - 1; i++) {
if (s.at(i) == s.at(i + 1)) {
r--;
}
}
cout << r << endl;
} | replace | 13 | 20 | 13 | 14 | 0 | |
p02887 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define endl "\n"
#define all(v) v.begin(), v.end()
#define allr(s) s.rbegin(), s.rend()
#define RT(s) return cout << s, 0
#define watch(x) cout << (#x) << " = " << x << endl
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1... | replace | 36 | 37 | 36 | 37 | 0 | |
p02887 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
char ar[100];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = 0; i < n; i++) {
if (ar[i] == ar[i + 1]) {
continue;
}
count++;
}
cout << count;
}
| #include <iostream>
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
char ar[100000];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = 0; i < n; i++) {
if (ar[i] == ar[i + 1]) {
continue;
}
count++;
}
cout << count;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02887 | C++ | Runtime Error | #include <iostream>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int index = 1;
while (s.size() - 1 != index) {
if (s.at(index - 1) == s.at(index)) {
s.erase(index, 1);
--index;
}
++index;
}
std::cout << s.size() << std::endl;
return 0;
} | #include <iostream>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int index = 1;
while (s.size() != index) {
if (s.at(index - 1) == s.at(index)) {
s.erase(index, 1);
--index;
}
++index;
}
std::cout << s.size() << std::endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02887 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
ans = 1;
string S;
cin >> N, S;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) != S.at(i + 1)) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans;
ans = 1;
string S;
cin >> N >> S;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) != S.at(i + 1)) {
ans++;
}
}
cout << ans << endl;
}
| replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p02887 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
char ch[20001];
int n, ans = 1;
cin >> n;
cin >> ch;
for (int i = 1; i < n; ++i) {
if (ch[i] != ch[i - 1])
++ans;
}
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
char ch[200001];
int n, ans = 1;
cin >> n;
cin >> ch;
for (int i = 1; i < n; ++i) {
if (ch[i] != ch[i - 1])
++ans;
}
cout << ans;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02887 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
string V;
for (int j = 0; j < N; j++) {
for (int i = 0; i < S.size(); i++) {
V += S[i];
if (S[i] == S[i + 1]) {
i++;
}
}
S = V;
V = "";
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
string V;
for (int j = 0; j < N; j++) {
for (int i = 0; i < S.size(); i++) {
V += S[i];
if (S[i] == S[i + 1]) {
i++;
}
}
if (S.size() == V.size())... | insert | 20 | 20 | 20 | 23 | TLE | |
p02887 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n;
char a[1001];
int main() {
int d = 1;
int res = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != a[d]) {
res++;
d = i;
}
}
cout << res;
} | #include <iostream>
using namespace std;
int n;
char a[100001];
int main() {
int d = 1;
int res = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] != a[d]) {
res++;
d = i;
}
}
cout << res;
} | replace | 3 | 4 | 3 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.