problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03005 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vt vector
#define pb push_back
#define pob pop_back
#define vi vt<int>
#define vvi vt<vi>
#define vii vt<ii>
#define vvii vt<vii>
typedef long long ll;
#define For(i, a, b) for (int i = a; i < b; i++)
#define foR(i, a, b) for (int i = a; i <= b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vt vector
#define pb push_back
#define pob pop_back
#define vi vt<int>
#define vvi vt<vi>
#define vii vt<ii>
#define vvii vt<vii>
typedef long long ll;
#define For(i, a, b) for (int i = a; i < b; i++)
#define foR(i, a, b) for (int i = a; i <= b... | [] | 819,080 | 819,081 | u469862174 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, k;
cin >> n >> k;
if (k == 0)
cout << 0;
if (k == 1)
cout << n;
else
cout << n - k;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, k;
cin >> n >> k;
if (k == 0)
cout << 0;
if (k == 1)
cout << 0;
else
cout << n - k;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 819,082 | 819,083 | u998997473 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N, K;
if (K == 1) {
cout << '0' << endl;
} else {
cout << N - K << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << '0' << endl;
} else {
cout << N - K << endl;
}
}
| [] | 819,084 | 819,085 | u341447450 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N, K;
if (K = 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << '0' << endl;
} else {
cout << N - K << endl;
}
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,086 | 819,085 | u341447450 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k >= 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k <= 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 819,087 | 819,088 | u183479807 | cpp |
p03005 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
... | [
"expression.operation.binary.remove"
] | 819,089 | 819,090 | u285598935 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
srand(time(0));
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n, k;
cin >> n >> k;
cout << (n == 1 ? 0 : n - k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
srand(time(0));
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k);
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,091 | 819,092 | u232060648 | cpp |
p03005 | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,093 | 819,094 | u375267383 | cpp |
p03005 | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << endl;
else
cout << (n - k) + 1 - 1 << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << (n - k) + 1 - 1 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,095 | 819,096 | u411517988 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1) ? 0 : n - k << '\n';
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << '\n';
} | [] | 819,099 | 819,100 | u222744685 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,101 | 819,102 | u243961437 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fr(i, j, k) for (i = j; i < (k); i++)
#define all(x) x.begin(), x.end()
#define el '\n'
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
typede... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fr(i, j, k) for (i = j; i < (k); i++)
#define all(x) x.begin(), x.end()
#define el '\n'
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
typede... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,107 | 819,108 | u166166717 | cpp |
p03005 | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
if (n == k) {
printf("0\n");
} else {
int remain = n - k;
printf("%d\n", remain);
}
return 0;
} | #include <stdio.h>
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
if (k == 1 || n == k) {
printf("0\n");
} else {
int remain = n - k;
printf("%d\n", remain);
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 819,113 | 819,114 | u497418592 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 0) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,117 | 819,118 | u392569193 | cpp |
p03005 | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, n) for (int i = 0; i < n; i++)
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long ... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, n) for (int i = 0; i < n; i++)
#define forr(i, a, b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 819,119 | 819,120 | u505510763 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << (N == 1 ? 0 : N - K) << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
cout << (K == 1 ? 0 : N - K) << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,127 | 819,128 | u374099594 | cpp |
p03005 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,133 | 819,134 | u102602414 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 0) {
cout << 0 << endl;
return 0;
}
cout << n - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
}
cout << n - k << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,154 | 819,155 | u017167684 | cpp |
p03005 | // stringray
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ost;
typedef pair<int, int> pi;
typedef long lo... | // stringray
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ost;
typedef pair<int, int> pi;
typedef long lo... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,160 | 819,161 | u964299793 | cpp |
p03005 | #include <iostream>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
cout << (k > 0 ? n - k : 0);
} | #include <iostream>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
cout << (k > 1 ? n - k : 0);
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 819,164 | 819,165 | u486908386 | cpp |
p03005 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
vector<int> a[100001];
bool cs = true;
int f(int root, int par) {
if (!cs) {
return -1;
}
if (a[root].size() == 1 && a[root].front() == par) {
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
vector<int> a[100001];
bool cs = true;
int f(int root, int par) {
if (!cs) {
return -1;
}
if (a[root].size() == 1 && a[root].front() == par) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,170 | 819,171 | u188208110 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,178 | 819,179 | u466393447 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N == 0) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 819,180 | 819,179 | u466393447 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"expression.operation.binary.remove"
] | 819,181 | 819,182 | u822169805 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
main() {
int n, k;
cin >> n >> k;
cout << (k ? n - k : 0);
} | #include <bits/stdc++.h>
using namespace std;
main() {
int n, k;
cin >> n >> k;
cout << (k > 1 ? n - k : 0);
} | [
"expression.operation.binary.add"
] | 819,196 | 819,197 | u756659922 | cpp |
p03005 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,205 | 819,206 | u710999236 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define REP(i, N) for (int i = 0; i < N; i++)
#define ANS(a) cout << a << endl;
#define SORT(V) sort(V.begin(), V.end())
#define RSORT(V) sort(V.rbegin(), V.rend())
#define DBG(V) ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define REP(i, N) for (int i = 0; i < N; i++)
#define ANS(a) cout << a << endl;
#define SORT(V) sort(V.begin(), V.end())
#define RSORT(V) sort(V.rbegin(), V.rend())
#define DBG(V) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 819,207 | 819,208 | u013373291 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << "\n";
else
cout << n - k << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << "\n";
else
cout << n - k << "\n";
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,209 | 819,210 | u018543978 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll INFLL = (1ll << 60);
const ll MOD = (ll)(1e9 + 7);
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a = (a < MOD) ? a : (a - MOD);
b = (b < MOD) ? b : (b - M... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 819,211 | 819,212 | u548624367 | cpp |
p03005 | #include <bits/stdc++.h>
#define All(v) v.begin(), v.end()
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int N, K;
cin >> N >> K;
if (K == 1)
cout << N << endl;
else
cout << N - K << e... | #include <bits/stdc++.h>
#define All(v) v.begin(), v.end()
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << e... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 819,217 | 819,218 | u354638986 | cpp |
p03005 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N;
cin >> K;
if (K < 2) {
cout << 0 << endl;
return 0;
}
cout << N - K - 1 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N;
cin >> K;
if (K < 2) {
cout << 0 << endl;
return 0;
}
cout << N - K << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 819,236 | 819,237 | u307752464 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1) ? 0 : n - k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k == 1) ? 0 : n - k);
} | [] | 819,238 | 819,239 | u219398458 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (n == 1) ? 0 : n - k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k == 1) ? 0 : n - k);
} | [
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,240 | 819,239 | u219398458 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v_ll;
typedef vector<vector<ll>> vv_ll;
typedef vector<pair<ll, ll>> vp_ll;
typedef pair<ll, ll> p_ll;
bool TEST = false;
ll MOD = 1000000007;
void show() {
if (TEST) {
cou... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> v_ll;
typedef vector<vector<ll>> vv_ll;
typedef vector<pair<ll, ll>> vp_ll;
typedef pair<ll, ll> p_ll;
bool TEST = false;
ll MOD = 1000000007;
void show() {
if (TEST) {
cou... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 819,245 | 819,246 | u881541634 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,249 | 819,250 | u002419600 | cpp |
p03005 | #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d", &x, &y);
if (x / y == 1) {
printf("0");
} else {
z = x - y;
printf("%d", z);
}
return 0;
}
| #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d", &x, &y);
if (y == 1) {
printf("0");
} else {
z = x - y;
printf("%d", z);
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 819,253 | 819,254 | u932409248 | cpp |
p03005 | #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d", &x, &y);
if (x / y == 1) {
printf("0\n");
} else {
z = x - y;
printf("%d\n", z);
}
return 0;
}
| #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d", &x, &y);
if (y == 1) {
printf("0");
} else {
z = x - y;
printf("%d", z);
}
return 0;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 819,255 | 819,254 | u932409248 | cpp |
p03005 | #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d%d", &x, &y);
if (x / y == 1) {
printf("0\n");
} else {
z = x - y;
printf("%d\n", z);
}
return 0;
}
| #include <cstdio>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d", &x, &y);
if (y == 1) {
printf("0");
} else {
z = x - y;
printf("%d", z);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.remove",
"io.output.change",
"io.output.newline.remove"
] | 819,256 | 819,254 | u932409248 | cpp |
p03005 | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | #define y1 askjdkasldjlkasd
#include <bits/stdc++.h>
#undef y1
using namespace std;
#define pb push_back
#define mp make_pair
#define fi(a, b) for (int i = a; i <= b; i++)
#define fj(a, b) for (int j = a; j <= b; j++)
#define fo(a, b) for (int o = a; o <= b; o++)
#define fdi(a, b) for (int i = a; i >= b; i--)
#define... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,262 | 819,263 | u197964611 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K - 1 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
}
| [
"expression.operation.binary.remove"
] | 819,277 | 819,278 | u913604515 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K - 1 << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
} | [
"expression.operation.binary.remove"
] | 819,277 | 819,279 | u913604515 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k)
cout << n - k;
else
cout << 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k - 1)
cout << n - k;
else
cout << 0;
}
| [
"control_flow.branch.if.condition.change"
] | 819,282 | 819,283 | u460412596 | cpp |
p03005 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long lon... | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long lon... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 819,289 | 819,290 | u358210788 | cpp |
p03005 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 整数の入力
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// 整数の入力
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,293 | 819,294 | u902500155 | cpp |
p03005 | #include <stdio.h>
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (n == 1)
printf("%d\n", 0);
else
printf("%d\n", n - k);
return 0;
} | #include <stdio.h>
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (k == 1)
printf("%d\n", 0);
else
printf("%d\n", n - k);
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,297 | 819,298 | u073586914 | cpp |
p03005 | #include <stdio.h>
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (n == 1)
puts("0");
else
printf("%d\n", n - k);
return 0;
} | #include <stdio.h>
int n, k;
int main() {
scanf("%d%d", &n, &k);
if (k == 1)
printf("%d\n", 0);
else
printf("%d\n", n - k);
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.function.change",
"io.output.change",
"literal.string.change",
"call.arguments.change",
"io.output.newline.add",
"call.arguments.add"
] | 819,299 | 819,298 | u073586914 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (n >= k) {
int max = n - k + 1;
int min = 1;
cout << max - min << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (k >= 2) {
int max = n - k + 1;
int min = 1;
cout << max - min << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 819,305 | 819,306 | u239316561 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 0) ? 0 : (n - k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k == 1) ? 0 : (n - k));
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 819,311 | 819,312 | u192159607 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int main() {
int N, K;
cin >> N >> K;
if (K == 0)
cout << 0 << endl;
else
cout << N - K << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,330 | 819,331 | u422592877 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
int main() {
int K, N;
cin >> N >> K;
if (N == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
int main() {
int K, N;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,332 | 819,333 | u378945900 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define mk make_pair
typedef long long LL;
typedef pair<int, int> Interval;
template <typename T> ostream ... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define mk make_pair
typedef long long LL;
typedef pair<int, int> Interval;
template <typename T> ostream ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,338 | 819,339 | u066651036 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
c... | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
c... | [
"expression.operation.binary.remove"
] | 819,352 | 819,353 | u924885571 | cpp |
p03005 |
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if (K == 1) {
printf("0");
} else {
printf("%d", N - K + 1);
}
return 0;
} |
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if (K == 1) {
printf("0");
} else {
printf("%d", N - K);
}
return 0;
} | [
"expression.operation.binary.remove"
] | 819,354 | 819,355 | u617987447 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k - 1) ? 0 : n - k);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k - 1 == 0) ? 0 : n - k);
} | [
"expression.operation.binary.add"
] | 819,356 | 819,357 | u885523920 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define dd double
#define ull unsigned long long
#define mes(x, y) m... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define dd double
#define ull unsigned long long
#define mes(x, y) m... | [
"expression.operation.binary.remove"
] | 819,360 | 819,361 | u538947292 | cpp |
p03005 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,364 | 819,365 | u495699318 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b == 1) {
cout << "0" << endl;
} else
cout << b - a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b == 1) {
cout << "0" << endl;
} else
cout << a - b << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 819,368 | 819,369 | u007099475 | cpp |
p03005 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
co... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 819,378 | 819,379 | u385297366 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
if (K > 1) {
cout << N - K;
} else {
cout << N;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
int K;
cin >> N >> K;
if (K > 1) {
cout << N - K;
} else {
cout << 0;
}
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 819,385 | 819,386 | u057810841 | cpp |
p03005 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = k == 0 ? 0 : n - k;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = k == 1 ? 0 : n - k;
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 819,387 | 819,388 | u590241855 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N > 1) {
cout << N - K << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K > 1) {
cout << N - K << endl;
} else {
cout << 0 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,389 | 819,390 | u801530021 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
// cin.tie(0);
// ios::sync_with_stdio(false);
int main() {
int N, K;
int ans;
cin >> N >> K;
if (K == 1) {
ans = N;
} else {
ans = N - K;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// cin.tie(0);
// ios::sync_with_stdio(false);
int main() {
int N, K;
int a, ans;
cin >> N >> K;
if (K == 1) {
ans = 0;
} else {
ans = N - K;
}
cout << ans << endl;
} | [
"variable_declaration.add",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 819,391 | 819,392 | u087520103 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,395 | 819,396 | u375619974 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
cout << n - k << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 819,401 | 819,402 | u125693891 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 1 << endl;
cout << N - K << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
return 0;
} | [
"literal.number.change",
"io.output.change",
"control_flow.branch.else.add"
] | 819,406 | 819,407 | u652609504 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 1 << endl;
}
else {
cout << n - k << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
}
else {
cout << n - k << endl;
}
}
| [
"literal.number.change",
"io.output.change"
] | 819,425 | 819,426 | u277253335 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,427 | 819,428 | u983540695 | cpp |
p03005 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,449 | 819,450 | u700484101 | cpp |
p03005 |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
/* see https://github.com/pllk/cphb/ */
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
/* see https://github.com/pllk/cphb/ */
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,456 | 819,457 | u014617387 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 0) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,460 | 819,461 | u153794369 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) RE... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) RE... | [
"literal.number.change",
"io.output.change"
] | 819,466 | 819,467 | u139235669 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int A, B;
// int money = 0;
cin >> A >> B;
if (B <= 1)
cout << 0 << endl;
else
cout << (B - A) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
// int money = 0;
cin >> A >> B;
if (B <= 1)
cout << 0 << endl;
else
cout << (A - B) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 819,474 | 819,475 | u551795653 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 0)
cout << 0 << endl;
else
cout << N - K << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,476 | 819,477 | u362444129 | cpp |
p03005 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k != 0 ? n - k : 0) << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k != 1 ? n - k : 0) << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 819,485 | 819,486 | u959815036 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return 0;
} else {
cout << n - k << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
} else {
cout << n - k << endl;
return 0;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,487 | 819,488 | u557044746 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,491 | 819,492 | u681869152 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [] | 819,493 | 819,492 | u681869152 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort((v).begin(), (v).end())
#define REV(v) sort((v).begin(), (v).end(... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,494 | 819,492 | u681869152 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (K = 1) {
ans = 0;
} else {
int big = N - K + 1;
int small = 1;
ans = big - small;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (K == 1) {
ans = 0;
} else {
int big = N - K + 1;
int small = 1;
ans = big - small;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,495 | 819,496 | u828664775 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k % n ? 0 : 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 819,497 | 819,498 | u948459352 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << endl;
else
cout << n - k << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
// ====================================================================
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,501 | 819,502 | u561186440 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
N = N - K;
if (K = 1)
N = 0;
cout << N;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
N = N - K;
if (K == 1)
N = 0;
cout << N;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,508 | 819,509 | u534015096 | cpp |
p03005 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << K - N << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 819,510 | 819,511 | u991846372 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a = 0, b = 0, c = 0, d = 0, e, l, m, n, k, o = 0, p, q, x, y, z, max1 = 0,
ans, r, g;
string s, t, u;
cin >> n >> k;
if (k = 1)
cout << 0 << endl;
else
cout << n - k << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll a = 0, b = 0, c = 0, d = 0, e, l, m, n, k, o = 0, p, q, x, y, z, max1 = 0,
ans, r, g;
string s, t, u;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
}... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,518 | 819,519 | u953532675 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, K, ans;
cin >> N >> K;
ans = N - K;
if (N == 1) {
cout << 0;
} else {
cout << ans;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N, K, ans;
cin >> N >> K;
ans = N - K;
if (K == 1) {
cout << 0;
} else {
cout << ans;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,524 | 819,525 | u591779169 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
if (k = 1) {
ans = 0;
} else {
ans = n - k;
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, k, ans;
cin >> n >> k;
if (k == 1) {
ans = 0;
} else {
ans = n - k;
}
cout << ans << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,528 | 819,529 | u821416900 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k != 1) ? (n - k) : (0);
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << ((k != 1) ? (n - k) : (0));
return 0;
} | [] | 819,537 | 819,538 | u468506413 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = N - K;
if (K != 1) {
cout << ans << endl;
}
else {
cout << N << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = N - K;
if (K != 1) {
cout << ans << endl;
}
else {
cout << 0 << endl;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 819,539 | 819,540 | u096717230 | cpp |
p03005 | // diverta 2019 Programming Contest
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int num = 0;
cin >> n >> k;
if (k == 1) {
cout << n << endl;
} else {
cout << n - k << endl;
}
}
| // diverta 2019 Programming Contest
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int num = 0;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 819,543 | 819,544 | u320509353 | cpp |
p03005 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
if (k == 0) {
cout << "0\n";
return... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
if (k == 1) {
cout << "0\n";
return... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,545 | 819,546 | u398025421 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
}
cout << n - k;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
} else {
cout << n - k;
}
}
| [
"control_flow.branch.else.add"
] | 819,547 | 819,548 | u365178348 | cpp |
p03005 | #include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin()
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
if (n == 1)
return cout << 0, 0;
n -= k;
cout << n;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin()
using namespace std;
signed main() {
int n, k;
cin >> n >> k;
if (k == 1)
return cout << 0, 0;
n -= k;
cout << n;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,551 | 819,552 | u759779286 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, K;
cin >> N >> K;
if (K... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 10e9 + 7
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int N, K;
cin >> N >> K;
if (K... | [
"io.output.change"
] | 819,562 | 819,563 | u090325904 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,564 | 819,565 | u027091475 | cpp |
p03005 | // diverta a
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
if (b == 1) {
c = 0;
} else {
c = b - a;
}
printf("%d\n", c);
return 0;
} | // diverta a
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
if (b == 1) {
c = 0;
} else {
c = a - b;
}
printf("%d\n", c);
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 819,566 | 819,567 | u489425626 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,568 | 819,569 | u953587543 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3")
#define ll long long
#define vi vector<int>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i > b; i--)
#define pb push_back
#define pii pair<int, int... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 819,570 | 819,569 | u953587543 | cpp |
p03005 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
using vint = vec... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) for (int i = (n)-1; 0 <= i; --i)
#define each(e, v) for (auto &&e : (v))
#define all(v) begin(v), end(v)
#define dump(x) cerr << #x << ": " << (x) << endl
using namespace std;
using vint = vec... | [
"expression.operation.binary.remove"
] | 819,575 | 819,576 | u667543757 | cpp |
p03005 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define INIT \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
#define ALL(c) (c).... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define INIT \
std::cin.tie(0); \
std::ios::sync_with_stdio(false);
#define ALL(c) (c).... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,579 | 819,580 | u685774550 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
if (n > 1)
cout << n - p;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
if (p > 1)
cout << n - p;
else
cout << 0 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,592 | 819,593 | u911150465 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.