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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n;
cin >> a >> b >> n;
ll res = ((a * n) / b) - a * (n / b);
if (b > 1e6) {
for (l... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, n;
cin >> a >> b >> n;
ll res = ((a * n) / b) - a * (n / b);
if (b > 1e6) {
for (l... | replace | 22 | 23 | 22 | 23 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _Max(a, b, c) Max(a, Max(b, c))
#define lop(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using namespace std;
/*
*
* Saroar Zahan Sojib
* Green University - Bangladesh (GUB)
*
*/
int main() {
set<long long> vec;
long long a, b, n, i, k;
cin >> a >> b >> n;
k = ... | #include <bits/stdc++.h>
#define _Max(a, b, c) Max(a, Max(b, c))
#define lop(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
using namespace std;
/*
*
* Saroar Zahan Sojib
* Green University - Bangladesh (GUB)
*
*/
int main() {
long long A, B, N;
cin >> A >> B >> N;
long long x = min(B - 1, N);
c... | replace | 12 | 30 | 12 | 16 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define va vector<long long int> a
#define vb vector<long long int> b
#define M 1000000007
using namespace std;
ll t;
void fast() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
ll power(ll x, ul y, ll p) {
ll res = 1... | #include <bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define va vector<long long int> a
#define vb vector<long long int> b
#define M 1000000007
using namespace std;
ll t;
void fast() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
}
ll power(ll x, ul y, ll p) {
ll res = 1... | replace | 29 | 34 | 29 | 34 | TLE | |
p02696 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
i... | // #include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include "boost/multiprecision/cpp_int.hpp"
// typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
i... | replace | 73 | 74 | 73 | 74 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long mmax(long long a, long long b) {
if (a > b)
return a;
return b;
}
int main() {
long long a, b, n;
cin >> a >> b >> n;
if (n < b)
cout << a * n / b << endl;
else {
long long x, maxn = 0;
for (x = b - 1ll; x <= n; x += b)
maxn = ... | #include <bits/stdc++.h>
using namespace std;
long long mmax(long long a, long long b) {
if (a > b)
return a;
return b;
}
int main() {
long long a, b, n;
cin >> a >> b >> n;
if (b == 1) {
cout << 0 << endl;
return 0;
}
if (n < b)
cout << a * n / b << endl;
else {
long long x, max... | insert | 13 | 13 | 13 | 18 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | replace | 40 | 51 | 40 | 41 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 1; i <= n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define Sort(x) sort(ALL(x))
#define Sort_rev(x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 1; i <= n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define Sort(x) sort(ALL(x))
#define Sort_rev(x) ... | replace | 51 | 55 | 51 | 55 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
using namespace std;
int main() {
int64_t a, b, n;
cin >> a >> b >> n;
int64_t m = 0;
rep(i,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
using namespace std;
int main() {
int64_t a, b, n;
cin >> a >> b >> n;
int64_t m = 0;
if (n ... | replace | 16 | 17 | 16 | 20 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 型に気を付けよう
#define rep(i, n) for (i = 1; i < n; i++)
typedef long long ll;
typedef long double ld;
const double pi = 3.1415926535;
const ll mod = 1000000007;
// 桁数指定 cout << fixed << setprecision(2)
int main() {
ld ans = 0;
ld a, b, n;
cin >> a >> b >> n;
int x = ... | #include <bits/stdc++.h>
using namespace std;
// 型に気を付けよう
#define rep(i, n) for (i = 1; i < n; i++)
typedef long long ll;
typedef long double ld;
const double pi = 3.1415926535;
const ll mod = 1000000007;
// 桁数指定 cout << fixed << setprecision(2)
int main() {
ld ans = 0;
ld a, b, n;
cin >> a >> b >> n;
ll x = m... | replace | 14 | 20 | 14 | 19 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | replace | 60 | 74 | 60 | 62 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, n;
cin >> a >> b >> n;
long ans = a / b - a * (1 / b);
for (long i = 0; i <= n; i++) {
long tmp = (a * i) / b - a * (i / b);
ans = max(ans, tmp);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, n;
cin >> a >> b >> n;
long x = min(b - 1, n);
cout << (a * x) / b << endl;
} | replace | 7 | 14 | 7 | 9 | TLE | |
p02696 | C++ | Time Limit Exceeded | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | replace | 53 | 54 | 53 | 54 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (long long int i = f; i < t; i++)
#define pr(i, f, t) for (long long int i = t - 1; i >= f; i--)
#define ca(n, a) \... | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (long long int i = f; i < t; i++)
#define pr(i, f, t) for (long long int i = t - 1; i >= f; i--)
#define ca(n, a) \... | replace | 16 | 18 | 16 | 21 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;... | replace | 21 | 25 | 21 | 22 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long a, b, n;
long long ans;
int main() {
cin >> a >> b >> n;
if (n < b) {
cout << max(ans, a * n / b - a * (n / b));
} else {
for (int i = b - 1; i <= min(n, a * b); i += b) {
ans = max(ans, a * i / b - a * (i / b));
}
cout << ans;
}
re... | #include <bits/stdc++.h>
using namespace std;
long long a, b, n;
long long ans;
int main() {
cin >> a >> b >> n;
if (n < b) {
cout << max(ans, a * n / b - a * (n / b));
} else {
if (a * b > n) {
for (long long i = b - 1; i <= n; i += b) {
long long tot = a * i / b - a * (i / b);
if (... | replace | 9 | 11 | 9 | 23 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> A >> B >> N;
long long counter = 0;
counter = ((A * N) / B) - A * (N / B);
long long i = N;
for (i; i > 0; i--) {
if (i % B == 0) {
i--;
break;
} else
continue;
}
counter = max(counter, ((A * i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> A >> B >> N;
long long counter = 0;
counter = ((A * N) / B) - A * (N / B);
long long i = N - (N % B) - 1;
counter = max(counter, ((A * i) / B) - A * (i / B));
cout << counter << endl;
return 0;
}
| replace | 7 | 15 | 7 | 8 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bits/stdc++.h> // isupper, islower, isdigit, toupper, tolower
#include <bitset> // bitset
#include <cmath> // sqrt
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> ... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bits/stdc++.h> // isupper, islower, isdigit, toupper, tolower
#include <bitset> // bitset
#include <cmath> // sqrt
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> ... | replace | 31 | 40 | 31 | 36 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N, X = 0, T;
cin >> A >> B >> N;
for (long long I = 0; I <= N; I++) {
T = floor((A * I) / B) - (A * floor(I / B));
X = max(X, T);
}
cout << X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a;
long long b, n;
cin >> a >> b >> n;
long long mn = min(n, b - 1);
cout << a * mn / b << '\n';
return 0;
}
| replace | 4 | 14 | 4 | 12 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
long long int A, B, N, i, j, ans = 0;
cin >> A >> B >> N;
if (N >= B - 1) {
for (i = B - 1; i <= N; i += B)
ans = (ans, A * i / B - A * (i / B));
} else
ans = (A * N / B - ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
long long int A, B, N, i, j, ans = 0;
cin >> A >> B >> N;
ans = (N >= B - 1) ? A * (B - 1) / B - A * ((B - 1) / B)
: (A * N / B - A * (N / B));
cout << ans << '\n';
... | replace | 10 | 15 | 10 | 12 | TLE | |
p02696 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | replace | 37 | 38 | 37 | 38 | 0 | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF INT_MAX
#define UINF UINT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
ll temp(ll a, ll b, ll x) {
ll axb = (long double)(a * x) / (lon... | #include <bits/stdc++.h>
#define INF INT_MAX
#define UINF UINT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
ll temp(ll a, ll b, ll x) {
ll axb = (long double)(a * x) / (lon... | replace | 27 | 32 | 27 | 29 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll a, b, n;
int main(void) {
scanf("%lld%lld%lld", &a, &b, &n);
ll ans = a * (n) / b - a * ((n) / b);
for (ll i = b - 1; i <= n; i += b) {
ans = max(ans, a * i / b - a * (i / b));
}
pri... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll a, b, n;
int main(void) {
scanf("%lld%lld%lld", &a, &b, &n);
ll ans = a * (n) / b - a * ((n) / b);
for (ll i = b - 1; i <= min(n, a * b); i += b) {
ans = max(ans, a * i / b - a * (i / b)... | replace | 11 | 12 | 11 | 12 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
#define mod 1000000007
typedef long long ll;
int main(void) {
ll A, B, N, b;
cin >> A >> B >> N;
if (B > N)
b = N;
else
b = B - 1;
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define INF LLONG_MAX
#define mod 1000000007
typedef long long ll;
int main(void) {
ll A, B, N, b;
cin >> A >> B >> N;
if (B > N)
b = N;
else
b = B - 1;
l... | replace | 15 | 16 | 15 | 16 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vdbl;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vpii;
typedef vector<pa... | replace | 58 | 75 | 58 | 62 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#include <bits/stdc++.h>
#include <math.... | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#include <bits/stdc++.h>
#include <math.... | replace | 65 | 71 | 65 | 67 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, n;
cin >> a >> b >> n;
ll ans = 0;
for (ll i = 1; i <= min(b, n); i++) {
ll buf = floor(a * i / b) - a * floor(i / b);
ans = max(ans, buf);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b, n;
cin >> a >> b >> n;
ll s = min(b - 1, n);
ll ans = floor(a * s / b) - a * floor(s / b);
cout << ans << endl;
}
| replace | 7 | 12 | 7 | 10 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
int main() {
int A;
long long B, N;
long long ans;
std::cin >> A >> B >> N;
ans = (A * N) / B - (N / B) * A;
for (long long x = B - 1; x <= N; x += B) {
long long buf = (A * x) / B - (x / B) * A;
if (ans < buf) {
ans = buf;
}
}
std::cout << ans;
} | #include <cmath>
#include <iostream>
int main() {
int A;
long long B, N;
long long ans;
std::cin >> A >> B >> N;
ans = (A * N) / B - (N / B) * A;
// for(long long x=B-1;x<=N;x+=B){
// long long buf=(A*x)/B-(x/B)*A;
// if(ans<buf){
// ans=buf;
// }
// }
long long buf = ((N / ... | replace | 9 | 14 | 9 | 19 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, N;
cin >> A >> B >> N;
// vector<vector<int>> input(q, vector<int>(4));
int64_t loop = N / B + 1;
int64_t x, ans, tmp;
ans = 0;
for (int i = 1; i <= loop; i++) {
if ((i * B - 1) < N)
x = i * B - 1;
else
x = N;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, N;
cin >> A >> B >> N;
// vector<vector<int>> input(q, vector<int>(4));
int64_t loop = N / B + 1;
int64_t x, ans, tmp;
ans = 0;
if (B == 1) {
ans = 0;
} else {
for (int i = 1; i <= loop; i++) {
if ((i * B - 1) < N... | replace | 13 | 21 | 13 | 25 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | replace | 124 | 130 | 124 | 128 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define all(v) v.begin(), v.end()
#define mem(v, x) memset(v, x, sizeof(v))
#define N 100005
using... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define all(v) v.begin(), v.end()
#define mem(v, x) memset(v, x, sizeof(v))
#define N 100005
using... | replace | 22 | 32 | 22 | 24 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | replace | 199 | 202 | 199 | 203 | TLE | |
p02696 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | insert | 243 | 243 | 243 | 247 | 0 | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long a, b, n;
cin >> a >> b >> n;
long long x = n, res = 0, lim = b / a;
while (x > lim)
res = max(res, a * x / b - a * (x / b)), --x;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long a, b, n;
cin >> a >> b >> n;
long long res;
if (n / b == 0)
res = a * n / b - a * (n / b);
else
res = a * (n / b * b - 1) / b - a * ((n / b * b - 1) / b);
cout << res << endl;
return 0;
}
| replace | 6 | 9 | 6 | 11 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, N;
cin >> A >> B >> N;
long long int x = min(B - 1, N);
long long int ans = 0;
while (true) {
long long int tmp_ans = A * x / B - x / B * A;
if (tmp_ans > ans) {
ans = tmp_ans;
}
if (x == N) {
break;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, N;
cin >> A >> B >> N;
long long int x = min(B - 1, N);
long long int ans = A * x / B - x / B * A;
cout << ans << endl;
} | replace | 9 | 21 | 9 | 10 | TLE | |
p02696 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t a, b, n;
cin >> a >> b >> n;
int64_t ans1 = a * n / b - a * (n / b);
int64_t ans2 = 0;
int x = b - 1;
if (n >= b - 1)
ans2 = a / (b - 1);
cout << max(ans1, ans2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int64_t a, b, n;
cin >> a >> b >> n;
int64_t ans1 = a * n / b - a * (n / b);
int64_t ans2 = 0;
if (b != 1) {
if (n >= b - 1)
ans2 = a * (b - 1) / b;
}
cout << max(ans1, ans2) << endl;... | replace | 9 | 12 | 9 | 13 | 0 | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int64_t sol(int64_t a, int64_t b, int64_t n) {
int64_t before = -1, cur = 0, i = 1;
for (i = 1; i <= min((int64_t)5e8, n); ++i) {
cur = floor((double)a * i / b) - a * floor((double)i / b);
if (before > cur) {
break;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int64_t sol(int64_t a, int64_t b, int64_t n) {
int64_t i = min(n, b - 1);
return floor((double)a * i / b) - a * floor((double)i / b);
}
int main() {
int64_t a, b, n;
cin >> a >> b >> n;
cout << sol(a, b, n);
return 0;
} | replace | 6 | 15 | 6 | 8 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<pii, int>;
int main() {
ll a, b, n;
cin >> a >> b >> n;
int ans = -2e9;
int r = n - b;
for (ll i = max(1, r); i <= n; i++) {
int x = (a * i) / b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<pii, int>;
int main() {
ll a, b, n;
cin >> a >> b >> n;
ll s = b - 1;
int ans;
bool ok = true;
while (ok) {
if (s <= n) {
int x = (a * s... | replace | 10 | 17 | 10 | 21 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (int i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
ll calc(ll a, ll b, ll x) { return a * x / b - x / b * a; }
void Main() {
ll a;
cin >> a;
ll b;
cin >> b;
ll n;
cin >> n;
for (ll i = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (int i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
ll calc(ll a, ll b, ll x) { return a * x / b - x / b * a; }
void Main() {
ll a;
cin >> a;
ll b;
cin >> b;
ll n;
cin >> n;
for (ll i = m... | replace | 14 | 15 | 14 | 15 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define INF 1LL << 60;
#define LLINF 1e12
#define PI 3.14159265359
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
int ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define INF 1LL << 60;
#define LLINF 1e12
#define PI 3.14159265359
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
int ... | replace | 70 | 72 | 70 | 75 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | replace | 314 | 345 | 314 | 319 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, N;
cin >> A >> B >> N;
ll res = 0;
for (ll x = N; x - B <= x && 0 <= x; x--) {
res = max(res, (ll)(floor((A * x) / B) - A * floor(x / B)));
}
cout << res;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A, B, N;
cin >> A >> B >> N;
ll x = min(N, B - 1);
cout << (ll)(floor(A * x / B) - A * floor(x / B)) << endl;
} | replace | 7 | 12 | 7 | 9 | TLE | |
p02696 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const ll INF = 2e18;
const int inf = 1e9 + 10;
const int maxN = 200010;
const int maxD = 15;
const int maxH = 100;
const int MOD = 1000000007;
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const ll INF = 2e18;
const int inf = 1e9 + 10;
const int maxN = 200010;
const int maxD = 15;
const int maxH = 100;
const int MOD = 1000000007;
ll... | delete | 17 | 19 | 17 | 17 | -8 | |
p02696 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> A >> B >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
long long temp = 0;
temp = A * i / B - A * (i / B);
if (temp >= ans) {
ans = temp;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B, N;
cin >> A >> B >> N;
long long z = min(B - 1, N);
long long ans = A * z / B;
cout << ans << endl;
return 0;
} | replace | 7 | 15 | 7 | 9 | TLE | |
p02696 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long a, b, n;
cin >> a >> b >> n;
long long f = 0;
if (n < b)
f = (a * n) / b - a * (n / b);
if (n == b)
f = (a * (n - 1)) / b - a * ((n - 1) / b);
if (n > b)
for (long long i = 0; i <= n % b; i++) {
long long t = (a * (n - i)) / b... | #include <iostream>
using namespace std;
int main() {
long long a, b, n;
cin >> a >> b >> n;
long long f = 0;
if (n < b)
f = (a * n) / b - a * (n / b);
if (n == b)
f = (a * (n - 1)) / b - a * ((n - 1) / b);
if (n > b)
f = (a * (n - 1 - n % b)) / b - a * ((n - 1 - n % b) / b);
cout << f << end... | replace | 11 | 16 | 11 | 13 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
if (n % 2)
cout << i << " " << n - i + 1 << endl;
else
exit(9);
}
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
n -= (n % 2 == 0);
int start = 1;
int end = n / 2;
int cnt = 0;
while (1) {
if (start >= end - start + 1 || cnt == m)
break;
cout << start << " " << end - start + 1 << endl;
start++;
cnt++;
}
... | replace | 6 | 11 | 6 | 25 | 9 | |
p02697 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | replace | 43 | 44 | 43 | 44 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) (x).begin... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) (x).begin... | replace | 124 | 136 | 124 | 132 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> ans;
if (n % 2) {
for (int l = 1, r = n - 1; l < r; l++, r--) {
ans.emplace_back(l, r);
}
} else {
bool... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> ans;
if (n % 2) {
for (int l = 1, r = n - 1; l < r; l++, r--) {
ans.emplace_back(l, r);
}
} else {
bool... | replace | 16 | 17 | 16 | 17 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | replace | 45 | 54 | 45 | 66 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N % 2)
for (int i = 0; i < M; i++)
cout << i + 1 << " " << N - i << endl;
else {
vector<bool> used(N + 1, false);
int pos = 1;
for (int k = M; k > 0; k--) {
while (1) {
if (!used[pos] && ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N % 2)
for (int i = 0; i < M; i++)
cout << i + 1 << " " << N - i << endl;
else {
for (int i = 0; i < (M + 1) / 2; i++)
cout << i + 1 << " " << (M + 1) / 2 * 2 - i << endl;
int r = (M + 1) / 2 * 2;
... | replace | 10 | 23 | 10 | 15 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n % 2 == 1) {
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << n - i << endl;
}
} else {
vector<bool> check(100005);
int arrow = 1;
int dif = 1;
int cnt = 0;
while (cnt < m) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n % 2 == 1) {
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << n - i << endl;
}
} else {
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << n - i - (2 * i >= m) << endl;
}
}
return 0;... | replace | 11 | 24 | 11 | 13 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | replace | 20 | 36 | 20 | 29 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<bool> visited(N + 1, false);
int j = 1;
for (int i = 1; i <= M; ++i) {
while (visited[j])
++j;
cout << j << ' ' << j + i << endl;
visited[j] = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
bool even = (M % 2 == 0);
int left = 1;
int right = M;
if (!even)
++right;
while (left < right) {
cout << left << ' ' << right << endl;
++left;
--r... | replace | 9 | 16 | 9 | 31 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
int dat1[50005], dat2[50005];
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (!(n & 1))
n--;
int mm = (n - 1) / 2;
if (mm & 1) {
for (int i = 1; i <= mm / 2; i++) {
dat1[i] = i;
dat2[i] = (n + 1) / 2 - i;
}
for (int j = (n + 1) / 2, i = mm /... | #include <bits/stdc++.h>
int dat1[100005], dat2[100005];
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (!(n & 1))
n--;
int mm = (n - 1) / 2;
if (mm & 1) {
for (int i = 1; i <= mm / 2; i++) {
dat1[i] = i;
dat2[i] = (n + 1) / 2 - i;
}
for (int j = (n + 1) / 2, i = mm... | replace | 1 | 2 | 1 | 2 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> used(n + 1);
for (int i = 1, j = 1; j <= m; i++, j++) {
while (use... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (n & 1) {
for (int i = 0; i < m; i++) {
cout << i + 1 << ' ' << n - i << ... | replace | 13 | 20 | 13 | 24 | 0 | |
p02697 | 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>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
int c = (n + 1) / 2, d = 1, i = 0;
while (c - d > 0) {
a[i] = d;
b[i] = c;
++d;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
if (m % 2 == 0) {
int c = m + 1, d = 1, i = 0;
while (c - d > 0) {
a[i] = d;
... | replace | 11 | 26 | 11 | 45 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
set<int> s;
for (int i = 1; i <= n; i++)
s.insert(i);
int i = 1;
while (i <= m) {
int front = *s.begin();
int next = front + i;
if (next > n) {
next -= n;
}
if (s.find(n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int i = 0;
while (1) {
int start = 1 + i;
int end = m + 1 - i;
if (start >= end)
break;
cout << start << ' ' << end << endl;
i++;
}
i = 0;
while (1) {
int start = m + ... | replace | 9 | 25 | 9 | 25 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | replace | 24 | 33 | 24 | 35 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int)v.size()
#define pr(v) \
For(i, 0, sz(v)) { cout << v[i] << " "; } \
cout << endl;
#define slld(x) scanf("%lld", &x)
#def... | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int)v.size()
#define pr(v) \
For(i, 0, sz(v)) { cout << v[i] << " "; } \
cout << endl;
#define slld(x) scanf("%lld", &x)
#def... | replace | 55 | 56 | 55 | 56 | 0 | |
p02697 | C++ | Runtime Error | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0... | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0... | replace | 53 | 55 | 53 | 72 | 255 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> checked(N + 1, false);
for (int i = M; i > 0; i--) {
for (int ai = 1; ai <= N; ai++) {
int bi = ai + i;
if (!checked.at(ai) && !checked.at(bi)) {
printf("%d %d\n", ai, bi);
checked.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> checked(N + 1, false);
int ai = 1;
for (int i = M; i > 0; i -= 2) {
printf("%d %d\n", ai, ai + i);
ai++;
}
ai = N;
for (int i = M - 1; i > 0; i -= 2) {
printf("%d %d\n", ai, ai - i);
ai--... | replace | 8 | 17 | 8 | 19 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007, INF = mod * mod * 3LL;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(fa... | #include <bits/stdc++.h>
#define be(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod = 1000000007, INF = mod * mod * 3LL;
#define doublecout(a) cout << fixed << setprecision(10) << a << endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(fa... | replace | 17 | 18 | 17 | 18 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#... | replace | 43 | 70 | 43 | 48 | TLE | |
p02697 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | replace | 20 | 31 | 20 | 30 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF... | replace | 44 | 56 | 44 | 51 | 0 | |
p02697 | C++ | Time Limit Exceeded | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize(3)
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("sse3","sse2","sse")
// #pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
// #pragma GCC target("f16c... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize(3)
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("sse3","sse2","sse")
// #pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
// #pragma GCC target("f16c... | replace | 218 | 219 | 218 | 219 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | replace | 80 | 81 | 80 | 102 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool U[100005];
int main() {
cin.tie(0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool U[100005];
int main() {
cin.tie(0)... | replace | 25 | 50 | 25 | 34 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define exrep(i, a, b) for (long long i = a; i <= b; i++)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
ty... | #include <bits/stdc++.h>
#define exrep(i, a, b) for (long long i = a; i <= b; i++)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
ty... | insert | 59 | 59 | 59 | 61 | TLE | |
p02697 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repf(i, ... | replace | 36 | 48 | 36 | 46 | 0 | |
p02697 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | replace | 50 | 51 | 50 | 51 | 0 | |
p02697 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | replace | 61 | 71 | 61 | 67 | 0 | |
p02697 | C++ | Runtime Error | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#inclu... | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#inclu... | replace | 30 | 53 | 30 | 42 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define ms(v, x) memset(v, x, sizeof(v))
#define ff first
#define ss second
#define td(v) v.begin(), v.end()
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
... | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define ms(v, x) memset(v, x, sizeof(v))
#define ff first
#define ss second
#define td(v) v.begin(), v.end()
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
... | replace | 15 | 31 | 15 | 23 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define REP(i, n) for (int i = 0; i < n; ++i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define REP(i, n) for (int i = 0; i < n; ++i... | replace | 49 | 60 | 49 | 65 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
if (n & 1) {
for (int i = 0; i < m; ++i) {
cout << i + 1 << ' ' << n - i - (n & 1) << '\n';
}
} else {
vector<int> a;
a.resize(1000000000000000);
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 1; i * 2 <= m; ++i) {
cout << i << ' ' << m - i + 1 << '\n';
}
for (int i = 1; i * 2 <= m + 1; ++i) {
cout << m + i << ' ' << m * 2 - i + 2 << '\n';
... | replace | 11 | 24 | 11 | 17 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool u[100010];
long long n, m, x;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> n >> m;
int i = 1;
int j = n;
while (m--) {
x = j - i - 2;
if (!u[x] && !u[n - x - 2]) {
u[x] = u[n - x - 2] = true;
cout << i << ' ' << j << '... | #include <bits/stdc++.h>
using namespace std;
bool u[1000010];
long long n, m, x;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> n >> m;
int i = 1;
int j = n;
while (m--) {
x = j - i - 2;
if (!u[x] && !u[n - x - 2]) {
u[x] = u[n - x - 2] = true;
cout << i << ' ' << j << ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> used(n, 0);
int now = 0;
for (int i = 1; i <= m; i++) {
int a = now + i;
while (used[now] || used[a])
(++now) %= n, (++a) %= n;
cout << now + 1 << " " << a + 1 << endl;
used[now] = used[a]... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
int cnt = 1;
for (int i = m; i >= 1; i -= 2) {
cout << cnt << " " << cnt + i << endl;
cnt++;
}
cnt = m + 2;
for (int i = m - 1; i >= 1; i -= 2) {
cout << cnt << " " << cnt + i << endl;
cnt++;
}
}
| replace | 6 | 14 | 6 | 15 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N, M;
cin >> N >> M;
ll head = 2 * (M / 2) + 1;
if (M % 2 == 0)
return 1;
rep(i, 1, M / 2 + 1) {
cout << i << " " << head << endl;
head... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll N, M;
cin >> N >> M;
ll head = 2 * (M / 2) + 1;
if (M % 2 == 0) {
rep(i, 1, M / 2 + 1) {
cout << i << " " << head << endl;
head--;
... | replace | 9 | 19 | 9 | 29 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(x) \
cout << #x << ":"; \
cout << x << endl;
#define d... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(x) \
cout << #x << ":"; \
cout << x << endl;
#define d... | replace | 50 | 56 | 50 | 72 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | replace | 41 | 51 | 41 | 58 | 0 | |
p02697 | C++ | Runtime Error | #ifndef DEBUG
#pragma GCC optimize("O3,unroll-loops")
#pragma loop_opt(on)
#endif
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FAST ;
#else
#define FAST \
ios::sync_with_stdio(0); ... | #ifndef DEBUG
#pragma GCC optimize("O3,unroll-loops")
#pragma loop_opt(on)
#endif
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FAST ;
#else
#define FAST \
ios::sync_with_stdio(0); ... | replace | 30 | 31 | 30 | 32 | -6 | a177d33b-97e6-4253-9097-fb4171dcc210.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02697/C++/s908641400.cpp:29: int main(): Assertion `n%2' failed.
|
p02697 | Python | Runtime Error | N, M = map(int, input().split())
sieve = [0] * (100000 + 1)
sieve[0] = -1
sieve[1] = -1
for i in range(2, 100000 + 1):
if sieve[i] != 0:
continue
sieve[i] = i
for j in range(i * i, 100000 + 1, i):
if sieve[j] == 0:
sieve[j] = i
p = []
for i in range(N - 1, -1, -1):
if sieve... | N, M = map(int, input().split())
for i in range(1, M + 1):
if i % 2 == 1:
j = (i - 1) // 2
print(1 + j, M + 1 - j)
else:
j = (i - 2) // 2
print(M + 2 + j, 2 * M + 1 - j)
| replace | 2 | 31 | 2 | 9 | 0 | |
p02697 | Python | Runtime Error | n, m = map(int, input().split())
a, b = n, 1
V = [False for d in range(1, m + 2)]
for i in range(m):
d = min(a - b, n - (a - b))
if 2 * d == n or V[d]:
a -= 1
print(a, b)
d = min(a - b, n - (a - b))
V[d] = True
a -= 1
b += 1
| n, m = map(int, input().split())
a, b = n, 1
V = [False for d in range(1, n + 1)]
for i in range(m):
d = min(a - b, n - (a - b))
if 2 * d == n or V[d]:
a -= 1
print(a, b)
d = min(a - b, n - (a - b))
V[d] = True
a -= 1
b += 1
| replace | 2 | 3 | 2 | 3 | 0 | |
p02697 | C++ | Runtime Error | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9... | replace | 67 | 69 | 67 | 68 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n % 2) {
int dif = 1;
int pivot = n / 2;
for (int i = 0; i < m; i++) {
cout << pivot << " " << pivot + dif << endl;
pivot--;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n % 2) {
int dif = 1;
int pivot = n / 2;
for (int i = 0; i < m; i++) {
cout << pivot << " " << pivot + dif << endl;
pivot--;
... | replace | 21 | 36 | 21 | 36 | TLE | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int m, n, tr, cnta, cntb;
int a[50005], b[50005];
int lo(int start, int step) { return (start + step + n - 1) % n + 1; }
int main() {
cin >> n >> m;
cnta = 1;
cntb = n;
for (int i = 0; i < m; i++) {
if (i % 2 == 0) {
a[i] = cnta;
b[i] = lo(cnta, ... | #include <bits/stdc++.h>
using namespace std;
int m, n, tr, cnta, cntb;
int a[100005], b[100005];
int lo(int start, int step) { return (start + step + n - 1) % n + 1; }
int main() {
cin >> n >> m;
cnta = 1;
cntb = n;
for (int i = 0; i < m; i++) {
if (i % 2 == 0) {
a[i] = cnta;
b[i] = lo(cnta... | replace | 5 | 6 | 5 | 6 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VP vector<pair<int, int>>
#define VPP vector<pair<int, pair<int, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VP vector<pair<int, int>>
#define VPP vector<pair<int, pair<int, ... | replace | 50 | 52 | 50 | 57 | -6 | 78faeead-fa29-4e44-823c-5bcba8858b4e.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02697/C++/s094347515.cpp:43: int main(): Assertion `n == 0' failed.
|
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | replace | 59 | 67 | 59 | 70 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 13 | 19 | 13 | 31 | 0 | |
p02697 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 998244353
#define fi first
#define se second
#define pii pair<int... | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define mod 998244353
#define fi first
#define se second
#define pii pair<int... | replace | 43 | 44 | 43 | 50 | -6 | fac7754b-8485-4e4f-9ea8-3c2e00bb8ea4.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02697/C++/s479002330.cpp:43: int32_t main(): Assertion `false' failed.
|
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int ... | replace | 46 | 57 | 46 | 59 | 0 | |
p02697 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;... | replace | 566 | 587 | 566 | 575 | TLE | |
p02697 | C++ | Runtime Error | /*
Author:Raghav Bansal
IIIT Una
*/
#include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define BOLT \
ios_base::sync_with_stdio(false); ... | /*
Author:Raghav Bansal
IIIT Una
*/
#include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define BOLT \
ios_base::sync_with_stdio(false); ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int i = 1, j = (N + 1) / 2;
int D = j - i - 1;
vector<pair<int, int>> ans;
while (i < j)
ans.emplace_back(i++, j--);
i = N - D, j = N;
while (ans.size() < M)
ans.emplace_back(i++, j--);
assert(ans.size() == M)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int i = 1, j = (N + 1) / 2;
int D = j - i - 1;
vector<pair<int, int>> ans;
while (i < j)
ans.emplace_back(i++, j--);
i = N - D, j = N;
while (ans.size() < M)
ans.emplace_back(i++, j--);
while (ans.size() > M)
... | insert | 14 | 14 | 14 | 16 | 0 | |
p02697 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int u[100005];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int u[100005];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.f... | replace | 23 | 31 | 23 | 30 | 0 | |
p02697 | Python | Runtime Error | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(1, m + 1):
print(i, n + 1 - i)
else:
used = [False] * (n + 1)
i = 1
count = 0
while count < m:
while used[i]:
i += 1
print(i, i + count + 1)
used[i] = True
used[i + count + 1] = True
... | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(1, m + 1):
print(i, n + 1 - i)
else:
turning_point = (m + 1) // 2
for i in range(1, turning_point + 1):
print(i, n + 1 - i)
for i in range(turning_point + 1, m + 1):
print(i, n - i)
| replace | 5 | 15 | 5 | 10 | 0 | |
p02697 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = map(int, input().split())
if N % 2 == 0:
used = [False] * (N + 1)
i = 0
span = 1
cnt = 0
while cnt < M:
cn... | import sys
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = map(int, input().split())
if N % 2 == 0:
for i in range(M):
x = i + 1
y = N - i - 1
if y - x > (N - y + x):
... | replace | 16 | 28 | 16 | 23 | 0 | |
p02698 | C++ | Runtime Error | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#includ... | replace | 590 | 591 | 590 | 591 | 0 | |
p02698 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push... | #include "bits/stdc++.h"
using namespace std;
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push... | replace | 49 | 50 | 49 | 50 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.