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 |
|---|---|---|---|---|---|---|---|
p02952 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 753,395 | 753,396 | u156778176 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = n;
for (int i = 90, j = 100; j < n; i *= 100, j *= 100)
ans -= i;
int size = to_string(n).size();
if (size % 2 == 0) {
int p = 1;
while (size > 1)
p *= 10, --si... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = n;
for (int i = 90, j = 100; j <= n; i *= 100, j *= 100)
ans -= i;
int size = to_string(n).size();
if (size % 2 == 0) {
int p = 1;
while (size > 1)
p *= 10, --s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,397 | 753,398 | u104613587 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str;
int ans = 0;
for (int i = 1; i < N; i++) {
str = to_string(i);
if (str.size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string str;
int ans = 0;
for (int i = 1; i < N + 1; i++) {
str = to_string(i);
if (str.size() % 2 == 1)
ans++;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 753,421 | 753,422 | u171046846 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
ll ans = 0;
if (N > 9) {
ans += 9;
} else {
cout << N << endl;
return 0;
}
if (N > 99) {
if (N > 999) {
ans += 900;
} else {
ans += N - 99;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
ll ans = 0;
if (N > 9) {
ans += 9;
} else {
cout << N << endl;
return 0;
}
if (N > 99) {
if (N > 999) {
ans += 900;
} else {
ans += N - 99;
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 753,431 | 753,432 | u072293789 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans;
string s;
for (int i = 1; i <= n; i++) {
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;
string s;
for (int i = 1; i <= n; i++) {
s = to_string(i);
if (s.size() % 2 == 1) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 753,439 | 753,440 | u113731459 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
for (int i = 1; i < n; i *= 100) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
for (int i = 1; i <= n; i *= 100) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,441 | 753,442 | u495704746 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,451 | 753,452 | u894339989 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl... | [
"expression.operation.binary.remove"
] | 753,453 | 753,454 | u709144111 | cpp |
p02952 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,455 | 753,456 | u709144111 | cpp |
p02952 | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | // Author: Fuadul Hasan(fuadul202@gmail.com)
// BSMRSTU,Gopalganj
#include <bits/stdc++.h>
using namespace std;
int tc = 1;
#define happy ios::sync_with_stdio(false);
#define coding cin.tie(0);
#define F first
#define S second
#define mp make_pair
#define ll long long
#define Pi atan(1) * 4
#define pb push_back
#define... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,467 | 753,468 | u526278960 | 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 (i >= 0 && i < 10) {
ans += 1;
} else if (i > 99 && i < 1000) {
ans += 1;
} else if (i > 9999 && i < 100000) {
ans += 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
if (i > 0 && i < 10) {
ans += 1;
} else if (i > 99 && i < 1000) {
ans += 1;
} else if (i > 9999 && i < 100000) {
ans += 1;
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,469 | 753,470 | u335151353 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
int count = 0;
rep(i, N) {
if (i == 0)
continue;
string s = to_string(i);
if (s.length() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
int count = 0;
rep(i, N + 1) {
if (i == 0)
continue;
string s = to_string(i);
if (s.lengt... | [
"expression.operation.binary.add"
] | 753,475 | 753,476 | u978535698 | cpp |
p02952 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int keta = 0;
if (n < 10) {
cout << n;
return 0;
}
for (int i = 10;; i *= 10) {
if (i > n) {
keta = i / 10;
break;
}
}
if (keta... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int keta = 0;
if (n < 10) {
cout << n;
return 0;
}
for (int i = 10;; i *= 10) {
if (i > n) {
keta = i / 10;
break;
}
}
if (keta... | [
"literal.string.change",
"io.output.change"
] | 753,479 | 753,480 | u047572420 | 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 n = i;
int sum = 0;
while (n > 0) {
n /= 10;
sum++;
}
if (sum % 2 == 1)
ans++;
}
cout << ans;
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 n = i;
int sum = 0;
while (n > 0) {
n /= 10;
sum++;
}
if (sum % 2 == 1)
ans++;
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,485 | 753,486 | u109191542 | 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++) {
int n = i;
int sum = 0;
while (n > 0) {
n /= 10;
sum++;
}
if (sum % 2 == 1)
ans++;
}
cout << ans;
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 n = i;
int sum = 0;
while (n > 0) {
n /= 10;
sum++;
}
if (sum % 2 == 1)
ans++;
}
cout << ans;
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,487 | 753,486 | u109191542 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, ten = 10;
cin >> n;
for (;;) {
if (n >= ten) {
ans += ten - 1;
} else if (n >= ten / 10) {
cout << ans + (n / (ten / 10) - 1) * (ten / 10) + n % (ten / 10) + 1
<< endl;
break;
} else {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0, ten = 10;
cin >> n;
for (;;) {
if (n >= ten) {
ans += ten - ten / 10;
} else if (n >= ten / 10) {
cout << ans + (n / (ten / 10) - 1) * (ten / 10) + n % (ten / 10) + 1
<< endl;
break;
} else {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"assignment.change"
] | 753,488 | 753,489 | u490965711 | cpp |
p02952 | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int ans = 0, tmp = 1, tmp2, p = 100;
cin ... | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int ans = 0, tmp = 1, tmp2, p = 100;
cin ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,490 | 753,491 | u928591554 | cpp |
p02952 | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int ans = 0, tmp = 1, tmp2, p = 100;
cin ... | #include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
int ans = 0, tmp = 1, tmp2, p = 100;
cin ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,492 | 753,491 | u928591554 | cpp |
p02952 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
if (to_string(i + 1).size() % 2 == 0)
++ans;
}
co... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const long long INF = 1LL << 61;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
if (to_string(i + 1).size() % 2 != 0)
++ans;
}
co... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,524 | 753,525 | u289578952 | cpp |
p02952 | #include <bits/stdc++.h>
#define FOR(i, n) for (ll i = 0; i < n; i++)
#define FORR(i, n) for (ll i = n; i >= 0; i--)
#define FORS(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) accumulate(v.begin(), v.end(), 0)
#define SORT(v) sort(v.begin(), v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#d... | #include <bits/stdc++.h>
#define FOR(i, n) for (ll i = 0; i < n; i++)
#define FORR(i, n) for (ll i = n; i >= 0; i--)
#define FORS(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) accumulate(v.begin(), v.end(), 0)
#define SORT(v) sort(v.begin(), v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#d... | [
"variable_declaration.value.change"
] | 753,558 | 753,559 | u312666261 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N; i++) {
if (i >= 1 && i <= 9)
ans++;
if (i >= 100 && i <= 999)
ans++;
if (i >= 10000 && i <= 99999)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (i >= 1 && i <= 9)
ans++;
if (i >= 100 && i <= 999)
ans++;
if (i >= 10000 && i <= 99999)... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,589 | 753,590 | u763377272 | cpp |
p02952 | #include <stdio.h>
int main(void) {
int i, n, ans = 0;
scanf("%d", &n);
for (i = 1; i < 10; ++i)
if (i <= n)
++ans;
for (i = 100; i < 1000; ++i)
if (i <= n)
++ans;
for (i = 10000; i < 100000; ++i)
if (i <= n)
+ans;
printf("%lld", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int i, n, ans = 0;
scanf("%d", &n);
for (i = 1; i < 10; ++i)
if (i <= n)
++ans;
for (i = 100; i < 1000; ++i)
if (i <= n)
++ans;
for (i = 10000; i < 100000; ++i)
if (i <= n)
++ans;
printf("%lld", ans);
return 0;
} | [] | 753,593 | 753,594 | u440920318 | cpp |
p02952 | #include <stdio.h>
int main(void) {
int i, n, ans = 0;
scanf("%d", &n);
for (i = 1; i < 10; ++i)
if (i < n)
++ans;
for (i = 100; i < 1000; ++i)
if (i < n)
++ans;
for (i = 10000; i < 100000; ++i)
if (i < n)
+ans;
printf("%lld", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int i, n, ans = 0;
scanf("%d", &n);
for (i = 1; i < 10; ++i)
if (i <= n)
++ans;
for (i = 100; i < 1000; ++i)
if (i <= n)
++ans;
for (i = 10000; i < 100000; ++i)
if (i <= n)
++ans;
printf("%lld", ans);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,595 | 753,594 | u440920318 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int num(int m) {
int res = 9;
REP(i, m) { res *= 10; }
res /= 10;
return res;
}
int main() {
int n;
cin >> n;
int d = n;
int count = 0;
while (d > 0) {
d /= 10;
count++;
}
int res = 0;
if (count %... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int num(int m) {
int res = 9;
REP(i, m) { res *= 10; }
res /= 10;
return res;
}
int main() {
int n;
cin >> n;
int d = n;
int count = 0;
while (d > 0) {
d /= 10;
count++;
}
int res = 0;
if (count %... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,603 | 753,604 | u231354686 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int num(int m) {
int res = 9;
REP(i, m) { res *= 10; }
res /= 10;
return res;
}
int main() {
int n;
cin >> n;
int d = n;
int count = 0;
while (d > 0) {
d /= 10;
count++;
}
int res = 0;
if (count %... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int num(int m) {
int res = 9;
REP(i, m) { res *= 10; }
res /= 10;
return res;
}
int main() {
int n;
cin >> n;
int d = n;
int count = 0;
while (d > 0) {
d /= 10;
count++;
}
int res = 0;
if (count %... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 753,605 | 753,604 | u231354686 | cpp |
p02952 | #include <iostream>
using namespace std;
int GetDigit(int num) {
int digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
if (GetDigit(i) % 2 != 0)
count++;
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int GetDigit(int num) {
int digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n + 1; i++) {
if (GetDigit(i) % 2 != 0)
count++;
}
cout << count << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 753,610 | 753,611 | u878454346 | 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;
} | #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;
} | [
"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,612 | 753,613 | u576472702 | cpp |
p02952 | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | /*dismint|jjc*/
#include <bits/stdc++.h>
using namespace std;
#define forl(V, S, E) for (int V = S; V < E; V++)
#define ford(V, S, E) for (int V = S; V >= E; V--)
#define fore(E, X) for (auto &E : X)
#define println(X) cout << X << endl
#define printe(X) \
... | [
"expression.operation.binary.add"
] | 753,614 | 753,615 | u602301110 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
if (1 <= i && i <= 9) {
count++;
} else if (100 <= i && i <= 999) {
count++;
} else if (10000 <= i && i <= 99999) {
count++;
}
}
cout << count << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; i++) {
if (1 <= i && i <= 9) {
count++;
} else if (100 <= i && i <= 999) {
count++;
} else if (10000 <= i && i <= 99999) {
count++;
}
}
cout << count << 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,616 | 753,617 | u262451272 | cpp |
p02952 | #include <bits/stdc++.h>
#if ONLINE_JUDGE
#define DEBUG false
#else
#define DEBUG true
#endif
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
#if ONLINE_JUDGE
#define DEBUG false
#else
#define DEBUG true
#endif
#define fastcin() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define rep(i, n) for (int i = 0; ... | [
"call.arguments.add"
] | 753,620 | 753,621 | u428830428 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int check_digits(int n) {
int res = 0;
while (n > 0) {
res++;
n /= 10;
}
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 0; i < N; i++) {
if (check_digits(i) % 2)
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int check_digits(int n) {
int res = 0;
while (n > 0) {
res++;
n /= 10;
}
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
if (check_digits(i) % 2)
ans++;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,622 | 753,623 | u538808095 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i < N; i++) {
string s = to_string(i);
if (s.size() % 2 == 1)
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; i++) {
string s = to_string(i);
if (s.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,626 | 753,627 | u760748346 | 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++) {
if (n >= 1 && n <= 9 || n >= 100 && n <= 999 || n >= 10000 && n <= 99999)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i >= 1 && i <= 9 || i >= 100 && i <= 999 || i >= 10000 && i <= 99999)
ans++;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 753,634 | 753,635 | u578969098 | cpp |
p02952 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int ii = 1; ii <= N; ++ii) {
int digit = 0;
int tmp = ii;
while (tmp > 0) {
digit++;
tmp = tmp >> 1;
}
if (digit % 2 == 1) {
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int ii = 1; ii <= N; ++ii) {
int digit = 0;
int tmp = ii;
while (tmp > 0) {
digit++;
tmp /= 10;
}
if (digit % 2 == 1) {
ans+... | [
"assignment.change"
] | 753,657 | 753,658 | u762158020 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N + 1; i++) {
string str = std::to_string(i);
int n = str.size();
if (n % 2 == 1) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i < N + 1; i++) {
string s = to_string(i);
int n = s.size();
if (n % 2 == 1) {
count++;
}
}
cout << count << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_declaration.name.change",
"identifier.change"
] | 753,659 | 753,660 | u896053584 | 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 (to_string(i).length() % 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).length() % 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"
] | 753,666 | 753,667 | u085235341 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, j, n) for (int i = (j); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int ans = 0;
int n;
FOR(i, 1, n + 1) {
if (to_s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, j, n) for (int i = (j); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int ans = 0;
int n;
cin >> n;
FOR(i, 1, n + 1) {
... | [] | 753,673 | 753,674 | u103365231 | cpp |
p02952 | #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
if (a < 10)
printf("%d", a);
else if (a < 100)
printf("10");
else if (a < 1000)
printf("%d", a - 90);
else if (a < 10000)
printf("910");
else if (a < 100000)
printf("%d", a - 9090);
else
printf("90909");
return 0;
} | #include <stdio.h>
int main() {
int a;
scanf("%d", &a);
if (a < 10)
printf("%d", a);
else if (a < 100)
printf("9");
else if (a < 1000)
printf("%d", a - 90);
else if (a < 10000)
printf("909");
else if (a < 100000)
printf("%d", a - 9090);
else
printf("90909");
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 753,679 | 753,678 | u054782559 | cpp |
p02952 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ci... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ci... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 753,693 | 753,694 | u519759783 | 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++) {
string tmp = to_string(i);
if ((int)tmp.size() % 2 == 1) {
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++) {
string tmp = to_string(i);
if ((int)tmp.size() % 2 == 1) {
cnt++;
}
}
cout << cnt << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,706 | 753,707 | u515131769 | cpp |
p02952 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
... | [
"identifier.change",
"call.arguments.change"
] | 753,708 | 753,709 | u027479217 | 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 res = 0;
rep(i, n + 1) {
string s = to_string(i);
if (s.size() != 0)
res++;
}
cout << res << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
rep(i, n) {
string s = to_string(i);
if (s.size() % 2 != 0)
res++;
}
cout << res << endl;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 753,722 | 753,723 | u816145694 | cpp |
p02952 | #include <iostream>
using namespace std;
int digNum(int n) {
int digit = 1;
for (;;) {
if (n / 10 >= 1)
digit++;
else
return digit;
n /= 10;
}
}
int main() {
unsigned int N;
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
if (digNum(i) % 2 == 1)
ans++;
}
cout... | #include <iostream>
using namespace std;
int digNum(int n) {
int digit = 1;
for (;;) {
if (n / 10 >= 1)
digit++;
else
return digit;
n /= 10;
}
}
int main() {
unsigned int N;
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
if (digNum(i) % 2 == 1)
ans++;
}
cout... | [] | 753,727 | 753,728 | u483747145 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | [
"variable_declaration.value.change"
] | 753,729 | 753,730 | u560381579 | 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;
int main() {
int n, cnt = 0, num = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int n = i;
num = 0;
while (n) {
n /= 10;
num++;
}
if (num % 2 == 1)
cnt++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, cnt = 0, num = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int n = i;
num = 0;
while (n) {
n /= 10;
num++;
}
if (num % 2 == 1)
cnt++;
... | [
"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,736 | 753,737 | u654949547 | cpp |
p02952 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
if (to_string(i).size() % 2 == 1)
count++;
}... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
if (to_string(i + 1).size() % 2 == 1)
count++;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 753,738 | 753,739 | u999788719 | cpp |
p02952 | #include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
using namespace std;
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i < N; ++i) {
string n = to_string(i);
if (n.size() % 2 == 1) {
ans += 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define INF 1000000000
#define ll long long
using namespace std;
int main() {
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i < N + 1; ++i) {
string n = to_string(i);
// cout << i << endl;
if (n.size() % 2 == 1) {
ans += 1;
}
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 753,744 | 753,745 | u023958502 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
if (i >= 1 && i <= 9) {
count++;
}
if (i >= 100 && i <= 999) {
count++;
}
if (i >= 10000 && i <= 99999) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
if (i >= 1 && i <= 9) {
count++;
}
if (i >= 100 && i <= 999) {
count++;
}
if (i >= 10000 && i <= 99999) {
count++;
}
}
cout << count << 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,746 | 753,747 | u327950489 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int n, c = 0;
for (int i = 1; i <= n; i++) {
if (i < 10 || i > 99 && i < 1000 || i > 9999 && i < 100000)
c++;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
#define M 1000000007
int main() {
int n, c = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i < 10 || i > 99 && i < 1000 || i > 9999 && i < 100000)
c++;
}
cout << c;
} | [] | 753,754 | 753,755 | u987476436 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i < N; i++) {
int c = 0;
int j = i;
while (j > 0) {
j /= 10;
c += 1;
}
if (c % 2 != 0) {
count += 1;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i <= N; i++) {
int c = 0;
int j = i;
while (j > 0) {
j /= 10;
c += 1;
}
if (c % 2 != 0) {
count += 1;
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,762 | 753,763 | u817228348 | cpp |
p02952 | #include <stdio.h>
int main(void) {
//変数nを定義
int n;
scanf("%d", &n);
//奇数桁まるまるをカウント
int x = 10, res = 0;
while (x <= n) {
res += x - x / 10;
x *= 100;
}
if (n >= x / 10) {
res += n - x / 10 + 1;
}
printf("%d", &res);
return 0;
} | #include <stdio.h>
int main() {
//変数nを定義
int n;
scanf("%d", &n);
//奇数桁まるまるをカウント
int x = 10, res = 0;
while (x <= n) {
res += x - x / 10;
x *= 100;
}
if (n >= x / 10) {
res += n - x / 10 + 1;
}
printf("%d\n", res);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 753,775 | 753,776 | u240511938 | cpp |
p02952 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long int ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main()... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,781 | 753,782 | u729285002 | cpp |
p02952 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll... | [
"expression.operation.binary.add"
] | 753,787 | 753,788 | u853721692 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n; i++) {
string s = to_string(i);
if (s.size() % 2 == 1)
count++;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
if (s.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,789 | 753,790 | u799521877 | cpp |
p02952 | #include <iostream>
#include <string>
using namespace std;
bool judge(int n) {
bool ans = false;
int count = 0;
while (n < 0) {
count++;
n /= 10;
};
if (count % 2 != 0)
ans = true;
return ans;
}
int main() {
int n;
cin >> n;
int ct = 0;
for (int i = 1; i <= n; ++i) {
bool tmp = ju... | #include <iostream>
#include <string>
using namespace std;
bool judge(int n) {
bool ans = false;
int count = 0;
while (n > 0) {
count++;
n /= 10;
};
if (count % 2 != 0)
ans = true;
return ans;
}
int main() {
int n;
cin >> n;
int ct = 0;
for (int i = 1; i <= n; ++i) {
bool tmp = ju... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 753,801 | 753,802 | u904995051 | cpp |
p02952 | #include <iostream>
#include <string>
using namespace std;
bool judge(int n) {
bool ans = false;
int count = 0;
while (n / 10 < 0) {
count++;
n /= 10;
};
if (count % 2 != 0)
ans = true;
return ans;
}
int main() {
int n;
cin >> n;
int ct = 0;
for (int i = 1; i <= n; ++i) {
bool tmp... | #include <iostream>
#include <string>
using namespace std;
bool judge(int n) {
bool ans = false;
int count = 0;
while (n > 0) {
count++;
n /= 10;
};
if (count % 2 != 0)
ans = true;
return ans;
}
int main() {
int n;
cin >> n;
int ct = 0;
for (int i = 1; i <= n; ++i) {
bool tmp = ju... | [
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 753,803 | 753,802 | u904995051 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int Digit_num(int n) { //桁数を返す関数
int digit = 0;
while (n > 0) {
digit++;
n /= 10;
}
return digit;
}
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (Digit_n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int Digit_num(int n) { //桁数を返す関数
int digit = 0;
while (n > 0) {
digit++;
n /= 10;
}
return digit;
}
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n; i++) {
if (Digit_n... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,808 | 753,809 | u452154326 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
for (int i = 1; i < N; i++) {
if (i >= 1 && 9 >= i) {
count++;
} else if (i >= 100 && 999 >= i) {
count++;
} else if (i >= 10000 && 99999 >= i) {
count++;
}
}
cout << count << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
cin >> N;
count = 0;
for (int i = 1; i <= N; i++) {
if (i >= 1 && 9 >= i) {
count++;
} else if (i >= 100 && 999 >= i) {
count++;
} else if (i >= 10000 && 99999 >= i) {
count++;
}
}
cout << count << en... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 753,810 | 753,811 | u564060397 | cpp |
p02949 | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | /*
░░░░░░░░░░░░░░░░▄▄█▀▀██▄▄░░░░░░░
░░░░░░░░░░░░░▄█▀▀░░░░░░░▀█░░░░░░
░░░░░░░░░░░▄▀░░░░░░░░░░░░░█░░░░░
░░░░░░░░░▄█░░░░░░░░░░░░░░░█░░░░░
░░░░░░░██▀░░░░░░░▄▄▄░░▄░█▄█▄░░░░
░░░░░▄▀░░░░░░░░░░████░█▄██░▀▄░░░
░░░░█▀░░░░░░░░▄▄██▀░░█████░██░░░
░░░█▀░░░░░░░░░▀█░▀█▀█▀▀▄██▄█▀░░░
░░░██░░░░░░░░░░█░░█░█░░▀▀▄█▀░░░░
░░░░█░░░░░█░░░▀█░░░░... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,812 | 753,813 | u392848063 | cpp |
p02949 | #include <bits/stdc++.h>
#define inf 1000000000
using namespace std;
typedef long long ll;
int n, m, a, b, c, p, d[2501], us[2501], from_st[2501];
vector<pair<pair<int, int>, int>> ed;
vector<int> v[2501];
bool can = false;
void _dfs(int x) {
from_st[x] = 1;
for (auto u : v[x])
if (!from_st[u])
_dfs(u);... | #include <bits/stdc++.h>
#define inf 1000000000
using namespace std;
typedef long long ll;
int n, m, a, b, c, p, d[2501], us[2501], from_st[2501];
vector<pair<pair<int, int>, int>> ed;
vector<int> v[2501];
bool can = false;
void _dfs(int x) {
from_st[x] = 1;
for (auto u : v[x])
if (!from_st[u])
_dfs(u);... | [] | 753,814 | 753,815 | u299067843 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,816 | 753,817 | u405338557 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,818 | 753,817 | u405338557 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,819 | 753,817 | u405338557 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = 1e18;
const int N = 6000;
ll d[N], e[N];
int a[N], b[N], c[N];
int n, m, p;
int main() {
// freopen("p.in","r",stdin);
// freopen("p.out","w",stdout);
cin >> n >> m >> p;
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i] >> c... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,820 | 753,817 | u405338557 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
bool vis[2510];
vector<int> adj[2510];
void dfs(int u) {
vis[u] = 1;
for (int v : adj[u]) {
if (!vis[v])
dfs(v);
}
}
int main() {
int n, m, p;
cin >> n >> m >> p;
vector<tuple<int, int, int>> edges;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
bool vis[2510];
vector<int> adj[2510];
void dfs(int u) {
vis[u] = 1;
for (int v : adj[u]) {
if (!vis[v])
dfs(v);
}
}
int main() {
int n, m, p;
cin >> n >> m >> p;
vector<tuple<int, int, int>> edges;
for (int i = 0; i ... | [
"control_flow.branch.if.condition.change"
] | 753,823 | 753,824 | u110193617 | cpp |
p02949 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<int> nodeByA[2500];
vector<int> nodeByB[2500];
bool reachableByA[2500];
bool reachableByB[2500];
bool reachable[2500];
void dfsByA(int n) {
if (reachableByA[n]) {
return;
}
reachableBy... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<int> nodeByA[2500];
vector<int> nodeByB[2500];
bool reachableByA[2500];
bool reachableByB[2500];
bool reachable[2500];
void dfsByA(int n) {
if (reachableByA[n]) {
return;
}
reachableBy... | [] | 753,827 | 753,828 | u814154745 | cpp |
p02949 | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"call.add",
"call.arguments.change"
] | 753,836 | 753,837 | u119460590 | cpp |
p02949 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace st... | [] | 753,840 | 753,841 | u967620300 | cpp |
p02949 | #include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
... | #include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,842 | 753,843 | u764234894 | cpp |
p02949 | #include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
... | #include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 753,844 | 753,843 | u764234894 | cpp |
p02949 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | [
"identifier.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 753,851 | 753,852 | u194385557 | cpp |
p02949 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | [
"identifier.change",
"expression.operation.unary.add",
"call.arguments.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 753,853 | 753,852 | u194385557 | cpp |
p02949 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | [
"call.add",
"call.arguments.change"
] | 753,854 | 753,855 | u407614884 | cpp |
p02949 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | [
"call.add",
"call.arguments.add"
] | 753,857 | 753,858 | u314008046 | cpp |
p02949 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,864 | 753,865 | u990764614 | cpp |
p02949 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 753,866 | 753,865 | u990764614 | cpp |
p02949 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
// 隣接リストで使う辺を表す型
struct Edge {
long long to, cost; // 辺の接続先頂点, 辺の重み
Edge(long long to, long long cost) : to(to), cost(cost) {} // コンストラクタ
};
typedef vector<vector<E... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.add"
] | 753,867 | 753,865 | u990764614 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define REP(i, j) FOR(i, 0, j)
#define fst first
#define snd second
#define pb push_back
#define eb emplace_back
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long in... | [
"call.add",
"call.arguments.change"
] | 753,868 | 753,869 | u463697306 | cpp |
p02949 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, sta, n) \
for (long lo... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, sta, n) \
for (long lo... | [] | 753,870 | 753,871 | u485731913 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
const int inf = 1e9;
struct edge {
int to, cost;
edge(int to, int cost) : to(to), cost(cost) {}
};
template <class T> bool bellman_ford(int s, const VV<e... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
const int inf = 1e9;
struct edge {
int to, cost;
edge(int to, int cost) : to(to), cost(cost) {}
};
template <class T> bool bellman_ford(int s, const VV<e... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 753,872 | 753,873 | u536580583 | cpp |
p02949 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 753,886 | 753,887 | u543284218 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
class Graph {
public:
struct Edge {
long long to;
long long distance;
Edge(const long long t, const long long d) {
this->to = t;
this->distance = d;
}
bool operator<(const Edge &e) const { return this->distance < e.distance; }
bool ope... | #include <bits/stdc++.h>
using namespace std;
class Graph {
public:
struct Edge {
long long to;
long long distance;
Edge(const long long t, const long long d) {
this->to = t;
this->distance = d;
}
bool operator<(const Edge &e) const { return this->distance < e.distance; }
bool ope... | [
"call.arguments.add"
] | 753,888 | 753,889 | u618697411 | cpp |
p02949 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"expression.operation.binary.add"
] | 753,895 | 753,896 | u675296835 | cpp |
p02949 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"expression.operation.unary.add"
] | 753,897 | 753,896 | u675296835 | cpp |
p02949 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 753,898 | 753,896 | u675296835 | cpp |
p02949 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change"
] | 753,900 | 753,896 | u675296835 | cpp |
p02949 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy XV cV... | [
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change"
] | 753,901 | 753,896 | u675296835 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 753,905 | 753,906 | u424655672 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
int INF = -1'000'000'000;
int main() {
int n, m;
long long p;
cin >> n >> m >> p;
struct edge {
int from, to, cost;
};
vector<edge> es(m);
for (int i = 0; i < m; i++) {
cin >> es[i].from >> es[i].to >> es[i].cost;
es[i].from--;
es[i].to--;
... | #include <bits/stdc++.h>
using namespace std;
int INF = -1'000'000'000;
int main() {
int n, m;
long long p;
cin >> n >> m >> p;
struct edge {
int from, to, cost;
};
vector<edge> es(m);
for (int i = 0; i < m; i++) {
cin >> es[i].from >> es[i].to >> es[i].cost;
es[i].from--;
es[i].to--;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 753,908 | 753,909 | u013408661 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
int INF = -1'000'000'000;
int main() {
int n, m, p;
cin >> n >> m >> p;
struct edge {
int from, to, cost;
};
vector<edge> es(m);
for (int i = 0; i < m; i++) {
cin >> es[i].from >> es[i].to >> es[i].cost;
es[i].from--;
es[i].to--;
}
vector<p... | #include <bits/stdc++.h>
using namespace std;
int INF = -1'000'000'000;
int main() {
int n, m;
long long p;
cin >> n >> m >> p;
struct edge {
int from, to, cost;
};
vector<edge> es(m);
for (int i = 0; i < m; i++) {
cin >> es[i].from >> es[i].to >> es[i].cost;
es[i].from--;
es[i].to--;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 753,910 | 753,909 | u013408661 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1000000000000
str... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1000000000000
str... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 753,911 | 753,912 | u586567203 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = x; i < (ll)(n); i++)
typ... | [
"literal.number.change",
"call.arguments.change"
] | 753,915 | 753,916 | u317711717 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,917 | 753,918 | u014847113 | cpp |
p02949 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 753,919 | 753,918 | u014847113 | cpp |
p02949 | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | #include "bits/stdc++.h"
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a), i##_len = (b); i < i##_len; ++i)
#define MSVC_UNKO(x) x
#define rep(...) \
MSVC_UNKO(_overload3(__VA_ARGS__,... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 753,923 | 753,924 | u751488284 | cpp |
p02949 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
const ll cutoff = 10000000000000000;
int main(void) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
const ll cutoff = 10000000000000000;
int main(void) {
... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 753,929 | 753,930 | u076566148 | 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... | [
"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,932 | 753,933 | 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... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,934 | 753,933 | 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... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,935 | 753,933 | 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... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 753,932 | 753,936 | u236433947 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.