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 | #include <iostream>
using namespace std;
int soremade(int k) {
int i, ans, q;
for (i = 1, ans = 0, q = 9; i <= k; i++, q *= 10) {
if (i % 2 == 1)
ans += q;
}
return ans;
}
int keta(int n) {
int k = 0;
for (int i = 1; i <= n; i *= 10, k++)
;
return k;
}
int zeros(int k) {
int ans = 1;
... | #include <iostream>
using namespace std;
int soremade(int k) {
int i, ans, q;
for (i = 1, ans = 0, q = 9; i <= k; i++, q *= 10) {
if (i % 2 == 1)
ans += q;
}
return ans;
}
int keta(int n) {
int k = 0;
for (int i = 1; i <= n; i *= 10, k++)
;
return k;
}
int zeros(int k) {
int ans = 1;
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 755,562 | 755,563 | u393325157 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int pow10(int p) {
if (p == 0)
return 1;
return 10 * pow10(p - 1);
}
int main() {
int N;
cin >> N;
int d = log10(N) + 1;
int n = 0;
for (int i = 1; i < d; i += 2) {
n += pow10(i) - pow10(i - 1);
}
cout << ((d % ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int pow10(int p) {
if (p == 0)
return 1;
return 10 * pow10(p - 1);
}
int main() {
int N;
cin >> N;
int d = log10(N) + 1;
int n = 0;
for (int i = 1; i < d; i += 2) {
n += pow10(i) - pow10(i - 1);
}
cout << ((d % ... | [
"expression.operation.binary.add"
] | 755,564 | 755,565 | u442062970 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int res;
if (n < 10) {
res = n;
} else {
if (n < 100)
res = 9;
else {
if (n < 1000)
res = 9 + n - 99;
else {
if (n < 10000)
res = 9 + 999 - 99;
else {
if (n < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int res;
if (n < 10) {
res = n;
} else {
if (n < 100)
res = 9;
else {
if (n < 1000)
res = 9 + n - 99;
else {
if (n < 10000)
res = 9 + 999 - 99;
else {
if (n < ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 755,570 | 755,571 | u222252114 | cpp |
p02952 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <tuple>
#define INF INT_MAX >> 1
#define SIZE 100010
#defi... | [
"expression.operation.binary.add"
] | 755,595 | 755,596 | u117734686 | cpp |
p02952 | #include <cstdio>
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
if (i >= 1 && i <= 9)
ans++;
if (i >= 100 && i <= 999)
ans++;
if (i >= 10001 && i <= 99999)
ans++;
}
printf("%d", ans);
return 0;
} | #include <cstdio>
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
if (i >= 1 && i <= 9)
ans++;
if (i >= 100 && i <= 999)
ans++;
if (i >= 10000 && i <= 99999)
ans++;
}
printf("%d", ans);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 755,601 | 755,602 | u464153313 | cpp |
p02952 | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
int j = i, num = 0;
while (j) {
j /= 10;
num++;
}
if (num % 2 == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int j = i, num = 0;
while (j) {
j /= 10;
num++;
}
if (num % 2 == 1)
ans++;
}
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,609 | 755,610 | u047554023 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
string str;
for (int i = 0; i < n; ++i) {
str = to_string(i);
if (str.length() % 2 == 1) {
// cout << str.length() << endl;
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
string str;
for (int i = 1; i <= n; ++i) {
str = to_string(i);
if (str.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"
] | 755,613 | 755,614 | u256027816 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
int ans = 0;
scanf("%d", &n);
if (n == 0) {
printf("0\n");
} else if (n < 10) {
printf("%d\n", n);
} else if (n < 100) {
printf("9\n");
} else {
int m = n;
int a = 0, b = 0;
while (m) {
a++;
m /= 10;
}
... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
int ans = 0;
scanf("%d", &n);
if (n == 0) {
printf("0\n");
} else if (n < 10) {
printf("%d\n", n);
} else if (n < 100) {
printf("9\n");
} else {
int m = n;
int a = 0, b = 0;
while (m) {
a++;
m /= 10;
}
... | [] | 755,620 | 755,621 | u741061839 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a = 0;
cin >> N;
for (int i = 1; i < N; i++) {
if (i < 10)
a++;
else if (i >= 100 && i < 1000)
a++;
else if (i >= 10000 && i < 100000)
a++;
}
cout << a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
if (i < 10)
a++;
else if (i >= 100 && i < 1000)
a++;
else if (i >= 10000 && i < 100000)
a++;
}
cout << a << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,648 | 755,649 | u849439947 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
// おまじない
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
// alias
#define gcd __gcd
#define pb pu... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 755,652 | 755,653 | u303059352 | cpp |
p02952 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 909;
}
if (n >= 10000 && n <... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 909;
}
if (n >= 10000 && n <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,666 | 755,665 | u477525609 | cpp |
p02952 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 109;
}
if (n >= 10000 && n <... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 909;
}
if (n >= 10000 && n <... | [
"literal.number.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 755,667 | 755,665 | u477525609 | cpp |
p02952 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 109;
}
if (n >= 10000 && n <... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 909;
}
if (n >= 10000 && n <... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,668 | 755,665 | u477525609 | cpp |
p02952 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 110;
}
if (n >= 10000 && n <... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans;
scanf("%d", &n);
if (n < 10) {
ans = n;
}
if (n >= 10 && n < 100) {
ans = 9;
}
if (n >= 100 && n < 1000) {
ans = 9 + n - 100 + 1;
}
if (n >= 1000 && n < 10000) {
ans = 909;
}
if (n >= 10000 && n <... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,669 | 755,665 | u477525609 | cpp |
p02952 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
if (n >= 9)
ans += 9;
if (n >= 999)
ans += 900;
if (n >= 99999)
ans += 90000;
if (n > 0 && n < 9)
ans += n - 0;
if (n > 100 && n < 999)
ans += n - 100 + 1;
if (n > 10000 && n < 999... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
if (n >= 9)
ans += 9;
if (n >= 999)
ans += 900;
if (n >= 99999)
ans += 90000;
if (n >= 0 && n < 9)
ans += n - 0;
if (n >= 100 && n < 999)
ans += n - 100 + 1;
if (n >= 10000 && n < ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,677 | 755,678 | u466318894 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b = a;
int n = 1;
while (a / 10 >= 1) {
a /= 10;
n += 1;
}
int ans = 0;
if (n = 1) {
ans = b;
} else if (n % 2 == 0) {
for (int i = 0; i < n / 2; ++i) {
ans += 9 * (pow(10, (i * 2)));
}
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b = a;
int n = 1;
while (a / 10 >= 1) {
a /= 10;
n += 1;
}
int ans = 0;
if (n == 1) {
ans = b;
} else if (n % 2 == 0) {
for (int i = 0; i < n / 2; ++i) {
ans += 9 * (pow(10, (i * 2)));
}
} else... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 755,693 | 755,692 | u567252408 | cpp |
p02952 | #include <iostream>
int main() {
int N;
std::cin >> N;
int nketa = 0;
int n = N;
while (n > 0) {
n /= 10;
++nketa;
}
int ans = 0;
int m = 1;
for (int i = 1; i < nketa; ++i) {
m *= 10;
if (i % 2 != 0)
ans += m - m / 10;
}
if (nketa % 2 != 0)
ans += N - m / 10 + 1;
std:... | #include <iostream>
int main() {
int N;
std::cin >> N;
int nketa = 0;
int n = N;
while (n > 0) {
n /= 10;
++nketa;
}
long long ans = 0;
int m = 1;
for (int i = 1; i < nketa; ++i) {
m *= 10;
if (i % 2 != 0)
ans += m - m / 10;
}
if (nketa % 2 != 0)
ans += N - m + 1;
std... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operation.binary.remove"
] | 755,713 | 755,714 | u047150897 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if (n > 99999) {
cout << 90909;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define mp make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if (n > 99999) {
cout << 90909;
return 0;
}
... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 755,741 | 755,742 | u666625234 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
#define rep(i, N) for (int i = 0; i < N; i++)
const llong MOD = 1e9 + 7;
const llong inf = 1 << 30;
int main() {
int N;
cin >> N;
int res = 0;
for (int i = 1; i < N; i++) {
string temp = to_string(i);
int digit = temp.size();
i... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
#define rep(i, N) for (int i = 0; i < N; i++)
const llong MOD = 1e9 + 7;
const llong inf = 1 << 30;
int main() {
int N;
cin >> N;
int res = 0;
for (int i = 1; i <= N; i++) {
string temp = to_string(i);
int digit = temp.size();
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,751 | 755,752 | u877476774 | cpp |
p02952 | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 4e6 + 3;
pair<int, int> arr[LIM + 3];
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)
... | #include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
const int LIM = 4e6 + 3;
pair<int, int> arr[LIM + 3];
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)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,753 | 755,754 | u540045035 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int cnt = 0;
int d = 0;
for (int i = 1; i <= n; i++) {
if (i >= 1 && i < 10)
cnt++;
if (i >= 100 && i < 1000)
cnt++;
if (i > 10000 && i < 1e6)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int cnt = 0;
int d = 0;
for (int i = 1; i <= n; i++) {
if (i >= 1 && i < 10)
cnt++;
if (i >= 100 && i < 1000)
cnt++;
if (i >= 10000 && i < 1e5)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 755,757 | 755,758 | u876784108 | cpp |
p02952 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (long long i = (a), i##Len_ = (b); i < i##Len_; i++)
typedef long long ll;
static const... | [
"expression.operation.binary.add"
] | 755,761 | 755,762 | u485731913 | cpp |
p02952 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"expression.operation.binary.add"
] | 755,763 | 755,764 | u406225550 | cpp |
p02952 | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef stack<int> IntStack;
typedef queue<int> IntQueue;
const double pi = 3.14159265358979... | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef stack<int> IntStack;
typedef queue<int> IntQueue;
const double pi = 3.14159265358979... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 755,771 | 755,772 | u397037010 | cpp |
p02952 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int kazu(int x) {
int temp;
if (x < 10) {
return 1;
} else if (100 <= x && x < 1000) {
return 1;
} else if (10000 <= x && x < 100000) {
return 1;
} else {
return 0;
}
}
int main() {
int n;
cin >> n;
int ans ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int kazu(int x) {
int temp;
if (1 <= x && x < 10) {
return 1;
} else if (100 <= x && x < 1000) {
return 1;
} else if (10000 <= x && x < 100000) {
return 1;
} else {
return 0;
}
}
int main() {
int n;
cin >> n;
... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,783 | 755,784 | u135203576 | cpp |
p02952 | #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define SORT(a) sort(ALL(a))
#define VSORT(a, type) sort(ALL(a), greate... | #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define SORT(a) sort(ALL(a))
#define VSORT(a, type) sort(ALL(a), greate... | [
"assignment.change"
] | 755,785 | 755,786 | u274055316 | cpp |
p02952 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
typedef long long ll;
using namespace std;
ll rem(ll num, ll a) {
while (num >= a) {
num -= a;
}
return num;
}
int main() {
int a;
scanf("%d", &a);
int one = 0, three = 0, five = 0;
if (a > 1) {
one = min(9,... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
typedef long long ll;
using namespace std;
ll rem(ll num, ll a) {
while (num >= a) {
num -= a;
}
return num;
}
int main() {
int a;
scanf("%d", &a);
int one = 0, three = 0, five = 0;
if (a > 0) {
one = min(9,... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 755,801 | 755,802 | u327949948 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int keta(int x) {
for (int i = 1; i < 11; i++) {
if (x == 0 || x == 1) {
return 1;
}
if (x != 0 && x != 1) {
if (x % int(pow(10, i)) == x) {
return i;
break;
}
}
}
}
int main() {
int N;
cin >> N;
int ans = 0;
... |
#include <bits/stdc++.h>
using namespace std;
int keta(int x) {
for (int i = 1; i < 11; i++) {
if (x == 0 || x == 1) {
return 1;
}
if (x != 0 && x != 1) {
if (x % int(pow(10, i)) == x) {
return i;
break;
}
}
}
}
int main() {
int N;
cin >> N;
int ans = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,805 | 755,806 | u096717230 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int digit = 1;
while (N >= pow(10, digit)) {
digit++;
}
switch (digit) {
case 1:
cout << N << endl;
case 2:
cout << 9 << endl;
break;
case 3:
cout << (N - 100 + 1) + 9 << endl;
break;
case 4:
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int digit = 1;
while (N >= pow(10, digit)) {
digit++;
}
switch (digit) {
case 1:
cout << N << endl;
break;
case 2:
cout << 9 << endl;
break;
case 3:
cout << (N - 100 + 1) + 9 << endl;
break;
ca... | [
"control_flow.break.add"
] | 755,815 | 755,816 | u732546570 | cpp |
p02952 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 755,819 | 755,820 | u622585907 | cpp |
p02952 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
if (N > 100000)
cout << 90909;
else if (N >= 10000)
cout << N - 10000 + 909 + 1;
else if (N >= 1000)
cout << 909;
else if (N >= 100)
cout << N - 100 + 9 + 1;
else if (N >= 10)
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
if (N >= 100000)
cout << 90909;
else if (N >= 10000)
cout << N - 10000 + 909 + 1;
else if (N >= 1000)
cout << 909;
else if (N >= 100)
cout << N - 100 + 9 + 1;
else if (N >= 10)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,826 | 755,827 | u582357587 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int n, s = 1, len, sum[10], ans;
int main() {
cin >> n;
int m = n;
while (m) {
s *= 10, len++;
m /= 10;
}
s /= 10;
if (len > 1)
ans += 9;
if (len > 3)
ans += 900;
if (len > 5)
ans += 90000;
if (len % 2 == 1)
ans += n % s + 1;
cout... | #include <bits/stdc++.h>
using namespace std;
int n, s = 1, len, sum[10], ans;
int main() {
cin >> n;
int m = n;
while (m) {
s *= 10, len++;
m /= 10;
}
s /= 10;
if (len > 1)
ans += 9;
if (len > 3)
ans += 900;
if (len > 5)
ans += 90000;
if (len % 2 == 1)
ans += n - s + 1;
cout... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 755,837 | 755,838 | u727652622 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int f(int x) {
int r = 0;
while (x > 0) {
r++;
x /= 10;
}
return r;
}
int main() {
int n, i, ans = 0;
cin >> n;
for (i = 1; i < n; i++)
if (f(i) & 1)
ans++;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int f(int x) {
int r = 0;
while (x > 0) {
r++;
x /= 10;
}
return r;
}
int main() {
int n, i, ans = 0;
cin >> n;
for (i = 1; i <= n; i++)
if (f(i) & 1)
ans++;
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,843 | 755,844 | u415372660 | cpp |
p02952 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
int ans = 0;
for (int i = 1; i < a; i++) {
if (i < 10) {
ans++;
} else if (i >= 100 && i < 1000) {
ans++;
} else if (i >= 10000 && i < 100000)... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
int ans = 0;
for (int i = 1; i <= a; i++) {
if (i < 10) {
ans++;
} else if (i >= 100 && i < 1000) {
ans++;
} else if (i >= 10000 && i < 100000... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,850 | 755,851 | u392569193 | cpp |
p02952 | /*================================================================
* Copyright (C) 2019 Sangfor Ltd. All rights reserved.
*
* 文件名称：B.cpp
* 创 建 者：YaliKiWi
* 创建日期：2019年08月04日
* 描 述：
*
================================================================*/
#include <bits/stdc++.h>
using namespace std;
int n, ans;... | /*================================================================
* Copyright (C) 2019 Sangfor Ltd. All rights reserved.
*
* 文件名称：B.cpp
* 创 建 者：YaliKiWi
* 创建日期：2019年08月04日
* 描 述：
*
================================================================*/
#include <bits/stdc++.h>
using namespace std;
int n, ans;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,876 | 755,877 | u409210574 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int keta_kount(int x) {
int keta_count = 0;
while (x > 0) {
keta_count++;
x /= 10;
}
return keta_count;
}
int main() {
int N;
cin >> N;
int all_count = 0;
for (int i = 1; i < N; i++) {
if (keta_kount(i) % 2 != 0) {
all_count++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int keta_kount(int x) {
int keta_count = 0;
while (x > 0) {
keta_count++;
x /= 10;
}
return keta_count;
}
int main() {
int N;
cin >> N;
int all_count = 0;
for (int i = 1; i <= N; i++) {
if (keta_kount(i) % 2 != 0) {
all_count++;
}
}
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,880 | 755,881 | u495881622 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!((11 <= i && i <= 99) || (1111 <= i && i <= 9999) ||
(111111 <= i && i <= 999999))) {
ans++;
}
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!((10 <= i && i <= 99) || (1000 <= i && i <= 9999) ||
(100000 <= i && i <= 999999))) {
ans++;
}
}... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 755,882 | 755,883 | u792423109 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!((11 <= i && i <= 99) && (1111 <= i && i <= 9999) &&
(111111 <= i && i <= 999999))) {
ans++;
}
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7; // 10^9+7
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!((10 <= i && i <= 99) || (1000 <= i && i <= 9999) ||
(100000 <= i && i <= 999999))) {
ans++;
}
}... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 755,884 | 755,883 | u792423109 | cpp |
p02952 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
if (ans < 10) {
cout << n << endl;
} else if (ans < 100) {
cout << 9 << endl;
} else if (ans < 1000) {
cout << (9 + ans - 99) << endl;
} else if (ans < 10000) {
cout ... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = n;
if (ans < 10) {
cout << n << endl;
} else if (ans < 100) {
cout << 9 << endl;
} else if (ans < 1000) {
cout << (9 + ans - 99) << endl;
} else if (ans < 10000) {
cout ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 755,885 | 755,886 | u023751250 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int n, a = 1, b = 10, ans;
int main() {
scanf("%d", &n);
while (a < n) {
for (int i = a; i <= min(b - 1, n); i++)
ans++;
a *= 100;
b *= 100;
}
printf("%d", ans);
} | #include <bits/stdc++.h>
using namespace std;
int n, a = 1, b = 10, ans;
int main() {
scanf("%d", &n);
while (a <= n) {
for (int i = a; i <= min(b - 1, n); i++)
ans++;
a *= 100;
b *= 100;
}
printf("%d", ans);
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 755,898 | 755,899 | u918731412 | cpp |
p02952 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int countDigit(long long n) { return floor(log10(n) + 1); }
int main() {
ll n, count = 0;
cin >> n;
for (ll i = 0; i < n; i++) {
if (countDigit(i) % 2 == 1)
++count;
}
cout << count;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int countDigit(long long n) { return floor(log10(n) + 1); }
int main() {
ll n, count = 0;
cin >> n;
for (ll i = 0; i <= n; i++) {
if (countDigit(i) % 2 == 1)
++count;
}
cout << count;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,906 | 755,907 | u853929315 | cpp |
p02952 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// inf
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
... | [] | 755,908 | 755,909 | u577747009 | 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.length() % 2 != 0)
count += 1;
}
cout << count << endl;
return 0;
} | #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.length() % 2 != 0)
count += 1;
}
cout << count << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 755,920 | 755,921 | u165405062 | cpp |
p02952 | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define pii pair<int, int>
#define prec(n) fixed << setprecision(n)
#define MOD 1000000007
#define eps 1e-8
#define FASTER ... | #include <bits/stdc++.h> //Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define pii pair<int, int>
#define prec(n) fixed << setprecision(n)
#define MOD 1000000007
#define eps 1e-8
#define FASTER ... | [
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 755,926 | 755,927 | u047858101 | cpp |
p02952 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | [
"call.arguments.add"
] | 755,932 | 755,933 | u519950235 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 1; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2 == 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 1; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2)
ans++;
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 755,934 | 755,935 | u088895504 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 10; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 1; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 755,936 | 755,935 | u088895504 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 10; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2 == 0)
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, a, i, s, ans = 0;
cin >> n;
for (i = 1; i <= n; i++) {
s = 0;
a = i;
while (a) {
a /= 10;
s++;
}
if (s % 2)
ans++;
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 755,937 | 755,935 | u088895504 | cpp |
p02952 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
if (n <= 9)
cout << n << endl;
else if (n <= 99)
cout << "9" << endl;
else if (n <= 999)
cout << n - 99 + 9 << endl;
else if (n <= 9999)
cout << "909" << endl;
else if (n <= 99999)
cout << n - 9999 + 909 << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n <= 9)
cout << n << endl;
else if (n <= 99)
cout << "9" << endl;
else if (n <= 999)
cout << n - 99 + 9 << endl;
else if (n <= 9999)
cout << "909" << endl;
else if (n <= 99999)
cout << n - 9999 + 909 << en... | [] | 755,938 | 755,939 | u432702669 | cpp |
p02953 | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 755,941 | 755,942 | u807585808 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 755,943 | 755,944 | u000113982 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = N - 2; i >= 0; i--) {
if (H[i] - 1 == H[i + 1])
H[i]--;
else if (H[i] - 1 > H[i]) {
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = N - 2; i >= 0; i--) {
if (H[i] - 1 == H[i + 1])
H[i]--;
else if (H[i] - 1 > H[i + 1]) {
cout << "No" << endl;
return ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 755,947 | 755,948 | u495692658 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> h(n);
for (long i = 0; i < n; i++)
cin >> h[i];
if (n == 1) {
cout << "No" << endl;
return 0;
}
for (long i = (n - 1); i > 0; i--) {
if (h[i - 1] > (h[i] + 1)) {
cout << "No" << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> h(n);
for (long i = 0; i < n; i++)
cin >> h[i];
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
for (long i = (n - 1); i > 0; i--) {
if (h[i - 1] > (h[i] + 1)) {
cout << "No" << endl;
re... | [
"literal.string.change",
"io.output.change"
] | 755,953 | 755,954 | u708721324 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi pair<int, int>
#define pii pair<pair<int, int>, int>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi pair<int, int>
#define pii pair<pair<int, int>, int>
#defi... | [
"control_flow.loop.for.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 755,957 | 755,958 | u277394423 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int m = h[0];
bool f = true;
for (int i = 1; i < n; i++) {
int m = max(m, h[i]);
if (m - h[i] > 1)
f = false;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int m = h[0];
bool f = true;
for (int i = 1; i < n; i++) {
m = max(m, h[i]);
if (m - h[i] > 1)
f = false;
}... | [] | 755,965 | 755,966 | u970690920 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 200000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 200000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int6... | [] | 755,971 | 755,972 | u992723601 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define PI 3.... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define PI 3.... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 755,985 | 755,986 | u834987206 | cpp |
p02953 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> vec(N);
vector<int> f(N, 0);
for (int i = 0; i < N; ++i)
cin >> vec[i];
for (int i = N - 1; i > 0; --i) {
if (vec[i - 1] <= vec[i])
continue;
if (f[i] == 1)
continue;
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> vec(N);
vector<int> f(N, 0);
for (int i = 0; i < N; ++i)
cin >> vec[i];
for (int i = N - 1; i > 0; --i) {
if (vec[i - 1] <= vec[i])
continue;
if (f[i - 1] == 1)
continue... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 755,993 | 755,994 | u110044127 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
string ans = "Yes";
rep(i, n) { cin >> h[i]; }
int t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
string ans = "Yes";
rep(i, n) { cin >> h[i]; }
int t... | [
"expression.operation.binary.remove"
] | 755,995 | 755,996 | u487530783 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define vuni(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define vuni(... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 755,999 | 756,000 | u827741718 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h[0]--;
rep(i, n - 1)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h[0]--;
rep(i, n - 1)... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 756,005 | 756,006 | u033937898 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
long long h[n];
string ans = "Yes";
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = n - 2; i > 0; i--) {
if (h[i] < h[i + 1])
h[i]--;
if (h[i] < h[i + 1]) {
ans = "No";
}
}
cout << ans << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
long long h[n];
string ans = "Yes";
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = n - 2; i > 0; i--) {
if (h[i] > h[i + 1])
h[i]--;
if (h[i] > h[i + 1]) {
ans = "No";
}
}
cout << ans << endl;
}... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,013 | 756,014 | u864785784 | cpp |
p02953 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,021 | 756,022 | u151236434 | cpp |
p02953 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 756,024 | 756,022 | u151236434 | cpp |
p02953 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a < 0) ? (a * -1... |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _T> static _T tp_abs(const _T &a) {
return ((a < 0) ? (a * -1... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 756,031 | 756,032 | u887675488 | cpp |
p02953 | #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;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
bool ans = true;
for (int i = 1; i <= n; i++) {
if (h[i] > h[i - 1])
h[i]--;
if (h[i] < h[i - 1]) {
... | #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;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
bool ans = true;
for (int i = 1; i < n; i++) {
if (h[i] > h[i - 1])
h[i]--;
if (h[i] < h[i - 1]) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,037 | 756,038 | u009414205 | cpp |
p02953 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.loop.condition.change",
"expression.operator.compare.change"
] | 756,047 | 756,048 | u965730380 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max - 1 > a[i]) {
cout << "NO" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
if (n == 1) {
cout << "Yes" << endl;
return 0;
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max - 1 > a[i]) {
cout << "No" << endl;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,052 | 756,053 | u018890850 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll h[n];
rep(i, n) cin >> h[i];
bool ans = true;
for (int j = 1; j < n; j++) {
if (h[j - 1] + 1 == h[j]) {
h[j]--;
}
if (h[j - 1] > h[j]) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
ll h[n];
rep(i, n) cin >> h[i];
bool ans = true;
for (int j = 1; j < n; j++) {
if (h[j - 1] < h[j]) {
h[j]--;
}
if (h[j - 1] > h[j]) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,054 | 756,055 | u096030913 | cpp |
p02953 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f(a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll>>
#define fast_io ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f(a, b) for (int i = a; i < b; i++)
#define mod 1000000007
#define inf (1LL << 60)
#define all(x) (x).begin(), (x).end()
#define prDouble(x) cout << fixed << setprecision(10) << x
#define triplet pair<ll, pair<ll, ll>>
#define fast_io ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,061 | 756,062 | u327245973 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [] | 756,069 | 756,070 | u987913144 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 756,071 | 756,070 | u987913144 | cpp |
p02953 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,072 | 756,073 | u789199225 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i - 1]) {
a[i - 1]++;
if (a[i] > a[i - 1]) {
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
for (int i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
a[i + 1]++;
if (a[i] > a[i + 1]) {
cout << "No" << endl;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 756,074 | 756,075 | u406647332 | cpp |
p02953 | #ifndef LOCAL
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <qu... | #ifndef LOCAL
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <qu... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 756,076 | 756,077 | u088863512 | cpp |
p02953 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
int n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; // 10^9
const ll inff = 1000000000000000000; // 10^18
int main() {
int n;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,084 | 756,085 | u296989351 | cpp |
p02953 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout << (#x) << "=" << (x) << '\n'
#define mset(d, val) memset(d, val, sizeof(d))
#define setp(x) cout << fixed << setprecision(x)
#define forn(i, a, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout << (#x) << "=" << (x) << '\n'
#define mset(d, val) memset(d, val, sizeof(d))
#define setp(x) cout << fixed << setprecision(x)
#define forn(i, a, ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,089 | 756,090 | u353919145 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pbb pop_back
#define mp make_pair
#define popcount __builtin_popcountll
#define pii pair<int, int>
#define all(x) x.begin(), x.... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pbb pop_back
#define mp make_pair
#define popcount __builtin_popcountll
#define pii pair<int, int>
#define all(x) x.begin(), x.... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 756,091 | 756,092 | u353919145 | cpp |
p02953 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define PI 3.14... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 756,102 | 756,103 | u866535689 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 756,112 | 756,113 | u221285045 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,114 | 756,113 | u221285045 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 756,115 | 756,113 | u221285045 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
// vector<vector<int>> mat(N, vector<int>(M, 0));
int main(int argc, const char *... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,116 | 756,113 | u221285045 | cpp |
p02953 | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T> void debug(T value) { std::cerr << value; }
template <typename T, typename... Ts> void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | [] | 756,119 | 756,120 | u505122009 | cpp |
p02953 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> h(n);
for (auto &&i : h)
cin >> i;
for (int i = n - 1; i >= 0; i--) {
if (h[i] == h[i - 1] - 1) {
h[i - 1]--;
} else if (h[i] < h[i - 1]) {
cout << "No"... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> h(n);
for (auto &&i : h)
cin >> i;
for (int i = n - 1; i > 0; i--) {
if (h[i] == h[i - 1] - 1) {
h[i - 1]--;
} else if (h[i] < h[i - 1]) {
cout << "No" ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 756,121 | 756,122 | u490965711 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n;
cin >> n;
V<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n;
cin >> n;
V<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 756,123 | 756,124 | u651235280 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
reverse(h.begin(), h.end());
bool ans = true;
rep(i, n - 1) {
if (h[i + 1] - h[1] >= 2) {
ans = fal... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
reverse(h.begin(), h.end());
bool ans = true;
rep(i, n - 1) {
if (h[i + 1] - h[i] >= 2) {
ans = fal... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 756,136 | 756,137 | u692550512 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
bool judge = true;
for (int i = 0; i < n - 1; i++) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1)--;
}
if (h.at(i) == h.at(i + 1)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
bool judge = true;
for (int i = 0; i < n - 1; i++) {
if (h.at(i) < h.at(i + 1)) {
h.at(i + 1)--;
} else if (h.at(i) == h.at(i + 1)) {
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 756,140 | 756,141 | u191114518 | cpp |
p02953 | //
// AtCoder Beginner Contest 136
// C - Build Stairs
//
#include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for... | //
// AtCoder Beginner Contest 136
// C - Build Stairs
//
#include <algorithm>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for... | [
"assignment.change"
] | 756,172 | 756,173 | u506417357 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
string ans = "Yes";
for (int i = 1; i < N; ++i) {
if (H[i] == H[i - 1] + 1) {
--H[i];
} else if (H[i] < H[i - 1]) {
ans = "No";
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
string ans = "Yes";
for (int i = 1; i < N; ++i) {
if (H[i] >= H[i - 1] + 1) {
--H[i];
} else if (H[i] < H[i - 1]) {
ans = "No";
}
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,176 | 756,177 | u879581330 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e9
const int mxN = 1e6;
ll a[mxN + 10], b[mxN + 1];
int main() {
int n;
cin >> n;
vector<ll> h;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
h.push_back(x);
}
int max = INT_MIN;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e9
const int mxN = 1e6;
ll a[mxN + 10], b[mxN + 1];
int main() {
int n;
cin >> n;
vector<ll> h;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
h.push_back(x);
}
int max = INT_MIN;
for (int i = 0; i < n; i++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,184 | 756,185 | u709070698 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e9
const int mxN = 1e6;
ll a[mxN + 10], b[mxN + 1];
int main() {
int n;
cin >> n;
vector<ll> h;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
for (int i = 0; i < n - 1; i++) {
if (h[i - 1] < h... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e9
const int mxN = 1e6;
ll a[mxN + 10], b[mxN + 1];
int main() {
int n;
cin >> n;
vector<ll> h;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.push_back(x);
}
for (int i = 0; i < n - 1; i++) {
if (h[i - 1] < h... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 756,186 | 756,187 | u709070698 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n;
cin... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
int main() {
int n;
cin... | [
"expression.operation.binary.remove"
] | 756,190 | 756,191 | u480172743 | cpp |
p02953 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(... | [
"identifier.change"
] | 756,201 | 756,202 | u237054088 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = a - 1; 0 < i; i--) {
if (b[i] >= b[i - 1]) {
} else if (b[i] == b[i - 1] + 1) {
b[i]--;
} else {
cout << "No" << endl;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = a - 1; 0 < i; i--) {
if (b[i] >= b[i - 1]) {
} else if (b[i] + 1 == b[i - 1]) {
b[i - 1]--;
} else {
cout << "No" << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 756,203 | 756,204 | u962609087 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 756,205 | 756,206 | u187013893 | cpp |
p02953 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD... | [
"io.output.change"
] | 756,207 | 756,208 | u952094438 | cpp |
p02953 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
long long n;
std::cin >> n;
std::vector<long long> v(n);
for (long long... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
int main() {
long long n;
std::cin >> n;
std::vector<long long> v(n);
for (long long... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 756,213 | 756,214 | u914739916 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, ans = 0;
bool flag = true;
cin >> N;
vector<ll> vec(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> vec[i];
if (vec[i] >= vec[i - 1]) {
continue;
} else if (vec[i] + 1 == vec[i - 1]) {
vec[i]--;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, ans = 0;
bool flag = true;
cin >> N;
vector<ll> vec(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> vec[i];
if (vec[i] >= vec[i - 1]) {
continue;
} else if (vec[i] + 1 == vec[i - 1]) {
vec[i]++;
... | [] | 756,221 | 756,222 | u000217193 | cpp |
p02953 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n) cin >> a[i + 1];
bool ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n) cin >> a[i + 1];
bool ans... | [
"expression.operation.binary.add"
] | 756,223 | 756,224 | u443151804 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.