problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if ((n / 2) + 1 >= k) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if (((n + 1) / 2) >= k) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 932,481 | 932,482 | u991974907 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N = 0;
int K = 0;
int ans = 0;
cin >> N >> K;
if (0 == N % 2) {
ans = N / 2;
} else {
ans = N / 2 + 1;
}
if (ans < K) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N = 0;
int K = 0;
int ans = 0;
cin >> N >> K;
if (0 == N % 2) {
ans = N / 2;
} else {
ans = N / 2 + 1;
}
if (ans < K) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,487 | 932,488 | u566436791 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
cout << ((N + 1) / 2 + 1 >= K ? "YES" : "NO") << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
cout << ((N + 1) / 2 >= K ? "YES" : "NO") << endl;
}
| [
"expression.operation.binary.remove"
] | 932,491 | 932,492 | u430527172 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
cout << ((N + 1) / 2 + 1 >= K ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
cout << ((N + 1) / 2 >= K ? "YES" : "NO") << endl;
}
| [
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,493 | 932,492 | u430527172 | cpp |
p03129 | // N K
// YES NO
#include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if (2 * K + 1 <= N)
printf("YES");
else
printf("NO");
return 0;
}
| // N K
// YES NO
#include <stdio.h>
int main() {
int N, K;
scanf("%d %d", &N, &K);
if (2 * K - 1 <= N)
printf("YES");
else
printf("NO");
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,498 | 932,499 | u174028570 | cpp |
p03129 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
if (2 * K - 1 < N) {
printf("YES\n");
return 0;
}
printf("NO\n");
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll N, K;
cin >> N >> K;
if (2 * K - 1 <= N) {
printf("YES\n");
return 0;
}
printf("NO\n");
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,500 | 932,501 | u546736430 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
if (N >= 2 * K + 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
if (N >= 2 * K - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,505 | 932,506 | u816742421 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, b, ans1, ans2;
cin >> n >> k >> b;
if (n / 2 + 1 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, b, ans1, ans2;
cin >> n >> k >> b;
if ((n + 1) / 2 >= k)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 932,509 | 932,510 | u982022271 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N, M;
cin >> N >> M;
if (N > ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL << 29;
const ll mod = 1e9 + 7;
#define rep(i, a, b) for (ll(i) = (a); (i) < (b); ++i)
int main() {
ll N, M;
cin >> N >> M;
if (N >=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,513 | 932,514 | u386806796 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int res;
if (n % 2 == 0)
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int res;
if (n % 2 == 0)
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"misc.opposites",
"assignment.change"
] | 932,515 | 932,516 | u704411633 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N >> a;
if (N > a - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N >> a;
if (N >= 2 * a - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,518 | 932,519 | u403984573 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N >> a;
if (N > a) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N >> a;
if (N >= 2 * a - 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,520 | 932,519 | u403984573 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,521 | 932,522 | u815863697 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 > K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,523 | 932,522 | u815863697 | cpp |
p03129 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1 / 2) > K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if ((N + 1) / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,524 | 932,522 | u815863697 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 1) {
N--;
}
if (N >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 1) {
N++;
}
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 932,536 | 932,537 | u979920726 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N > K)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N % 2 == 0) {
if (N / 2 >= K) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
if (N / 2 + 1 >= K)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
... | [
"control_flow.branch.if.condition.change"
] | 932,538 | 932,539 | u806800460 | cpp |
p03129 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,540 | 932,541 | u504142483 | cpp |
p03129 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int i, j;
i = n / 2;
j = n % 2;
if (j == 0) {
if (k <= i)
cout << "yes" << endl;
else
cout << "no" << endl;
} else {
if (k <= i + 1)
cout << "yes" << endl;
else
cout << "no" << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int i, j;
i = n / 2;
j = n % 2;
if (j == 0) {
if (k <= i)
cout << "YES" << endl;
else
cout << "NO" << endl;
} else {
if (k <= i + 1)
cout << "YES" << endl;
else
cout << "NO" << endl;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,542 | 932,543 | u567480139 | cpp |
p03129 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int k, n, t = 0;
cin >> n >> k;
n % 2 == 0 ? t = n / 2 : t = (n + 1) / 2;
cout << (t <= k ? "YES" : "NO") << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int k, n, t = 0;
cin >> n >> k;
n % 2 == 0 ? t = n / 2 : t = (n + 1) / 2;
cout << (k <= t ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.remove"
] | 932,546 | 932,547 | u317177661 | cpp |
p03129 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int k, n, t = 0;
cin >> n, k;
n % 2 == 0 ? t = n / 2 : t = (n + 1) / 2;
cout << (t <= k ? "YES" : "NO") << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int k, n, t = 0;
cin >> n >> k;
n % 2 == 0 ? t = n / 2 : t = (n + 1) / 2;
cout << (k <= t ? "YES" : "NO") << endl;
} | [
"expression.operation.binary.remove"
] | 932,548 | 932,547 | u317177661 | cpp |
p03129 | #include <algorithm>
#include <cstdio>
#define REP(i, n) for (int i = 0; i < n; i++)
int N, K;
int main() {
scanf("%d %d", &N, &K);
if (N % 2 == 0) {
if (K <= N / 2)
printf("Yes\n");
else
printf("No\n");
} else {
if (K <= N / 2 + 1)
printf("Yes\n");
else
printf("No\n");
... | #include <algorithm>
#include <cstdio>
#define REP(i, n) for (int i = 0; i < n; i++)
int N, K;
int main() {
scanf("%d %d\n", &N, &K);
if (N % 2 == 0) {
if (K <= N / 2)
printf("YES\n");
else
printf("NO\n");
} else {
if (K <= N / 2 + 1)
printf("YES\n");
else
printf("NO\n")... | [
"literal.string.change",
"call.arguments.change",
"literal.string.case.change",
"io.output.change"
] | 932,549 | 932,550 | u236162829 | cpp |
p03129 | #include <algorithm>
#include <cstdio>
#define REP(i, n) for (int i = 0; i < n; i++)
int N, K;
int main() {
scanf("%d %d\n", &N, &K);
if (N % 2 == 0) {
if (K <= N / 2)
printf("Yes\n");
else
printf("No\n");
} else {
if (K <= N / 2 + 1)
printf("Yes\n");
else
printf("No\n")... | #include <algorithm>
#include <cstdio>
#define REP(i, n) for (int i = 0; i < n; i++)
int N, K;
int main() {
scanf("%d %d\n", &N, &K);
if (N % 2 == 0) {
if (K <= N / 2)
printf("YES\n");
else
printf("NO\n");
} else {
if (K <= N / 2 + 1)
printf("YES\n");
else
printf("NO\n")... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 932,551 | 932,550 | u236162829 | cpp |
p03129 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, K;
cin >> N >> K;
if (K <= N / 2 + 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N, K;
cin >> N >> K;
if (K <= (N + 1) / 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 932,552 | 932,553 | u157322125 | cpp |
p03129 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2.0 + 1 > k) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n / 2.0 + 1 > k) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,562 | 932,563 | u465669072 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int n, k;
std::cin >> n >> k;
int count = 0;
for (size_t i = 1; i < n; i += 2) {
count++;
}
if (count >= k) {
std::... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int n, k;
std::cin >> n >> k;
int count = 0;
for (size_t i = 1; i <= n; i += 2) {
count++;
}
if (count >= k) {
std:... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,564 | 932,565 | u914739916 | cpp |
p03129 | #include <iostream>
int main() {
unsigned int n, k;
std::cin >> n >> k;
if (n >= k + 2 - 1)
std::cout << "YES";
else
std::cout << "NO";
std::cout << std::endl;
} | #include <iostream>
int main() {
unsigned int n, k;
std::cin >> n >> k;
if (n >= k * 2 - 1)
std::cout << "YES";
else
std::cout << "NO";
std::cout << std::endl;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,568 | 932,569 | u532096498 | cpp |
p03129 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k;
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 932,579 | 932,580 | u635992896 | cpp |
p03131 | #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.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 932,591 | 932,592 | u151236434 | cpp |
p03131 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<... | [
"assignment.value.change",
"assignment.change"
] | 932,597 | 932,598 | u606600497 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1;
return 0;
} else if (a - 1 >= k) {
cout << k + 1 << endl;
} else {
ll rest = k - (a - 1);
ll ans = a;
ans += (rest / 2) * (b - a);
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1;
return 0;
} else if (a - 1 >= k) {
cout << k + 1 << endl;
} else {
ll rest = k - (a - 1);
ll ans = a;
ans += (rest / 2) * (b - a);
if... | [
"identifier.change"
] | 932,601 | 932,602 | u027630431 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 932,615 | 932,616 | u280096880 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | [
"control_flow.branch.if.condition.change"
] | 932,617 | 932,616 | u280096880 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b) {
cout << k + 1 << endl;
return 0;
} else if (k <= a) {
cout << k + 1 << endl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b) {
cout << k + 1 << endl;
return 0;
} else if (k <= a - 1) {
cout << k + 1 << ... | [
"control_flow.branch.if.condition.change"
] | 932,622 | 932,623 | u024191315 | cpp |
p03131 | #include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t k, a, b;
std::cin >> k >> a >> b;
if (b - a <= 2) {
std::cout << k + 1 << std::endl;
} else {
k -= a - 1;
std::cout << (b - a) * k / 2 + (k % 2) <... | #include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t k, a, b;
std::cin >> k >> a >> b;
if (b - a <= 2) {
std::cout << k + 1 << std::endl;
} else {
k -= a - 1;
std::cout << (b - a) * (k / 2) + (k % 2)... | [
"expression.operation.binary.add"
] | 932,634 | 932,635 | u222625974 | cpp |
p03131 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define dupl(s) s.erase(unique(s.begin(), s.end()), s.end()); //重複取り除き
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s) { return accumu... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define dupl(s) s.erase(unique(s.begin(), s.end()), s.end()); //重複取り除き
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s) { return accumu... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 932,636 | 932,637 | u854685063 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
// a->b;
if ((a - 1) + 1 + 1 > k || b <= a) {
cout << k + 1 << '\n';
} else {
long long x = a;
long long kk = k;
kk -= (a - 1); // get b biscuit
x += (long long)(b - a) * kk / 2;
if (kk %... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
// a->b;
if ((a - 1) + 1 + 1 > k || b <= a + 2) {
cout << k + 1 << '\n';
} else {
long long x = a;
long long kk = k;
kk -= (a - 1); // get b biscuit
x += (long long)(b - a) * (kk / 2);
if... | [
"control_flow.branch.if.condition.change"
] | 932,638 | 932,639 | u385825353 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
// a->b;
if ((a - 1) + 1 + 1 > k || b <= a) {
cout << k + 1 << '\n';
} else {
long long x = a;
long long kk = k;
kk -= (a - 1); // get b biscuit
x += (long long)(b - a) * kk / 2;
if (kk %... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
// a->b;
if ((a - 1) + 1 + 1 > k || b <= a) {
cout << k + 1 << '\n';
} else {
long long x = a;
long long kk = k;
kk -= (a - 1); // get b biscuit
x += (long long)(b - a) * (kk / 2);
if (kk... | [] | 932,638 | 932,640 | u385825353 | cpp |
p03131 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
l... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main() {
l... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.add"
] | 932,647 | 932,648 | u475843109 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> k >> a >> b;
long long ans;
if (k < a)
ans = k + 1;
else {
if (a + 2 >= b)
ans = k + 1;
else {
k -= (a - 1);
ans = (k / 2) * b - (k / 2 - 1) * a + k / 2;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> k >> a >> b;
long long ans;
if (k < a)
ans = k + 1;
else {
if (a + 2 >= b)
ans = k + 1;
else {
k -= (a - 1);
ans = (k / 2) * b - (k / 2 - 1) * a + k % 2;
}
}
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 932,657 | 932,658 | u605833494 | cpp |
p03131 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) \
for (auto it = v.begin(); it != v.end(); it++) { \
cin >... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) \
for (auto it = v.begin(); it != v.end(); it++) { \
cin >... | [
"variable_declaration.type.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 932,663 | 932,662 | u225660136 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,664 | 932,665 | u160429264 | cpp |
p03131 | #pragma region template
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define last(a) (a).at((int)(a).size() - 1)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (... | #pragma region template
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define last(a) (a).at((int)(a).size() - 1)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (... | [] | 932,679 | 932,680 | u368735320 | cpp |
p03131 | #pragma region template
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define last(a) (a).at((int)(a).size() - 1)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (... | #pragma region template
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define last(a) (a).at((int)(a).size() - 1)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define brep(i, a, b) for (int i = (a), i##_len = (... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,681 | 932,680 | u368735320 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3], b[3], c[4] = {};
int cou3 = 0, cou2 = 0;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
c[a[i]]++;
c[b[i]]++;
}
for (int j = 0; j < 4; j++) {
if (c[j] == 2)
cou2++;
if (c[j] == 3)
cou3++;
}
if (!cou3) {... | #include <iostream>
using namespace std;
int main() {
int a[3], b[3], c[5] = {};
int cou3 = 0, cou2 = 0;
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
c[a[i]]++;
c[b[i]]++;
}
for (int j = 0; j < 5; j++) {
if (c[j] == 2)
cou2++;
if (c[j] == 3)
cou3++;
}
if (!cou3) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,700 | 932,701 | u912533549 | cpp |
p03130 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<
// pair<int, int>, // change type
// null_type,
// less<pa... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including
//tree_order_statistics_node_update
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<
// pair<int, int>, // change type
// null_type,
// less<pa... | [
"variable_declaration.value.change"
] | 932,708 | 932,709 | u611826259 | cpp |
p03130 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,713 | 932,714 | u504142483 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5] = {0}, i, k;
for (i = 0; i < 3; i++) {
cin >> k;
a[k]++;
cin >> k;
a[k]++;
}
if (a[1] <= 1 && a[2] <= 2 && a[3] <= 2 && a[4] <= 3)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[5] = {0}, i, k;
for (i = 0; i < 3; i++) {
cin >> k;
a[k]++;
cin >> k;
a[k]++;
}
if (a[1] <= 2 && a[2] <= 2 && a[3] <= 2 && a[4] <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,721 | 932,722 | u409179445 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[5];
for (int i = 0; i < 4; i++)
arr[i] = 0;
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
arr[x]++;
}
if (arr[4] <= 2 and arr[1] <= 2 and arr[2] <= 2 and arr[3] <= 2) {
cout << "YES\n";
} else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[5];
for (int i = 1; i <= 4; i++)
arr[i] = 0;
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
arr[x]++;
}
if (arr[4] <= 2 and arr[1] <= 2 and arr[2] <= 2 and arr[3] <= 2) {
cout << "YES\n";
} else
cout << "NO\n";
}
| [
"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"
] | 932,726 | 932,727 | u047442155 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[5];
for (int i = 0; i < 4; i++)
arr[i] = 0;
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
arr[x]++;
}
if (arr[0] <= 2 and arr[1] <= 2 and arr[2] <= 2 and arr[3] <= 2) {
cout << "YES\n";
} else
cout << "NO\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[5];
for (int i = 1; i <= 4; i++)
arr[i] = 0;
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
arr[x]++;
}
if (arr[4] <= 2 and arr[1] <= 2 and arr[2] <= 2 and arr[3] <= 2) {
cout << "YES\n";
} else
cout << "NO\n";
}
| [
"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",
"variable_access.subscript.index.change",
"control_... | 932,728 | 932,727 | u047442155 | cpp |
p03130 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int d[10];
int main() {
for (int i = 0; i < 3; i++) {
int u, v;
cin >> u >> v;
d[u]++;
d[v]++;
}
bool flag = true;
for (int i = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int d[10];
int main() {
for (int i = 0; i < 3; i++) {
int u, v;
cin >> u >> v;
d[u]++;
d[v]++;
}
bool flag = true;
for (int i = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 932,729 | 932,730 | u275726913 | cpp |
p03130 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | [
"variable_declaration.value.change"
] | 932,731 | 932,732 | u548768105 | cpp |
p03130 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d[10];
for (int i = 1; i <= 4; i++)
d[i] = 0;
for (int i = 0; i < 6; i++) {
int z;
scanf("%d", &z);
d[z]++;
}
if (d[1] >= 3 && d[2] >= 3 && d[3] >= 3 && d[4] >= 3)
printf("NO\n");
else
printf("YES\n");
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int d[10];
for (int i = 1; i <= 4; i++)
d[i] = 0;
for (int i = 0; i < 6; i++) {
int z;
scanf("%d", &z);
d[z]++;
}
if (d[1] >= 3 || d[2] >= 3 || d[3] >= 3 || d[4] >= 3)
printf("NO\n");
else
printf("YES\n");
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 932,735 | 932,736 | u346834985 | cpp |
p03130 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[4];
memset(vertex, 0, sizeof(vertex));
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 0; i < 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[5];
memset(vertex, 0, sizeof(vertex));
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 1; i <= 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.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"
] | 932,745 | 932,746 | u387480576 | cpp |
p03130 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[4];
memset(vertex, 0, sizeof(vertex));
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 1; i <= 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[5];
memset(vertex, 0, sizeof(vertex));
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 1; i <= 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 932,747 | 932,746 | u387480576 | cpp |
p03130 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[5];
memset(vertex, 0, 5);
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 1; i <= 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
}
}
cout... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int element;
int vertex[5];
memset(vertex, 0, sizeof(vertex));
for (int i = 0; i < 6; i++) {
cin >> element;
vertex[element]++;
}
for (int i = 1; i <= 4; i++) {
if (vertex[i] > 2) {
cout << "NO";
return 0;
... | [
"call.arguments.change"
] | 932,748 | 932,746 | u387480576 | cpp |
p03130 | #include <iostream>
using namespace std;
bool print(int *Path) {
for (int i = 0; i < 4; i++) {
if (Path[i] >= 3) {
return false;
}
}
return true;
}
int main() {
int Path[4];
int x, y;
for (int i = 0; i < 3; i++) {
cin >> x >> y;
Path[x - 1] += 1;
Path[y - 1] += 1;
}
if (print... | #include <iostream>
using namespace std;
bool print(int *Path) {
for (int i = 0; i < 4; i++) {
if (Path[i] >= 3) {
return false;
}
}
return true;
}
int main() {
int Path[4] = {};
int x, y;
for (int i = 0; i < 3; i++) {
cin >> x >> y;
Path[x - 1] += 1;
Path[y - 1] += 1;
}
if (... | [
"variable_declaration.value.change"
] | 932,754 | 932,755 | u168139048 | cpp |
p03130 | #include <iostream>
#include <vector>
int main() {
std::vector<std::pair<int, int>> list;
for (int i = 0; i < 3; ++i) {
int n, k;
std::cin >> n;
std::cin >> k;
list.emplace_back(n, k);
}
int a[4] = {0};
bool flg = false;
for (auto c : list) {
a[c.first]++;
a[c.second]++;
}
int... | #include <iostream>
#include <vector>
int main() {
std::vector<std::pair<int, int>> list;
for (int i = 0; i < 3; ++i) {
int n, k;
std::cin >> n;
std::cin >> k;
list.emplace_back(n, k);
}
int a[4] = {0};
bool flg = false;
for (auto c : list) {
a[c.first - 1]++;
a[c.second - 1]++;
... | [
"expression.operation.binary.add"
] | 932,767 | 932,768 | u336096593 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int a[7];
int main() {
for (int i = 0; i < 6; ++i)
cin >> a[i];
int N = 0;
for (int i = 0; i < 6; ++i) {
if (a[i] == 1)
N++;
}
int B = 0;
for (int i = 0; i < 6; ++i) {
if (a[i] == 2)
B++;
}
int V = 0;
for (int i = 0; i < 6; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int a[7];
int main() {
for (int i = 0; i < 6; ++i)
cin >> a[i];
int N = 0;
for (int i = 0; i < 6; ++i) {
if (a[i] == 1)
N++;
}
int B = 0;
for (int i = 0; i < 6; ++i) {
if (a[i] == 2)
B++;
}
int V = 0;
for (int i = 0; i < 6; ++i) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 932,769 | 932,770 | u297195722 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[5] = {0, 0, 0, 0, 0};
int N;
for (int i = 1; i <= 6; i++) {
cin >> N;
a[N]++;
}
for (int j = 1; j <= 3; j++) {
if (a[j] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a[5] = {0, 0, 0, 0, 0};
int N;
for (int i = 1; i <= 6; i++) {
cin >> N;
a[N]++;
}
for (int j = 1; j <= 4; j++) {
if (a[j] >= 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,771 | 932,772 | u537837642 | cpp |
p03130 | #include <iostream>
using namespace std;
int main(void) {
int a1, b1, a2, b2, a3, b3;
cin >> a1;
cin >> b1;
cin >> a2;
cin >> b2;
cin >> a3;
cin >> b3;
int node_list[] = {a1, b1, a2, b2, a3, b3};
int num_list[] = {0, 0, 0, 0};
int flg = 0;
for (int i = 0; i < 6; ++i) {
num_list[node_list[i]... | #include <iostream>
using namespace std;
int main(void) {
int a1, b1, a2, b2, a3, b3;
cin >> a1;
cin >> b1;
cin >> a2;
cin >> b2;
cin >> a3;
cin >> b3;
int node_list[] = {a1, b1, a2, b2, a3, b3};
int num_list[] = {0, 0, 0, 0};
int flg = 0;
for (int i = 0; i < 6; ++i) {
num_list[node_list[i]... | [
"expression.operation.binary.add"
] | 932,773 | 932,774 | u636489589 | cpp |
p03130 | #include <stdio.h>
char str[10001];
int a[3];
int b[3];
void receive_input() {
for (size_t i = 0; i < 3; i++) {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d %d", &a[i], &b[i]);
}
}
void initialize() {
// nop
}
int check() {
int flag[4] = {};
for (size_t i = 0; i < 3; i++) {
flag[a[i]]++;
... | #include <stdio.h>
char str[10001];
int a[3];
int b[3];
void receive_input() {
for (size_t i = 0; i < 3; i++) {
fgets(str, sizeof(str), stdin);
sscanf(str, "%d %d", &a[i], &b[i]);
}
}
void initialize() {
// nop
}
int check() {
int flag[5] = {};
for (size_t i = 0; i < 3; i++) {
flag[a[i]]++;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.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"
] | 932,781 | 932,782 | u869153175 | cpp |
p03130 | #include <iostream>
int a[4], b[4], count[5], countmax = 0, countmin = 10;
int main() {
for (int i = 1; i < 4; i++) {
std::cin >> a[i] >> b[i];
for (int j = 1; j < 5; j++) {
if (a[i] == j) {
count[j]++;
}
if (b[i] == j) {
count[j]++;
}
}
}
for (int i = 1; i < ... | #include <iostream>
int a[4], b[4], count[5], countmax = 0, countmin = 10;
int main() {
for (int i = 1; i < 4; i++) {
std::cin >> a[i] >> b[i];
for (int j = 1; j < 5; j++) {
if (a[i] == j) {
count[j]++;
}
if (b[i] == j) {
count[j]++;
}
}
}
for (int i = 1; i < ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,783 | 932,784 | u165829448 | cpp |
p03130 | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
for (int i = 0; i < 3; ++i)
cin >> a[i] >> b[i];
int p[3] = {0};
for (int i = 0; i < 3; ++i)
p[a[i] - 1]++, p[b[i] - 1]++;
bool ok = true;
for (int i = 0; i < 3; ++i)
if (p[i] >= 3)
ok = false;
cout << (ok ? "YES" : "... | #include <iostream>
using namespace std;
int main() {
int a[3], b[3];
for (int i = 0; i < 3; ++i)
cin >> a[i] >> b[i];
int p[4] = {0};
for (int i = 0; i < 3; ++i)
p[a[i] - 1]++, p[b[i] - 1]++;
bool ok = true;
for (int i = 0; i < 4; ++i)
if (p[i] >= 3)
ok = false;
cout << (ok ? "YES" : "... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 932,787 | 932,788 | u799216831 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
int b[10] = {0};
for (int i = 0; i < 6; ++i) {
cin >> a[i];
++b[a[i]];
}
for (int i = 0; i < 6; ++i) {
if (b[i] == 3) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
int b[10] = {0};
for (int i = 0; i < 6; ++i) {
cin >> a[i];
++b[a[i]];
}
for (int i = 0; i < 6; ++i) {
if (b[i] == 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,795 | 932,796 | u634527561 | cpp |
p03130 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
int b[10] = {0};
for (int i = 0; i < 6; ++i) {
cin >> a[i];
++b[a[i]];
}
for (int i = 0; i < 6; ++i) {
if (b[i] == 3) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
/*
int a, b, c, d, e, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
int b[10] = {0};
for (int i = 0; i < 6; ++i) {
cin >> a[i];
++b[a[i]];
}
for (int i = 0; i < 6; ++i) {
if (b[i] == 3) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 932,797 | 932,796 | u634527561 | cpp |
p03130 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int n[5];
int main() {
int a[10], b[10];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
n[a[i]]++;
n[b[i]]++;
}
for (int i = 0; i < 4; i++) {
if (n[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int n[5];
int main() {
int a[10], b[10];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
n[a[i]]++;
n[b[i]]++;
}
for (int i = 1; i <= 4; i++) {
if (n[i] > 2) {
cout << "NO" << endl;
return 0;
}
}
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 932,810 | 932,811 | u100499821 | cpp |
p03131 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a >= b - 2)
ans = k + 1;
else {
k -= a + 1;
ans = b + k / 2 * (b - a) + k % 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a >= b - 1 || a >= k)
ans = k + 1;
else {
k -= a + 1;
ans = b + k / 2 * (b - a) + k % 2;
}
cout << ans << endl;
re... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,822 | 932,821 | u907525511 | cpp |
p03131 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a >= b - 1)
ans = k + 1;
else {
k -= a + 1;
ans = b + k / 2 * (b - a) + k % 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 0;
if (a >= b - 1 || a >= k)
ans = k + 1;
else {
k -= a + 1;
ans = b + k / 2 * (b - a) + k % 2;
}
cout << ans << endl;
re... | [
"control_flow.branch.if.condition.change"
] | 932,823 | 932,821 | u907525511 | cpp |
p03131 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"expression.operation.binary.remove"
] | 932,824 | 932,825 | u596311864 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll K, A, B;
cin... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll K, A, B;
cin... | [
"control_flow.branch.if.condition.change"
] | 932,826 | 932,827 | u843522325 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/yahoo_procon2019_qual_c.txt"); ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/yahoo_procon2019_qual_c.txt"); ... | [
"control_flow.branch.if.condition.change"
] | 932,837 | 932,838 | u513083943 | cpp |
p03131 | #include <bits/stdc++.h>
#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() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2 || k < a + 1)
cout << k + 1 << endl;
else
cout << a + (k - a + 1) / 2 * (b - a) + (k - a + 1) % 2 * ... | #include <bits/stdc++.h>
#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() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2 || k < a + 1)
cout << k + 1 << endl;
else
cout << a + (k - a + 1) / 2 * (b - a) + (k - a + 1) % 2 <<... | [
"expression.operation.binary.remove"
] | 932,842 | 932,843 | u641900703 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
ll res;
if (A + 1 < B) {
if (K > A) {
res = B + ((K - A - 1) / 2) * (B - A) + (K - A - 1) % 2;
}
} else
res = K + 1;
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
ll res;
if (A + 1 < B && K > A) {
res = B + ((K - A - 1) / 2) * (B - A) + (K - A - 1) % 2;
} else
res = K + 1;
cout << res << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 932,852 | 932,853 | u986480146 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
if (A - B + 2 >= 0 || K < A + 1)
cout << K + 1 << endl;
else {
ll N = K - (A + 1);
if (N % 2 == 0)
cout << B + (B - A) * (N / 2) << endl;
if (N % 2 == 1)
cout << B + (B -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll K, A, B;
cin >> K >> A >> B;
if (A - B + 2 >= 0 || K < A + 1)
cout << K + 1 << endl;
else {
ll N = K - (A + 1);
if (N % 2 == 0)
cout << B + (B - A) * (N / 2) << endl;
if (N % 2 == 1)
cout << B + (B -... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 932,854 | 932,855 | u094654185 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t K, A, B;
cin >> K >> A >> B;
if (B - A <= 1 || K <= A)
cout << K + 1 << endl;
else {
if ((K - A + 1) % 2 == 0) {
int ans = A + (B - A) * (K - A + 1) / 2;
cout << ans << endl;
} else {
int ans = 1 + A + (B - A) * ((... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t K, A, B;
cin >> K >> A >> B;
if (B - A <= 1 || K <= A)
cout << K + 1 << endl;
else {
if ((K - A + 1) % 2 == 0) {
int64_t ans = A + (B - A) * (K - A + 1) / 2;
cout << ans << endl;
} else {
int64_t ans = 1 + A + (B -... | [
"variable_declaration.type.primitive.change"
] | 932,871 | 932,872 | u101018317 | cpp |
p03131 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 932,873 | 932,874 | u318334550 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b, ans;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << endl;
return 0;
}
ans += a - 1;
k -= a - 1;
ans += k % 2;
k -= k % 2;
ans += (b - a) * k / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b, ans = 1;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << endl;
return 0;
}
ans += a - 1;
k -= a - 1;
ans += k % 2;
k -= k % 2;
ans += (b - a) * k / 2;
cout << ans << endl;
}
| [
"variable_declaration.value.change"
] | 932,875 | 932,876 | u028906014 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b, c;
cin >> k >> a >> b;
c = 1;
if (a >= b) {
cout << k + 1 << endl;
} else {
if (k < a) {
cout << k + 1 << endl;
} else if (b - a == 1) {
cout << k + 1 << endl;
} else {
if (k >= a - c + 2) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long k, a, b, c;
cin >> k >> a >> b;
c = 1;
if (a >= b) {
cout << k + 1 << endl;
} else {
if (k < a + 1) {
cout << k + 1 << endl;
} else if (b - a == 1) {
cout << k + 1 << endl;
} else {
if (k >= a - c + 2) {
... | [
"control_flow.branch.if.condition.change"
] | 932,877 | 932,878 | u956675118 | cpp |
p03131 | #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 <util... | #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 <util... | [
"variable_declaration.type.change"
] | 932,888 | 932,889 | u622585907 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | [
"assignment.change"
] | 932,894 | 932,895 | u093973314 | cpp |
p03131 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queu... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queu... | [
"control_flow.return.add"
] | 932,898 | 932,899 | u987591601 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#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 < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#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 < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,916 | 932,917 | u187878098 | cpp |
p03131 | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n)... | #include <bits/stdc++.h>
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n)... | [
"expression.operation.binary.remove"
] | 932,918 | 932,919 | u457985479 | cpp |
p03131 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using name... | [
"variable_declaration.type.narrow.change"
] | 932,924 | 932,925 | u723550619 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | [
"control_flow.branch.if.condition.change"
] | 932,939 | 932,940 | u789323170 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
if (B - A <= 2) {
cout << K + 1 << endl;
} else {
long long t = max(0LL, (K - (A - 1)) / 2);
cout << A + (B - A) * t + (K - t) % 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
if (B - A <= 2) {
cout << K + 1 << endl;
} else {
long long t = max(0LL, (K - (A - 1)) / 2);
cout << A + (B - A) * t + (K - (A - 1)) % 2 << endl;
}
return 0;
}
| [
"io.output.change"
] | 932,941 | 932,942 | u519194615 | cpp |
p03131 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main() {
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 ... | [
"control_flow.branch.if.condition.change"
] | 932,943 | 932,944 | u561143568 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000005;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans = 1;
if (b - a > 2) {
ans += a - 1;
k -= a - 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000005;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll K = k;
ll ans = 1;
if (b - a > 2) {
ans += a - 1;
k... | [
"variable_declaration.add",
"identifier.change",
"io.output.change"
] | 932,952 | 932,953 | u184929210 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | [
"expression.unary.arithmetic.add"
] | 932,954 | 932,955 | u539011156 | cpp |
p03131 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 932,958 | 932,959 | u024764559 | cpp |
p03131 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 932,960 | 932,959 | u024764559 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"control_flow.branch.if.condition.change"
] | 932,961 | 932,962 | u322177979 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,963 | 932,962 | u322177979 | cpp |
p03131 | #include <iostream>
using namespace std;
typedef long long ll;
ll K, A, B;
ll biscuit;
int main() {
cin >> K >> A >> B;
if (A >= B) {
biscuit = 1 + 2 * K;
cout << biscuit << endl;
}
else {
if (B - A < 2) {
biscuit = K + 1;
}
else {
if (K == A + 1) {
biscuit = B;
... | #include <iostream>
using namespace std;
typedef long long ll;
ll K, A, B;
ll biscuit;
int main() {
cin >> K >> A >> B;
if (A >= B) {
biscuit = K + 1;
cout << biscuit << endl;
}
else {
if (B - A < 2) {
biscuit = K + 1;
}
else {
if (K == A + 1) {
biscuit = B;
}... | [
"expression.operation.binary.remove",
"assignment.change"
] | 932,970 | 932,971 | u353919145 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define PER(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define ROF(i, l, r) for (int i = r; i >= l; i--)
#define DEBUG(x) cout << #x << "=" << x << endl;
#define SHOW1(A, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define PER(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, l, r) for (int i = l; i <= r; i++)
#define ROF(i, l, r) for (int i = r; i >= l; i--)
#define DEBUG(x) cout << #x << "=" << x << endl;
#define SHOW1(A, n) ... | [
"control_flow.branch.if.condition.change"
] | 932,972 | 932,973 | u089230684 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 932,988 | 932,989 | u303039933 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (100000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (100000000... | [
"variable_declaration.type.change"
] | 932,992 | 932,993 | u973991908 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (k <= a) {
cout << k << endl;
return 0;
}
long long delta = b - a;
long long acc = 0;
if (delta > 2) {
k -= a - 1;
acc += a;
if (k % 2 == 0) {
acc += delta * (k / 2);
} else {
... | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (k <= a) {
cout << k + 1 << endl;
return 0;
}
long long delta = b - a;
long long acc = 0;
if (delta > 2) {
k -= a - 1;
acc += a;
if (k % 2 == 0) {
acc += delta * (k / 2);
} else... | [
"expression.operation.binary.add"
] | 932,994 | 932,995 | u629133942 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll K, A, B;
cin >> K >> A >> B;
if (A >= B || K <= A)
cout << K + 1 << endl;
else
cout << A + (K + 1 - A) / 2 * (B - A) + (K - A + 1) % 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll K, A, B;
cin >> K >> A >> B;
if (A >= B - 1 || K <= A)
cout << K + 1 << endl;
else
cout << A + (K - A + 1) / 2 * (B - A) + (K - A + 1) % 2 << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 932,996 | 932,997 | u548834738 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.