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 |
|---|---|---|---|---|---|---|---|
p03003 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 818,221 | 818,222 | u976162616 | cpp |
p03003 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, s, n) for (int i = (int)(s); i < (int)(n); ++i)
#define ALL(n) (n).begin(), (n).end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> mat;
// mat dtable(M, vl(N, 0)); ... | [
"assignment.change"
] | 818,247 | 818,248 | u963682312 | cpp |
p03003 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef long long ll;
ll a, b, c;
const ll maxn... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(false), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef long long ll;
ll a, b, c;
const ll maxn... | [
"assignment.change"
] | 818,324 | 818,325 | u856205835 | cpp |
p03003 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | [
"literal.number.change",
"assignment.value.change"
] | 818,350 | 818,351 | u107292917 | cpp |
p03003 | /*input
20 20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
*/
#include <bits/stdc++.h>
using namespace std;
#define TEMPLATE
#ifdef TEMPLATE
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld>... | /*input
20 20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
*/
#include <bits/stdc++.h>
using namespace std;
#define TEMPLATE
#ifdef TEMPLATE
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld>... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 818,396 | 818,397 | u725463576 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repe(i, j, n) for (int i = (j); i <= (n); i++)
#define repr(i, j, n) for (int i = (n)-1; i >= 0; i--)
int mod = 1e9 + 7;
signed main() {
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repe(i, j, n) for (int i = (j); i <= (n); i++)
#define repr(i, j, n) for (int i = (n)-1; i >= 0; i--)
int mod = 1e9 + 7;
signed main() {
i... | [
"control_flow.branch.if.condition.change"
] | 818,402 | 818,403 | u731175398 | cpp |
p03003 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 818,412 | 818,413 | u957188497 | cpp |
p03003 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#define mst(a, b) memset(a, b, sizeof(a))
#define repi(a, b) for (i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#define mst(a, b) memset(a, b, sizeof(a))
#define repi(a, b) for (i... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 818,418 | 818,419 | u401146093 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) ... | [
"assignment.change"
] | 818,421 | 818,422 | u337054478 | cpp |
p03003 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"variable_declaration.remove",
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_declaration.value.change"
] | 818,460 | 818,461 | u824337972 | cpp |
p03003 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"variable_declaration.remove",
"variable_declaration.name.change",
"identifier.change"
] | 818,462 | 818,461 | u824337972 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 2048
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef long double ld;
const double PI = acos(-1.0);
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 2048
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef long double ld;
const double PI = acos(-1.0);
#define dbg(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 818,470 | 818,471 | u802237789 | cpp |
p03003 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 818,490 | 818,488 | u502721867 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int j = 0; j < m; ++j)
cin >> b[j];
vector<vector<int>> dp(n + 1, vector<int>(m +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int j = 0; j < m; ++j)
cin >> b[j];
vector<vector<int>> dp(n + 1, vector<int>(m +... | [
"expression.operation.binary.add"
] | 818,497 | 818,498 | u595786324 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
const int mod = 1e9 + 7;
const int inf = 2e9;
int a[N], b[N];
long long dp[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i <= m; ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
const int mod = 1e9 + 7;
const int inf = 2e9;
int a[N], b[N];
long long dp[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i <= m; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 818,499 | 818,500 | u595786324 | cpp |
p03003 | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pai... | // Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pai... | [
"call.arguments.change"
] | 818,517 | 818,518 | u050607149 | cpp |
p03003 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"literal.number.type.widen.change",
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 818,519 | 818,520 | u837951457 | cpp |
p03003 | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n);
vector<int> t(m);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> t[i];
vector<vector<long long>> dp(n + 1, vector<lon... | #include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n);
vector<int> t(m);
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < m; i++)
cin >> t[i];
vector<vector<long long>> dp(n + 1, vector<lon... | [
"assignment.change"
] | 818,531 | 818,532 | u513736711 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
//#define %d %lld
//#define int long long
typedef long long ll;
#define sqr(x) ((x) * (x))
#define pb push_back
const int N = 2002, M = 1e9 + 7;
void Max(int &x, int y) {
if (y > x)
x = y;
}
void Min(int &x, int y) {
if (y < x)
x = y;
}
void inc(int &x, int y) {... | #include <bits/stdc++.h>
using namespace std;
//#define %d %lld
//#define int long long
typedef long long ll;
#define sqr(x) ((x) * (x))
#define pb push_back
const int N = 2002, M = 1e9 + 7;
void Max(int &x, int y) {
if (y > x)
x = y;
}
void Min(int &x, int y) {
if (y < x)
x = y;
}
void inc(int &x, int y) {... | [
"call.arguments.change",
"call.arguments.add"
] | 818,555 | 818,556 | u764856393 | cpp |
p03003 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long int
constexpr int MOD = 1000000007; // 10 ** 9 + 7
constexpr int SIZE = 2010;
int dp[SIZE][SIZE];
int sum[SIZE][SIZE];
void solve() {
int N, M;
cin >> N >> M;
vector<int> s(N);
for (auto ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long int
constexpr int MOD = 1000000007; // 10 ** 9 + 7
constexpr int SIZE = 2010;
int dp[SIZE][SIZE];
int sum[SIZE][SIZE];
void solve() {
int N, M;
cin >> N >> M;
vector<int> s(N);
for (auto ... | [
"expression.operation.binary.remove"
] | 818,573 | 818,574 | u173511648 | cpp |
p03003 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long int
constexpr int MOD = 1000000007; // 10 ** 9 + 7
constexpr int SIZE = 2010;
int dp[SIZE][SIZE];
int sum[SIZE][SIZE];
void solve() {
int N, M;
cin >> N >> M;
vector<int> s(N);
for (auto ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long int
constexpr int MOD = 1000000007; // 10 ** 9 + 7
constexpr int SIZE = 2010;
int dp[SIZE][SIZE];
int sum[SIZE][SIZE];
void solve() {
int N, M;
cin >> N >> M;
vector<int> s(N);
for (auto ... | [
"expression.operation.binary.remove"
] | 818,575 | 818,574 | u173511648 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define ... | [
"assignment.change"
] | 818,585 | 818,586 | u764234894 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int a, b;
long long ans = 1;
cin >> a >> b;
vector<char> s(a), t(b);
vector<long long> q(a), w(b);
for (int i = 0; i < a; i++) {
cin >> s.at(i);
q.at(i) = 0;
}
for (int i = 0; i < b; i++) {
cin >> t.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int a, b;
long long ans = 1;
cin >> a >> b;
vector<int> s(a), t(b);
vector<long long> q(a), w(b);
for (int i = 0; i < a; i++) {
cin >> s.at(i);
q.at(i) = 0;
}
for (int i = 0; i < b; i++) {
cin >> t.at(i);
... | [
"variable_declaration.type.primitive.change"
] | 818,587 | 818,588 | u112775098 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
for (auto &i : v)
os << i << " ";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &i : v)
is >>... | [
"expression.operator.change",
"assignment.change"
] | 818,601 | 818,602 | u171804186 | cpp |
p03003 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if (x += a.x >= mod)
x -= mod;
return *this;
}
mint &operator-=(con... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(c... | [
"control_flow.branch.if.condition.change"
] | 818,612 | 818,613 | u457283867 | cpp |
p03003 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e3 + 5;
const ... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e3 + 5;
const ... | [
"variable_declaration.type.primitive.change"
] | 818,620 | 818,621 | u047655753 | cpp |
p03003 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 100000... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
// typedef vector<unsigned int>vec;
// typedef vector<ll>vec;
// typedef vector<vec> mat;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 100000... | [
"assignment.value.change"
] | 818,622 | 818,623 | u493750228 | cpp |
p03003 | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))
... | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) memset(a, b, sizeof(a))... | [
"identifier.change",
"variable_declaration.type.primitive.change"
] | 818,626 | 818,627 | u751741878 | cpp |
p03003 | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
int A[n], B[m];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int j = 0; j < m; j++)
cin >> B[j];
long long dp[n + 1][m + 1];
memset(dp, 0, sizeo... | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
int A[n], B[m];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int j = 0; j < m; j++)
cin >> B[j];
long long dp[n + 1][m + 1];
memset(dp, 0, sizeo... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"identifier.replace.remove",
"literal.replace.add"
] | 818,643 | 818,644 | u257965594 | cpp |
p03003 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long int64;
static int64 MOD = 1e9 ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long int64;
static int64 MOD = 1e9 ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 818,652 | 818,653 | u635804867 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 10;
const int modn = 1e9 + 7;
int a[maxn], b[maxn];
ll dp[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i])... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 10;
const int modn = 1e9 + 7;
int a[maxn], b[maxn];
ll dp[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i])... | [
"assignment.change"
] | 818,670 | 818,671 | u115357063 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 10;
const int modn = 1e9 + 7;
int a[maxn], b[maxn];
ll dp[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i])... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 10;
const int modn = 1e9 + 7;
int a[maxn], b[maxn];
ll dp[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i])... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.change"
] | 818,672 | 818,671 | u115357063 | cpp |
p03003 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_map>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_map>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 818,675 | 818,676 | u532573979 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) fo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 818,685 | 818,686 | u139031151 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) fo... | [
"literal.number.change"
] | 818,687 | 818,688 | u139031151 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
for (int i = 0; i < M; i++) {
cin >> T.at(i);
}
vector<vector<int>> dp(N + 1, vector<int>(M + 1, 1));
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> S(N), T(M);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
for (int i = 0; i < M; i++) {
cin >> T.at(i);
}
vector<vector<ll>> dp(N + 1, vector<ll>(M + 1, 1));
ll P... | [
"call.arguments.change"
] | 818,731 | 818,732 | u154931839 | cpp |
p03003 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m;... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m;... | [
"variable_declaration.type.change"
] | 818,753 | 818,754 | u906208439 | cpp |
p03003 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
long long dp[2005][2005];
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
long long dp[2005][2005];
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; i... | [
"assignment.change"
] | 818,757 | 818,758 | u801102476 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
ll dp_memo[2010][2010];
ll sum_memo[2010][2010];
ll N, M;
vector<ll> S;
vector<ll> T;
ll dp(ll a, ll b);
ll sum(ll c, ll d);
// dp(a,b)は最後にS[a],T[b]を使う共通部分列の個数
// sum(a,b)はdp(0,0) + dp(0,1) + ...... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
ll dp_memo[2010][2010];
ll sum_memo[2010][2010];
ll N, M;
vector<ll> S;
vector<ll> T;
ll dp(ll a, ll b);
ll sum(ll c, ll d);
// dp(a,b)は最後にS[a],T[b]を使う共通部分列の個数
// sum(a,b)はdp(0,0) + dp(0,1) + ...... | [] | 818,792 | 818,793 | u904123392 | cpp |
p03003 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_wi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int main() {
ios::sync_wi... | [
"assignment.change"
] | 818,819 | 818,820 | u827841970 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
//二分累乗法 modを設定すること
ll dp[2100][2100];
signed main() {
ll n, m;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
//二分累乗法 modを設定すること
ll dp[2100][2100];
signed main() {
ll n, m;
... | [
"expression.operator.change",
"expression.operation.binary.remove"
] | 818,827 | 818,828 | u317711717 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
//二分累乗法 modを設定すること
ll dp[2100][2100];
signed main() {
ll n, m;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
//二分累乗法 modを設定すること
ll dp[2100][2100];
signed main() {
ll n, m;
... | [
"expression.operator.change"
] | 818,827 | 818,830 | u317711717 | cpp |
p03003 | #include <iostream>
using namespace std;
const int C = 2005;
int s[C];
int t[C];
long long dp[C][C];
long long MOD = 1000000009;
int main() {
int N, M;
while (cin >> N >> M) {
for (int i = 0; i < C; i++) {
s[i] = t[i] = 0;
for (int j = 0; j < C; j++) {
dp[i][j] = 0;
}
dp[i][0... | #include <iostream>
using namespace std;
const int C = 2005;
int s[C];
int t[C];
long long dp[C][C];
long long MOD = 1000000007;
int main() {
int N, M;
while (cin >> N >> M) {
for (int i = 0; i < C; i++) {
s[i] = t[i] = 0;
for (int j = 0; j < C; j++) {
dp[i][j] = 0;
}
dp[i][0... | [
"literal.number.change",
"variable_declaration.value.change"
] | 818,838 | 818,839 | u159335277 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int n, m, s[2003], t[2003], d[2003][2003];
bool db = 0;
int a(int u, int v) {
int res = (u + v) % mod;
if (res < 0)
res += mod;
return res;
}
int dp(int u, int v) {
int &ans = d[u][v];
if (ans != LONG_MIN) {
ret... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int n, m, s[2003], t[2003], d[2003][2003];
bool db = 0;
int a(int u, int v) {
int res = (u + v) % mod;
if (res < 0)
res += mod;
return res;
}
int dp(int u, int v) {
int &ans = d[u][v];
if (ans != LONG_MIN) {
ret... | [
"expression.operation.unary.add",
"call.arguments.change",
"function.return_value.change"
] | 818,844 | 818,845 | u839109522 | cpp |
p03005 | #include <bits/stdc++.h>
#define I inline void
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e6 + 7;
// How interesting!
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("in.in", "r" , stdin) ;
int k;
cin >> k;
if (k == 1)
cout << 0;
e... | #include <bits/stdc++.h>
#define I inline void
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e6 + 7;
// How interesting!
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("in.in", "r" , stdin) ;
int k;
cin >> n >> k;
if (k == 1)
cout << 0... | [
"expression.operation.binary.add"
] | 818,850 | 818,851 | u812179198 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 0 || n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 1 || n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,861 | 818,862 | u587622858 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 0 && n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 1 || n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | [] | 818,864 | 818,862 | u587622858 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
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 rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
if (k == 1 || n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,865 | 818,862 | u587622858 | cpp |
p03005 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
usi... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
usi... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 818,866 | 818,867 | u993074316 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(var) \
do { ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,868 | 818,869 | u697968316 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1)
printf("0");
else
printf("%d", N - M - 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1)
printf("0");
else
printf("%d", N - M);
return 0;
} | [
"expression.operation.binary.remove"
] | 818,870 | 818,871 | u527058497 | cpp |
p03005 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1 ? 1 : n - k) << endl;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 818,883 | 818,884 | u225660136 | cpp |
p03005 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int(i) = 0; (i) ... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int(i) = 0; (i) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,889 | 818,890 | u798339690 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (n == 0) {
cout << 0 << endl;
return 0;
}
cout << n - k << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
}
cout << n - k << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 818,891 | 818,892 | u582684800 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 818,893 | 818,894 | u152335469 | 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;
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;
}
| [
"literal.number.change",
"io.output.change"
] | 818,907 | 818,908 | u729703601 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
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;
using ll = long long;
using P = pair<int, int>;
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"
] | 818,909 | 818,910 | u440217234 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
cout << (n == k ? 0 : n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k;
cin >> n >> k;
cout << (n == k || k ==... | [
"expression.operation.binary.add"
] | 818,911 | 818,912 | u166419774 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (k != 1)
n -= k;
cout << n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (k != 1)
n -= k;
else
n = 0;
cout << n << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 818,917 | 818,918 | u890331732 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (i < N - 1) {
a.at(i) = 1;
N--;
} else
a.at(i) = N;
}
cout << a.at(N - 1) - a.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(K);
for (int i = 0; i < K; i++) {
if (i < K - 1) {
a.at(i) = 1;
N--;
} else
a.at(i) = N;
}
cout << a.at(K - 1) - a.at(0) << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 818,919 | 818,920 | u936602931 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
n = k;
int ans = n - k;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
n = k;
int ans = n - k;
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,923 | 818,924 | u255302563 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 818,925 | 818,926 | u863717702 | cpp |
p03005 | #include <algorithm> //next_permutation
#include <iostream>
#include <set>
#include <stdio.h> //printf("%.*f\n",*********);
#include <string> //char('a'=32+'A')
#include <vector> //s.erase(n),vector
//to_string,string,substr
#include <cmath> //min,max
#include <complex>
#include <iomanip>
#includ... | #include <algorithm> //next_permutation
#include <iostream>
#include <set>
#include <stdio.h> //printf("%.*f\n",*********);
#include <string> //char('a'=32+'A')
#include <vector> //s.erase(n),vector
//to_string,string,substr
#include <cmath> //min,max
#include <complex>
#include <iomanip>
#includ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,927 | 818,928 | u742306624 | cpp |
p03005 | #include <iostream>
using namespace std;
#define loop(i, n, a) for (int i = a; i < n; ++i)
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0;
return 0;
}
cout << n - k;
return 0;
} | #include <iostream>
using namespace std;
#define loop(i, n, a) for (int i = a; i < n; ++i)
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
return 0;
}
cout << n - k;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,931 | 818,932 | u089230684 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | [
"control_flow.branch.else.add"
] | 818,933 | 818,934 | u813559924 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,935 | 818,936 | u207310767 | cpp |
p03005 | #include <bits/stdc++.h>
int main(int argc, char **argv) {
int n, k;
std::cin >> n >> k;
if (k == 0)
std::cout << '0';
else
std::cout << n - k;
std::cout << '\n';
return 0;
}
| #include <bits/stdc++.h>
int main(int argc, char **argv) {
int n, k;
std::cin >> n >> k;
if (k == 1)
std::cout << '0';
else
std::cout << n - k;
std::cout << '\n';
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,937 | 818,938 | u316440712 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#define rep(i, n) for (in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,945 | 818,946 | u545364250 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int n, k;
cin >> n, k;
int ans = n - k;
if (k == 1)
ans = 0;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
int ans = n - k;
if (k == 1)
ans = 0;
cout << ans << endl;
return 0;
}
| [] | 818,947 | 818,948 | u685800831 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0;
} else {
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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,949 | 818,950 | u955282280 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0;
} else {
cout << 1;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
} else {
cout << n - k;
}
} | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 818,951 | 818,950 | u955282280 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << endl;
else
cout << n -... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n -... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,962 | 818,963 | u374051158 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,964 | 818,965 | u347057617 | cpp |
p03005 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,966 | 818,967 | u373008269 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::c... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 818,968 | 818,969 | u155216115 | cpp |
p03005 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 818,972 | 818,973 | u043443359 | cpp |
p03005 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 818,974 | 818,973 | u043443359 | cpp |
p03005 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 818,975 | 818,973 | u043443359 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operation.binary.remove"
] | 818,980 | 818,981 | u696290869 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,982 | 818,983 | u365512540 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 818,984 | 818,983 | u365512540 | 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;
}
} | #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;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 818,985 | 818,986 | u028572059 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lon... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lon... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 818,993 | 818,994 | u456611841 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 0 || N == K)
cout << 0 << endl;
else
cout << N - K << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1 || N == K)
cout << 0 << endl;
else
cout << N - K << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,001 | 819,002 | u815026012 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K = 1) {
cout << 0 << endl;
} else {
int ans1 = N - K + 1;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
} else {
int ans1 = (N - K) + 1;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,003 | 819,004 | u955534952 | cpp |
p03005 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | [
"io.output.change",
"io.output.newline.add"
] | 819,005 | 819,006 | u845000384 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"literal.number.change",
"io.output.change"
] | 819,009 | 819,010 | u132033278 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n != 1)
cout << n - k << endl;
else
cout << 0 << endl;
} | #include <iostream>
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,017 | 819,018 | u131230001 | cpp |
p03005 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string str... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,021 | 819,022 | u787690200 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0 << endl;
} else if (N == K) {
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 if (K == N) {
cout << 0 << endl;
} else {
cout << N - K << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,023 | 819,024 | u273355214 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k + 1) << endl;
// end
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << endl;
// end
return 0;
}
| [
"expression.operation.binary.remove"
] | 819,025 | 819,026 | u376234649 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int 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;
#define REP(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int 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,029 | 819,030 | u366398972 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 1 << endl;
} else {
cout << n - k << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int 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",
"literal.number.change",
"io.output.change"
] | 819,031 | 819,030 | u366398972 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << '\n';
else
cout << n - k << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << '\n';
else
cout << n - k << '\n';
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,036 | 819,037 | u925767073 | cpp |
p03005 | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", a - b);
} | #include <stdio.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", b > 1 ? a - b : 0);
} | [] | 819,046 | 819,047 | u648138491 | cpp |
p03005 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (k == 0) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
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,054 | 819,055 | u114838227 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n % k == 0) {
cout << 0 << endl;
} else {
cout << 1 << 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.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 819,068 | 819,069 | u244626757 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,070 | 819,071 | u093922224 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k != 1) * n - k << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << (k != 1) * (n - k) << endl;
} | [] | 819,072 | 819,073 | u234435881 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k == 1)
cout << "0";
cout << n - k;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k == 1)
cout << "0";
else
cout << n - k;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 819,076 | 819,077 | u185917548 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.