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 |
|---|---|---|---|---|---|---|---|
p02949 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,934 | 753,936 | u236433947 | cpp |
p02949 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,935 | 753,936 | u236433947 | cpp |
p02949 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pa;
struct edge {
int to;
ll coin;
};
int n;
ll p;
vector<vector<edge>> graph;
vector<vector<int>> b_graph;
vector<bool> reachable;
bool is_inf;
void backdfs(int now) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pa;
struct edge {
int to;
ll coin;
};
int n;
ll p;
vector<vector<edge>> graph;
vector<vector<int>> b_graph;
vector<bool> reachable;
bool is_inf;
void backdfs(int now) {
... | [
"call.add",
"call.arguments.change",
"function.return_value.change"
] | 753,941 | 753,942 | u412908746 | cpp |
p02949 | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define dump(x) cerr << #x << " => " << (x) << endl
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) ... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define dump(x) cerr << #x << " => " << (x) << endl
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 753,943 | 753,944 | u925364229 | cpp |
p02949 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 3e18 + 7
#define MOD 1000000007
using names... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 3e18 + 7
#define MOD 1000000007
using names... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change"
] | 753,945 | 753,946 | u493750228 | cpp |
p02949 | #include <bits/stdc++.h>
#define N 2502
using namespace std;
int n, m, p, dis[N];
struct node {
int u, v, w;
} e[5002];
vector<int> s[N];
int vis[N][N];
void dfs(int st, int x) {
vis[st][x] = 1;
for (int i = 0; i < s[x].size(); i++) {
int to = s[x][i];
if (vis[st][to])
continue;
dfs(st, to);
}... | #include <bits/stdc++.h>
#define N 2502
using namespace std;
int n, m, p, dis[N];
struct node {
int u, v, w;
} e[5002];
vector<int> s[N];
int vis[N][N];
void dfs(int st, int x) {
vis[st][x] = 1;
for (int i = 0; i < s[x].size(); i++) {
int to = s[x][i];
if (vis[st][to])
continue;
dfs(st, to);
}... | [
"literal.number.change",
"call.arguments.change"
] | 753,951 | 753,952 | u196341564 | cpp |
p02949 | #include <iostream>
#include <limits>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m, p;
cin >> n >> m >> p;
vector<vector<pair<int, int>>> to(n);
vector<vector<int>> from(n);
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
... | #include <iostream>
#include <limits>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m, p;
cin >> n >> m >> p;
vector<vector<pair<int, int>>> to(n);
vector<vector<int>> from(n);
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 753,955 | 753,956 | u455757400 | cpp |
p02949 | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
struct edge {
ll from;
ll to; //到達点
ll cost; //移動コスト
};
int main() {
ll n, m, p;
std::cin >> n >> m >> p;
vector<edge> edges;
for (int i = 0; i < m; i++) {
ll a, b, c;
std::c... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
struct edge {
ll from;
ll to; //到達点
ll cost; //移動コスト
};
int main() {
ll n, m, p;
std::cin >> n >> m >> p;
vector<edge> edges;
for (int i = 0; i < m; i++) {
ll a, b, c;
std::c... | [
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,957 | 753,958 | u121794232 | cpp |
p02949 | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
struct edge {
ll from;
ll to; //到達点
ll cost; //移動コスト
};
int main() {
ll n, m, p;
std::cin >> n >> m >> p;
vector<edge> edges;
for (int i = 0; i < m; i++) {
ll a, b, c;
std::c... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
struct edge {
ll from;
ll to; //到達点
ll cost; //移動コスト
};
int main() {
ll n, m, p;
std::cin >> n >> m >> p;
vector<edge> edges;
for (int i = 0; i < m; i++) {
ll a, b, c;
std::c... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 753,959 | 753,958 | u121794232 | cpp |
p02949 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 5005;
long long d[sz];
int n, m, p;
int f[sz], t[sz], w[sz];
long long inf = 1e18, ans;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d %d %d", &n, &m, &p);
for (int i = 0; i <... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 5005;
long long d[sz];
int n, m, p;
int f[sz], t[sz], w[sz];
long long inf = 1e18, ans;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
scanf("%d %d %d", &n, &m, &p);
for (int i = 0; i <... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 753,960 | 753,961 | u353783395 | cpp |
p02949 | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t &&... | #include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <sys/time.h>
#include <sys/timeb.h>
#include <time.h>
using namespace std;
#define ll long long
#define uint unsigned int
#define ulong unsigned long long int
#define Vec vector
template <typename T> bool InRange(T t, T l, T r) { return l <= t &&... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,962 | 753,963 | u774845108 | cpp |
p02949 | #include <bits/stdc++.h>
#define MAX 5010
using namespace std;
vector<pair<int, int>> edge[MAX];
long long mmax[MAX];
int main(void) {
int N, M, P;
cin >> N >> M >> P;
for (int i = 0; i < M; i++) {
int A, B, C;
cin >> A >> B >> C;
A--;
B--;
edge[A].push_back({B, P - C});
}
for (int i = 1... | #include <bits/stdc++.h>
#define MAX 5010
using namespace std;
vector<pair<int, int>> edge[MAX];
long long mmax[MAX];
int main(void) {
int N, M, P;
cin >> N >> M >> P;
for (int i = 0; i < M; i++) {
int A, B, C;
cin >> A >> B >> C;
A--;
B--;
edge[A].push_back({B, P - C});
}
for (int i = 1... | [
"call.add",
"call.arguments.add"
] | 753,971 | 753,972 | u305757380 | cpp |
p02949 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
std::vector<int> to[2505];
std::vector<int> ot[2505];
bool reachableToN[2505];
bool reachableFrom1[2505];
bool ok[2505];
long long INF = 1LL << 60;
void dfs(int v) {
if (reachableFrom1[v])
return;
reachableFrom1[v] = tru... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
std::vector<int> to[2505];
std::vector<int> ot[2505];
bool reachableToN[2505];
bool reachableFrom1[2505];
bool ok[2505];
long long INF = 1LL << 60;
void dfs(int v) {
if (reachableFrom1[v])
return;
reachableFrom1[v] = tru... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 753,977 | 753,976 | u313111801 | cpp |
p02949 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ii pair<int, int>
#define iill pair<ii, ll>
#define lli pair<ll, int>
#define MAXN 100010
#define EPS 1e-9
#define MAXLOG
#define INF (long long)1e18
#define MOD
#define prt(a) printf("%d\n", a)
#define prt2(a, b) printf("%d %d\n", a, b)
#define prt3(a... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ii pair<int, int>
#define iill pair<ii, ll>
#define lli pair<ll, int>
#define MAXN 100010
#define EPS 1e-9
#define MAXLOG
#define INF (long long)1e18
#define MOD
#define prt(a) printf("%d\n", a)
#define prt2(a, b) printf("%d %d\n", a, b)
#define prt3(a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,978 | 753,979 | u934308457 | cpp |
p02949 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 2505, N = 1e4 + 5;
struct node {
ll to, next, dis;
} edge[N];
vector<ll> mp[M];
ll head[M], cnt;
ll minn[M], tot[M];
bool vis[M], can[M];
queue<ll> q;
inline void add(ll ... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 2505, N = 1e4 + 5;
struct node {
ll to, next, dis;
} edge[N];
vector<ll> mp[M];
ll head[M], cnt;
ll minn[M], tot[M];
bool vis[M], can[M];
queue<ll> q;
inline void add(ll ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,980 | 753,981 | u660361728 | cpp |
p02949 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operation.unary.add"
] | 753,987 | 753,988 | u526630579 | cpp |
p02949 | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector... | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 753,989 | 753,990 | u058317639 | cpp |
p02949 | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector... | //#pragma once
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib> // srand,rand
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
... | 753,991 | 753,990 | u058317639 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
struct Graph {
struct Edge {
int u, v;
int cost;
Edge(int _u, int _v, int _cost) : u(_u), v(_v), cost(_cost) {}
};
int n, m;
bool is_digraph;
vector<vector<int>> g;
vector<Edge> e;
Graph(int _n) : n(_n), m(0) {
assert(n >= 1);
g.resize(n... | #include <bits/stdc++.h>
using namespace std;
struct Graph {
struct Edge {
int u, v;
int cost;
Edge(int _u, int _v, int _cost) : u(_u), v(_v), cost(_cost) {}
};
int n, m;
bool is_digraph;
vector<vector<int>> g;
vector<Edge> e;
Graph(int _n) : n(_n), m(0) {
assert(n >= 1);
g.resize(n... | [
"call.arguments.change",
"expression.operation.unary.add"
] | 753,997 | 753,998 | u031986221 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define al... | [
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 754,006 | 754,007 | u069450081 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define forn(i, n) for (ll i = 0; i < n; i++)
#define fore(i, a, b) for (ll i = a; i <= b; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define fi first
#define se second
#defi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 754,011 | 754,012 | u576115185 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define MP make_pair
#define PB push_back
#define PII pair<int, int>
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 3005;
const double pi = acos(-1);
mt19... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define MP make_pair
#define PB push_back
#define PII pair<int, int>
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 5005;
const double pi = acos(-1);
mt19... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change",
"call.arguments.change"
] | 754,013 | 754,014 | u847307867 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2500;
int N, M, P;
vector<pii> adj[MAXN + 10];
ll dist[MAXN + 10], ans;
int main() {
int i, j;
scanf("%d%d%d", &N, &M, &P);
for (i = 1; i <= M; i++) {
int a, b, c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2500;
int N, M, P;
vector<pii> adj[MAXN + 10];
ll dist[MAXN + 10], ans;
int main() {
int i, j;
scanf("%d%d%d", &N, &M, &P);
for (i = 1; i <= M; i++) {
int a, b, c;
... | [
"control_flow.loop.for.condition.change"
] | 754,033 | 754,034 | u539847337 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2500;
int N, M, P;
vector<pii> adj[MAXN + 10];
int dist[MAXN + 10], ans;
int main() {
int i, j;
scanf("%d%d%d", &N, &M, &P);
for (i = 1; i <= M; i++) {
int a, b, c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2500;
int N, M, P;
vector<pii> adj[MAXN + 10];
ll dist[MAXN + 10], ans;
int main() {
int i, j;
scanf("%d%d%d", &N, &M, &P);
for (i = 1; i <= M; i++) {
int a, b, c;
... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 754,035 | 754,034 | u539847337 | cpp |
p02949 | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr L... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr L... | [] | 754,040 | 754,041 | u028496463 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
int j = 1;
vector<int> A(N);
for (int i = 1; i < N + 1; i++) {
int S = i / pow(10, j);
if (S >= 1)
j++;
A.at(j)++;
}
for (int j = 1; j < N; j += 2) {
count += A.at(j);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
int j = 1;
vector<int> A(N + 1);
for (int i = 1; i < N + 1; i++) {
int S = i / pow(10, j);
if (S >= 1)
j++;
A.at(j)++;
}
for (int j = 1; j < N + 1; j += 2) {
count += A.at(j);
}
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 754,064 | 754,065 | u028906014 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
int main() {
int n;
cin >> n;
int s = 0;
fori(n + 1) { s += ((to_string(i + 1).size()) % 2); }
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
int main() {
int n;
cin >> n;
int s = 0;
fori(n) { s += ((to_string(i + 1).size()) % 2); }
cout << s;
return 0;
} | [
"expression.operation.binary.remove"
] | 754,066 | 754,067 | u344810256 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int power(int a, int b) {
long long int mul = 1;
while (b > 0) {
mul *= a;
b--;
}
return mul;
}
int main() {
int n, a, d = 0, sum = 0;
cin >> n;
a = n;
while (a > 0) {
a /= 10;
d++;
}
if (d % 2 == 0) {
d--;
while (d > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int power(int a, int b) {
long long int mul = 1;
while (b > 0) {
mul *= a;
b--;
}
return mul;
}
int main() {
int n, a, d = 0, sum = 0;
cin >> n;
a = n;
while (a > 0) {
a /= 10;
d++;
}
if (d % 2 == 0) {
d--;
while (d > 0) {
... | [
"call.arguments.change",
"assignment.value.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 754,068 | 754,069 | u559021558 | cpp |
p02952 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"control_flow.loop.condition.change"
] | 754,071 | 754,072 | u516525290 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
string s = to_string(i);
if (s.length() % 2 == 1)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
if (s.length() % 2 == 1)
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,087 | 754,088 | u503841284 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int CountOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum++;
n /= 10;
}
return sum;
}
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
if (CountOfDigits(i) % 2 == 1)
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int CountOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum++;
n /= 10;
}
return sum;
}
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; i++) {
if (CountOfDigits(i) % 2 == 1)
count++;
}
cout << coun... | [
"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"
] | 754,101 | 754,102 | u533566373 | 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 (1 <= i || i <= 9) {
ans++;
}
if (100 <= i || i <= 999) {
ans++;
}
if (10000 <= i || i <= 99999) {
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 (1 <= i && i <= 9) {
ans++;
}
if (100 <= i && i <= 999) {
ans++;
}
if (10000 <= i && i <= 99999) {
ans++;
}
}
cout << ans << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 754,111 | 754,112 | u420514616 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
if (n < 10)
count = n;
else {
count += 9;
if (n > 100) {
if (n < 1000)
count += (n - 100) + 1;
else if (n < 10000)
count += 1000 - 100;
else {
count += 1000 - 100;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
if (n < 10)
count = n;
else {
count += 9;
if (n >= 100) {
if (n < 1000)
count += (n - 100) + 1;
else if (n < 10000)
count += 1000 - 100;
else {
count += 1000 - 100;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 754,119 | 754,120 | u538400413 | 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++) {
int ctr = 0;
int cpy = n;
while (cpy) {
cpy /= 10;
ctr++;
}
if (ctr % 2 == 1)
ans++;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
int ctr = 0;
int cpy = i;
while (cpy) {
cpy /= 10;
ctr++;
}
if (ctr % 2 == 1)
ans++;
}
cout << ans << '\n';
return 0;
} | [
"variable_declaration.value.change",
"identifier.change"
] | 754,125 | 754,126 | u248554859 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int m = log10(i);
if (m % 2 == 1)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int m = log10(i) + 1;
if (m % 2 == 1)
ans++;
}
cout << ans << endl;
} | [
"assignment.change"
] | 754,139 | 754,140 | u873762144 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, ans = 0;
cin >> n;
int k = 0, tmp = n;
while (tmp > 0) {
tmp /= 10;
k++;
}
if (k == 1)
ans += n % 10;
if (k == 2)
ans += 9;
if (k == 3)
ans += n % 100 + 9 + 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, ans = 0;
cin >> n;
int k = 0, tmp = n;
while (tmp > 0) {
tmp /= 10;
k++;
}
if (k == 1)
ans += n % 10;
if (k == 2)
ans += 9;
if (k == 3)
ans += n - 100 + 9 + 1... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,143 | 754,144 | u690475097 | cpp |
p02952 | #include <iostream>
int digit(int n) {
int c = 0;
while (n != 0) {
c++;
n /= 10;
}
return c;
}
int main() {
int n, c = 0;
std::cin >> n;
for (int i = 1; i <= n; i++)
if (digit(i))
c++;
std::cout << c;
return 0;
}
| #include <iostream>
int digit(int n) {
int c = 0;
while (n != 0) {
c++;
n /= 10;
}
return c;
}
int main() {
int n, c = 0;
std::cin >> n;
for (int i = 1; i <= n; i++)
if (digit(i) % 2)
c++;
std::cout << c;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 754,147 | 754,148 | u467710662 | cpp |
p02952 | #include <cmath>
#include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 1;
int temp = n;
while (temp > 9) {
++cnt;
temp /= 10;
}
int ans = 0;
for (int i = 1; i < cnt; ++i)
if (i % 2 == 1)
ans += 9 * std::pow(10, cnt - 1);
if (cnt % 2 == 1)
ans += n - std::pow(10, cnt -... | #include <cmath>
#include <iostream>
int main() {
int n;
std::cin >> n;
int cnt = 1;
int temp = n;
while (temp > 9) {
++cnt;
temp /= 10;
}
int ans = 0;
for (int i = 1; i < cnt; ++i)
if (i % 2 == 1)
ans += 9 * std::pow(10, i - 1);
if (cnt % 2 == 1)
ans += n - std::pow(10, cnt - 1... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 754,149 | 754,150 | u864752370 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N - 1 << endl;
} else if (N < 100) {
cout << 9 << endl;
} else if (N < 1000) {
cout << 9 + (N - 99) << endl;
} else if (N < 10000) {
cout << 909 << endl;
} else if (N < 100000) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N << endl;
} else if (N < 100) {
cout << 9 << endl;
} else if (N < 1000) {
cout << 9 + (N - 99) << endl;
} else if (N < 10000) {
cout << 909 << endl;
} else if (N < 100000) {
cout << 909 ... | [
"expression.operation.binary.remove"
] | 754,163 | 754,164 | u313124728 | cpp |
p02952 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース... | [
"call.arguments.add"
] | 754,167 | 754,168 | u154645927 | cpp |
p02952 | #include <algorithm> //辞書順はnext_permutation
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swap(数値交換)
#include <vector>
#define rt "\n"
#define rep... | #include <algorithm> //辞書順はnext_permutation
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swap(数値交換)
#include <vector>
#define rt "\n"
#define rep... | [
"literal.number.change",
"assignment.value.change"
] | 754,174 | 754,175 | u742306624 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int power(int a) {
if (a == 0)
return 1;
else
return 10 * power(a - 1);
}
int main() {
int N;
cin >> N;
int tmp = N;
int dig = 0;
wh... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int power(int a) {
if (a == 0)
return 1;
else
return 10 * power(a - 1);
}
int main() {
int N;
cin >> N;
int tmp = N;
int dig = 0;
wh... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,180 | 754,181 | u797165415 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef long long ll;
#define ALL(V) V.begin(), V.end()
template <class T, class U> boo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef long long ll;
#define ALL(V) V.begin(), V.end()
template <class T, class U> boo... | [
"literal.number.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 754,182 | 754,183 | u132687480 | cpp |
p02952 | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= ... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 754,191 | 754,192 | u623468376 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
if (std::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 (std::to_string(i).size() % 2 == 1) {
ans++;
}
}
cout << ans << 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"
] | 754,201 | 754,202 | u249218227 | cpp |
p02952 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 754,217 | 754,218 | u811004127 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | [
"call.remove",
"call.arguments.change"
] | 754,219 | 754,220 | u355254193 | cpp |
p02952 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i < n; i++) {
if (to_string(i).size() % 2 == 1)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).size() % 2 == 1)
cnt++;
}
cout << cnt << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,228 | 754,229 | u094619686 | cpp |
p02952 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (to_string(i).size() % 2 == 1)
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).size() % 2 == 1)
cnt++;
}
cout << cnt << 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"
] | 754,230 | 754,229 | u094619686 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans;
for (int i = 1; i < N + 1; 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 + 1; i++) {
if ((to_string(i)).size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 754,232 | 754,233 | u297195722 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
rep(i, n) {
if (to_string(i).size() % 2 == 1)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
rep(i, n) {
if (to_string(i + 1).size() % 2 == 1)
ans++;
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 754,241 | 754,242 | u924451152 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
typedef pair<int, int> pii; // pair<int, int> に pii という別名を付ける
int main() {
int N, count = 0;
cin >> N;
if (N > 10000) {
count += min(90000, N - 10000 + 1);
}
... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
typedef pair<int, int> pii; // pair<int, int> に pii という別名を付ける
int main() {
int N, count = 0;
cin >> N;
if (N >= 10000) {
count += min(90000, N - 10000 + 1);
}... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 754,243 | 754,244 | u275212209 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result = 0;
for (int i = 1; i <= n; i++) {
if (i < 10)
result++;
if (99 < i && i < 1000)
result++;
if (9999 < i)
result++;
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result = 0;
for (int i = 1; i <= n; i++) {
if (i < 10)
result++;
if (99 < i && i < 1000)
result++;
if (9999 < i && i < 100000)
result++;
}
cout << result << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 754,250 | 754,251 | u334553376 | cpp |
p02952 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int count = 0;
while (n > 0) {
if (n >= 1 && n <= 9 || n >= 100 && n <= 999 || n >= 10000 && n <= 9999) {... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int count = 0;
while (n > 0) {
if (n >= 1 && n <= 9 || n >= 100 && n <= 999 || n >= 10000 && n <= 99999) ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,257 | 754,258 | u553461888 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int NT = N;
int pom = 1;
long long suma = 0;
bool czy = true;
while (N /= 10) {
pom *= 10;
if (czy) {
suma += pom - pom / 10;
}
czy = !czy;
}
if (czy)
suma += NT % pom + 1;
cout << suma;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int NT = N;
int pom = 1;
long long suma = 0;
bool czy = true;
while (N /= 10) {
pom *= 10;
if (czy) {
suma += pom - pom / 10;
}
czy = !czy;
}
if (czy)
suma += NT - pom + 1;
cout << suma;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,263 | 754,264 | u898595510 | cpp |
p02952 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
for (int i = 1; i < N; i++) {
if ((int(log10(i)) + 1) % 2) {
count++;
}
}
cout << count;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int count = 0;
int N;
cin >> N;
for (int i = 1; i < N + 1; i++) {
if ((int(log10(i)) + 1) % 2) {
count++;
}
}
cout << count;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 754,269 | 754,270 | u573537453 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++)
if (to_string(i).size() % 2 == 0)
cnt++;
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++)
if (to_string(i).size() % 2 == 1)
cnt++;
cout << cnt << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,276 | 754,277 | u071019032 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 0; i < N; i++) {
string s = to_string(i);
if (s.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++) {
string s = to_string(i);
if (s.size() % 2 == 1) {
ans++;
}
}
cout << ans << 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"
] | 754,282 | 754,283 | u584139221 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int ans;
if (n < 10) {
ans = n;
} else if (n < 100) {
ans = 9;
} else if (n < 1000) {
ans = n - 99 + 9;
} else if (n < 10000) {
ans = 909;
} else if (n < 100000) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
int ans;
if (n < 10) {
ans = n;
} else if (n < 100) {
ans = 9;
} else if (n < 1000) {
ans = n - 99 + 9;
} else if (n < 10000) {
ans = 909;
} else if (n < 100000) {... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,288 | 754,289 | u741134767 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int s = 0; pow(10, s) < N; ++s) {
if (s % 2 == 0 && pow(10, s + 1) <= N) {
count = count + (pow(10, s + 1) - pow(10, s));
} else if (s % 2 == 0) {
count = count + (N - pow(10, s) + 1);
}
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int s = 0; pow(10, s) <= N; ++s) {
if (s % 2 == 0 && pow(10, s + 1) <= N) {
count = count + (pow(10, s + 1) - pow(10, s));
} else if (s % 2 == 0) {
count = count + (N - pow(10, s) + 1);
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,296 | 754,297 | u304862095 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, cnt = 0;
cin >> N;
for (i = 1; i <= N; i++) {
if (1 <= i <= 9 || 100 <= i <= 999 || 10000 <= i <= 99999)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, cnt = 0;
cin >> N;
for (i = 1; i <= N; i++) {
if (1 <= i && i <= 9 || 100 <= i && i <= 999 || 10000 <= i && i <= 99999)
cnt++;
}
cout << cnt << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 754,298 | 754,299 | u089241640 | cpp |
p02952 | #include <iostream>
using namespace std;
int main() {
int n, u;
cin >> n;
int c = n, n_d = 0;
while (c > 0) {
n_d++;
c = c / 10;
}
int sum = 0, k = 1;
for (int i = 1; i <= n_d - 1; i++) {
if (i % 2 == 1) {
sum = sum + (9 * k);
}
k = k * 10;
}
if (n_d % 2 == 1) {
for (int ... | #include <iostream>
using namespace std;
int main() {
int n, u = 1;
cin >> n;
int c = n, n_d = 0;
while (c > 0) {
n_d++;
c = c / 10;
}
int sum = 0, k = 1;
for (int i = 1; i <= n_d - 1; i++) {
if (i % 2 == 1) {
sum = sum + (9 * k);
}
k = k * 10;
}
if (n_d % 2 == 1) {
for (... | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 754,310 | 754,311 | u476054945 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, cnt;
int n;
cin >> n;
if (9 >= n)
cout << n;
else if (99 >= n)
cout << 9;
else if (999 >= n)
cout << n - 90;
else if (9999 >= n)
cout << 909;
else if (99999 >= n)
cout << n - 9090;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, cnt;
int n;
cin >> n;
if (9 >= n)
cout << n;
else if (99 >= n)
cout << 9;
else if (999 >= n)
cout << n - 90;
else if (9999 >= n)
cout << 909;
else if (99999 >= n)
cout << n - 9090;
else
cout << 90909;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 754,314 | 754,315 | u952130512 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, ans;
cin >> a;
if (a < 10) {
ans = a;
} else if (a >= 10 && a < 100) {
ans = 9;
} else if (a >= 100 && a < 1000) {
ans = a - 90;
} else if (a >= 1000 && a < 10000) {
ans = 909;
} else if (a >= 10000 && a < 100000) {
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, ans;
cin >> a;
if (a < 10) {
ans = a;
} else if (a >= 10 && a < 100) {
ans = 9;
} else if (a >= 100 && a < 1000) {
ans = a - 90;
} else if (a >= 1000 && a < 10000) {
ans = 909;
} else if (a >= 10000 && a < 100000) {
ans... | [
"literal.number.change",
"assignment.value.change"
] | 754,316 | 754,317 | u431125128 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, ans;
cin >> a;
if (a < 10) {
ans = a;
} else if (a >= 10 && a < 100) {
ans = 9;
} else if (a >= 100 && a < 1000) {
ans = a - 90;
} else if (a >= 1000 && a < 10000) {
ans = 909;
} else if (a >= 10000 && a < 100000) {
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, ans;
cin >> a;
if (a < 10) {
ans = a;
} else if (a >= 10 && a < 100) {
ans = 9;
} else if (a >= 100 && a < 1000) {
ans = a - 90;
} else if (a >= 1000 && a < 10000) {
ans = 909;
} else if (a >= 10000 && a < 100000) {
ans... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,318 | 754,317 | u431125128 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int n, c;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
if (to_string(i).length() % 2 == 1) {
c++;
}
}
cout << n;
} | #include <bits/stdc++.h>
using namespace std;
int n, c;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
if (to_string(i).length() % 2 == 1) {
c++;
}
}
cout << c;
} | [
"identifier.change",
"io.output.change"
] | 754,319 | 754,320 | u397732894 | cpp |
p02952 | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair... | /*
Author: Arham_doshi
@quote "Code like there's no tommorow!"
*************************************** UNAUTHORISED COPYING OF CODE
PROHIBITED **********************************
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define pb push_back
#define pf push_front
#define pii pair... | [
"expression.operation.binary.add"
] | 754,321 | 754,322 | u488763956 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10) {
cout << n << endl;
} else if (n < 100) {
cout << 9 << endl;
} else if (n < 1000) {
cout << 9 + n - 90 << endl;
} else if (n < 10000) {
cout << 909 << endl;
} else if (n < 100000) {
cout << 909 + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 10) {
cout << n << endl;
} else if (n < 100) {
cout << 9 << endl;
} else if (n < 1000) {
cout << 9 + n - 99 << endl;
} else if (n < 10000) {
cout << 909 << endl;
} else if (n < 100000) {
cout << 909 + ... | [
"literal.number.change",
"io.output.change"
] | 754,341 | 754,342 | u974931918 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n, ans = 0;
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n, ans = 0;
cin ... | [
"call.arguments.add"
] | 754,367 | 754,368 | u688825490 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int number = 0;
for (int i = 1; i < N + 1; i++) {
int count = 0;
int number = i;
while (number != 0) {
number /= 10;
count++;
}
if (count % 2 == 1) {
number++;
}
}
cout << number << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int number = 0;
for (int i = 1; i < N + 1; i++) {
int count = 0;
int a = i;
while (a != 0) {
a /= 10;
count++;
}
if (count % 2 == 1) {
number++;
}
}
cout << number << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 754,375 | 754,376 | u025287757 | cpp |
p02952 | #include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
for (int i = 0; i <= N; ++i) {
if (to_string(i).size() % 2)
++ans;
}
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int ans = 0;
int N;
cin >> N;
for (int i = 1; i <= N; ++i) {
if (to_string(i).size() % 2)
++ans;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 754,377 | 754,378 | u318334550 | cpp |
p02952 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N + 1; i++) {
if (1 <= i && i < 10)
ans++;
if (100 <= i && i < 1000)
ans++;
if (10000 <= i && i < 1000000)
ans++;
if (1000000 <= i && i < 100000000)
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N + 1; i++) {
if (1 <= i && i < 10)
ans++;
if (100 <= i && i < 1000)
ans++;
if (10000 <= i && i < 100000)
ans++;
if (1000000 <= i && i < 100000000)
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,397 | 754,398 | u393754572 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 9999 && i < 100000)
s++;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a + 1) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 9999 && i < 100000)
s++;
}
cout << s << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 754,410 | 754,411 | u551813187 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 10000 && i < 100000)
s++;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a + 1) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 9999 && i < 100000)
s++;
}
cout << s << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,412 | 754,411 | u551813187 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a + 1) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 1000 && i < 100000)
s++;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a + 1) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 9999 && i < 100000)
s++;
}
cout << s << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,413 | 754,411 | u551813187 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 1000 && i < 100000)
s++;
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < n; i++)
int main() {
int a, s;
cin >> a;
s = 0;
rep(i, a + 1) {
if (i < 10)
s++;
else if (i > 99 && i < 1000)
s++;
else if (i > 9999 && i < 100000)
s++;
}
cout << s << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 754,414 | 754,411 | u551813187 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5, M = 1e3 + 5, OO = 0x3f3f3f3f;
typedef long long ll;
int n;
int main() {
cin >> n;
if (n <= 9)
cout << n << endl;
else if (n <= 100)
cout << 9 << endl;
else if (n <= 999)
cout << n - 100 + 10;
else if (n <= 10000)
cout <... | #include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5, M = 1e3 + 5, OO = 0x3f3f3f3f;
typedef long long ll;
int n;
int main() {
cin >> n;
if (n <= 9)
cout << n << endl;
else if (n < 100)
cout << 9 << endl;
else if (n <= 999)
cout << n - 100 + 10;
else if (n < 10000)
cout << ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 754,415 | 754,416 | u563495615 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int num = 0;
repd(i, 1, n) {
string s = to_string(i);
if (s.size() % 2 != 0)
num++;
}
cout <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int num = 0;
repd(i, 1, n + 1) {
string s = to_string(i);
if (s.size() % 2 != 0)
num++;
}
cou... | [
"expression.operation.binary.add"
] | 754,417 | 754,418 | u199846743 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int num = 0;
rep(i, n) {
string s = to_string(i);
if (s.size() % 2 != 0)
num++;
}
cout << num... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int num = 0;
repd(i, 1, n + 1) {
string s = to_string(i);
if (s.size() % 2 != 0)
num++;
}
cou... | [
"call.arguments.add"
] | 754,419 | 754,418 | u199846743 | cpp |
p02952 | #include <algorithm>
#include <iostream>
int main() {
int n;
int r = 0;
std::cin >> n;
int a = 1;
while (a < n) {
r += std::min(a * 10, n + 1) - a;
a *= 100;
}
std::cout << r;
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
int n;
int r = 0;
std::cin >> n;
int a = 1;
while (a <= n) {
r += std::min(a * 10, n + 1) - a;
a *= 100;
}
std::cout << r;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 754,423 | 754,424 | u628544249 | cpp |
p02952 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
bool kisu(int x) { return to_string(x).size() % 2 ? true : false; }
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
if (kisu(i))
ans++;
}
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
bool kisu(int x) { return to_string(x).size() % 2 == 1 ? true : false; }
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (kisu(i))
ans++;
}
cout << ans << endl;
retu... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,425 | 754,426 | u654240084 | cpp |
p02952 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
if (N < 10) {
printf("%d\n", N);
} else if (10 <= N && N < 100) {
printf("%d\n", 9);
} else if (100 <= N && N < 1000) {
printf("%d\n", 9 + N - 99);
} else if (1000 <= N && N ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
if (N < 10) {
printf("%d\n", N);
} else if (10 <= N && N < 100) {
printf("%d\n", 9);
} else if (100 <= N && N < 1000) {
printf("%d\n", 9 + N - 99);
} else if (1000 <= N && N ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 754,441 | 754,442 | u684448032 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,450 | 754,451 | u186089447 | cpp |
p02952 | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
int count = 0;
int dec = 10;
if (N < dec)
count = N;
else
while (N >= dec) {
count += dec * 0.9;
if (N < dec * 100 && N > dec * 10) {
count += N - dec * 10;
break;
}
dec *= 100;
}
printf("%d", count... | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
int count = 0;
int dec = 10;
if (N < dec)
count = N;
else
while (N >= dec) {
count += dec * 0.9;
if (N < dec * 100 && N >= dec * 10) {
count += N - dec * 10 + 1;
break;
}
dec *= 100;
}
printf("%d", ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 754,454 | 754,455 | u568501780 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, ans = 0;
cin >> n;
ans += (n, 9);
if (n > 99) {
ans += min(n - 99, 999 - 99);
}
if (n > 9999) {
ans += min(n - 9999, 99999 - 9999);
}
cout << ans;
return ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, ans = 0;
cin >> n;
ans += min(n, 9);
if (n > 99) {
ans += min(n - 99, 999 - 99);
}
if (n > 9999) {
ans += min(n - 9999, 99999 - 9999);
}
cout << ans;
retu... | [
"call.add"
] | 754,458 | 754,459 | u380762346 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n < 10)
printf("%d", n);
else if (n < 100)
printf("9");
else if (n < 1000)
printf("%d", n - 90);
else if (n < 10000)
printf("909");
else if (n < 100000)
printf("%d", n - 90909);
else
printf("90... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n < 10)
printf("%d", n);
else if (n < 100)
printf("9");
else if (n < 1000)
printf("%d", n - 90);
else if (n < 10000)
printf("909");
else if (n < 100000)
printf("%d", n - 9090);
else
printf("90... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"literal.string.change"
] | 754,472 | 754,471 | u735447709 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int cp = i, digit = 0;
while (cp) {
digit++;
cp /= 10;
}
if (digit % 2)
cnt++;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int cp = i, digit = 0;
while (cp) {
digit++;
cp /= 10;
}
if (digit % 2)
cnt++;
}
cout << cnt << 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"
] | 754,473 | 754,474 | u288432959 | cpp |
p02952 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,475 | 754,476 | u288432959 | cpp |
p02952 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 754,477 | 754,476 | u288432959 | cpp |
p02952 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,478 | 754,476 | u288432959 | cpp |
p02952 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
if (n < 10) {
cout << n << endl;
} else if (n < 100) {
cout << 9 << endl;
} el... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
if (n < 10) {
cout << n << endl;
} else if (n < 100) {
cout << 9 << endl;
} el... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 754,487 | 754,488 | u229008310 | cpp |
p02952 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int l = to_string(n).size();
int ans = 0;
switch (l) {
case 1:
ans = n;
break;
case 2:
ans = 9;
break;
case 3:
ans = 9 + n % 100 + 1;
break;
case 4:
ans = 909;
break;
case 5:
ans = 909 + ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int l = to_string(n).size();
int ans = 0;
switch (l) {
case 1:
ans = n;
break;
case 2:
ans = 9;
break;
case 3:
ans = 9 + n - 100 + 1;
break;
case 4:
ans = 909;
break;
case 5:
ans = 909 + ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 754,492 | 754,493 | u709142358 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int high, low;
for (int i = 0; i < 5; i += 2) {
high = pow(10, i + 1);
low = pow(10, i);
if (high <= n)
ans += 9 * low;
else if (low < n) {
ans += n - low + 1;
break;
} else
b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int high, low;
for (int i = 0; i < 5; i += 2) {
high = pow(10, i + 1);
low = pow(10, i);
if (high <= n)
ans += 9 * low;
else if (low <= n) {
ans += n - low + 1;
break;
} else
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 754,498 | 754,499 | u661308718 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N << endl;
}
if (N >= 10 && N < 100) {
cout << "9" << endl;
}
if (N >= 100 && N < 1000) {
cout << N - 90 << endl;
}
if (N >= 1000 && N < 10000) {
cout << "909" << endl;
}
if (N >= 100... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N < 10) {
cout << N << endl;
}
if (N >= 10 && N < 100) {
cout << "9" << endl;
}
if (N >= 100 && N < 1000) {
cout << N - 90 << endl;
}
if (N >= 1000 && N < 10000) {
cout << "909" << endl;
}
if (N >= 100... | [
"control_flow.branch.if.condition.change"
] | 754,503 | 754,505 | u387371565 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count;
cin >> n;
count = 0;
for (int i = 0; i <= n; i++) {
if (to_string(i).size() % 2 == 1) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count;
cin >> n;
count = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).size() % 2 == 1) {
count++;
}
}
cout << count << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 754,512 | 754,513 | u770009793 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
typedef pair<int, int> P;
int main()... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
typedef pair<int, int> P;
int main()... | [
"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"
] | 754,516 | 754,517 | u227379863 | cpp |
p02952 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#defin... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#defin... | [
"control_flow.branch.if.condition.change"
] | 754,532 | 754,533 | u757738907 | cpp |
p02952 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int counter = 0;
for (int i = 1; i < N; ++i) {
if (to_string(i).size() % 2 == 1)
counter++;
}
cout << counter << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int counter = 0;
for (int i = 1; i <= N; ++i) {
if (to_string(i).size() % 2 == 1)
counter++;
}
cout << counter << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,538 | 754,539 | u419501474 | cpp |
p02952 | #include <stdio.h>
int main(void) {
int n;
int ans = 0;
int a = 10;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
if (i < a) {
ans++;
}
if (i == a * 10) {
ans++;
a *= 100;
}
printf("%d", ans);
}
return 0;
}
| #include <stdio.h>
int main(void) {
int n;
int ans = 0;
int a = 10;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
if (i < a) {
ans++;
}
if (i == a * 10) {
ans++;
a *= 100;
}
}
printf("%d", ans);
return 0;
}
| [] | 754,540 | 754,541 | u195269284 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i < n; i++) {
string s = to_string(i);
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 754,548 | 754,549 | u291178324 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.