problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B - A + C > 0)
cout << A - B - C << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B - A + C > 0)
cout << B - A + C << endl;
else
cout << 0 << endl;
} | [
"expression.operation.binary.remove"
] | 752,857 | 752,858 | u804980376 | cpp |
p02951 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
namespace mine {
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define mid (l + r) / 2
#define lc 2 * x
#define rc 2 * x + 1
void chmax(int &x, const ll y) { x = (x > y ? x : y); }
void chmin(int &x, const ll y) { x = (x < y ? x : y); }
ll qread() {
ll ans = 0, f = 1;
char c = getchar();
while (c < '0' or c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while ('0' <= c and c <= '9')
ans = ans * 10 + c - '0', c = getchar();
return ans * f;
}
void write(ll num) {
if (num < 0)
putchar('-'), num = -num;
if (num >= 10)
write(num / 10);
putchar('0' + num % 10);
}
void write1(ll num) {
write(num);
putchar(' ');
}
void write2(ll num) {
write(num);
putchar('\n');
}
const int INF = 0x3f3f3f3f;
const int MOD = 19491001;
void add(ll &a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
if (a <= -MOD)
a += MOD;
}
ll qpower(ll x, ll e) {
ll ans = 1;
while (e) {
if (e & 1)
ans = ans * x % MOD;
x = x * x % MOD;
e >>= 1;
}
return ans;
}
ll invm(ll x) { return qpower(x, MOD - 2); }
const int N = 1e5 + 10;
void main() {
int a = qread(), b = qread(), c = qread();
write(max(c - (b - a), 0));
}
}; // namespace mine
int main() {
srand(time(0));
mine::main();
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
namespace mine {
typedef long long ll;
#define pr pair<int, int>
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define mid (l + r) / 2
#define lc 2 * x
#define rc 2 * x + 1
void chmax(int &x, const ll y) { x = (x > y ? x : y); }
void chmin(int &x, const ll y) { x = (x < y ? x : y); }
ll qread() {
ll ans = 0, f = 1;
char c = getchar();
while (c < '0' or c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while ('0' <= c and c <= '9')
ans = ans * 10 + c - '0', c = getchar();
return ans * f;
}
void write(ll num) {
if (num < 0)
putchar('-'), num = -num;
if (num >= 10)
write(num / 10);
putchar('0' + num % 10);
}
void write1(ll num) {
write(num);
putchar(' ');
}
void write2(ll num) {
write(num);
putchar('\n');
}
const int INF = 0x3f3f3f3f;
const int MOD = 19491001;
void add(ll &a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
if (a <= -MOD)
a += MOD;
}
ll qpower(ll x, ll e) {
ll ans = 1;
while (e) {
if (e & 1)
ans = ans * x % MOD;
x = x * x % MOD;
e >>= 1;
}
return ans;
}
ll invm(ll x) { return qpower(x, MOD - 2); }
const int N = 1e5 + 10;
void main() {
int a = qread(), b = qread(), c = qread();
write(max(c - (a - b), 0));
}
}; // namespace mine
int main() {
srand(time(0));
mine::main();
}
| [
"expression.operation.binary.remove"
] | 752,865 | 752,866 | u960093366 | cpp |
p02951 | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes cout << "Yes\n"
#define no cout << "No\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << min(0ll, c - a + b) << endl;
}
| /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
prayer
*/
// g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
#define yes cout << "Yes\n"
#define no cout << "No\n"
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - a + b) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 752,869 | 752,870 | u010004797 | cpp |
p02951 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define N 10010
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
printf("%d", k - (n - m));
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define N 10010
using namespace std;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
printf("%d", max(k - (n - m), 0));
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,871 | 752,872 | u588366417 | cpp |
p02951 | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vector>
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define INF(a) memset(a, 0x3f, sizeof(a))
#define ALL(t) (t).begin(), (t).end()
#define FILL(a, c) fill(a, a + sizeof(a) / sizeof(*a), c)
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
#define REP(i, m) for (int i = 0; i < (m); ++i)
// closed interval, inverse repeat
#define CIREP(i, start, fin) for (int i = (start); i >= (fin); i--)
#define CREP(i, start, fin) for (int i = (start); i <= (fin); i++)
#define RNG(i, start, fin) for (int i = (start); i < (fin); i++)
#define IN(a, x, b) (a <= x && x < b)
#define PB push_back
#define SZ(x) (int)(x).size()
using namespace std;
using LL = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<LL, LL>;
using VI = vector<int>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VVI = vector<VI>;
const LL LINF = 1001002003004005006ll;
/*
template<typename T>inline istream& operator>>(istream&i,vector<T>&v)
{REP(j,SZ(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;REP(i,SZ(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const vector<T>&v)
{if(SZ(v))o<<join(v);return o;}
*/
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*
constant values
*/
// const int dx[] = {1,0,-1,0};
// const int dy[] = {0,1,0,-1};
// const int MX = 31001;
// const ll INF= 1LL<<60 ;//INF = 1001001001001; //1e9
// Main program
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return;
}
// ----------------------------------------------
int main() {
int T = 1;
for (int i = 0; i < T; ++i) {
solve();
}
return 0;
} | //#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <mutex>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <vector>
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define INF(a) memset(a, 0x3f, sizeof(a))
#define ALL(t) (t).begin(), (t).end()
#define FILL(a, c) fill(a, a + sizeof(a) / sizeof(*a), c)
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
#define REP(i, m) for (int i = 0; i < (m); ++i)
// closed interval, inverse repeat
#define CIREP(i, start, fin) for (int i = (start); i >= (fin); i--)
#define CREP(i, start, fin) for (int i = (start); i <= (fin); i++)
#define RNG(i, start, fin) for (int i = (start); i < (fin); i++)
#define IN(a, x, b) (a <= x && x < b)
#define PB push_back
#define SZ(x) (int)(x).size()
using namespace std;
using LL = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<LL, LL>;
using VI = vector<int>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VVI = vector<VI>;
const LL LINF = 1001002003004005006ll;
/*
template<typename T>inline istream& operator>>(istream&i,vector<T>&v)
{REP(j,SZ(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;REP(i,SZ(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const vector<T>&v)
{if(SZ(v))o<<join(v);return o;}
*/
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/*
constant values
*/
// const int dx[] = {1,0,-1,0};
// const int dy[] = {0,1,0,-1};
// const int MX = 31001;
// const ll INF= 1LL<<60 ;//INF = 1001001001001; //1e9
// Main program
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return;
}
// ----------------------------------------------
int main() {
int T = 1;
for (int i = 0; i < T; ++i) {
solve();
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,879 | 752,880 | u495072453 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
int b;
int c;
cin >> a >> b >> c;
int d = a - b;
if ((a - b) > c)
cout << c;
int res = c - (a - b);
if ((a - b) <= c)
cout << res;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
int b;
int c;
cin >> a >> b >> c;
int d = a - b;
if ((a - b) > c)
cout << 0;
int res = c - (a - b);
if ((a - b) <= c)
cout << res;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 752,888 | 752,889 | u931191237 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, tmp;
cin >> a >> b >> c;
tmp = c - (a - b);
cout << tmp << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, tmp;
cin >> a >> b >> c;
tmp = max(c - (a - b), 0);
cout << tmp << endl;
}
| [
"call.add",
"call.arguments.add"
] | 752,898 | 752,899 | u059207724 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (b + c < a) {
cout << a - b - c << endl;
} else {
cout << "0" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
cin >> a;
cin >> b;
cin >> c;
if (b + c > a) {
cout << b + c - a << endl;
} else {
cout << "0" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"io.output.change"
] | 752,900 | 752,901 | u991863667 | cpp |
p02951 | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<pii>
#define vi vector<int>
#define ll long long
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + c - a << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<pii>
#define vi vector<int>
#define ll long long
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << max(b + c - a, 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,905 | 752,906 | u785897267 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int d = 0;
cin >> a >> b >> c;
if (c >= a - b)
cout << c - (a - b) << endl;
if (c <= a - b)
cout << d << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int d = 0;
cin >> a >> b >> c;
if (c >= a - b)
cout << c - (a - b) << endl;
if (c < a - b)
cout << d << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,908 | 752,909 | u282060653 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b <= c) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a - b >= c) {
cout << 0 << endl;
} else {
cout << c - (a - b) << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 752,910 | 752,911 | u952865396 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define u128 __int128
#define ff first
#define ss second
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
#define N 100100
#define M 1000010
int n, m;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define u128 __int128
#define ff first
#define ss second
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007
#define N 100100
#define M 1000010
int n, m;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - a + b);
return 0;
} | [
"call.add",
"call.arguments.change"
] | 752,932 | 752,933 | u060049558 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
typedef long long LL;
typedef pair<int, int> Pii;
const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
typedef long long LL;
typedef pair<int, int> Pii;
const int inf = 0x3f3f3f3f;
const LL infLL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,934 | 752,935 | u033288617 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (C - A + B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - A + B) << endl;
} | [
"call.add",
"call.arguments.add"
] | 752,938 | 752,939 | u607746177 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
if (c > a)
cout << c - b << endl;
else
cout << 0 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
if (c > a)
cout << c - a << endl;
else
cout << 0 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"identifier.change",
"io.output.change"
] | 752,949 | 752,950 | u973991908 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
if (c > b)
cout << c - b << endl;
else
cout << 0 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t, int64_t> pll;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define ALL(a) begin(a), end(a)
#define sz(s) (s).size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
int a, b, c;
cin >> a >> b >> c;
a -= b;
if (c > a)
cout << c - a << endl;
else
cout << 0 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 752,951 | 752,950 | u973991908 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
if (d >= c) {
cout << c << endl;
} else if (d < c) {
cout << c - d << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a - b;
if (d >= c) {
cout << "0" << endl;
} else if (d < c) {
cout << c - d << endl;
}
return 0;
} | [
"io.output.change"
] | 752,952 | 752,953 | u248241157 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,954 | 752,955 | u038569501 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
;
cin >> a >> b >> c;
if (c - a - b >= 0) {
cout << c - a - b << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
;
cin >> a >> b >> c;
if (c - (a - b) > 0) {
cout << c - (a - b) << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 752,958 | 752,959 | u575207957 | cpp |
p02951 | #include <bits/stdc++.h>
typedef long long ll;
#define pair <int, int> P
#define sc(N) scanf("%lld", &N);
using namespace std;
int main() {
ll A, B, C;
sc(A);
sc(B);
sc(C);
cout << C - A + B << '\n';
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define pair <int, int> P
#define sc(N) scanf("%lld", &N);
using namespace std;
int main() {
ll A, B, C;
sc(A);
sc(B);
sc(C);
cout << max(C - A + B, 0ll) << '\n';
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 752,960 | 752,961 | u014289849 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 752,967 | 752,968 | u423832505 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a - b, c) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - min(a - b, c) << endl;
}
| [
"expression.operation.binary.add"
] | 752,975 | 752,976 | u366974105 | cpp |
p02951 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = (ss); ii < (ll)(ee); ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define MSB(bm) ((bm == 0) ? -1 : (63 - __builtin_clzll((bm))))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
// #define degug(...) cerr << "[" << #__VA_ARGS__ << "]:",
// degug_out(__VA_ARGS__)
#else
// #define degug(...) 663
#define cerr \
if (0) \
cout
#endif
ll a, b, c;
int main() {
FAST cin >> a >> b >> c;
cout << c - (a - b);
}
| #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = (ss); ii < (ll)(ee); ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define MSB(bm) ((bm == 0) ? -1 : (63 - __builtin_clzll((bm))))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
// #define degug(...) cerr << "[" << #__VA_ARGS__ << "]:",
// degug_out(__VA_ARGS__)
#else
// #define degug(...) 663
#define cerr \
if (0) \
cout
#endif
ll a, b, c;
int main() {
FAST cin >> a >> b >> c;
cout << max(0ll, c - (a - b));
}
| [
"call.add",
"call.arguments.change"
] | 752,977 | 752,978 | u844961982 | cpp |
p02951 | #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 400012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int a, b, c;
void input() {
// freopen("TEST.INP","r",stdin);
// freopen("TEST.OUT","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> a >> b >> c;
cout << c - (a - b);
}
int main() {
input();
return 0;
}
| #include <bits/stdc++.h>
#define pp pair<int, int>
#define fi first
#define se second
#define maxx 400012
#define ll long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
const int mod = 998244353;
using namespace std;
int a, b, c;
void input() {
// freopen("TEST.INP","r",stdin);
// freopen("TEST.OUT","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> a >> b >> c;
cout << max(c - (a - b), 0);
}
int main() {
input();
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 752,981 | 752,982 | u309723391 | cpp |
p02951 | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
using i64 = int64_t;
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (C - (A - B)) << endl;
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
using i64 = int64_t;
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 752,983 | 752,984 | u936555566 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << min(c - (a - b), (long long)0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), (long long)0) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 753,000 | 753,001 | u206489571 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (max(0, abs(c - (a - b))));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (max(0, c - (a - b)));
return 0;
}
| [
"call.remove"
] | 753,009 | 753,010 | u702142173 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (min(0, abs(c - (a - b))));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (max(0, c - (a - b)));
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.remove"
] | 753,011 | 753,010 | u702142173 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (abs(c - (a - b)));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define pb push_back
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define endl '\n'
#define deb(x) cout << #x << " " << x << endl;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
struct greaterr {
template <class T> bool operator()(T const &a, T const &b) const {
return a > b;
}
};
vector<bool> sieve(1000007, true);
void help() {
sieve[0] = false;
sieve[1] = false;
for (int i = 2; i * i <= 1000000; ++i) {
if (sieve[i]) {
for (int j = i * i; j <= 1000000; j += i)
sieve[j] = false;
}
}
}
int main() {
fastIO
int a,
b, c;
cin >> a >> b >> c;
cout << (max(0, c - (a - b)));
return 0;
}
| [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.add"
] | 753,012 | 753,010 | u702142173 | cpp |
p02951 | #include <iostream>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = c + b - a;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int a, b, c;
int ans;
int main() {
cin >> a >> b >> c;
ans = max(c + b - a, 0);
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,021 | 753,022 | u860830353 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, c, ans;
cin >> a >> b >> c;
i = a - b;
ans = c - i;
if (c < 0) {
ans = 0;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, b, c, ans;
cin >> a >> b >> c;
i = a - b;
ans = c - i;
if (ans < 0) {
ans = 0;
}
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 753,025 | 753,026 | u018807058 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", max(c - (b - a), 0));
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d", max(c - (a - b), 0));
} | [
"expression.operation.binary.remove"
] | 753,035 | 753,036 | u582434836 | cpp |
p02951 | #include <bits/stdc++.h>
#include <cstdio>
#define PI acos(-1)
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
#define llenar(a, val) memset(a, val, sizeof(a))
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef long long ll;
int main() {
ofstream out("output.txt");
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cstdio>
#define PI acos(-1)
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
#define llenar(a, val) memset(a, val, sizeof(a))
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef long long ll;
int main() {
ofstream out("output.txt");
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,047 | 753,048 | u594272051 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
int x;
cin >> a >> b >> c;
x = a - b - c;
if (x < 0)
cout << x << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
int x;
cin >> a >> b >> c;
x = a - b - c;
if (x < 0)
cout << -x << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.unary.add"
] | 753,049 | 753,050 | u787972656 | cpp |
p02951 | // Created by liszt on 2019/08/04.
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
} | // Created by liszt on 2019/08/04.
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
} | [
"call.add",
"call.arguments.add"
] | 753,053 | 753,054 | u370447425 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(0, c - (b - a)));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int a, b, c;
int main(void) {
// Here your code !
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", max(0, c - (a - b)));
return 0;
}
| [
"expression.operation.binary.remove"
] | 753,057 | 753,058 | u497422208 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, a - (b + c)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (b + c) - a) << endl;
}
| [
"expression.operation.binary.remove"
] | 753,059 | 753,060 | u577552796 | cpp |
p02951 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,061 | 753,062 | u519950235 | cpp |
p02951 | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
#define MM int m = (l + r) >> 1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl '\n'
#define lcm(a, b) (a * b) / __gcd(a, b)
#define Case(i, ans) cout << "Case " << i << ": " << ans << endl;
#define cp(i, ans) printf("%.if", ans);
#define cpp(i, ans) cout << setprecision(i) << fixed << ans << endl;
#define ppb pop_back
#define ppf pop_front
#define pb push_back
#define pf push_front
#define pq priority_queue
#define lowbit(x) (x) & (-x)
#define all(V) V.begin(), V.end()
#define ms multiset
#define mod(x) (x + mo_num) % mo_num
#define vc vector
#define vct vector<int>
#define fa(i, V) for (auto i : V)
#define out(i) cout << (i) << endl;
#define fi first
#define se second
#define fun(i) fu(i, 1, n)
#define fut(i) fu(i, 1, t)
#define fum(i) fu(i, 1, m)
#define ld long double
//#define P pair<int,int>
using namespace std;
const int INF = LLONG_MAX;
const int maxn = 1e6 + 5;
const int mo_num = 1e9 + 7;
int n, m, a[maxn], b[maxn], ans;
int32_t main() {
IOS int x, y, z;
cin >> x >> y >> z;
cout << min(z - (x - y), (long long)0);
return 0;
} | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
#define MM int m = (l + r) >> 1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl '\n'
#define lcm(a, b) (a * b) / __gcd(a, b)
#define Case(i, ans) cout << "Case " << i << ": " << ans << endl;
#define cp(i, ans) printf("%.if", ans);
#define cpp(i, ans) cout << setprecision(i) << fixed << ans << endl;
#define ppb pop_back
#define ppf pop_front
#define pb push_back
#define pf push_front
#define pq priority_queue
#define lowbit(x) (x) & (-x)
#define all(V) V.begin(), V.end()
#define ms multiset
#define mod(x) (x + mo_num) % mo_num
#define vc vector
#define vct vector<int>
#define fa(i, V) for (auto i : V)
#define out(i) cout << (i) << endl;
#define fi first
#define se second
#define fun(i) fu(i, 1, n)
#define fut(i) fu(i, 1, t)
#define fum(i) fu(i, 1, m)
#define ld long double
//#define P pair<int,int>
using namespace std;
const int INF = LLONG_MAX;
const int maxn = 1e6 + 5;
const int mo_num = 1e9 + 7;
int n, m, a[maxn], b[maxn], ans;
int32_t main() {
IOS int x, y, z;
cin >> x >> y >> z;
cout << max(z - (x - y), (long long)0);
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 753,067 | 753,068 | u020160935 | cpp |
p02951 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,071 | 753,072 | u258907785 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,073 | 753,074 | u996142393 | cpp |
p02951 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c - a - b > 0)
cout << c - a - b << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c - (a - b) > 0)
cout << c - (a - b) << endl;
else
cout << 0 << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 753,077 | 753,078 | u467561544 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int i;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < -1) {
ans = 0;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int i;
cin >> a >> b >> c;
int ans;
ans = c - (a - b);
if (ans < 0) {
ans = 0;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,083 | 753,084 | u108540384 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include<unordered_map>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 100005;
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define CLR(a) memset(a, 0, sizeof a)
#define repf(i, a, b) for (int i = a; i <= b; ++i)
template <class T> void in(T &x) {
static char ch;
static bool neg;
for (ch = neg = 0; ch < '0' || '9' < ch; neg |= ch == '-', ch = getchar())
;
for (x = 0; '0' <= ch && ch <= '9'; (x *= 10) += ch - '0', ch = getchar())
;
x = neg ? -x : x;
}
int main() {
// freopen("in.txt", "r", stdin);
ll a, b, c;
in(a);
in(b);
in(c);
cout << c - (a - b) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include<unordered_map>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 100005;
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define CLR(a) memset(a, 0, sizeof a)
#define repf(i, a, b) for (int i = a; i <= b; ++i)
template <class T> void in(T &x) {
static char ch;
static bool neg;
for (ch = neg = 0; ch < '0' || '9' < ch; neg |= ch == '-', ch = getchar())
;
for (x = 0; '0' <= ch && ch <= '9'; (x *= 10) += ch - '0', ch = getchar())
;
x = neg ? -x : x;
}
int main() {
// freopen("in.txt", "r", stdin);
ll a, b, c;
in(a);
in(b);
in(c);
cout << max(0ll, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,085 | 753,086 | u666161993 | cpp |
p02951 | #include <bits/stdc++.h>
//#include <tr1/unordered_map>
#define debug(x) (cout << "#x = " << (x) << endl)
#define lowbit(x) (x & -x)
#define Set(x, i) memset(x, i, sizeof x)
#define R register
#define For(i, j, k) for (R int i = (j); i <= (k); ++i)
#define Rep(i, j, k) for (R int i = (j); i >= (k); --i)
#define Cross(i, j, k) for (R int i = (j); i; i = (k))
typedef long long ll;
using namespace std;
const ll N = 100011;
const ll INF = 5e16;
namespace IO {
#define dd ch = getchar()
inline ll read() {
ll x = 0;
bool f = 0;
char dd;
for (; !isdigit(ch); dd)
f ^= (ch == '-');
for (; isdigit(ch); dd)
x = x * 10 + (ch ^ 48);
return f ? -x : x;
}
#undef dd
inline void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 | 48);
}
inline void wrn(ll x) {
write(x);
putchar(' ');
}
inline void wln(ll x) {
write(x);
putchar('\n');
}
inline void wlnn(ll x, ll y) {
wrn(x);
wln(y);
}
} // namespace IO
using namespace IO;
namespace Cesare {
int main() {
ll A = read(), B = read(), C = read();
C = max(0ll, C - A - B);
return wln(C), 0;
}
} // namespace Cesare
int main() { return Cesare::main(); }
/*
*/
| #include <bits/stdc++.h>
//#include <tr1/unordered_map>
#define debug(x) (cout << "#x = " << (x) << endl)
#define lowbit(x) (x & -x)
#define Set(x, i) memset(x, i, sizeof x)
#define R register
#define For(i, j, k) for (R int i = (j); i <= (k); ++i)
#define Rep(i, j, k) for (R int i = (j); i >= (k); --i)
#define Cross(i, j, k) for (R int i = (j); i; i = (k))
typedef long long ll;
using namespace std;
const ll N = 100011;
const ll INF = 5e16;
namespace IO {
#define dd ch = getchar()
inline ll read() {
ll x = 0;
bool f = 0;
char dd;
for (; !isdigit(ch); dd)
f ^= (ch == '-');
for (; isdigit(ch); dd)
x = x * 10 + (ch ^ 48);
return f ? -x : x;
}
#undef dd
inline void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 | 48);
}
inline void wrn(ll x) {
write(x);
putchar(' ');
}
inline void wln(ll x) {
write(x);
putchar('\n');
}
inline void wlnn(ll x, ll y) {
wrn(x);
wln(y);
}
} // namespace IO
using namespace IO;
namespace Cesare {
int main() {
ll A = read(), B = read(), C = read();
C = max(0ll, C - A + B);
return wln(C), 0;
}
} // namespace Cesare
int main() { return Cesare::main(); }
/*
*/
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 753,091 | 753,092 | u031514160 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (B + C - A) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (max(B + C - A, 0)) << endl;
} | [
"call.arguments.add"
] | 753,095 | 753,096 | u598710706 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
cin.tie(NULL);
#endif
ll a, b, c;
cin >> a >> b >> c;
cout << c - a + b;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
using namespace std;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#else
ios::sync_with_stdio(false);
cin.tie(NULL);
#endif
ll a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - a + b);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,099 | 753,100 | u042208369 | cpp |
p02951 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
// struct edge {int from, to, cost;};
constexpr double EPS = 1e-10;
// constexpr double PI = acos(-1.0);
// constexpr int INF = INT_MAX;
constexpr int MOD = 1'000'000'007;
// inline void modAdd(LL &l, LL &r) {l = (l + r) % MOD;}
template <class T> inline T sqr(T x) { return x * x; }
void solve() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
int main() {
solve();
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,103 | 753,104 | u608965386 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c >= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b + c <= a)
cout << 0 << endl;
else
cout << b + c - a << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,105 | 753,106 | u703214333 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = c - (a - b);
cout << max(ans, 0);
} | [
"call.add",
"call.arguments.add"
] | 753,113 | 753,114 | u425858059 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T> inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (sign)
x = -x;
return true;
}
inline bool read(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign)
x = -x;
return true;
}
inline bool read(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
for (; !blank(ch) && !IOerror; ch = nc())
*s++ = ch;
*s = 0;
return true;
}
inline bool read(char &c) {
for (c = nc(); blank(c); c = nc())
;
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <class T, class... U> bool read(T &h, U &...t) {
return read(h) && read(t...);
}
#undef OUT_SIZE
#undef BUF_SIZE
}; // namespace fastIO
using namespace fastIO;
/************* debug begin *************/
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool &b) { return (b ? "true" : "false"); }
template <class T> string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class A, class B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class A> string to_string(const vector<A> v) {
int f = 1;
string res = "{";
for (const auto x : v) {
if (!f)
res += ", ";
f = 0;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { puts(""); }
template <class T, class... U> void debug_out(const T &h, const U &...t) {
cout << " " << to_string(h);
debug_out(t...);
}
#ifdef tokitsukaze
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
#else
#define debug(...) 233;
#endif
/************* debug end *************/
#define mem(a, b) memset((a), (b), sizeof(a))
#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 sqr(x) (x) * (x)
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, ll> PIL;
typedef pair<ll, int> PLI;
typedef vector<int> VI;
typedef vector<ll> VL;
/************* define end *************/
void read(int *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(double *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void println(VI x) {
for (int i = 0; i < sz(x); i++)
printf("%d%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(VL x) {
for (int i = 0; i < sz(x); i++)
printf("%lld%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(int *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%d%c", x[i], " \n"[i == r]);
}
void println(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%lld%c", x[i], " \n"[i == r]);
}
/*************** IO end ***************/
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX = 1e5 + 10;
const ll mod = 998244353;
/********************************* head *********************************/
void go() {
int a, b, c;
while (read(a, b, c)) {
printf("%d\n", c - (a - b));
}
} | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T> inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (sign)
x = -x;
return true;
}
inline bool read(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign)
x = -x;
return true;
}
inline bool read(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
for (; !blank(ch) && !IOerror; ch = nc())
*s++ = ch;
*s = 0;
return true;
}
inline bool read(char &c) {
for (c = nc(); blank(c); c = nc())
;
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <class T, class... U> bool read(T &h, U &...t) {
return read(h) && read(t...);
}
#undef OUT_SIZE
#undef BUF_SIZE
}; // namespace fastIO
using namespace fastIO;
/************* debug begin *************/
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool &b) { return (b ? "true" : "false"); }
template <class T> string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class A, class B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class A> string to_string(const vector<A> v) {
int f = 1;
string res = "{";
for (const auto x : v) {
if (!f)
res += ", ";
f = 0;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { puts(""); }
template <class T, class... U> void debug_out(const T &h, const U &...t) {
cout << " " << to_string(h);
debug_out(t...);
}
#ifdef tokitsukaze
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
#else
#define debug(...) 233;
#endif
/************* debug end *************/
#define mem(a, b) memset((a), (b), sizeof(a))
#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 sqr(x) (x) * (x)
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, ll> PIL;
typedef pair<ll, int> PLI;
typedef vector<int> VI;
typedef vector<ll> VL;
/************* define end *************/
void read(int *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(double *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void println(VI x) {
for (int i = 0; i < sz(x); i++)
printf("%d%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(VL x) {
for (int i = 0; i < sz(x); i++)
printf("%lld%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(int *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%d%c", x[i], " \n"[i == r]);
}
void println(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%lld%c", x[i], " \n"[i == r]);
}
/*************** IO end ***************/
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX = 1e5 + 10;
const ll mod = 998244353;
/********************************* head *********************************/
void go() {
int a, b, c;
while (read(a, b, c)) {
printf("%d\n", max(0, c - (a - b)));
}
} | [
"call.arguments.add",
"call.arguments.change"
] | 753,115 | 753,116 | u709755864 | cpp |
p02951 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<ll int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void solve() {
ll i, j = 0, r = 200, p, q, k = 0, ans = 0, d, y = 0, x, h, flag = 0, n,
m = 0, a = hell, b = hell, id, c, h1, h2, a1, b1, w;
cin >> n >> x >> h;
cout << x + h - n;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define vi vector<ll int>
#define CLR(a) memset((a), 0, sizeof(a))
#define mp make_pair
#define hell 1000000007
using namespace std;
void solve() {
ll i, j = 0, r = 200, p, q, k = 0, ans = 0, d, y = 0, x, h, flag = 0, n,
m = 0, a = hell, b = hell, id, c, h1, h2, a1, b1, w;
cin >> n >> x >> h;
cout << max(x + h - n, 0LL);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"call.add",
"call.arguments.add"
] | 753,121 | 753,122 | u216069198 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, c, ans = 0;
cin >> a >> b >> c;
ans = c - (a - b);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, c, ans = 0;
cin >> a >> b >> c;
ans = max(c - (a - b), 0);
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 753,127 | 753,128 | u480806810 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n); (i)++)
#define FR(i, n) for (lli(i) = (n)-1; (i) >= 0; (i)--)
#define FSG(i, a, b) for (lli(i) = (a); (i) < (b); (i)++)
#define FSGR(i, a, b) for (lli(i) = (b)-1; (i) >= (a); (i)--)
#define VAL(n) cout << n << endl;
#define VALD(n) cout << #n << ": " << n << endl;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define F(i, n) for (lli(i) = 0; (i) < (n); (i)++)
#define FR(i, n) for (lli(i) = (n)-1; (i) >= 0; (i)--)
#define FSG(i, a, b) for (lli(i) = (a); (i) < (b); (i)++)
#define FSGR(i, a, b) for (lli(i) = (b)-1; (i) >= (a); (i)--)
#define VAL(n) cout << n << endl;
#define VALD(n) cout << #n << ": " << n << endl;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 753,133 | 753,134 | u201489353 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 753,135 | 753,136 | u266059249 | cpp |
p02951 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b, c) << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c - min(a - b, c)) << endl;
}
| [
"call.arguments.change"
] | 753,139 | 753,140 | u508729896 | cpp |
p02951 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
printf("%d\n", c - (a - b));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
printf("%d\n", max(c - (a - b), 0));
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,141 | 753,142 | u553807330 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define th(n) cout << n << endl
#define gc getchar_unlocked
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
#define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define print(arr) \
for (auto el : arr) \
cout << el << " "; \
cout << endl
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
#define formatrix(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define eof (scanf("%d", &n)) != EOF
// declaration shortcuts
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>
#define ppl pair<ll, pp>
#define ull unsigned long long
#define ll long long
#define mll map<ll, ll>
#define sll set<ll>
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
#define ini(a, v) memset(a, v, sizeof(a))
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 1006;
// Debugging
// For reference: https://codeforces.com/blog/entry/65311
#define dbg(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
#define n_l '\n'
ll dp[2][maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll diff = a - b;
cout << c - diff << endl;
} | #include <bits/stdc++.h>
using namespace std;
// Optimisations
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O2")
// shortcuts for functions
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define th(n) cout << n << endl
#define gc getchar_unlocked
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define n_l '\n'
// make it python
#define gcd __gcd
#define append push_back
#define str to_string
#define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define print(arr) \
for (auto el : arr) \
cout << el << " "; \
cout << endl
// utility functions shortcuts
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sswap(a, b) \
{ \
a = a ^ b; \
b = a ^ b; \
a = a ^ b; \
}
#define swap(a, b) \
{ \
auto temp = a; \
a = b; \
b = temp; \
}
#define init(dp) memset(dp, -1, sizeof(dp));
#define set0(dp) memset(dp, 0, sizeof(dp));
#define bits(x) __builtin_popcount(x)
#define SORT(v) sort(all(v))
#define endl "\n"
#define forr(i, n) for (ll i = 0; i < n; i++)
#define formatrix(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define eof (scanf("%d", &n)) != EOF
// declaration shortcuts
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define pll pair<ll, ll>
#define ppl pair<ll, pp>
#define ull unsigned long long
#define ll long long
#define mll map<ll, ll>
#define sll set<ll>
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
#define ini(a, v) memset(a, v, sizeof(a))
// Constants
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
constexpr ll INF = 1999999999999999997;
constexpr int inf = INT_MAX;
constexpr int MAXSIZE = int(1e6) + 5;
constexpr auto PI = 3.14159265358979323846L;
constexpr auto oo = numeric_limits<int>::max() / 2 - 2;
constexpr auto eps = 1e-6;
constexpr auto mod = 1000000007;
constexpr auto MOD = 1000000007;
constexpr auto MOD9 = 1000000009;
constexpr auto maxn = 1006;
// Debugging
// For reference: https://codeforces.com/blog/entry/65311
#define dbg(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
#define n_l '\n'
ll dp[2][maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a, b, c;
cin >> a >> b >> c;
ll diff = a - b;
cout << max(c - diff, 0ll) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 753,145 | 753,146 | u996003680 | cpp |
p02951 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef long double ld;
#define mp make_pair
#define pb push_back
const ll mod = 1000000007;
// const ll mod = 998244353;
const ll LLMAX = numeric_limits<long long>::max();
void No() { cout << "No" << endl; }
void Yes() { cout << "Yes" << endl; }
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef long double ld;
#define mp make_pair
#define pb push_back
const ll mod = 1000000007;
// const ll mod = 998244353;
const ll LLMAX = numeric_limits<long long>::max();
void No() { cout << "No" << endl; }
void Yes() { cout << "Yes" << endl; }
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,151 | 753,152 | u462078186 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
// priority_queue<int, vector<int>, greater<int> > pq;
const int N = 1000300;
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - (a - b));
} | [
"call.add",
"call.arguments.change"
] | 753,153 | 753,154 | u278557567 | cpp |
p02951 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define sc second
#define heap priority_queue
struct piii {
int64 fr, sc, th;
bool operator<(const piii &b) {
if (fr != b.fr)
return fr < b.fr;
if (sc != b.sc)
return sc < b.sc;
return th < b.th;
}
};
///////////////////////////////////////////////
///////////////////////////////////////////////
int main() {
cout << setprecision(2) << fixed;
ios::sync_with_stdio(false), cin.tie(0);
// freopen("input.txt", "r", stdin);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define int64 long long
#define pii pair<int64, int64>
#define fr first
#define sc second
#define heap priority_queue
struct piii {
int64 fr, sc, th;
bool operator<(const piii &b) {
if (fr != b.fr)
return fr < b.fr;
if (sc != b.sc)
return sc < b.sc;
return th < b.th;
}
};
///////////////////////////////////////////////
///////////////////////////////////////////////
int main() {
cout << setprecision(2) << fixed;
ios::sync_with_stdio(false), cin.tie(0);
// freopen("input.txt", "r", stdin);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,159 | 753,160 | u217917732 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define PRINT(x) cout << x << endl
#define all(x) x.begin(), x.end()
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define PRINT(x) cout << x << endl
#define all(x) x.begin(), x.end()
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 753,161 | 753,162 | u239375815 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SZ(a) ((int)a.size())
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define fst first
#define snd second
void dout() { cerr << endl; }
template <typename Head, typename... Tail> void dout(Head H, Tail... T) {
cerr << H << ' ';
dout(T...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SZ(a) ((int)a.size())
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define fst first
#define snd second
void dout() { cerr << endl; }
template <typename Head, typename... Tail> void dout(Head H, Tail... T) {
cerr << H << ' ';
dout(T...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b));
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,165 | 753,166 | u340474328 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1000000007;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 753,169 | 753,170 | u540491484 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << b + c - a;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << max(b + c - a, 0);
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,171 | 753,172 | u088044957 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << C - (A - B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 1e5 + 10;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int A, B, C;
int main() {
cin >> A >> B >> C;
cout << max(0, C - (A - B)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 753,173 | 753,174 | u992875223 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(i) i.begin(), i.end()
template <class T, class U> bool cmax(T &a, U b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T, class U> bool cmin(T &a, U b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << max(0, c - (a - b)) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 753,175 | 753,176 | u366644013 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
typedef long long ll;
ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
void setcomb() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 1000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
}
ifac[1000000] = mpow(fac[1000000], M - 2);
for (ll i = 1000000; i > 0; i--) {
ifac[i - 1] = ifac[i] * i % M;
}
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
return fac[a] * ifac[a - b] % M;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a) {
long long b = M, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= M;
if (u < 0)
u += M;
return u;
}
vector<vector<ll>> mul(vector<vector<ll>> a, vector<vector<ll>> b, int n) {
int i, j, k, t;
vector<vector<ll>> c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
t = 0;
for (k = 0; k < n; k++)
t = (t + a[i][k] * b[k][j] % M) % M;
c[i].push_back(t);
}
}
return c;
}
template <typename Monoid> struct SegmentTree {
int sz;
vector<Monoid> seg;
const Monoid M1;
SegmentTree(int n, const Monoid &M1) : M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid value(const int &k) const { return seg[k + sz]; }
Monoid f(Monoid a, Monoid b) { return a + b; }
};
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c - a + b << endl;
} | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
typedef long long ll;
ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
void setcomb() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 1000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
}
ifac[1000000] = mpow(fac[1000000], M - 2);
for (ll i = 1000000; i > 0; i--) {
ifac[i - 1] = ifac[i] * i % M;
}
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
ll perm(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
return fac[a] * ifac[a - b] % M;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a) {
long long b = M, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= M;
if (u < 0)
u += M;
return u;
}
vector<vector<ll>> mul(vector<vector<ll>> a, vector<vector<ll>> b, int n) {
int i, j, k, t;
vector<vector<ll>> c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
t = 0;
for (k = 0; k < n; k++)
t = (t + a[i][k] * b[k][j] % M) % M;
c[i].push_back(t);
}
}
return c;
}
template <typename Monoid> struct SegmentTree {
int sz;
vector<Monoid> seg;
const Monoid M1;
SegmentTree(int n, const Monoid &M1) : M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid value(const int &k) const { return seg[k + sz]; }
Monoid f(Monoid a, Monoid b) { return a + b; }
};
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c - a + b, 0) << endl;
}
| [
"call.add",
"call.arguments.add"
] | 753,177 | 753,178 | u933068010 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - (A - B) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(C - (A - B), 0) << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 753,181 | 753,182 | u950721652 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int main() {
int a, b, c;
cin >> a >> b >> c;
c -= b - a;
cout << max(c, 0);
return 0;
}
// 5 1 5 -10 -10 -10 5 7
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
int main() {
int a, b, c;
cin >> b >> a >> c;
c -= b - a;
cout << max(c, 0);
return 0;
}
// 5 1 5 -10 -10 -10 5 7
| [
"expression.operation.binary.remove"
] | 753,189 | 753,190 | u188000196 | cpp |
p02951 | #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
bool cmp(pii a, pii b) { return a.S < b.S; }
int find(vector<int> &dp, int t) {
int hi = sz(dp) - 1, lo = -1;
while (hi - lo > 1) {
int m = (hi + lo) / 2;
if (dp[m] <= t)
lo = m;
else
hi = m;
}
return hi;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - (b - a)) << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; i++)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9 + 7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int fpow(int b, int p) {
if (p == 0)
return 1;
int h = fpow(b, p / 2);
if (p % 2)
return h * b % MOD * h % MOD;
return h * h % MOD;
}
bool cmp(pii a, pii b) { return a.S < b.S; }
int find(vector<int> &dp, int t) {
int hi = sz(dp) - 1, lo = -1;
while (hi - lo > 1) {
int m = (hi + lo) / 2;
if (dp[m] <= t)
lo = m;
else
hi = m;
}
return hi;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(0ll, c - (a - b)) << "\n";
return 0;
}
| [
"expression.operation.binary.remove"
] | 753,191 | 753,192 | u055148700 | cpp |
p02951 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0LL) << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,199 | 753,200 | u067267922 | cpp |
p02951 | /***************************************************************
File name: A.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时56分49秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; ++i)
#define mem(a) memset((a), 0, sizeof(a))
#define str(a) strlen(a)
typedef long long LL;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", max(0, b + c - 1));
return 0;
} | /***************************************************************
File name: A.cpp
Author: ljfcnyali
Create time: 2019年08月04日 星期日 19时56分49秒
***************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; ++i)
#define mem(a) memset((a), 0, sizeof(a))
#define str(a) strlen(a)
typedef long long LL;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", max(0, b + c - a));
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 753,201 | 753,202 | u192982222 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << max(0LL, c - (a - b)) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 753,203 | 753,204 | u924885571 | cpp |
p02951 | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FENWICK(k) (k & -k)
#define FOREACH(i, t) \
for (auto i = t.begin(); i != t.end(); i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define LL \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int rogi[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int n;
void dane() {
int a, b, c;
cin >> a >> b >> c;
cout << (c - (a - b)) << endl;
}
int main() {
IOS
// int t;
// cin>>t;
// F(i,0,t)
dane();
return 0;
} | #include <bits/stdc++.h>
#include <iomanip> // std::setprecision
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FENWICK(k) (k & -k)
#define FOREACH(i, t) \
for (auto i = t.begin(); i != t.end(); i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define LL \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
const int rogi[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int n;
void dane() {
int a, b, c;
cin >> a >> b >> c;
cout << max(0, (c - (a - b))) << endl;
}
int main() {
IOS
// int t;
// cin>>t;
// F(i,0,t)
dane();
return 0;
} | [
"call.add",
"call.arguments.change"
] | 753,205 | 753,206 | u381312634 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int k = a - b;
c = min(c - k, 0);
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int k = a - b;
c = max(c - k, 0);
cout << c << endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 753,211 | 753,212 | u965377001 | cpp |
p02951 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << c - (a - b) << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << max(c - (a - b), 0) << '\n';
return 0;
} | [
"call.add",
"call.arguments.add"
] | 753,213 | 753,214 | u941934550 | cpp |
p02951 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64> vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(A - B, C) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64> vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <typename F> struct FixPoint : F {
FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args> decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F> inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C - min(A - B, C) << endl;
}
| [
"expression.operation.binary.add"
] | 753,217 | 753,218 | u524343822 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10)
cout << "n" << endl;
else if (n >= 10 && n < 100)
cout << "9" << endl;
else if (n >= 100 && n < 1000)
cout << n - 100 + 10 << endl;
else if (n >= 1000 && n < 10000)
cout << "909" << endl;
else if (n >= 10000 && n < 100000)
cout << n - 10000 + 1000 - 100 + 10 << endl;
else
cout << "90909" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10)
cout << n << endl;
else if (n >= 10 && n < 100)
cout << "9" << endl;
else if (n >= 100 && n < 1000)
cout << n - 100 + 10 << endl;
else if (n >= 1000 && n < 10000)
cout << "909" << endl;
else if (n >= 10000 && n < 100000)
cout << n - 10000 + 1000 - 100 + 10 << endl;
else
cout << "90909" << endl;
}
| [] | 753,223 | 753,224 | u516876944 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n + 1; i++) {
string s = to_string(i);
int cmp = s.length();
if (cmp % 2 == 1)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
int cmp = s.length();
if (cmp % 2 == 1)
cnt++;
}
cout << cnt << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,230 | 753,231 | u188332959 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
// map<string>a
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
//組み合わせ
void recursive_comb(vector<int> indexes, int s, int rest,
std::function<void(vector<int>)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(int n, int k, std::function<void(vector<int>)> f) {
vector<int> indexes(k);
recursive_comb(indexes, n - 1, k, f);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
int func(int j) {
int tmp = j;
int ans = 1;
tmp /= 10;
while (tmp != 0) {
ans++;
tmp /= 10;
}
return ans;
}
int main() {
int N;
int ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
if (func(i) % 2 == 1) {
ans++;
}
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
// map<string>a
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
//組み合わせ
void recursive_comb(vector<int> indexes, int s, int rest,
std::function<void(vector<int>)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(int n, int k, std::function<void(vector<int>)> f) {
vector<int> indexes(k);
recursive_comb(indexes, n - 1, k, f);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
int func(int j) {
int tmp = j;
int ans = 1;
tmp /= 10;
while (tmp != 0) {
ans++;
tmp /= 10;
}
return ans;
}
int main() {
int N;
int ans = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
if (func(i) % 2 == 1) {
ans++;
}
}
cout << ans;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,245 | 753,246 | u272628953 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.value.change",
"io.output.newline.add"
] | 753,255 | 753,256 | u475280305 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 753,257 | 753,256 | u475280305 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res;
for (int i = 1; i <= N; i++) {
if (to_string(i).size() % 2)
res++;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 別解
int main() {
// 考え方メモ
// N < 10^5 のため、forループで全ての数を見た場合(O(N))でも、10^5 <
// 10^8（AtCoderの制約）を満たす 全検索を行う
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
if (to_string(i).length() % 2) {
res++;
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.value.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 753,258 | 753,256 | u475280305 | cpp |
p02952 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename A, typename B> bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
template <typename A, typename B> bool chmax(A &a, const B &b) {
return a < b && (a = b, true);
}
int main() {
int n, cnt;
cin >> n;
for (int i = 1; i <= n; i++) {
if ((i >= 1 && i <= 9) || (i >= 100 && i <= 999) ||
(i >= 10000 && i <= 99999)) {
cnt++;
}
}
cout << cnt << '\n';
return 0;
} |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename A, typename B> bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
template <typename A, typename B> bool chmax(A &a, const B &b) {
return a < b && (a = b, true);
}
int main() {
int n, cnt = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if ((i >= 1 && i <= 9) || (i >= 100 && i <= 999) ||
(i >= 10000 && i <= 99999)) {
cnt++;
}
}
cout << cnt << '\n';
return 0;
} | [
"variable_declaration.value.change"
] | 753,268 | 753,269 | u535565217 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
ll count = 0;
FOR(i, 1, n - 1) {
if (to_string(i).length() % 2 != 0) {
count++;
}
}
COUT(count);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
3 2
*/
| #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
// REPEAT
// ----------------------------------------
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REPA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) \
;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define COUT(a) cout << (a) << endl;
#define ENDL(a) cout << endl;
#define COUTA(i, a) \
for (ll i = 0; i < (ll)(a.size()); i++) { \
cout << (a)[i] << " "; \
} \
cout << endl;
// UTIL
// ----------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) sort((a).rbegin(), (a).rend())
// DEBUG
// ----------------------------------------
#ifdef _DEBUG
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
#else
#define debug(x)
#endif
template <typename T> void debugV(const vector<T> v) {
#ifdef _DEBUG
rep(i, v.size()) { cout << i << ":" << v[i] << " "; }
cout << endl;
#else
(void)v;
#endif
}
// BIT FLAG
// ----------------------------------------
const unsigned int BIT_FLAG_0 = (1 << 0); // 0000 0000 0000 0001
const unsigned int BIT_FLAG_1 = (1 << 1); // 0000 0000 0000 0010
const unsigned int BIT_FLAG_2 = (1 << 2); // 0000 0000 0000 0100
const unsigned int BIT_FLAG_3 = (1 << 3); // 0000 0000 0000 1000
const unsigned int BIT_FLAG_4 = (1 << 4); // 0000 0000 0001 0000
const unsigned int BIT_FLAG_5 = (1 << 5); // 0000 0000 0010 0000
const unsigned int BIT_FLAG_6 = (1 << 6); // 0000 0000 0100 0000
const unsigned int BIT_FLAG_7 = (1 << 7); // 0000 0000 1000 0000
const unsigned int BIT_FLAG_8 = (1 << 8); // 0000 0001 0000 0000
const unsigned int BIT_FLAG_9 = (1 << 9); // 0000 0010 0000 0000
const unsigned int BIT_FLAG_10 = (1 << 10); // 0000 0100 0000 0000
const unsigned int BIT_FLAG_11 = (1 << 11); // 0000 1000 0000 0000
// CONST
// ----------------------------------------
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr double PI = 3.14159265358979323846; // or M_PI
constexpr int MOD = 1000000007;
void Main() {
ll n;
cin >> n;
ll count = 0;
FOR(i, 1, n) {
if (to_string(i).length() % 2 != 0) {
// COUT(i);
count++;
}
}
COUT(count);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
/*
3 2
*/
| [
"expression.operation.binary.remove"
] | 753,275 | 753,276 | u644224332 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
int count = 0;
for (i = 1; i < N; i++) {
string s = to_string(i);
int size = s.size();
if (size % 2 == 1) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int i;
int count = 0;
for (i = 1; i <= N; i++) {
string s = to_string(i);
int size = s.size();
if (size % 2 == 1) {
count++;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,279 | 753,280 | u594983000 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
if (to_string(i).size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,284 | 753,285 | u347397127 | cpp |
p02952 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N << endl;
} else if (10 <= N || N < 100) {
cout << 9 << endl;
} else if (100 <= N || N < 1000) {
cout << 9 + (N - 99) << endl;
} else if (1000 <= N || N < 10000) {
cout << 9 + 900 << endl;
} else if (10000 <= N || N < 100000) {
cout << 9 + 900 + (N - 9999);
} else {
cout << 9 + 900 + 90000 << endl;
}
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N << endl;
} else if (10 <= N && N < 100) {
cout << 9 << endl;
} else if (100 <= N && N < 1000) {
cout << 9 + (N - 99) << endl;
} else if (1000 <= N && N < 10000) {
cout << 9 + 900 << endl;
} else if (10000 <= N && N < 100000) {
cout << 9 + 900 + (N - 9999);
} else {
cout << 9 + 900 + 90000 << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 753,297 | 753,298 | u580593895 | cpp |
p02952 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 1;
}
cout << k << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 0;
}
cout << k << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 753,299 | 753,300 | u657538941 | cpp |
p02952 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 1; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 1;
}
cout << k << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int k = 0; //合計
int j = 0; //桁数
int a = 0;
for (int n = 1; n <= N; n++) {
a = n;
while (a != 0) {
a /= 10;
j++;
}
if (j % 2 == 1) {
k++;
}
j = 0;
}
cout << k << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 753,301 | 753,300 | u657538941 | cpp |
p02952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (i / 10 == 0)
count++;
else if (i / 100 == 0)
continue;
else if (i / 1000 == 0)
count++;
else if (i / 10000 == 0)
continue;
else if (i / 100000 != 0)
count++;
}
cout << count << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (i / 10 == 0)
count++;
else if (i / 100 == 0)
continue;
else if (i / 1000 == 0)
count++;
else if (i / 10000 == 0)
continue;
else if (i / 100000 == 0)
count++;
else
continue;
}
cout << count << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 753,308 | 753,309 | u412057008 | cpp |
p02952 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, no_odd = 0;
cin >> n;
for (int i = 0; i < n; i++) {
if (to_string(i).length() % 2 == 1) {
no_odd++;
}
}
cout << no_odd;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, no_odd = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (to_string(i).length() % 2 == 1) {
no_odd++;
}
}
cout << no_odd;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,310 | 753,311 | u323819429 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int power(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
int keta(int N) {
int j;
for (int i = 1; i <= 7; i++) {
if (N >= power(10, i) && N < power(10, i + 1)) {
j = i + 1;
break;
}
}
return j;
}
int main() {
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (keta(i) % 2 == 1)
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int power(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
int keta(int N) {
int j = 0;
for (int i = 0; i <= 7; i++) {
if (N >= power(10, i) && N < power(10, i + 1)) {
j = i + 1;
break;
}
}
return j;
}
int main() {
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (keta(i) % 2 == 1)
cnt++;
}
cout << cnt << endl;
}
| [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 753,312 | 753,313 | u527311983 | cpp |
p02952 | #include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 0;
for (int i = 0; i < n; ++i) {
int j = i;
int keta = 0;
while (j > 0) {
j /= 10;
keta++;
}
if (keta % 2 != 0)
cnt++;
}
std::cout << cnt << std::endl;
}
| #include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
int j = i;
int keta = 0;
while (j > 0) {
j /= 10;
keta++;
}
if (keta % 2 != 0)
cnt++;
}
std::cout << cnt << std::endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,360 | 753,361 | u089888152 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
ll c = 10;
for (ll i = 1; i < 7; i++) {
if (a < c) {
b = i;
break;
}
c = c * 10;
}
ll d = 0;
if (b == 1) {
d = a;
} else {
ll e = 9;
for (ll i = 1; i <= b - 1;) {
d += e;
e = e * 81;
i = i + 2;
}
if (b % 2 == 1) {
d += a - c / 10 + 1;
}
}
cout << d << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
ll c = 10;
for (ll i = 1; i < 7; i++) {
if (a < c) {
b = i;
break;
}
c = c * 10;
}
ll d = 0;
if (b == 1) {
d = a;
} else {
ll e = 9;
for (ll i = 1; i <= b - 1;) {
d += e;
e = e * 100;
i = i + 2;
}
if (b % 2 == 1) {
d += a - c / 10 + 1;
}
}
cout << d << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,369 | 753,370 | u883297128 | cpp |
p02952 | /*
* Project: AtCoder Beginners Contest 136 B - Uneven Numbers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/09/08
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdint>
#include <cstdio>
#include <string>
using namespace std;
int32_t n;
void solve() {
int32_t odd = 0;
for (int i = 1; i < n; i++) {
if (to_string(i).length() % 2 == 1) {
odd++;
}
}
printf("%d\n", odd);
}
int main() {
scanf("%d", &n);
solve();
}
| /*
* Project: AtCoder Beginners Contest 136 B - Uneven Numbers
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/09/08
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cstdint>
#include <cstdio>
#include <string>
using namespace std;
int32_t n;
void solve() {
uint32_t odd = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).length() % 2 == 1) {
odd++;
}
}
printf("%d\n", odd);
}
int main() {
scanf("%d", &n);
solve();
}
| [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,376 | 753,377 | u781458283 | cpp |
p02952 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_REP(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2)(__VA_ARGS__)
#define IN(type, n) \
type n; \
cin >> n
#define INALL(type, v) \
REP(i, v.size()) { \
IN(type, _tmp); \
v.at(i) = _tmp; \
}
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
int main() {
IN(int, N);
int count = 0;
int i = 10;
while (i <= N) {
count += (int)(i * 0.9);
i *= 100;
}
i /= 10;
if (N > i)
count += N - i + 1;
cout << count << endl;
return 0;
}
| #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_REP(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define RREP2(i, n) for (int i = (n - 1); i >= 0; --i)
#define RREP3(i, l, r) for (int i = (r - 1), i##_len = (l); i >= i##_len; --i)
#define GET_MACRO_RREP(_1, _2, _3, NAME, ...) NAME
#define RREP(...) GET_MACRO_REP(__VA_ARGS__, RREP3, RREP2)(__VA_ARGS__)
#define IN(type, n) \
type n; \
cin >> n
#define INALL(type, v) \
REP(i, v.size()) { \
IN(type, _tmp); \
v.at(i) = _tmp; \
}
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#ifdef _DEBUG
#define DEBUG(x) cout << #x << ": " << x << endl
#else
#define DEBUG(x)
#endif
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
int main() {
IN(int, N);
int count = 0;
int i = 10;
while (i <= N) {
count += (int)(i * 0.9);
i *= 100;
}
i /= 10;
if (N >= i)
count += N - i + 1;
cout << count << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,378 | 753,379 | u244839008 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
bool f(int x) {
int keta = 0;
while (x) {
keta++;
x /= 10;
}
return keta % 2 == 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
if (f(i))
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool f(int x) {
int keta = 0;
while (x) {
keta++;
x /= 10;
}
return keta % 2 == 1;
}
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (f(i))
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,380 | 753,381 | u497715246 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
int dig(int x) {
int ans = 0;
while (x > 0) {
ans++;
x /= 10;
}
return ans;
}
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
int t = dig(n);
int ans = 0;
for (int i = 1; i < t; i += 2) {
ans += 9 * (pow(10, i - 1));
}
if (t % 2)
ans += n % (int)(pow(10, t - 1)) + 1;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_pair
#define f(i, n) for (int i = 0; i < n; i++)
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define gcd(a, b) __gcd((a), (b))
#define fill(a, value) memset(a, value, sizeof(a));
#define minn(v) *min_element(v.begin(), v.end());
#define maxx(v) *max_element(v.begin(), v.end());
#define print(x) cout << (x) << endl;
#define sum(v) +x accumulate(v.begin(), v.end(), x);
#define debug(x) cout << #x << '=' << (x) << endl;
typedef pair<int, int> pii;
typedef vector<int> vi;
int dig(int x) {
int ans = 0;
while (x > 0) {
ans++;
x /= 10;
}
return ans;
}
signed main() {
fastio;
cout << fixed << setprecision(12);
int n;
cin >> n;
int t = dig(n);
int ans = 0;
for (int i = 1; i < t; i += 2) {
ans += 9 * (pow(10, i - 1));
}
if (t % 2) {
ans += n - (int)(pow(10, t - 1)) + 1;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,393 | 753,394 | u858929490 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.