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 8
values |
|---|---|---|---|---|---|---|---|
p03139 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"call.add",
"call.arguments.change"
] | 940,492 | 940,491 | u310790595 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_w... | [
"expression.operation.binary.remove"
] | 940,498 | 940,499 | u879931038 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, r0, r1;
cin >> N >> A >> B;
r0 = min(A, B);
r1 = A + B - N;
cout << r0 << " " << r1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, r0, r1;
cin >> N >> A >> B;
r0 = min(A, B);
r1 = max(A + B - N, 0);
cout << r0 << " " << r1 << endl;
} | [
"call.add",
"call.arguments.add"
] | 940,500 | 940,501 | u335278042 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int ... | [
"call.add",
"call.arguments.change"
] | 940,504 | 940,505 | u640323045 | cpp |
p03139 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"io.output.change"
] | 940,506 | 940,507 | u288432959 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR... | [
"expression.operation.binary.remove"
] | 940,508 | 940,509 | u128676584 | cpp |
p03139 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"call.add",
"call.arguments.change"
] | 940,510 | 940,511 | u811004127 | cpp |
p03140 | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lon... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e9)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long lon... | [] | 940,536 | 940,537 | u222293734 | cpp |
p03140 | /*
これを入れて実行
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 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,538 | 940,539 | u845000384 | cpp |
p03140 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [] | 940,540 | 940,541 | u051493691 | cpp |
p03140 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,542 | 940,541 | u051493691 | cpp |
p03140 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] == c[i])
continue;
if (a[i] == b[i] || b[i] == c[i] || c[i] == a[i])
ans++;
else
ans += 2;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && b[i] == c[i])
continue;
if (a[i] == b[i] || b[i] == c[i] || c[i] == a[i])
ans++;
else
ans += 2;
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 940,545 | 940,546 | u370447425 | cpp |
p03140 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, c[26][100] = {};
string S[3];
cin >> N;
int ans = N * 3;
for (int i = 0; i < 3; i++)
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, c[26][100] = {};
string S[3];
cin >> N;
int ans = N * 3;
for (int i = 0; i < 3; i++)
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 940,551 | 940,552 | u444349080 | cpp |
p03140 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e2 + 10;
int n, a[N], b[N], c[N], ans;
int main() {
scanf("%d", &n);
scanf("%s%s%s", a + 1, b + 1, c + 1);
for (register int i = 1; i <= n; i++) {
if (a[i] == b[i] && b[i] == c[i])
continue;
else if (a[i] ==... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e2 + 10;
int n, ans;
char a[N], b[N], c[N];
int main() {
scanf("%d", &n);
scanf("%s%s%s", a + 1, b + 1, c + 1);
for (register int i = 1; i <= n; i++) {
if (a[i] == b[i] && b[i] == c[i])
continue;
else if (a[... | [
"variable_declaration.add",
"variable_declaration.remove"
] | 940,561 | 940,562 | u917335077 | cpp |
p03140 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 940,573 | 940,574 | u195132800 | cpp |
p03140 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [] | 940,575 | 940,576 | u341447450 | cpp |
p03140 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
string A, B, C;
cin >> N >> A >> B >> C;
if (A == B && A == C) {
cout << ans << endl;
} else {
for (int i = 0; i < N; i++) {
if (A.at(i) == B.at(i) && A.at(i) != C.at(i)) {
C.at(i) = A.at(i);
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
string A, B, C;
cin >> N >> A >> B >> C;
if (A == B && A == C) {
ans = 0;
} else {
for (int i = 0; i < N; i++) {
if (A.at(i) == B.at(i) && A.at(i) != C.at(i)) {
C.at(i) = A.at(i);
ans++;
} else if ... | [
"expression.operation.binary.remove"
] | 940,577 | 940,578 | u799751074 | cpp |
p03140 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
int main() {
int n;
string a, b, c;
cin >> n >> a >> b >> c;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UINT = unsigned long long;
int main() {
int n;
string a, b, c;
cin >> n >> a >> b >> c;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 940,582 | 940,583 | u275797573 | cpp |
p03140 | #include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int res{0};
std::string A, B, C;
std::cin >> A >> B >> C;
for (int i = 0; i < N; i++) {
char a{A[i]}, b{B[i]}, c{C[i]};
if (a == b && b == c)
continue;
else if (a != b && b != c)
res += 2;
else
res++;... | #include <iostream>
#include <string>
int main() {
int N;
std::cin >> N;
int res{0};
std::string A, B, C;
std::cin >> A >> B >> C;
for (int i = 0; i < N; i++) {
char a{A[i]}, b{B[i]}, c{C[i]};
if (a == b && b == c)
continue;
else if (a != b && b != c && c != a)
res += 2;
else
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 940,592 | 940,593 | u821432765 | cpp |
p03140 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
string a, b, c;
cin >> n >> a >> b >> c;
int ans = 0;
rep(i, n) {
ans += (a[i] == b[i] && b[i] == c[i]) +
(a[i] = b[i] || b[i] == c[i] || c[i] == a[i]);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
string a, b, c;
cin >> n >> a >> b >> c;
int ans = 0;
rep(i, n) {
ans += (a[i] == b[i] && b[i] == c[i]) +
(a[i] == b[i] || b[i] == c[i] || c[i] == a[i]);
}
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 940,594 | 940,595 | u754114382 | cpp |
p03140 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | [
"expression.operation.binary.add"
] | 940,596 | 940,597 | u853721692 | cpp |
p03140 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, ans = 0;
string a, b, c;
cin >> a >> b >> c;
for (i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && a[i] != c[i])
ans += 2;
else if (!(a[i] == b[i] && b[i] == c[i]))
ans += 1;
}
cout << ans << endl;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, i, ans = 0;
string a, b, c;
cin >> n >> a >> b >> c;
for (i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && a[i] != c[i])
ans += 2;
else if (!(a[i] == b[i] && b[i] == c[i]))
ans += 1;
}
cout << ans << e... | [
"expression.operation.binary.add"
] | 940,598 | 940,599 | u881116515 | cpp |
p03140 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
char a[100], b[100], c[100];
for (int i = 0; i != n; i++) {
cin >> a[i];
}
for (int i = 0; i != n; i++) {
cin >> b[i];
}
for (int i = 0; i != n; i++) {
cin >> c[i];
}
int ans = 0;
for (int i = 0; i != n; i++) {
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
char a[100], b[100], c[100];
for (int i = 0; i != n; i++) {
cin >> a[i];
}
for (int i = 0; i != n; i++) {
cin >> b[i];
}
for (int i = 0; i != n; i++) {
cin >> c[i];
}
int ans = 0;
for (int i = 0; i != n; i++) {
... | [
"literal.number.change",
"assignment.value.change"
] | 940,619 | 940,620 | u589810630 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << max(0, (a + b - n)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, (a + b - n)) << endl;
return 0;
} | [
"io.output.change"
] | 940,514 | 940,515 | u617380180 | cpp |
p03139 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
//#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, ... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
//#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, ... | [
"call.add",
"call.arguments.add"
] | 940,516 | 940,517 | u317754719 | cpp |
p03139 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b) - n << endl;
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max((a + b) - n, 0) <... | [
"call.add",
"call.arguments.add"
] | 940,520 | 940,521 | u772304668 | cpp |
p03139 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using db = double;
us... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using db = double;
us... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,522 | 940,523 | u953074801 | cpp |
p03140 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 940,530 | 940,531 | u947236878 | cpp |
p03140 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans;
string A, B, C;
cin >> N >> A >> B >> C;
ans = 2 * N;
for (int i = 0; i < N; ++i) {
if (A[i] == B[i] == C[i])
ans -= 2;
else if (A[i] == B[i] && B[i] != C[i])
ans -= 1;
else if (B[i] == C[i] && C[i]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, ans;
string A, B, C;
cin >> N >> A >> B >> C;
ans = 2 * N;
for (int i = 0; i < N; ++i) {
if (A[i] == B[i] && B[i] == C[i])
ans -= 2;
else if (A[i] == B[i] && B[i] != C[i])
ans -= 1;
else if (B[i] == C[i]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 940,627 | 940,628 | u041282550 | cpp |
p03140 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
ll ans = 0;
rep... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
ll ans = 0;
rep... | [
"control_flow.branch.if.condition.change"
] | 940,638 | 940,639 | u075865455 | cpp |
p03140 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k;
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int result = 0;
int temp;
for (i = 0; i < n; i++) {
temp = 0;
if (a[i] == b[i]) {
temp = 1;
if (a[i] == c[i]) {
temp = 2;
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k;
int n;
cin >> n;
string a, b, c;
cin >> a >> b >> c;
int result = 0;
int temp;
for (i = 0; i < n; i++) {
temp = 0;
if (a[i] == b[i]) {
temp = 1;
if (a[i] == c[i]) {
temp = 2;
}
... | [
"identifier.change"
] | 940,640 | 940,641 | u649220991 | cpp |
p03140 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type... | [] | 940,648 | 940,649 | u304121198 | cpp |
p03140 | #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 <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #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 <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 940,650 | 940,651 | u906208439 | cpp |
p03140 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [] | 940,652 | 940,653 | u089869622 | cpp |
p03140 | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 940,654 | 940,655 | u817142576 | cpp |
p03140 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
string A, B, C;
cin >> N >> A >> B >> C;
int answer;
for (int i = 0; i < N; ++i) {
bool ab = A[i] == B[i];
bool bc = B[i] == C[i];
bool ca = C[i] == A... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
string A, B, C;
cin >> N >> A >> B >> C;
int answer = 0;
for (int i = 0; i < N; ++i) {
bool ab = A[i] == B[i];
bool bc = B[i] == C[i];
bool ca = C[i] ... | [
"variable_declaration.value.change"
] | 940,656 | 940,657 | u505240349 | cpp |
p03140 | #include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdlib.h>
#include <utility>
using namespace std;
int int_sort(const void *a, const void *b) {
return *(int *)b - *(int *)a;
// qsort(b, a, sizeof(long long int), int_sort);
}
int main() {
int N, count = 0;
cin >> N;
char a[N], b[N], c[N];
... | #include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdlib.h>
#include <utility>
using namespace std;
int int_sort(const void *a, const void *b) {
return *(int *)b - *(int *)a;
// qsort(b, a, sizeof(long long int), int_sort);
}
int main() {
int N, count = 0;
cin >> N;
char a[N], b[N], c[N];
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 940,664 | 940,665 | u696415377 | cpp |
p03140 | #include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
string a, b, c;
int n, count;
cin >> n;
cin >> a;
cin >> b;
cin >> c;
count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] != c[i]) {
count++;
} else if (a[i] != b[i] &... | #include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
string a, b, c;
int n, count;
cin >> n;
cin >> a;
cin >> b;
cin >> c;
count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] != c[i]) {
count++;
} else if (a[i] != b[i] &... | [
"control_flow.branch.else.add"
] | 940,670 | 940,671 | u519950235 | cpp |
p03140 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == b[i])
continue;
if (a[i... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == c[i])
continue;
if (a[i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,691 | 940,692 | u051981922 | cpp |
p03140 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == b[i])
continue;
if (a[i... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == c[i])
continue;
if (a[i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,693 | 940,692 | u051981922 | cpp |
p03140 | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == b[i])
continue;
if (a[i... | #include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
int main() {
int n;
char a[100], b[100], c[100];
scanf("%d", &n);
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == c[i])
continue;
if (a[i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,694 | 940,692 | u051981922 | cpp |
p03141 | #include <algorithm>
#include <iostream>
using namespace std;
int N;
pair<int, int> S[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
S[i] = make_pair(a, b);
}
sort(S, S + N,
[](auto a, auto b) { return a.first + a.second < b.first + b.second; });
lo... | #include <algorithm>
#include <iostream>
using namespace std;
int N;
pair<int, int> S[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
S[i] = make_pair(a, b);
}
sort(S, S + N,
[](auto a, auto b) { return a.first + a.second > b.first + b.second; });
lo... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,695 | 940,696 | u521712919 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (... | [
"call.arguments.add"
] | 940,697 | 940,698 | u450883456 | cpp |
p03141 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | [
"identifier.change",
"call.function.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 940,707 | 940,708 | u610897920 | cpp |
p03141 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
strin... | [
"identifier.change",
"call.function.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.remove"
] | 940,710 | 940,708 | u610897920 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,711 | 940,712 | u184572586 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | [
"call.arguments.change",
"function.return_value.change"
] | 940,713 | 940,712 | u184572586 | cpp |
p03141 |
// C - Different Strokes
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<pair<int, int>> P(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >... |
// C - Different Strokes
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<pair<int, int>> P(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,720 | 940,721 | u790272146 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
vector<ll> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<ll, int>> C(N);
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
vector<ll> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<ll, int>> C(N);
for (in... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 940,724 | 940,725 | u190875453 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int nm = 1e5;
int n, a, b;
ll ans = 0;
vector<P> v;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
v.emplace_back(a, b);
}
sort(v.begin(), v.end(), [](auto &x, auto &y) {
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int nm = 1e5;
int n, a, b;
ll ans = 0;
vector<P> v;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
v.emplace_back(a, b);
}
sort(v.begin(), v.end(), [](auto &x, auto &y) {
retur... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,730 | 940,731 | u154898295 | cpp |
p03141 | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
#define FOR(i, b, n) for (long i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<long, long>;
void solve(long N, vector<long> A, vector<long> B) {
// the best strategy is to eat max(max(Ai, Bi))
// create max(Ai, B... | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
#define FOR(i, b, n) for (long i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<long, long>;
void solve(long N, vector<long> A, vector<long> B) {
// the best strategy is to eat max(Ai + Bi)
// create Ai + Bi list
... | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 940,735 | 940,736 | u280941196 | cpp |
p03139 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a) {
cout << min(b, c) << " " << 0 << endl;
} else {
cout << min(b, c) << " " <<... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a) {
cout << min(b, c) << " " << 0 << endl;
} else {
cout << min(b, c) << " " <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,739 | 940,740 | u539402331 | cpp |
p03139 | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a) {
cout << min(b, c) << " " << 0 << endl;
} else {
cout << min(b, c) << " " <<... | #include "bits/stdc++.h"
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a) {
cout << min(b, c) << " " << 0 << endl;
} else {
cout << min(b, c) << " " <<... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,739 | 940,741 | u539402331 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << max(0, a + b - n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
return 0;
} | [
"io.output.change"
] | 940,744 | 940,745 | u823112986 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b, x;
cin >> n >> a >> b;
if (a >= b) {
x = b;
} else if (a < b) {
x = a;
}
int y;
if (n > a + b) {
y = 0;
} else if (n <= a + b) {
y = a + b - n;
}
cout << x << y << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, x;
cin >> n >> a >> b;
if (a >= b) {
x = b;
} else if (a < b) {
x = a;
}
int y;
if (n > a + b) {
y = 0;
} else if (n <= a + b) {
y = a + b - n;
}
cout << x << " " << y << endl;
}
| [
"io.output.change"
] | 940,754 | 940,755 | u127856129 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a >= b and n > a + b) {
x = b;
y = 0;
} else if (a < b and n > a + b) {
x = a;
y = 0;
} else if (n <= a + b and a >= b) {
y = a + b - n;
x = b;
} else if (n <= a + b and a < b) {
y = ... | #include <iostream>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a >= b and n > a + b) {
x = b;
y = 0;
} else if (a < b and n > a + b) {
x = a;
y = 0;
} else if (n <= a + b and a >= b) {
y = a + b - n;
x = b;
} else if (n <= a + b and a < b) {
y = ... | [
"literal.string.change",
"io.output.change"
] | 940,756 | 940,757 | u127856129 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a >= b and n > a + b) {
x = b;
y = 0;
} else if (a < b and n > a + b) {
x = a;
y = 0;
} else if (n <= a + b and a >= b) {
y = a + b - n;
x = b;
} else if (n <= a + b and a < b) {
y = ... | #include <iostream>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a >= b and n > a + b) {
x = b;
y = 0;
} else if (a < b and n > a + b) {
x = a;
y = 0;
} else if (n <= a + b and a >= b) {
y = a + b - n;
x = b;
} else if (n <= a + b and a < b) {
y = ... | [
"io.output.change"
] | 940,758 | 940,757 | u127856129 | cpp |
p03139 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int max = 0;
if (A > B) {
max = B;
}
if (A < B) {
max = A;
}
if (A == B) {
max = A;
}
int min = 0;
if (10 >= (A + B)) {
min = 0;
} else {
if (A > B) {
min = A - (N... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int max = 0;
if (A > B) {
max = B;
}
if (A < B) {
max = A;
}
if (A == B) {
max = A;
}
int min = 0;
if (N >= (A + B)) {
min = 0;
} else {
if (A > B) {
min = A - (N ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 940,759 | 940,760 | u918022685 | cpp |
p03139 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int max = 0;
if (A > B) {
max = B;
}
if (A < B) {
max = A;
}
if (A == B) {
max = A;
}
int min = 0;
if (10 >= (A + B)) {
min = 0;
} else {
if (A > B) {
min = A - (N... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int max = 0;
if (A > B) {
max = B;
}
if (A < B) {
max = A;
}
if (A == B) {
max = A;
}
int min = 0;
if (N >= (A + B)) {
min = 0;
} else {
if (A > B) {
min = A - (N ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 940,761 | 940,760 | u918022685 | cpp |
p03139 | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 100000007
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) <<... | #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 100000007
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) <<... | [
"call.add",
"call.arguments.add"
] | 940,762 | 940,763 | u506320030 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, size... | [
"call.add",
"call.arguments.change"
] | 940,764 | 940,765 | u394634573 | cpp |
p03139 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << a + b - n;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(a + b - n, 0);
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 940,766 | 940,767 | u809153881 | cpp |
p03139 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B;
int Max, Min;
cin >> N >> A >> B;
if (A < B) {
cout << A << " ";
} else {
cout << A << " ";
}
Min = A + B - N;
if (Min < 0) {
cout << 0 << endl;
} else {
cout << Min << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, A, B;
int Max, Min;
cin >> N >> A >> B;
if (A < B) {
cout << A << " ";
} else {
cout << B << " ";
}
Min = A + B - N;
if (Min < 0) {
cout << 0 << endl;
} else {
cout << Min << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 940,779 | 940,780 | u889812821 | cpp |
p03139 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int maxa = min(a, b);
int min = 0;
if (a + b > 100) {
min = a + b - 100;
}
cout << maxa << " " << min << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int maxa = min(a, b);
int min = 0;
if (a + b > n) {
min = a + b - n;
}
cout << maxa << " " << min << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 940,789 | 940,790 | u023751250 | cpp |
p03139 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int maxa = max(a, b);
int min = 0;
if (a + b > 100) {
min = a + b - 100;
}
cout << maxa << " " << min << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int maxa = min(a, b);
int min = 0;
if (a + b > n) {
min = a + b - n;
}
cout << maxa << " " << min << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 940,791 | 940,790 | u023751250 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
// std::cout << "Hello World!\n";
int N, a, b;
cin >> N >> a >> b;
// cout << a << "," << b << "," << c;
int max = a;
if (b < a) {
max = b;
}
int min = 0;
if (N < a + b) {
min = a + b - N;
}
cout << max << "," << min;
} | #include <iostream>
using namespace std;
int main() {
// std::cout << "Hello World!\n";
int N, a, b;
cin >> N >> a >> b;
// cout << a << "," << b << "," << c;
int max = a;
if (b < a) {
max = b;
}
int min = 0;
if (N < a + b) {
min = a + b - N;
}
cout << max << " " << min;
} | [
"literal.string.change",
"io.output.change"
] | 940,792 | 940,793 | u791964314 | cpp |
p03139 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int maxSub = min(x, y);
int minSub = n - y + x;
if (minSub < 0)
minSub = 0;
cout << maxSub << " " << minSub << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
int maxSub = min(x, y);
int minSub = y + x - n;
if (minSub < 0)
minSub = 0;
cout << maxSub << " " << minSub << endl;
} | [
"expression.operation.binary.remove"
] | 940,796 | 940,797 | u708595514 | cpp |
p03139 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a, b;
int ma, mi;
scanf("%d %d %d", &n, &a, &b);
ma = min(a, b);
if (n - a - b > 0)
mi = n - a - b;
else
mi = 0;
printf("%d %d\n", ma, mi);
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n, a, b;
int ma, mi;
scanf("%d %d %d", &n, &a, &b);
ma = min(a, b);
if (n - a - b < 0)
mi = abs(n - a - b);
else
mi = 0;
printf("%d %d\n", ma, mi);
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 940,807 | 940,808 | u857348954 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m, k;
cin >> n >> m >> k;
cout << min(m, k) << " " << min(0ll, (m + k - n)) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m, k;
cin >> n >> m >> k;
cout << min(m, k) << " " << max(0ll, (m + k - n)) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,809 | 940,810 | u906536200 | cpp |
p03139 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b) - n << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max((a + b) - n, 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 940,815 | 940,816 | u199912250 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,821 | 940,822 | u841408819 | cpp |
p03139 | #include <iostream>
int max(int a, int b);
int minn(int n, int a, int b);
int main() {
int N, A, B;
std::cin >> N >> A >> B;
std::cout << max(A, B) << minn(N, A, B) << std::endl;
return 0;
}
int max(int a, int b) {
if (a > b) {
return b;
} else {
return a;
}
}
int minn(int n, int a, int b) ... | #include <iostream>
int max(int a, int b);
int minn(int n, int a, int b);
int main() {
int N, A, B;
std::cin >> N >> A >> B;
std::cout << max(A, B) << " " << minn(N, A, B) << std::endl;
return 0;
}
int max(int a, int b) {
if (a > b) {
return b;
} else {
return a;
}
}
int minn(int n, int a, ... | [
"expression.operation.binary.add"
] | 940,840 | 940,841 | u892351900 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define fi first
#define se second
#define pb push_back
int a, b, n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> a >> b;
cout << min(a, b) << ' ' << min(n, a + b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define fi first
#define se second
#define pb push_back
int a, b, n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(0, a + b - n);
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"identifier.replace.remove",
"literal.replace.add"
] | 940,842 | 940,843 | u060105478 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
int max;
int min;
if (A == B) {
max = A;
min = B;
}
if (A + B < N) {
min = 0;
max = (A < B) ? A : B;
}
if (A + B > N) {
max = (A > B) ? B : A;
min = A + B - N;
}
cout << max... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
int max;
int min;
if (A == B) {
max = A;
min = B;
}
if (A + B < N) {
min = 0;
max = (A < B) ? A : B;
}
if (A + B >= N) {
max = (A > B) ? B : A;
min = A + B ... | [
"import.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 940,850 | 940,851 | u176986694 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
... | [] | 940,855 | 940,856 | u137747137 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"expression.operation.binary.remove"
] | 940,857 | 940,858 | u190018920 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,859 | 940,858 | u190018920 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n), b(n);
rep(i, n) scanf("%d%d", &a[i], &b[i]);
vector<int> sum(n);
rep(i, n) sum[i] = a[i] + b[i];
sort(sum.begin(), sum.end());
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n), b(n);
rep(i, n) scanf("%d%d", &a[i], &b[i]);
vector<int> sum(n);
rep(i, n) sum[i] = a[i] + b[i];
sort(sum.rbegin(), sum.rend());... | [
"call.function.change",
"call.arguments.change"
] | 940,872 | 940,873 | u781095600 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
vector<long long> s(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> a >> b;
ans -= b;
s[i] = a + b;
}
sort(s.begin(), s.end());
int f = 0;
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> s(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> a >> b;
ans -= b;
s[i] = a + b;
}
sort(s.begin(), s.end());
int f = 0;
for... | [] | 940,892 | 940,893 | u503221936 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100005;
int n;
bitset<N> eaten;
ll ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
eaten.reset();
cin >> n;
// A for takashi ordering, b for aoki
vector<pair<int, pair<int, int>>> a, b;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100005;
int n;
bitset<N> eaten;
ll ans;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
eaten.reset();
cin >> n;
// A for takashi ordering, b for aoki
vector<pair<int, pair<int, int>>> a, b;
for (int i = 0; i < n; i++) {... | [
"expression.operation.binary.add"
] | 940,894 | 940,895 | u736647947 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int LL;
LL t[2][100005];
vector<pair<LL, int>> v1;
int main() {
int n;
int i, j, k;
LL a = 0, b = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t[0][i] >> t[1][i];
a = t[1][i] + t[0][i];
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int LL;
LL t[2][100005];
vector<pair<LL, int>> v1;
int main() {
int n;
int i, j, k;
LL a = 0, b = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t[0][i] >> t[1][i];
a = t[1][i] + t[0][i];
... | [
"call.function.change",
"call.arguments.change"
] | 940,896 | 940,897 | u464804957 | cpp |
p03141 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; i++)
#define rep3(i, n, m) for (ll i = n; ... | [
"call.function.change",
"call.arguments.change"
] | 940,900 | 940,901 | u449123607 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) ... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,902 | 940,903 | u168017191 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll a, b;
vector<tuple<ll, ll, ll>> ab(n);
for (int i = 0; i < n; i++) {
cin >> a >> b;
ab[i] = make_tuple(a - b, a, b);
}
sort(ab.begin(), ab.end());
ll ans = 0LL;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll a, b;
vector<tuple<ll, ll, ll>> ab(n);
for (int i = 0; i < n; i++) {
cin >> a >> b;
ab[i] = make_tuple(a + b, a, b);
}
sort(ab.rbegin(), ab.rend());
ll ans = 0LL;
for (int i = 0; i < n; ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.function.change"
] | 940,906 | 940,907 | u759987571 | cpp |
p03141 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>... | [
"call.add"
] | 940,908 | 940,909 | u714724786 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll p = 1000000007;
int main() {
ll n;
cin >> n;
ll bb = 0;
ll k[n];
rep(i, n) {
ll a, b;
cin >> a >> b;
bb += b;
k[i] = a + b;
}
sort(k, k + n);
ll ans = 0;
rep... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const ll p = 1000000007;
int main() {
ll n;
cin >> n;
ll bb = 0;
ll k[n];
rep(i, n) {
ll a, b;
cin >> a >> b;
bb += b;
k[i] = a + b;
}
sort(k, k + n);
ll ans = 0;
rep... | [
"assignment.change"
] | 940,910 | 940,911 | u525560003 | cpp |
p03141 | #pragma GCC target("avx")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define PA pair<LL, LL>
#define VE vector... | #pragma GCC target("avx")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define PA pair<LL, LL>
#define VE vector... | [
"call.add"
] | 940,914 | 940,915 | u596117821 | cpp |
p03141 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vect... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vect... | [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 940,918 | 940,919 | u353402627 | cpp |
p03141 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | [
"identifier.change",
"call.function.change",
"call.arguments.add",
"call.arguments.change"
] | 940,920 | 940,921 | u128572736 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n;
vector<int> a, b;
long long sum;
cin >> n;
a.resize(n);
b.resize(n);
sum = 0;
rep(i, n) {
cin >> a[i] >> b[i];
a[i] += b[i];
sum += b[i];
}
sum *= -1;
sort(a.begin()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
signed main(void) {
int n;
vector<long long> a, b;
long long sum;
cin >> n;
a.resize(n);
b.resize(n);
sum = 0;
rep(i, n) {
cin >> a[i] >> b[i];
a[i] += b[i];
sum += b[i];
}
sum *= -1;
sort(a.r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.function.change",
"call.arguments.change"
] | 940,922 | 940,923 | u890331732 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 940,930 | 940,931 | u812973725 | cpp |
p03141 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using intpair = pair<int, int>... | [
"assignment.change"
] | 940,934 | 940,935 | u195036695 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int64_t min(int64_t a, int64_t b) {
if (a > b) {
return b;
} else {
return a;
}
}
int main() {
int n;
cin >> n;
vector<vector<int64_... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int64_t min(int64_t a, int64_t b) {
if (a > b) {
return b;
} else {
return a;
}
}
int main() {
int n;
cin >> n;
vector<vector<int64_... | [
"assignment.change"
] | 940,938 | 940,939 | u229148215 | cpp |
p03141 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
template <class T>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
template <class T>... | [
"call.function.change",
"call.arguments.change"
] | 940,940 | 940,941 | u009414205 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 940,942 | 940,943 | u690475097 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | [
"assignment.change"
] | 940,944 | 940,943 | u690475097 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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 Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | [
"assignment.change"
] | 940,945 | 940,943 | u690475097 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int num[1000000001];
/*--- クイックソート ---*/
void quick(int sum[], int left, int right) {
int pl = left; /* 左カーソル */
int pr = right; /* 右カーソル */
int x = sum[(p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int num[100001];
/*--- クイックソート ---*/
void quick(int sum[], int left, int right) {
int pl = left; /* 左カーソル */
int pr = right; /* 右カーソル */
int x = sum[(pl + ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 940,946 | 940,947 | u903311413 | cpp |
p03141 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (int i = 1, i##_len = (n); i ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (int i = 1, i##_len = (n); i ... | [
"identifier.change",
"call.arguments.change"
] | 940,950 | 940,951 | u563743611 | cpp |
p03141 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (int i = 1, i##_len = (n); i ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (int i = 1, i##_len = (n); i ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 940,952 | 940,951 | u563743611 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.