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 <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, A + B - 100) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, A + B - N) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 939,989 | 939,990 | u164730704 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << max(0, a + b - n) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << '\n';
} | [
"io.output.change"
] | 939,993 | 939,994 | u979163294 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << max(a, b) << max(0, a + b - n) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << '\n';
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 939,995 | 939,994 | u979163294 | cpp |
p03139 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vec... | [
"expression.operation.binary.add"
] | 939,996 | 939,997 | u195132800 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | #include <bits/stdc++.h>
using namespace std;
namespace FAST_IO {
template <typename T> void read(T &a) {
a = 0;
int f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') {
f = -1;
}
c = getchar();
}
while (isdigit(c)) {
a = a * 10 + c - '0';
c = getchar();
}
a = a * f... | [
"call.add",
"call.arguments.add"
] | 940,000 | 940,001 | u207310767 | cpp |
p03139 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << max(A + B - N, 0) << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(A + B - N, 0) << endl;
return 0;
} | [
"io.output.change"
] | 940,002 | 940,003 | u906839513 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
int main() {
int n, a, b, i;
cin >> n >> a >> b;
cout << max(a, b) << " " << max(0, a + b - n);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
int main() {
int n, a, b, i;
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"
] | 940,004 | 940,005 | u555091608 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A >= B) {
cout << A;
} else {
cout << B;
}
cout << " ";
if (N >= A + B) {
cout << 0;
} else {
cout << A + B - N;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A >= B) {
cout << B;
} else {
cout << A;
}
cout << " ";
if (N >= A + B) {
cout << 0;
} else {
cout << A + B - N;
}
} | [
"identifier.change",
"io.output.change"
] | 940,006 | 940,007 | u492707675 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << abs(a - b);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n);
}
| [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 940,008 | 940,009 | u420805165 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, n - a - b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n);
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,010 | 940,009 | u420805165 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << A;
} else {
cout << B;
}
cout << " ";
if (A + B - N > 0) {
cout << A + B - N << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << B;
} else {
cout << A;
}
cout << " ";
if (A + B - N > 0) {
cout << A + B - N << endl;
} else {
cout << 0 << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 940,013 | 940,014 | u457196771 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << max(0, a + b - n);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n);
}
| [
"io.output.change"
] | 940,015 | 940,016 | u222643545 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,017 | 940,018 | u340010271 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a < b) {
x = a;
} else {
x = b;
}
if (a + b - n < 0) {
y = 0;
} else {
y = a + b - n;
}
cout << x << y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x, y;
cin >> n >> a >> b;
if (a < b) {
x = a;
} else {
x = b;
}
if (a + b - n < 0) {
y = 0;
} else {
y = a + b - n;
}
cout << x << " " << y << endl;
} | [
"io.output.change"
] | 940,019 | 940,020 | u584169254 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << max(min(A, B) - N + max(A, B), 0);
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(min(A, B) - N + max(A, B), 0);
}
| [
"io.output.change"
] | 940,025 | 940,026 | u028572059 | cpp |
p03139 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.change"
] | 940,029 | 940,030 | u917972976 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << max(0, x + y - n) << endl;
}
signed main() {
// while(1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << " " << max(0, x + y - n) << endl;
}
signed main() {
// while(1)
solve();
} | [
"io.output.change"
] | 940,031 | 940,032 | u134181243 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N, A, B;
cin >> N >> A >> B;
int rmax = max(A, B);
int rmin = max(0, A + B - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main() {
int N, A, B;
cin >> N >> A >> B;
int rmax = min(A, B);
int rmin = max(0, A + B - ... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 940,041 | 940,042 | u680707192 | cpp |
p03139 | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
// Faster Program
#define endl "\n"
// Faster Coding
#define ED return
#define GET(a) \
int a; ... | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
// Faster Program
#define endl "\n"
// Faster Coding
#define ED return
#define GET(a) \
int a; ... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,043 | 940,044 | u550995059 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> a >> b;
cout << min(a, b) << " " << max(0, a + b - 2) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,045 | 940,046 | u734519000 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> a >> b;
cout << min(a, b) << " " << max(0, a + b - 2) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,045 | 940,047 | u734519000 | cpp |
p03139 | // atcodder.xcode
// main.cpp
// Created by conan1024hao on 2019/11/09.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリ
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#inc... | // atcodder.xcode
// main.cpp
// Created by conan1024hao on 2019/11/09.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリ
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#inc... | [
"call.arguments.change"
] | 940,052 | 940,053 | u220212997 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a, b) << " " << a + b - n << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a, b) << " " << max(a + b - n, 0) ... | [
"call.add",
"call.arguments.add"
] | 940,054 | 940,055 | u980909653 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(n - a - b, 0) << endl;
return 0;
} | #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;
return 0;
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,058 | 940,059 | u110383054 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(a, b);
cout << ' ';
cout << max(0, a + b - n);
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b);
cout << ' ';
cout << max(0, a + b - n);
cout << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,062 | 940,063 | u091552241 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << std::min(A, B) << std::max(A + B - N, 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << std::min(A, B) << " " << std::max(A + B - N, 0) << endl;
return 0;
} | [
"io.output.change"
] | 940,068 | 940,069 | u894339989 | cpp |
p03139 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << max(0, a + b - n) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
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,072 | 940,073 | u110653681 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove",
"expression.operator.arithmetic.change"
] | 940,076 | 940,077 | u225581241 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,080 | 940,081 | u264265458 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << max(A + B - N, 0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << ' ' << max(A + B - N, 0);
} | [
"io.output.change"
] | 940,082 | 940,083 | u424374375 | cpp |
p03139 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"call.add",
"call.arguments.change"
] | 940,086 | 940,087 | u852449189 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b <= 10 ? 0 : a + b - 10) << endl;
//... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b <= n ? 0 : a + b - n) << endl;
// e... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 940,092 | 940,093 | u376234649 | cpp |
p03139 | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 940,102 | 940,103 | u168578024 | cpp |
p03139 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(N - A - B, 0);
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(A + B - N, 0);
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,108 | 940,109 | u444349080 | cpp |
p03139 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << min(N - A - B, 0);
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(A + B - N, 0);
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove",
"expression.operator.arithmetic.change"
] | 940,110 | 940,109 | u444349080 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, n - a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,111 | 940,112 | u093744128 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(0, a + b - 100) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ' << max(0, a + b - n) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,113 | 940,114 | u244626757 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << (a + b < n ? 0 : a + b - n);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b < n ? 0 : a + b - n);
} | [
"io.output.change"
] | 940,117 | 940,118 | u950901760 | cpp |
p03139 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b >= n ? n - a + b : 0) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << (a + b > n ? a + b - n : 0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 940,121 | 940,122 | u392569193 | cpp |
p03139 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << max(A + B - N, 0) << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << ' ' << max(A + B - N, 0) << endl;
return 0;
} | [
"io.output.change"
] | 940,129 | 940,130 | u520129469 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << " " << max(0, a - b - c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << " " << max(0, b + c - a) << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 940,134 | 940,135 | u251828455 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << max(a, b) << " " << max(0, a + b - n);
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,152 | 940,153 | u425670723 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 940,156 | 940,157 | u518883877 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,158 | 940,157 | u518883877 | cpp |
p03139 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b, M, m;
cin >> n;
cin >> a;
cin >> b;
M = min(a, b);
m = a + b - n;
if (n < 0)
m = 0;
cout << M << " " << m << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b, M, m;
cin >> n;
cin >> a;
cin >> b;
M = min(a, b);
m = a + b - n;
if (m < 0)
m = 0;
cout << M << " " << m << "\n";
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,165 | 940,166 | u636489589 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
// freopen("input.txt", "r", stdin);
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << max(0, x + y - n);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
// freopen("input.txt", "r", stdin);
int n, x, y;
cin >> n >> x >> y;
cout << min(x, y) << ' ' << max(0, x + y - n);
}
| [
"io.output.change"
] | 940,169 | 940,170 | u537871123 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
int max, min;
cin >> n >> a >> b;
if (a < b)
max = a;
else
max = b;
min = n - a - n;
if (min > 0) {
min = 0;
} else {
min = -min;
}
cout << max << " " << min << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
int max, min;
cin >> n >> a >> b;
if (a < b)
max = a;
else
max = b;
min = n - a - b;
if (min > 0) {
min = 0;
} else {
min = -min;
}
cout << max << " " << min << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 940,171 | 940,172 | u524568016 | cpp |
p03139 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 940,184 | 940,185 | u791593901 | cpp |
p03139 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.add",
"call.arguments.add"
] | 940,186 | 940,185 | u791593901 | cpp |
p03139 | #include <iostream>
using namespace std;
int max(int a, int b) {
if (a < b)
return b;
else
return a;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ma = min(A, B);
int mi = max(0, A + B - N);
cout << ma << mi << endl;
} | #include <iostream>
using namespace std;
int max(int a, int b) {
if (a < b)
return b;
else
return a;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ma = min(A, B);
int mi = max(0, A + B - N);
cout << ma << " " << mi << ... | [
"io.output.change"
] | 940,194 | 940,195 | u058186113 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c;
c = a + b - c;
if (c < 0)
c = 0;
cout << min(a, b) << " " << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c;
c = a + b - n;
if (c < 0)
c = 0;
cout << min(a, b) << " " << c << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 940,198 | 940,199 | u501130777 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c;
c = a + b - c;
if (c < 0)
c = 0;
cout << max(a, b) << " " << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c;
c = a + b - n;
if (c < 0)
c = 0;
cout << min(a, b) << " " << c << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"call.function.change",
"io.output.change"
] | 940,200 | 940,199 | u501130777 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << max(a + b - n, 0);
// your code goes here
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(a + b - n, 0);
// your code goes here
return 0;
} | [
"io.output.change"
] | 940,201 | 940,202 | u214610627 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
if ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
if ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 940,205 | 940,206 | u709746636 | cpp |
p03139 | #include <iostream>
using namespace std;
int main(void) {
int A, B, N, MAX, MIN, tmp;
cin >> N >> A >> B;
MAX = min(A, B);
tmp = A + B - N;
if (tmp > 0) {
MIN = tmp;
} else {
MIN = 0;
}
cout << MAX << MIN << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int A, B, N, MAX, MIN, tmp;
cin >> N >> A >> B;
MAX = min(A, B);
tmp = A + B - N;
if (tmp > 0) {
MIN = tmp;
} else {
MIN = 0;
}
cout << MAX << " " << MIN << endl;
return 0;
}
| [
"io.output.change"
] | 940,207 | 940,208 | u011869847 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, n;
long long res = 0, ans = 0;
cin >> N >> K;
vector<long long> v(N), vs(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
vs = v;
vector<long long> v2(40);
for (int i = 0; i < N; i++) {
n = 0;
while (v[i] > 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, n;
long long res = 0, ans = 0;
cin >> N >> K;
vector<long long> v(N), vs(N);
for (int i = 0; i < N; i++) {
cin >> v[i];
}
vs = v;
vector<long long> v2(40);
for (int i = 0; i < N; i++) {
n = 0;
while (v[i] > 0) {... | [
"expression.operation.binary.remove"
] | 940,219 | 940,220 | u335278042 | cpp |
p03138 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pa... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 940,228 | 940,226 | u299869545 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 200005
int freq[40][2];
int pref[40];
map<pair<int, int>, int> me;
int find_ans(int ind, int k) {
if (ind < 0)
return 0;
if (me.find({ind, k}) != me.end())
return me[{ind, k}];
int p = pow(2, ind);
if (k < p) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 200005
int freq[40][2];
int pref[40];
map<pair<int, int>, int> me;
int find_ans(int ind, int k) {
if (ind < 0)
return 0;
if (me.find({ind, k}) != me.end())
return me[{ind, k}];
int p = pow(2, ind);
if (k < p) {
int ... | [
"assignment.value.change"
] | 940,262 | 940,263 | u991382421 | cpp |
p03138 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 940,264 | 940,265 | u164300951 | cpp |
p03138 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, k, bit[45], ans, a;
vector<ll> vec;
ll pow(ll r, ll t) {
if (t == 0)
return 1;
if (t % 2)
return r * pow(r, t - 1);
else {
ll yy = pow(r, t / 2);
return yy * yy;
}
}
int main(void) {
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, k, bit[45], ans, a;
vector<ll> vec;
ll pow(ll r, ll t) {
if (t == 0)
return 1;
if (t % 2)
return r * pow(r, t - 1);
else {
ll yy = pow(r, t / 2);
return yy * yy;
}
}
int main(void) {
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"assignment.change",
"call.arguments.change"
] | 940,271 | 940,272 | u475007080 | cpp |
p03138 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using n... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 940,273 | 940,274 | u896838289 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K;
vector<ll> A;
ll ret = 0;
ll f0;
void input() {
ll temp;
cin >> N >> K;
for (ll i = 0; i < N; i++) {
cin >> temp;
A.push_back(temp);
}
}
ll func(ll X) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += X ^ A[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, K;
vector<ll> A;
ll ret = 0;
ll f0;
void input() {
ll temp;
cin >> N >> K;
for (ll i = 0; i < N; i++) {
cin >> temp;
A.push_back(temp);
}
}
ll func(ll X) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans += X ^ A[i];
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 940,284 | 940,285 | u790171360 | cpp |
p03138 | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vec... | [
"call.arguments.change"
] | 940,301 | 940,300 | u137332130 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u, v) for (auto(u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(x) (x).begin(), (x).end()
#define foreach(u, v) for (auto(u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define int... | [
"control_flow.branch.if.condition.change"
] | 940,310 | 940,311 | u057866967 | cpp |
p03138 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
#define _ read()
l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -f;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return x * f;
}
#define _ read()
l... | [
"expression.operation.unary.add"
] | 940,322 | 940,323 | u513391017 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
int max, min;
cin >> n >> a >> b;
if (a <= b) {
max = a;
}
if (b <= a) {
max = b;
}
min = a + b - n;
if (min < 10) {
min = 0;
}
cout << max << " " << min;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
int max, min;
cin >> n >> a >> b;
if (a <= b) {
max = a;
}
if (b <= a) {
max = b;
}
min = a + b - n;
if (a + b <= n) {
min = 0;
}
cout << max << " " << min;
} | [
"control_flow.branch.if.condition.change"
] | 940,329 | 940,330 | u365178348 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B)
cout << B << " ";
else
cout << A << " ";
if (N < A + B) {
if (A > B)
cout << A + B - N << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B)
cout << B << " ";
else
cout << A << " ";
if (N < A + B) {
cout << A + B - N << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [] | 940,344 | 940,345 | u239087789 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int C = A + B;
int news_min;
if (C > N)
news_min = C - N;
else
news_min = 0;
if (A > B)
cout << A << " " << news_min << endl;
else
cout << A << " " << news_min << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int C = A + B;
int news_min;
if (C > N)
news_min = C - N;
else
news_min = 0;
if (A > B)
cout << B << " " << news_min << endl;
else
cout << A << " " << news_min << endl;
}
| [
"identifier.change",
"io.output.change"
] | 940,348 | 940,349 | u809700806 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << min(0, a + b - n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,353 | 940,354 | u683718016 | cpp |
p03139 | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
int N, A, B;
std::cin >> N >> A >> B;
int max = 0;
int min = 0;
max = std::min(... | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
int main(int argc, char *argv[]) {
int N, A, B;
std::cin >> N >> A >> B;
int max = 0;
int min = 0;
max = std::min(... | [
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change"
] | 940,355 | 940,356 | u458798873 | cpp |
p03139 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, A, B;
std::cin >> N;
std::cin >> A;
std::cin >> B;
int M = 0;
M = std::max(A, B);
int Mi = 0;
if (A + B > N)
Mi = A + B - N;
std::cout << std::to_string(M) + " " + std::to_string(Mi);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, A, B;
std::cin >> N;
std::cin >> A;
std::cin >> B;
int M = 0;
M = std::min(A, B);
int Mi = 0;
if (A + B > N)
Mi = A + B - N;
std::cout << std::to_string(M) + " " + std::to_string(Mi);
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 940,359 | 940,360 | u817999507 | cpp |
p03139 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << " " << max(0, b + c - 10) << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << " " << max(0, b + c - a) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,363 | 940,364 | u454670021 | cpp |
p03139 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N, A, B;
cin >> N >> A >> B;
int m = min(A, B);
cout << m;
cout << max(A + B - N, 0) << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N, A, B;
cin >> N >> A >> B;
int m = min(A, B);
cout << m << " ";
cout << max(A + B - N, 0) << endl;
} | [
"io.output.change"
] | 940,367 | 940,368 | u949692208 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c;
if (b > c)
d = c;
else
d = b;
e = c + b - a;
cout << d << ' ' << (e > 0) ? e : 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c;
if (b > c)
d = c;
else
d = b;
e = c + b - a;
cout << d << ' ' << ((e > 0) ? e : 0);
}
| [] | 940,381 | 940,382 | u950603962 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define MAX 999999999
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
typedef long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define MAX 999999999
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
typedef long... | [
"call.add",
"call.arguments.add"
] | 940,383 | 940,384 | u934073187 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using pa = pair<int, int>;
int main() {
int N, A, B;
cin >> N >> ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
using pa = pair<int, int>;
int main() {
int N, A, B;
cin >> N >> ... | [
"io.output.change"
] | 940,385 | 940,386 | u486021106 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - 10) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,389 | 940,390 | u633967774 | cpp |
p03139 | #include <bits/stdc++.h>
#define INF 1 << 30
#define mod 1000000007
#define ll long long
#define pb push_back
#define pp pop_back
#define Loop(i, s, e) for (ll(i) = (s); (i) <= (e); ++(i))
#define desLoop(i, s, e) for (ll(i) = (s); (i) >= (e); --(i))
using namespace std;
typedef struct {
int x, y;
} point;
void Swa... | #include <bits/stdc++.h>
#define INF 1 << 30
#define mod 1000000007
#define ll long long
#define pb push_back
#define pp pop_back
#define Loop(i, s, e) for (ll(i) = (s); (i) <= (e); ++(i))
#define desLoop(i, s, e) for (ll(i) = (s); (i) >= (e); --(i))
using namespace std;
typedef struct {
int x, y;
} point;
void Swa... | [
"call.add",
"call.arguments.add"
] | 940,395 | 940,396 | u516708338 | cpp |
p03139 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRI... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRI... | [
"call.add",
"call.arguments.change"
] | 940,397 | 940,398 | u833064541 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int e;
int d = min(c, b);
if (a < b + c) {
e = b + c - a;
} else {
e = 0;
}
cout << d << e << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int e;
int d = min(c, b);
if (a < b + c) {
e = b + c - a;
} else {
e = 0;
}
cout << d << " " << e << endl;
}
| [
"io.output.change"
] | 940,403 | 940,404 | u686352452 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int e;
int d = min(a, b);
if (a < b + c) {
e = b + c - a;
} else {
e = 0;
}
cout << d << e << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int e;
int d = min(c, b);
if (a < b + c) {
e = b + c - a;
} else {
e = 0;
}
cout << d << " " << e << endl;
}
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 940,405 | 940,404 | u686352452 | cpp |
p03139 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (__typeof(x) i = 0; i < x; i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define sci(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (__typeof(x) i = 0; i < x; i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define sci(x) ... | [
"io.output.change"
] | 940,416 | 940,417 | u500451627 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int N, A, B;
int main() {
cin >> N >> A >> B;
cout << min(A, B) << " " << min(0, A + B - N) << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
int N, A, B;
int main() {
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, A + B - N) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,428 | 940,429 | u718394671 | cpp |
p03139 | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(a, b) << " " << max(0, b + c - a) << ... | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(c, b) << " " << max(0, b + c - a) << ... | [
"identifier.change",
"io.output.change"
] | 940,430 | 940,431 | u554106628 | cpp |
p03139 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << max(0, a + b - n) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << " " << max(0, a + b - n) << endl;
} | [
"io.output.change"
] | 940,432 | 940,433 | u621509943 | cpp |
p03139 | #include <bits/stdc++.h>
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>
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,434 | 940,435 | u158758819 | cpp |
p03139 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (long long i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; --i)
#define yesno(flag) \
if (flag) \
c... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,444 | 940,445 | u770256251 | cpp |
p03139 | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | #include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int, int>
#define low lower_bound
#define upp upper_bound
#define inf 1000000007 // 10^9+7
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define sort(vec) sort(all(vec));
#define rever(vec) ... | [
"io.output.change"
] | 940,446 | 940,447 | u054475353 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"call.add",
"call.arguments.add"
] | 940,448 | 940,449 | u895971408 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const int INF32 = 1e9 + 10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << min(0, (A + B) - N) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
const int INF32 = 1e9 + 10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, (A + B) - N) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,450 | 940,451 | u028516426 | cpp |
p03139 | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
int a, b, c;
cin >> c >> a >> b;
cout << min(a, b) << " " << min((int)(0), (a + b - c)) << endl;
return... | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
using namespace std;
signed main() {
int a, b, c;
cin >> c >> a >> b;
cout << min(a, b) << " " << max((int)(0), (a + b - c)) << endl;
return... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,452 | 940,453 | u259210975 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, A, B;
void input() { cin >> N >> A >> B; }
void solve() { co... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, A, B;
void input() { cin >> N >> A >> B; }
void solve() { co... | [
"call.add",
"call.arguments.add"
] | 940,454 | 940,455 | u500092662 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ';
if (a + b <= 10) {
cout << 0 << endl;
return 0;
} else {
cout << abs((n - a) - b) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) << ' ';
if (a + b <= n) {
cout << 0 << endl;
return 0;
} else {
cout << abs((n - a) - b) << endl;
}
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 940,456 | 940,457 | u810067372 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
typedef pair<int, int> P;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
int main() {
int n, a, b;
cin >> n >> a >> b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
typedef pair<int, int> P;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
int main() {
int n, a, b;
cin >> n >> a >> b... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 940,462 | 940,463 | u342051078 | cpp |
p03139 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << min(A, B) << " " << max(0, A + B - 100) << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) << " " << max(0, A + B - N) << endl;
}
| [
"variable_declaration.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 940,470 | 940,471 | u041282550 | cpp |
p03139 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ull unsigned long long
#define ul unsigned long
#define ll long long
#define size_t unsigned long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// sort(td.... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define ull unsigned long long
#define ul unsigned long
#define ll long long
#define size_t unsigned long long
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// sort(td.... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 940,472 | 940,473 | u131033623 | cpp |
p03139 | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, A, B;
int max, min;
std::cin >> N >> A >> B;
max = std::max(A, B);
min = std::max(A + B - N, 0);
std::cout << max << " " << min << std::endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
int main() {
int N, A, B;
int max, min;
std::cin >> N >> A >> B;
max = std::min(A, B);
min = std::max(A + B - N, 0);
std::cout << max << " " << min << std::endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 940,479 | 940,480 | u005702636 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int N, A,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int main() {
int N, A,... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 940,484 | 940,485 | u482544950 | cpp |
p03139 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, x, y;
int main() {
scanf("%d %d %d", &n, &x, &y);
if (x > y)
swap(x, y);
printf("%d %d", y, max(0, x + y - n));
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, x, y;
int main() {
scanf("%d %d %d", &n, &x, &y);
if (x < y)
swap(x, y);
printf("%d %d", y, max(0, x + y - n));
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 940,486 | 940,487 | u764522757 | cpp |
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... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 940,490 | 940,491 | u310790595 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.