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;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
if (n > 1)
cout << p - n;
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",
"expression.operation.binary.remove"
] | 819,594 | 819,593 | u911150465 | cpp |
p03005 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 100000000... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 100000000... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,595 | 819,596 | u774652316 | cpp |
p03005 | #include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << N;
else
cout << N - K << endl;
return 0;
}
| #include <cmath>
#include <functional>
#include <iostream>
#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 << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"io.output.newline.add"
] | 819,599 | 819,600 | u982234424 | cpp |
p03005 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int ans = n - k;
if (k = 1)
ans = 0;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int ans = n - k;
if (k == 1)
ans = 0;
cout << ans << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,605 | 819,606 | u803893892 | cpp |
p03005 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return 0;
}
cout << k - n << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
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",
"expression.operation.binary.remove"
] | 819,614 | 819,615 | u071036035 | cpp |
p03005 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | [
"literal.number.change",
"assignment.value.change"
] | 819,616 | 819,617 | u240031669 | cpp |
p03005 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n... | [
"literal.number.change",
"assignment.value.change"
] | 819,618 | 819,617 | u240031669 | cpp |
p03005 | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
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 <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#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 << endl;
return 0;
} | [] | 819,621 | 819,622 | u697987631 | 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.add"
] | 819,625 | 819,626 | u611571299 | cpp |
p03005 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,635 | 819,636 | u013064880 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000ll
#define MAXN 1000001
#define eps 0.0000000001
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000ll
#define MAXN 1000001
#define eps 0.0000000001
#define fastio ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,639 | 819,640 | u883546077 | cpp |
p03005 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 819,641 | 819,642 | u918357423 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 1;
;
} else {
cout << n - k;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
} else {
cout << n - k;
}
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 819,645 | 819,646 | u058348416 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,647 | 819,648 | u762921614 | cpp |
p03005 | #include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i, j) memset(i, j, sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(), v.end()
#define DB(a, s, e) ... | #include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i, j) memset(i, j, sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(), v.end()
#define DB(a, s, e) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,649 | 819,650 | u241716904 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a, b;
if (b == 1) {
cout << 0 << endl;
return 0;
}
cout << a - b;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a >> b;
if (b == 1) {
cout << 0 << endl;
return 0;
}
cout << a - b;
} | [] | 819,653 | 819,654 | u687204015 | cpp |
p03005 | #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... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,657 | 819,658 | u837951457 | cpp |
p03005 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#def... | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#def... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,659 | 819,660 | u908982828 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (N == 1) {
ans = 0;
} else {
ans = N - K;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (K == 1) {
ans = 0;
} else {
ans = N - K;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,661 | 819,662 | u541263126 | cpp |
p03005 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | [
"literal.number.change",
"call.arguments.change"
] | 819,667 | 819,668 | u820612421 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0;
else
cout << K - N;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0;
else
cout << N - K;
}
| [
"expression.operation.binary.remove"
] | 819,671 | 819,672 | u998203751 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
return N - K;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
cout << N - K << endl;
} | [
"io.output.change",
"io.output.newline.add"
] | 819,675 | 819,676 | u684164049 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const ch... | #include <bits/stdc++.h>
using namespace std;
// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const ch... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,677 | 819,678 | u467423063 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,681 | 819,682 | u921177152 | cpp |
p03005 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,683 | 819,684 | u190907730 | cpp |
p03005 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 819,685 | 819,684 | u190907730 | cpp |
p03005 | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N == 1)
cout << 0... | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1)
cout << 0... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,690 | 819,691 | u766779796 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (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)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 819,692 | 819,693 | u681557252 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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(void) {
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,694 | 819,695 | u023195454 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
void judge(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
main() {
int N, K;
cin >> N >> K;
if (N == 1)
cout << 0 << endl;
else
c... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
void judge(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,698 | 819,699 | u157322125 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << ((n == 1) ? 0 : n - k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << ((k == 1) ? 0 : n - k) << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,700 | 819,701 | u905270643 | cpp |
p03005 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,706 | 819,707 | u350388631 | cpp |
p03005 | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enu... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,716 | 819,717 | u817722036 | cpp |
p03005 | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | [
"literal.number.change",
"expression.operation.binary.change"
] | 819,728 | 819,729 | u438319362 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long double PI = acos(-1);
constexpr long double EPS = 1e-15;
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long double PI = acos(-1);
constexpr long double EPS = 1e-15;
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 819,730 | 819,731 | u891178744 | 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';
}
| #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';
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,734 | 819,735 | u459737327 | cpp |
p03005 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,738 | 819,739 | u937608388 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,742 | 819,743 | u756088996 | cpp |
p03005 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typed... | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typed... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,746 | 819,747 | u652420316 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#in... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,750 | 819,751 | u294531924 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
if (N == 1 || N == 2) {
cout << 1 << endl;
return 0;
}
vector<int> count(N * (N - 1) / 2);
int M = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
if (N == 1 || N == 2) {
cout << 1 << endl;
return 0;
}
vector<int> count(N * (N - 1) / 2);
int M = 0;
for (int ... | [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,756 | 819,757 | u710877960 | cpp |
p03006 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, x[50], y[50], p, q, ans = 50;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
p = x[i] - x[j];
... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, x[50], y[50], p, q, ans = 50;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
p = x[i] - x[j];
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 819,791 | 819,792 | u855429581 | cpp |
p03006 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); ... | [
"identifier.change"
] | 819,811 | 819,812 | u103850114 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
int n;
ll x[51], y[51];
set<pii> st;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
if (n == 1) {
cout << 1 << endl;
return 0;
}
ll ans = n + 1;
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
int n;
ll x[51], y[51];
set<pii> st;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
if (n == 1) {
cout << 1 << endl;
return 0;
}
ll ans = n + 1;
for (int i = 1; i <= n; i++... | [
"control_flow.branch.if.condition.change"
] | 819,815 | 819,816 | u324752405 | cpp |
p03006 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n;
ll a[55];
ll b[55];
map<pair<ll, ll>, ll> ma;
ll ans;
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
for ... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n;
ll a[55];
ll b[55];
map<pair<ll, ll>, ll> ma;
ll ans;
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
for ... | [
"expression.operation.binary.add"
] | 819,831 | 819,832 | u307227472 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy.at(i).first >> xy.at(i).second;
map<pair<int, int>, int> mp;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy.at(i).first >> xy.at(i).second;
map<pair<int, int>, int> mp;
for (int i = 0; i < n... | [
"expression.operation.binary.remove"
] | 819,839 | 819,840 | u628597699 | cpp |
p03006 | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int... | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,857 | 819,858 | u069838609 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<P> b(n);
rep(i, n) {
int x, y;
cin >> x >> y;
b[i] = {x, y};
}
map<P, int> mp;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<P> b(n);
rep(i, n) {
int x, y;
cin >> x >> y;
b[i] = {x, y};
}
map<P, int> mp;
for (in... | [
"expression.operation.binary.add"
] | 819,875 | 819,876 | u108540384 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef pair<string, int> s_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef pair<string, int> s_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector... | [
"call.arguments.add"
] | 819,907 | 819,908 | u263715385 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll n;
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll n;
l... | [
"variable_declaration.type.narrow.change"
] | 819,931 | 819,932 | u586567203 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"identifier.change",
"call.function.change"
] | 819,965 | 819,966 | u096883693 | cpp |
p03004 | #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)... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 819,975 | 819,976 | u710999236 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by ÇØϧÃÎ
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%... | [
"assignment.variable.change",
"identifier.change"
] | 819,977 | 819,978 | u545001286 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by ÇØϧÃÎ
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%... | #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.variable.change",
"identifier.change"
] | 819,979 | 819,978 | u545001286 | cpp |
p03004 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<double> x(N), y(N);
vector<char> d(N);
for (ll i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> d[i];
if (d[i] == 'R') {
d[i] = 0;
} else if (d[i] == 'L') {
d[i] = 1;
} else if (d[i] =... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<double> x(N), y(N);
vector<char> d(N);
for (ll i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> d[i];
if (d[i] == 'R') {
d[i] = 0;
} else if (d[i] == 'L') {
d[i] = 1;
} else if (d[i] =... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 820,010 | 820,011 | u456065785 | cpp |
p03004 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> x(N), y(N);
vector<char> d(N);
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> d[i];
for (int i = 0; i < N; i++) {
x[i] *= 2;
y[i] *= 2;
}... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> x(N), y(N);
vector<char> d(N);
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> d[i];
for (int i = 0; i < N; i++) {
x[i] *= 2;
y[i] *= 2;
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 820,015 | 820,016 | u374099594 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,017 | 820,018 | u839953699 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,019 | 820,018 | u839953699 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].secon... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,020 | 820,018 | u839953699 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,023 | 820,024 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,025 | 820,026 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 820,027 | 820,026 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,025 | 820,028 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pa... | [
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,029 | 820,028 | u237010411 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >... | [
"expression.operation.binary.remove"
] | 820,037 | 820,038 | u196497077 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
... | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
p... | [
"variable_declaration.type.narrow.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,041 | 820,042 | u596743351 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
... | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,041 | 820,043 | u596743351 | cpp |
p03004 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e15) // 1234567890987654321
#define INF 1234567890ll
#def... | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e15) // 1234567890987654321
#define INF 1234567890ll
#def... | [
"literal.number.change",
"call.arguments.change"
] | 820,047 | 820,048 | u844961982 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<double, pair<double, int>>> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<double, pair<double, int>>> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 820,057 | 820,058 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"io.output.change"
] | 820,059 | 820,060 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 820,061 | 820,060 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::n... | [
"variable_declaration.value.change"
] | 820,101 | 820,102 | u915020369 | cpp |
p03004 | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<char> c;
vector<long long int> x, y;
long long int n;
long double kansu(long double t) {
// cout << " t = " << t << endl;
if (t < 0)
return 1145141919191919191919191919.00L;
long double xmax = x[0];
long double xmin =... | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<char> c;
vector<long long int> x, y;
long long int n;
long double kansu(long double t) {
// cout << " t = " << t << endl;
if (t < 0)
return 1145141919191919191919191919.00L;
long double xmax = x[0];
long double xmin =... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 820,103 | 820,104 | u676042970 | cpp |
p03004 |
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
using ld = long double;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size... |
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
using ld = long double;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 820,107 | 820,108 | u027091475 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 820,109 | 820,110 | u452725238 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
typedef long long ll;
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"
] | 820,115 | 820,116 | u221391729 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (y = 1)
cout << "0";
else
cout << x - y;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (y == 1)
cout << "0";
else
cout << x - y;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 820,119 | 820,120 | u083006500 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | [
"assignment.change"
] | 820,129 | 820,130 | u137747137 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return... | [
"assignment.change"
] | 820,131 | 820,132 | u221780420 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"assignment.change"
] | 820,137 | 820,138 | u126859973 | cpp |
p03003 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
/*
#include<algorithm>
#include<array>
#include<cassert>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<typeinfo>
#incl... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
/*
#include<algorithm>
#include<array>
#include<cassert>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<typeinfo>
#incl... | [
"variable_declaration.remove",
"io.output.change"
] | 820,141 | 820,142 | u989345508 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m;
cin >> n >> m;
vec s(n), t(m);
for (ll i = 0; i < n; i++)
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m;
cin >> n >> m;
vec s(n), t(m);
for (ll i = 0; i < n; i++)
cin >> ... | [
"call.arguments.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 820,149 | 820,150 | u718758485 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long l... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 820,151 | 820,152 | u898749314 | cpp |
p03003 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vect... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vect... | [
"expression.operation.binary.add"
] | 820,155 | 820,156 | u614128939 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 820,161 | 820,162 | u342075214 | cpp |
p03003 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"identifier.replace.remove",
"literal.replace.add"
] | 820,235 | 820,236 | u498141549 | cpp |
p03003 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int res_map[2005][2005] = {};
int main() {
const long long int mod = 1000000007;
ma... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int res_map[2005][2005] = {};
int main() {
const long long int mod = 1000000007;
ma... | [
"assignment.value.change"
] | 820,256 | 820,257 | u018872912 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int MOD = 1e9 + 7;
//---------- べき乗 ----------
Int power(Int a, Int n) {
if (a == 0)
return 0;
if (n == 0)
return 1;
Int res = 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int MOD = 1e9 + 7;
//---------- べき乗 ----------
Int power(Int a, Int n) {
if (a == 0)
return 0;
if (n == 0)
return 1;
Int res = 1... | [
"assignment.change"
] | 820,279 | 820,280 | u285358283 | cpp |
p03003 | #include <algorithm>
#include <cstdio>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
using ll = long long;
constexpr ll mod = 1000000007;
ll N, M;
ll S[2010], T[2010];
ll dp[2010][2010], sum[2010][2010];
int main() {
scanf("%lld%lld", &N... | #include <algorithm>
#include <cstdio>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
using ll = long long;
constexpr ll mod = 1000000007;
ll N, M;
ll S[2010], T[2010];
ll dp[2010][2010], sum[2010][2010];
int main() {
scanf("%lld%lld", &N... | [
"assignment.change"
] | 820,281 | 820,282 | u265250376 | cpp |
p03003 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
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-=(const mint a) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
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-=(const mint a) {
... | [
"assignment.value.change",
"identifier.change"
] | 820,302 | 820,303 | u633402865 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long x[n];
long y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
long p = x[i] - x[j];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long x[n];
long y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
long p = x[i] - x[j];
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 820,326 | 820,327 | u993967581 | cpp |
p03006 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) { cin >> x[i] >> y[i]; }
int res = 0;
rep(i, N) {
rep(j, N) {
if (i == j)
continue;
l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) { cin >> x[i] >> y[i]; }
int res = N;
rep(i, N) {
rep(j, N) {
if (i == j)
continue;
l... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 820,344 | 820,345 | u710135612 | cpp |
p03006 | #include <bits/stdc++.h>
#define maxn 55
using namespace std;
int n, num, a[maxn], b[maxn];
map<int, map<int, int>> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", a[i], b[i]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i != j)
num = max(num, +... | #include <bits/stdc++.h>
#define maxn 55
using namespace std;
int n, num, a[maxn], b[maxn];
map<int, map<int, int>> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", a + i, b + i);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i != j)
num = max(num,... | [
"call.arguments.change"
] | 820,352 | 820,353 | u786712982 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
void solve() {
ll N;
cin >> N;
vector<pair<ll, ll>> pos(N);
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
void solve() {
ll N;
cin >> N;
vector<pair<ll, ll>> pos;
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
p... | [] | 820,354 | 820,355 | u796269639 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"expression.operation.binary.add"
] | 820,433 | 820,434 | u320367606 | cpp |
p03006 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"expression.operation.binary.remove"
] | 820,450 | 820,451 | u055131803 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define N 50
int a[N + 1], b[N + 1];
int main() {
int n, mn = n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", a + i, b + i);
for (i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int x = a[i] - a[j], y = b[i] - b[j], ans = n;
... | #include <bits/stdc++.h>
using namespace std;
#define N 50
int a[N + 1], b[N + 1];
int main() {
int n, mn, i;
scanf("%d", &n);
mn = n;
for (i = 1; i <= n; i++)
scanf("%d%d", a + i, b + i);
for (i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int x = a[i] - a[j], y = b[i] - b[j], ans = n;
... | [
"assignment.add"
] | 820,460 | 820,461 | u058625538 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> mp;
vector<pair<ll, ll>> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n;
ll mx = 0;
for (ll i = 1; i <= n; ++i) {
ll a, b;
cin >> a >> b;
v.emplace_back(a, b);
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> mp;
vector<pair<ll, ll>> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n;
ll mx = 0;
for (ll i = 1; i <= n; ++i) {
ll a, b;
cin >> a >> b;
v.emplace_back(a, b);
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 820,462 | 820,463 | u976418120 | cpp |
p03006 | #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i];
}
map<tuple<int, int>, int> r;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
... | #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i];
}
map<tuple<int, int>, int> r;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
... | [
"expression.operation.binary.remove"
] | 820,470 | 820,471 | u898335619 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int x[51], y[51];
int main() {
int cnt, i, j, n, m, k, l, ans = INT_MAX, cx, cy;
scanf("%d", &n);
for (i = 0; i < n; i++)
printf("%d%d", &x[i], &y[i]);
if (n == 1) {
printf("1");
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int x[51], y[51];
int main() {
int cnt, i, j, n, m, k, l, ans = INT_MAX, cx, cy;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d", &x[i], &y[i]);
if (n == 1) {
printf("1");
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 820,488 | 820,489 | u314499126 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.