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 |
|---|---|---|---|---|---|---|---|
p03131 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (a >= b || k - a + 1 <= 0)
cout << k + 1;
else {
k = k - a + 1;
if (k == 1)
cout << a + 1;
else if (k % 2 != 0)
cout << (k / 2) * b - (k / 2 - 1) * a + 1;
else
... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (a + 1 >= b || k - a + 1 <= 0)
cout << k + 1;
else {
k = k - a + 1;
if (k == 1)
cout << a + 1;
else if (k % 2 != 0)
cout << (k / 2) * b - (k / 2 - 1) * a + 1;
els... | [
"control_flow.branch.if.condition.change"
] | 933,520 | 933,521 | u387480576 | cpp |
p03131 | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int k, a, b;
cin >> k >> a >> b;
if (a >= b || k - a + 1 <= 0)
cout << k + 1;
else {
k = k - a + 1;
if (k == 1)
cout << a + 1;
else if (k % 2 != 0)
cout << (k / 2) * b - (k / 2 - 1) * a + 1;
else
co... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if (a + 1 >= b || k - a + 1 <= 0)
cout << k + 1;
else {
k = k - a + 1;
if (k == 1)
cout << a + 1;
else if (k % 2 != 0)
cout << (k / 2) * b - (k / 2 - 1) * a + 1;
els... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change"
] | 933,522 | 933,521 | u387480576 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
int no_of_operations, A, B;
cin >> no_of_operations >> A >> B;
long long max_biscuits = 0;
if (B <= A + 2) {
max_biscuits = no_of_operations + 1;
} else if (B > A) {
if (no_of_operations <= A) {
max_biscuits = no_of_operations + 1;
} ... | #include <iostream>
using namespace std;
int main() {
int no_of_operations, A, B;
cin >> no_of_operations >> A >> B;
long long max_biscuits = 0;
if (B <= A + 2) {
max_biscuits = no_of_operations + 1;
} else if (B > A) {
if (no_of_operations <= A) {
max_biscuits = no_of_operations + 1;
} ... | [
"identifier.replace.add",
"literal.replace.remove"
] | 933,523 | 933,524 | u927253988 | cpp |
p03131 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef unsigned long long ll;
int main() {
ll k, a, b;
std::cin >> k >> a >> b;
b -= a;
ll ans = 1;
if (b <= 2)
std::cout... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
typedef long long ll;
int main() {
ll k, a, b;
std::cin >> k >> a >> b;
b -= a;
ll ans = 1;
if (b <= 2)
std::cout << k + 1... | [
"variable_declaration.type.narrow.change"
] | 933,546 | 933,547 | u176331779 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll res = 1;
ll num = 0;
num =... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll res = 1;
ll num = 0;
num =... | [
"control_flow.branch.if.condition.change"
] | 933,561 | 933,562 | u916743460 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll res = 1;
ll num = 0;
num =... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll res = 1;
ll num = 0;
num =... | [
"control_flow.branch.if.condition.change"
] | 933,563 | 933,562 | u916743460 | cpp |
p03131 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vec... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vec... | [
"variable_declaration.type.change",
"call.remove",
"expression.operation.binary.remove",
"call.arguments.change"
] | 933,564 | 933,565 | u276479653 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if ((b - a <= 2) || (k <= a)) {
cout << k + 1 << endl;
return 0;
} else {
if (a == 1) {
cout << ((k - a + 1) / 2) * (b - a) + a + (k % 2) << endl;
return 0;
} else {
cout << ((k - a +... | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if ((b - a <= 2) || (k <= a)) {
cout << k + 1 << endl;
return 0;
} else {
if (a == 1) {
cout << ((k - a + 1) / 2) * (b - a) + a + (k % 2) << endl;
return 0;
} else {
cout << ((k - a +... | [
"expression.operation.binary.add"
] | 933,566 | 933,567 | u841641310 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
unsigned long long k, a, b;
cin >> k >> a >> b;
if ((b - a <= 2) || (k <= a)) {
cout << k + 1 << endl;
return 0;
} else {
if (a == 1) {
cout << ((k - a + 1) / 2) * (b - a) + a + (k % 2) << endl;
return 0;
} else {
cout << ... | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
if ((b - a <= 2) || (k <= a)) {
cout << k + 1 << endl;
return 0;
} else {
if (a == 1) {
cout << ((k - a + 1) / 2) * (b - a) + a + (k % 2) << endl;
return 0;
} else {
cout << ((k - a +... | [
"variable_declaration.type.narrow.change"
] | 933,568 | 933,567 | u841641310 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 933,573 | 933,571 | u435321965 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"control_flow.branch.if.condition.change"
] | 933,574 | 933,571 | u435321965 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"control_flow.branch.if.condition.change"
] | 933,575 | 933,571 | u435321965 | cpp |
p03131 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"control_flow.branch.if.condition.change",
"literal.number.type.widen.change"
] | 933,576 | 933,571 | u435321965 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
long long int dif = b - a;
long long int res = 0;
if (dif <= 1)
cout << (n + 1) << endl;
else {
// cout << "in" << endl;
long long int m = n;
res = 0;
n = n - (a);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
long long int dif = b - a;
long long int res = 0;
if (dif <= 1)
cout << (n + 1) << endl;
else {
// cout << "in" << endl;
long long int m = n;
res = 0;
n = n - (a);
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 933,577 | 933,578 | u031482407 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
long long K, A, B;
long long biscuit = 1; //,yen = 0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> K >> A >> B;
if (A + 2 < B) {
if (K >= A + 1) {
K -=... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
long long K, A, B;
long long biscuit = 1; //,yen = 0;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> K >> A >> B;
if (A + 2 < B) {
if (K >= A + 1) {
K -=... | [] | 933,585 | 933,586 | u325820449 | cpp |
p03131 | #include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define int long long
using namespace std;
signed main() {
int k, a, b;
int sum = 1;
cin >> k >> a >> b;
if (k < a) {
sum += k;
k = 0;
} else {
sum += (a - 1);
k -= (a - 1);
}
while (k > ... | #include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define int long long
using namespace std;
signed main() {
int k, a, b;
int sum = 1;
cin >> k >> a >> b;
if (k < a) {
sum += k;
k = 0;
} else {
sum += (a - 1);
k -= (a - 1);
}
while (k > ... | [
"expression.operation.binary.remove"
] | 933,587 | 933,588 | u021140967 | cpp |
p03131 | #include <iostream>
using namespace std;
int main(void) {
long long K, A, B;
int check = 1;
long long count = 0;
long long pre_K;
cin >> K >> A >> B;
pre_K = K;
int i;
if (K == 1 || K <= A - 1) {
cout << K + 1 << endl;
} else if (A >= B - 1) {
cout << K + 1 << endl;
} else {
while (K > 1... | #include <iostream>
using namespace std;
int main(void) {
long long K, A, B;
int check = 1;
long long count = 0;
long long pre_K;
cin >> K >> A >> B;
pre_K = K;
int i;
if (K == 1 || K <= A) {
cout << K + 1 << endl;
} else if (A >= B - 1) {
cout << K + 1 << endl;
} else {
while (K > 1) {
... | [
"expression.operation.binary.remove"
] | 933,604 | 933,605 | u586244382 | cpp |
p03131 | #include <iostream>
using namespace std;
int main(void) {
long long K, A, B;
int check = 1;
long long count = 0;
long long pre_K;
cin >> K >> A >> B;
pre_K = K;
int i;
if (K == 1) {
cout << K + 1 << endl;
} else if (A >= B - 1) {
cout << K + 1 << endl;
} else {
while (K > 1) {
if (... | #include <iostream>
using namespace std;
int main(void) {
long long K, A, B;
int check = 1;
long long count = 0;
long long pre_K;
cin >> K >> A >> B;
pre_K = K;
int i;
if (K == 1 || K <= A) {
cout << K + 1 << endl;
} else if (A >= B - 1) {
cout << K + 1 << endl;
} else {
while (K > 1) {
... | [
"control_flow.branch.if.condition.change"
] | 933,606 | 933,605 | u586244382 | cpp |
p03131 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 933,617 | 933,618 | u629650917 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
long long it;
long long res;
if (b <= (a + 2))
res = 1 + k;
else {
it = (k - a - 1) / 2;
res = 1 + k + it * (b - a - 2);
}
cout << res << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long k, a, b;
cin >> k >> a >> b;
long long it;
long long res;
if (b <= (a + 2))
res = 1 + k;
else {
it = (k - a + 1) / 2;
res = 1 + k + it * (b - a - 2);
}
cout << res << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 933,639 | 933,640 | u462329577 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
namespace io {
const int L = (1 << 20) + 1;
char buf[L], *S, *T, c;
char getchar() {
if (__builtin_expect(S == T, 0)) {
T = (S ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
namespace io {
const int L = (1 << 20) + 1;
char buf[L], *S, *T, c;
char getchar() {
if (__builtin_expect(S == T, 0)) {
T = (S ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 933,647 | 933,648 | u807919574 | cpp |
p03131 | #include <iostream>
using namespace std;
int main() {
long long int K, A, B;
cin >> K >> A >> B;
long long int max = 0;
max = K + 1;
int mh = 0;
mh = max;
int ct = 1;
if (B - A > 2) {
if ((K + 1 - A) % 2 == 0) {
max = A + (B - A) * (K + 1 - A) / 2;
} else {
max = A + (B - A) * (K + 1... | #include <iostream>
using namespace std;
int main() {
long long int K, A, B;
cin >> K >> A >> B;
long long int max = 0;
max = K + 1;
int mh = 0;
mh = max;
int ct = 1;
if (B - A > 2) {
if ((K + 1 - A) % 2 == 0) {
max = A + (B - A) * ((K + 1 - A) / 2);
} else {
max = A + (B - A) * ((K ... | [] | 933,655 | 933,656 | u724063025 | cpp |
p03131 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int dx[4] =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 933,661 | 933,662 | u199371251 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll k, m, ans, a, b;
ll t[1 << 17], d[1 << 17];
vector<ll> u, v;
int main() {
cin >> k >> a >> b;
ans = 1;
if (a + 1 >= b || a > k - 1) {
cout << k + 1 << endl;
return 0;
} else {
ans = a;
k -= a - 3;
ans = b;
ans += (b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll k, m, ans, a, b;
ll t[1 << 17], d[1 << 17];
vector<ll> u, v;
int main() {
cin >> k >> a >> b;
ans = 1;
if (a + 1 >= b || a > k - 1) {
cout << k + 1 << endl;
return 0;
} else {
ans = a;
k -= a + 1;
ans = b;
ans += (b... | [] | 933,663 | 933,664 | u394482932 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
// Int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
Int k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b) {
dump(k + 1);
return 0;
}
if (k <= a + 1) {
dump(k);
... | #include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
// Int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
Int k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b) {
dump(k + 1);
return 0;
}
if (k < a + 1) {
dump(k + 1);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 933,667 | 933,666 | u572665222 | cpp |
p03131 | #include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
// Int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
Int k, a, b;
cin >> k >> a >> b;
if (a + 1 >= b) {
dump(k + 1);
return 0;
}
if (k <= a + 1) {
dump(k);
... | #include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef int64_t Int;
Int mod = 1e9 + 7;
// Int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
Int k, a, b;
cin >> k >> a >> b;
if (a + 2 >= b) {
dump(k + 1);
return 0;
}
if (k < a + 1) {
dump(k + 1);
... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 933,668 | 933,666 | u572665222 | cpp |
p03131 | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
long long ans = 0;
if (B - A > 2 && K >= 2) {
K = K - (A + 1);
long long a_num = K / 2;
long long... | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
long long ans = 0;
if (K > A && B - A > 2 && K >= 2) {
K = K - (A + 1);
long long a_num = K / 2;
... | [
"control_flow.branch.if.condition.change"
] | 933,688 | 933,689 | u758765597 | cpp |
p03131 | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
long long ans = 0;
if (B - A > 2 && K > 2) {
K = K - (A + 1);
long long a_num = K / 2;
long long ... | #include <algorithm>
#include <iomanip>
#include <ios>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long K, A, B;
cin >> K >> A >> B;
long long ans = 0;
if (K > A && B - A > 2 && K >= 2) {
K = K - (A + 1);
long long a_num = K / 2;
... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 933,690 | 933,689 | u758765597 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | [] | 933,695 | 933,696 | u934272719 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 933,697 | 933,698 | u604329931 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const ll INF = 1e18;
const int N = 2e5 + 5;
ll dp[N][5], a[N];
int n;
ll solve() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j < 5; j++) {
dp[i][j] = INF;
}
}
dp[0][0] = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const ll INF = 1e18;
const int N = 2e5 + 5;
ll dp[N][5], a[N];
int n;
ll solve() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j < 5; j++) {
dp[i][j] = INF;
}
}
dp[0][0] = 0;
for (int... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 933,701 | 933,702 | u399309850 | cpp |
p03132 | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
ll A[200010], dp[200010][5] = {};
int main(void) {
int L;
cin >> L;
for (int i = 0; i < L; ++i)
cin >> A[i];
for (int i = 0; i < L; ++i) {
ll mn = 1e18;
for (int j = 0; j < 5; ++j) {
mn = min(mn, dp[i][j]);
... | #include <algorithm>
#include <iostream>
typedef long long ll;
using namespace std;
ll A[200010], dp[200010][5] = {};
int main(void) {
int L;
cin >> L;
for (int i = 0; i < L; ++i)
cin >> A[i];
for (int i = 0; i < L; ++i) {
ll mn = 1e18;
for (int j = 0; j < 5; ++j) {
mn = min(mn, dp[i][j]);
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 933,709 | 933,710 | u297367372 | cpp |
p03132 | #ifndef DEBUG
#define NDEBUG
#endif
#include <cassert>
#include <iostream>
#include <iterator>
#include <limits>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]] constexpr Z INF = numeric_limits<Z>::max... | #ifndef DEBUG
#define NDEBUG
#endif
#include <cassert>
#include <iostream>
#include <iterator>
#include <limits>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]] constexpr Z INF = numeric_limits<Z>::max... | [
"expression.operation.binary.remove"
] | 933,718 | 933,719 | u390181802 | cpp |
p03132 | /* be name khoda */
#define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef lo... | /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef... | [] | 933,720 | 933,721 | u780597450 | cpp |
p03132 | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
//#define int long long
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
using namespace std;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, ... | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
//#define int long long
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
using namespace std;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, ... | [
"variable_declaration.type.change"
] | 933,728 | 933,729 | u317754719 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x + modulo)) % modulo)
#define Inf 1000000000000000
int main() {
int N;
cin >> N;
vector<vector<long long>> dp(N + 1, vector<long long>(5, Inf));
for (int i = 0; i <= N; i++) {
long long A;
i... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x + modulo)) % modulo)
#define Inf 1000000000000000
int main() {
int N;
cin >> N;
vector<vector<long long>> dp(N + 1, vector<long long>(5, Inf));
for (int i = 0; i <= N; i++) {
long long A;
i... | [
"literal.number.change",
"assignment.value.change"
] | 933,734 | 933,735 | u118797367 | cpp |
p03132 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long l... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long l... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 933,740 | 933,741 | u450494974 | cpp |
p03132 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int l;
cin >> l;
long dp[l + 1][5];
fill(dp[0], dp[l + 1], 0);
for (int i = 0; i < l; i++) {
long a;
cin >> a;
long best = 1e18;
for (int j = 0; j < 5; j++) {
dp[i + 1][j] = min(best, dp[i][j]);
if (j == 0... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int l;
cin >> l;
long dp[l + 1][5];
fill(dp[0], dp[l + 1], 0);
for (int i = 0; i < l; i++) {
long a;
cin >> a;
long best = 1e18;
for (int j = 0; j < 5; j++) {
dp[i + 1][j] = best = min(best, dp[i][j]);
if ... | [
"assignment.change"
] | 933,744 | 933,745 | u956758464 | cpp |
p03132 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int l;
cin >> l;
long dp[l + 1][5];
fill(dp[0], dp[l + 1], 0);
for (int i = 0; i < l; i++) {
long a;
cin >> a;
long best = 1000000000000000;
for (int j = 0; j < 5; j++) {
dp[i + 1][j] = min(best, dp[i][j]);
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int l;
cin >> l;
long dp[l + 1][5];
fill(dp[0], dp[l + 1], 0);
for (int i = 0; i < l; i++) {
long a;
cin >> a;
long best = 1e18;
for (int j = 0; j < 5; j++) {
dp[i + 1][j] = best = min(best, dp[i][j]);
if ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 933,746 | 933,745 | u956758464 | cpp |
p03132 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = a; i < n; i++)
#define Repr(i, n, a) for (int i = n; i >= a; i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typedef pai... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = a; i < n; i++)
#define Repr(i, n, a) for (int i = n; i >= a; i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) a.begin(), a.end()
using namespace std;
typedef pair<int, int> P;
typedef pai... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 933,747 | 933,748 | u869282786 | cpp |
p03132 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int SIZEN = 200010;
typedef long long LL;
LL a[SIZEN] = {0};
LL L1[SIZEN] = {0};
LL L2[SIZEN] = {0};
LL R1[SIZEN] = {0};
LL R2[SIZEN] = {0};
LL sum[SIZEN];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int SIZEN = 200010;
typedef long long LL;
LL a[SIZEN] = {0};
LL L1[SIZEN] = {0};
LL L2[SIZEN] = {0};
LL R1[SIZEN] = {0};
LL R2[SIZEN] = {0};
LL sum[SIZEN];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 933,749 | 933,750 | u140172805 | cpp |
p03132 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int SIZEN = 200010;
typedef long long LL;
LL a[SIZEN] = {0};
LL L1[SIZEN] = {0};
LL L2[SIZEN] = {0};
LL R1[SIZEN] = {0};
LL R2[SIZEN] = {0};
LL sum[SIZEN];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
using namespace std;
const int SIZEN = 200010;
typedef long long LL;
LL a[SIZEN] = {0};
LL L1[SIZEN] = {0};
LL L2[SIZEN] = {0};
LL R1[SIZEN] = {0};
LL R2[SIZEN] = {0};
LL sum[SIZEN];
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 933,751 | 933,750 | u140172805 | cpp |
p03132 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (... |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 933,754 | 933,755 | u305138467 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
const ll INF = 8e18 + 7;
// lower -even-> start -odd-> end -even-> upper
int n;
ll a[N], sum[N];
int sumOfEven[N], sumOfOdd[N];
ll minCarry[4];
ll f[N][4];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
const ll INF = 8e18 + 7;
// lower -even-> start -odd-> end -even-> upper
int n;
ll a[N], sum[N];
int sumOfEven[N], sumOfOdd[N];
ll minCarry[4];
ll f[N][4];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i =... | [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 933,761 | 933,762 | u353573192 | cpp |
p03132 | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
vector<int> calc1(int L, vector<int> &A) {
vector<int> dp(L + 1);
int sum = 0;
for (int i = 1; i <= L; ++i) {
sum += A[i];
if (A[i] ... | #include <bits/stdc++.h>
#define ALL(c) (c).begin(), (c).end()
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
using namespace std;
#define int long long
vector<int> calc1(int L, vector<int> &A) {
vector<int> dp(L + 1);
int sum = 0;
for (int i = 1; i <= L; ++i) {
sum += A[i];
if (A[i] ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 933,763 | 933,764 | u183530284 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double, double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define RFOR(i, j, k, in) for (ll i = j; i >= k; i -= in)
#define... | [] | 933,767 | 933,768 | u825429292 | cpp |
p03132 | #include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#define MAX_L (200000L)
#define INF (1000000000000000000L)
using namespace std;
long accl_as[MAX_L + 2], accr_as[MAX_L + 2];
long accl_nes[MAX_L + 2];
long dp1s[MAX_L + 1], dp2s[MAX_L + 1];
long dp2ds[MAX_L + 1];
long minr_dp2ds[MAX_L + 1];
int main(int ar... | #include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#define MAX_L (200000L)
#define INF (1000000000000000000L)
using namespace std;
long accl_as[MAX_L + 2], accr_as[MAX_L + 2];
long accl_nes[MAX_L + 2];
long dp1s[MAX_L + 1], dp2s[MAX_L + 1];
long dp2ds[MAX_L + 1];
long minr_dp2ds[MAX_L + 1];
int main(int ar... | [
"expression.operation.binary.remove"
] | 933,769 | 933,770 | u359413838 | cpp |
p03132 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAXN 200000
#define LL long long
#define DB double
#define FR first
#define SE second
int a[MAXN + 5];
LL ans;
LL L1[MAXN], L2[MAXN + 5], R1[MAXN + 5], R2[MAXN + 5];
LL lsum[MAXN ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAXN 200000
#define LL long long
#define DB double
#define FR first
#define SE second
int a[MAXN + 5];
LL ans;
LL L1[MAXN], L2[MAXN + 5], R1[MAXN + 5], R2[MAXN + 5];
LL lsum[MAXN ... | [
"literal.string.change",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 933,781 | 933,782 | u294179241 | cpp |
p03132 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tim... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tim... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 933,783 | 933,784 | u313288017 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
long long a[300001];
long long f[300001][5];
int main() {
int l;
scanf("%d", &l);
int i;
long long tot = 0;
for (i = 1; i <= l; i++) {
scanf("%lld", &a[i]);
tot += a[i];
}
int j;
for (i = 1; i <= l; i++) {
if (a[i] != 0) {
long long tmp = f... | #include <bits/stdc++.h>
using namespace std;
long long a[300001];
long long f[300001][5];
int main() {
int l;
scanf("%d", &l);
int i;
long long tot = 0;
for (i = 1; i <= l; i++) {
scanf("%lld", &a[i]);
tot += a[i];
}
int j;
for (i = 1; i <= l; i++) {
if (a[i] != 0) {
long long tmp = f... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 933,792 | 933,793 | u137690186 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
long long a[300001];
long long f[300001][5];
int main() {
int l;
scanf("%d", &l);
int i;
long long tot = 0;
for (i = 1; i <= l; i++) {
scanf("%lld", &a[i]);
tot += a[i];
}
for (i = 1; i <= l; i++) {
if (a[i] != 0) {
long long tmp = f[i - 1][0... | #include <bits/stdc++.h>
using namespace std;
long long a[300001];
long long f[300001][5];
int main() {
int l;
scanf("%d", &l);
int i;
long long tot = 0;
for (i = 1; i <= l; i++) {
scanf("%lld", &a[i]);
tot += a[i];
}
int j;
for (i = 1; i <= l; i++) {
if (a[i] != 0) {
long long tmp = f... | [
"variable_declaration.add",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 933,794 | 933,793 | u137690186 | cpp |
p03132 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define... | [
"assignment.change"
] | 933,795 | 933,796 | u471289663 | cpp |
p03132 |
#include <bits/stdc++.h>
#define MAX_N 200005
#define MAX_M 100005
#define pb push_back
#define mp make_pair
#define all(V) (V).begin(), (V).end()
#define reset(V) \
(V).clear(); \
(V).re... |
#include <bits/stdc++.h>
#define MAX_N 200005
#define MAX_M 100005
#define pb push_back
#define mp make_pair
#define all(V) (V).begin(), (V).end()
#define reset(V) \
(V).clear(); \
(V).re... | [
"expression.operation.binary.remove"
] | 933,799 | 933,800 | u410228537 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int, int> pii;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
ll L;
ll A[200010];
ll dp[200010][5];
ll rec(int pos, int stat) {
if (dp[pos][stat] >= 0)
return dp[pos][s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int, int> pii;
void fastStream() {
cin.tie(0);
std::ios_base::sync_with_stdio(0);
}
ll L;
ll A[200010];
ll dp[200010][5];
ll rec(int pos, int stat) {
if (dp[pos][stat] >= 0)
return dp[pos][s... | [] | 933,801 | 933,802 | u489053642 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"literal.number.change",
"call.arguments.change"
] | 933,805 | 933,806 | u579152247 | cpp |
p03132 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 933,807 | 933,806 | u579152247 | cpp |
p03132 | #define DEB
#include <bits/stdc++.h>
#define REP(i, m) for (int i = 0; i < (m); ++i)
#define REPN(i, m, in) for (int i = (in); i < (m); ++i)
#define ALL(t) (t).begin(), (t).end()
#define CLR(a) memset((a), 0, sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
using namespace std;
... | #define DEB
#include <bits/stdc++.h>
#define REP(i, m) for (int i = 0; i < (m); ++i)
#define REPN(i, m, in) for (int i = (in); i < (m); ++i)
#define ALL(t) (t).begin(), (t).end()
#define CLR(a) memset((a), 0, sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
using namespace std;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 933,810 | 933,811 | u801556382 | cpp |
p03133 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr boo... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr boo... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 933,832 | 933,833 | u047554023 | cpp |
p03133 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include ... | [
"assignment.variable.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 933,834 | 933,835 | u798339690 | cpp |
p03133 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | [
"expression.operation.binary.remove"
] | 933,838 | 933,839 | u633284019 | cpp |
p03133 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const Int MOD = 998244353;
const Int MAX = 1000;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const Int MOD = 998244353;
const Int MAX = 1000;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 933,842 | 933,841 | u449722246 | cpp |
p03114 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, INV9 = (MOD + 1) / 9;
int dp[12][1 << 15 | 1], val[1 << 15 | 1], val0[1 << 15 | 1], N, Q, l[20],
r[20];
vector<int> lsh, coef;
int poww(long long a, int b) {
int times = 1;
while (b) {
if (b & 1)
times = times * a % MOD;
a = ... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, INV9 = (MOD + 1) / 9;
int dp[12][1 << 15 | 1], val[1 << 15 | 1], val0[1 << 15 | 1], N, Q, l[20],
r[20];
vector<int> lsh, coef;
int poww(long long a, int b) {
int times = 1;
while (b) {
if (b & 1)
times = times * a % MOD;
a = ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 933,879 | 933,880 | u563201135 | cpp |
p03114 | // by yjz
#include <bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it, s) \
for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); it++)
#ifndef LOCAL
#define cerr ... | // by yjz
#include <bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it, s) \
for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); it++)
#ifndef LOCAL
#define cerr ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 933,883 | 933,884 | u563764376 | cpp |
p03114 | #include <bits/stdc++.h>
#define Q 22
#define ll long long
#define mo 1000000007
#define ni9 111111112
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char c = getchar();
int fh = 1;
while (!isdigit(c)) {
if (c == '-')
fh = -1;
c = getchar();
}
while (isdigit(c))
x = x ... | #include <bits/stdc++.h>
#define Q 22
#define ll long long
#define mo 1000000007
#define ni9 111111112
using namespace std;
template <typename T> void read(T &x) {
x = 0;
char c = getchar();
int fh = 1;
while (!isdigit(c)) {
if (c == '-')
fh = -1;
c = getchar();
}
while (isdigit(c))
x = x ... | [] | 933,885 | 933,886 | u539443668 | cpp |
p03114 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"expression.operation.binary.add"
] | 933,889 | 933,890 | u284124505 | cpp |
p03114 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"identifier.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 933,891 | 933,892 | u483814783 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(0, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(0, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | [
"assignment.variable.change",
"identifier.change"
] | 933,920 | 933,921 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | [
"variable_declaration.value.change"
] | 933,924 | 933,925 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | [
"expression.operation.binary.change",
"expression.operation.unary.add"
] | 933,927 | 933,928 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | [
"call.arguments.add",
"expression.operation.binary.change",
"expression.operation.unary.add"
] | 933,929 | 933,928 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
qab[0].reserve(... | [
"call.arguments.add",
"expression.operation.binary.change",
"expression.operation.unary.add",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 933,930 | 933,928 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
int sz = ab.siz... | [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 933,931 | 933,932 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
for (pin x : ab... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
for (pin x : ab... | [
"literal.number.change",
"call.arguments.change"
] | 933,933 | 933,934 | u021034020 | cpp |
p03116 | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
for (pin x : ab... | #include <iostream>
#include <vector>
using namespace std;
#define int long long
#define V vector
#define vel V<int>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mkp make_pair
#define pin pair<int, int>
pin solve(V<pin> &ab, int ex) {
if (!ex) {
return mkp(1, 0);
}
V<V<pin>> qab(2);
for (pin x : ab... | [
"literal.string.change",
"call.arguments.change"
] | 933,935 | 933,936 | u021034020 | cpp |
p03121 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul... | [
"assignment.change"
] | 933,947 | 933,948 | u953484888 | cpp |
p03125 | #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>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #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>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 933,953 | 933,954 | u005006157 | cpp |
p03125 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << a - b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b % a == 0)
cout << a + b << endl;
else
cout << b - a << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 933,957 | 933,958 | u818967913 | cpp |
p03125 | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#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
#de... | #include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
// using namespace atcoder;
#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
#de... | [
"expression.operation.binary.remove"
] | 933,963 | 933,964 | u722640678 | cpp |
p03125 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << A - B << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (B % A == 0) {
cout << A + B << endl;
} else {
cout << B - A << endl;
}
}
| [
"expression.operation.binary.remove"
] | 933,967 | 933,968 | u312172322 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (double)b / a;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (double)a / b;
return 0;
}
| [
"expression.operation.binary.remove"
] | 933,974 | 933,975 | u818967913 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << b / a;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (double)a / b;
return 0;
}
| [
"expression.operation.binary.add"
] | 933,976 | 933,975 | u818967913 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int X, T;
cin >> X >> T;
cout << double(T) / double(X);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X, T;
cin >> T >> X;
cout << double(T) / double(X);
return 0;
} | [
"expression.operation.binary.remove"
] | 933,977 | 933,978 | u337949146 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << fixed << setprecision(4) << t / x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << fixed << setprecision(4) << t / x << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 933,979 | 933,980 | u298768617 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double c;
c = a / b;
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double c;
c = a / b;
cout << c << endl;
} | [
"variable_declaration.type.primitive.change"
] | 933,985 | 933,986 | u946082956 | cpp |
p03135 | #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
... | #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
... | [
"type_conversion.add"
] | 933,987 | 933,988 | u531436689 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (double)b / a << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (double)a / b << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 933,989 | 933,990 | u123745130 | cpp |
p03135 | /*
author : nishi5451
created: 11.08.2020 21:18:57
*/
#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 t, x;
cin >> t >> x;
double ans;
ans = t / x;
printf("%.12lf", ans);
return 0;
}
| /*
author : nishi5451
created: 11.08.2020 21:18:57
*/
#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 t, x;
cin >> t >> x;
double ans;
ans = (double)t / x;
printf("%.12lf", ans);
return 0;
}
| [
"type_conversion.add"
] | 933,991 | 933,992 | u033937898 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / b;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
}
| [
"variable_declaration.type.primitive.change",
"io.output.newline.add"
] | 933,995 | 933,996 | u025773431 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
double a;
cin >> t >> x;
a = t / x;
cout << a;
} | #include <iostream>
using namespace std;
int main() {
double t, x, a;
cin >> t >> x;
a = t / x;
cout << a;
} | [
"variable_declaration.type.primitive.change"
] | 933,997 | 933,998 | u691856718 | cpp |
p03135 | #include <bits/stdc++.h>
#include <cstdio> // popen, pclose, fgets
#include <cstdlib>
#include <iostream>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using vi = vector<int>; // intの1次元の型に vi という別名を... | #include <bits/stdc++.h>
#include <cstdio> // popen, pclose, fgets
#include <cstdlib>
#include <iostream>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using vi = vector<int>; // intの1次元の型に vi という別名を... | [
"variable_declaration.type.primitive.change"
] | 933,999 | 934,000 | u680574634 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = T / X;
cout << fixed << setprecision(3) << time << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = T * 1.0 / X;
cout << fixed << setprecision(3) << time << endl;
return 0;
} | [
"assignment.change"
] | 934,003 | 934,004 | u260525363 | cpp |
p03135 | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
typedef pair<int, int> P;
#define inf 1e9
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
priority_queue<llint, vector<llint>, greater<llint>> que;... | // c++ テンプレ
#include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
typedef pair<int, int> P;
#define inf 1e9
#define mod 1000000007
#define sort(v) sort(v.begin(), v.end())
#define reverse(v) reverse(v.begin(), v.end())
priority_queue<llint, vector<llint>, greater<llint>> que;... | [
"variable_declaration.type.primitive.change"
] | 934,017 | 934,018 | u332253305 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
double C = A / B;
cout << C << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
double C = A / B;
cout << C << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,019 | 934,020 | u991713078 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
float ans;
int t, x;
cin >> t >> x;
ans = t / x;
cout << setprecision(10) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double ans, t, x;
cin >> t >> x;
ans = t / x;
cout << setprecision(10) << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,038 | 934,039 | u124676202 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | [
"variable_declaration.type.change"
] | 934,040 | 934,041 | u297738015 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
int t, x;
cin >> t >> x;
cout << t * x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 934,044 | 934,045 | u191484928 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,046 | 934,047 | u751515087 | cpp |
p03135 | #include <bits/stdc++.h>
#define int long long int
#define gif(a, b) (a / b + (a % b ? 1 : 0))
#define pi 3.14159265358
#define watch(x) cout << (#x) << " is " << (x) << "\n";
#define float long double
using namespace std;
int32_t main() {
cin.tie(NULL);
std::ios::sync_with_stdio(false);
int y, m, d;
cin >> y ... | #include <bits/stdc++.h>
#define int long long int
#define gif(a, b) (a / b + (a % b ? 1 : 0))
#define pi 3.14159265358
#define watch(x) cout << (#x) << " is " << (x) << "\n";
#define float long double
using namespace std;
int32_t main() {
cin.tie(NULL);
std::ios::sync_with_stdio(false);
int y, m, d;
cin >> y ... | [
"type_conversion.add"
] | 934,051 | 934,052 | u735675333 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << setprecision(10) << (double)x / t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << setprecision(10) << (double)t / x << endl;
}
| [
"expression.operation.binary.remove"
] | 934,053 | 934,054 | u449303900 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X;
}
| [
"variable_declaration.type.primitive.change"
] | 934,074 | 934,075 | u884647366 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.