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 |
|---|---|---|---|---|---|---|---|
p03055 | // BWOTSHEWCHB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define in insert
#define X first
#define Y second
const int MAXN = 1e6 + 69, MOD = 1e9 + 7;
int n, leaf, dp[MAXN], height[MAXN];
vector<int> g[MAXN];
void dfs(int v, int par = -1) {
for (auto u : g[v])
i... | // BWOTSHEWCHB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define in insert
#define X first
#define Y second
const int MAXN = 1e6 + 69, MOD = 1e9 + 7;
int n, leaf, dp[MAXN], height[MAXN];
vector<int> g[MAXN];
void dfs(int v, int par = -1) {
for (auto u : g[v])
i... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 870,181 | 870,182 | u711755001 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200001;
int len, fid, dis;
vector<int> edge[maxn];
void dfs(int now, int last, int d = 0) {
if (d > dis) {
dis = d;
fid = now;
}
for (auto &i : edge[now]) {
if (last != i) {
dfs(i, now, d + 1);
}
}
}
bool win[maxn];
int main() ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200001;
int len, fid, dis;
vector<int> edge[maxn];
void dfs(int now, int last, int d = 1) {
if (d > dis) {
dis = d;
fid = now;
}
for (auto &i : edge[now]) {
if (last != i) {
dfs(i, now, d + 1);
}
}
}
bool win[maxn];
int main() ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 870,183 | 870,184 | u233690053 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200001;
int len, fid, dis;
vector<int> edge[maxn];
void dfs(int now, int last, int d = 0) {
if (d > dis) {
dis = d;
fid = now;
}
for (auto &i : edge[now]) {
if (last != i) {
dfs(i, now, d + 1);
}
}
}
bool win[maxn];
int main() ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200001;
int len, fid, dis;
vector<int> edge[maxn];
void dfs(int now, int last, int d = 1) {
if (d > dis) {
dis = d;
fid = now;
}
for (auto &i : edge[now]) {
if (last != i) {
dfs(i, now, d + 1);
}
}
}
bool win[maxn];
int main() ... | [
"literal.number.change",
"expression.operation.binary.remove",
"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"
] | 870,185 | 870,184 | u233690053 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// 1-indexed, 200000頂点以下で統一
#define MAX_SIZE 200000
vector<int> v[MAX_SIZE + 1];
// 木vで点startから最も遠い頂点の(距離, 座標)を返す関数
pair<int, int> dfs(int start) {
pair<int, int> ans(0, start);
vector<int> dist(MAX_SIZE + 1, -1); // -1は未探訪... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
using ll = long long;
// 1-indexed, 200000頂点以下で統一
#define MAX_SIZE 200000
vector<int> v[MAX_SIZE + 1];
// 木vで点startから最も遠い頂点の(距離, 座標)を返す関数
pair<int, int> dfs(int start) {
pair<int, int> ans(0, start);
vector<int> dist(MAX_SIZE + 1, -1); // -1は未探訪... | [] | 870,201 | 870,202 | u590088474 | cpp |
p03055 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inli... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change"
] | 870,212 | 870,211 | u807998890 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); i... | [] | 870,227 | 870,228 | u807190097 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define foreach(it, v) \
for (typeof(v.begin()) it = v.begin(); i... | [] | 870,229 | 870,230 | u807190097 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
pair<uint64_t, uint64_t>
farthest(uint64_t N, map<uint64_t, set<uint64_t>> &edges, uint64_t src) {
vector<bool> visited(N, false);
stack<pair<uint64_t, uint64_t>> s;
s.emplace(src, 0);
uint64_t max_len = 0, max_len_node = -1;
while (!s.empty()) {
pair<uint... | #include <bits/stdc++.h>
using namespace std;
pair<uint64_t, uint64_t>
farthest(uint64_t N, map<uint64_t, set<uint64_t>> &edges, uint64_t src) {
vector<bool> visited(N, false);
stack<pair<uint64_t, uint64_t>> s;
s.emplace(src, 0);
uint64_t max_len = 0, max_len_node = 0;
while (!s.empty()) {
pair<uint6... | [
"literal.number.change",
"variable_declaration.value.change"
] | 870,239 | 870,240 | u198355306 | cpp |
p03055 | #include <bits/stdc++.h>
#define FAST_IO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define Relocate \
freopen("./in.txt", "r", stdin), freopen("./out.txt", "w", stdout)
#define up(mi, a, b) for (mi = a; mi <= b; ++mi)
#define down(mi, b, a) for (mi ... | #include <bits/stdc++.h>
#define FAST_IO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define Relocate \
freopen("./in.txt", "r", stdin), freopen("./out.txt", "w", stdout)
#define up(mi, a, b) for (mi = a; mi <= b; ++mi)
#define down(mi, b, a) for (mi ... | [
"expression.unary.arithmetic.add",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 870,241 | 870,242 | u305806150 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i ... | #include <bits/stdc++.h>
using namespace std;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i ... | [] | 870,247 | 870,248 | u959236700 | cpp |
p03055 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long lo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long lo... | [
"call.remove"
] | 870,249 | 870,250 | u754514364 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 870,253 | 870,254 | u780122303 | cpp |
p03055 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"control_flow.branch.if.condition.change"
] | 870,255 | 870,256 | u764076797 | cpp |
p03055 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 870,257 | 870,258 | u472675932 | cpp |
p03055 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se seco... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se seco... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 870,265 | 870,266 | u955723966 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct Dijkstra {
struct Edge {
int to;
T cost;
};
vector<int> prev;
vector<vector<Edge>> g;
Dijkstra(int n) : prev(n, -1), g(n) {}
void addEdge(int u, int v, T w) {
g[u].push_back({v, w});
g[v].push_back({u, w});
}
ve... | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct Dijkstra {
struct Edge {
int to;
T cost;
};
vector<int> prev;
vector<vector<Edge>> g;
Dijkstra(int n) : prev(n, -1), g(n) {}
void addEdge(int u, int v, T w) {
g[u].push_back({v, w});
g[v].push_back({u, w});
}
ve... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 870,267 | 870,268 | u858748695 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 1;
vector<int> to[maxn];
int len, rt, n;
void dfs(int u, int f, int d) {
if (d > len)
len = d, rt = u;
for (auto v : to[u])
if (v != f)
dfs(v, u, d + 1);
}
int main() {
scanf("%d", &n);
for (int i = 2; i <= n; ++i) {
int ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 1;
vector<int> to[maxn];
int len, rt, n;
void dfs(int u, int f, int d) {
if (d > len)
len = d, rt = u;
for (auto v : to[u])
if (v != f)
dfs(v, u, d + 1);
}
int main() {
scanf("%d", &n);
for (int i = 2; i <= n; ++i) {
int ... | [] | 870,271 | 870,272 | u860951382 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 870,291 | 870,292 | u900834830 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin()... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 870,293 | 870,294 | u912359563 | cpp |
p03055 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> graph;
vector<int> depth;
int start;
void dfs(int v) {
for (auto next : graph[v]) {
if (depth[next] == 0 && next != start) {
depth[next] = depth[v] + 1;
dfs(next);
}
}
}
int main() {
int n;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> graph;
vector<int> depth;
int start;
void dfs(int v) {
for (auto next : graph[v]) {
if (depth[next] == 0 && next != start) {
depth[next] = depth[v] + 1;
dfs(next);
}
}
}
int main() {
int n;
... | [
"expression.operation.binary.remove"
] | 870,295 | 870,296 | u412908746 | cpp |
p03055 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h> //////////////////////////////////////////
#define deb(...) /////////////////////////////////////////////////
#define DBP(...) /////////////////////////////////////////////////
#ifdef LOC ///////////////////////////////////////////////////... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h> //////////////////////////////////////////
#define deb(...) /////////////////////////////////////////////////
#define DBP(...) /////////////////////////////////////////////////
#ifdef LOC ///////////////////////////////////////////////////... | [
"call.arguments.change"
] | 870,299 | 870,300 | u018915813 | cpp |
p03055 | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"literal.string.change"
] | 870,305 | 870,306 | u656721037 | cpp |
p03055 | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄... | [
"call.remove"
] | 870,311 | 870,312 | u139147798 | cpp |
p03055 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | [
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 870,317 | 870,318 | u287015418 | cpp |
p03054 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int H, W, N, Sr, Sc;
string S, T;
int main() {
cin >> H >> W >> N;
cin >> Sr >> Sc;
ci... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int H, W, N, Sr, Sc;
string S, T;
int main() {
cin >> H >> W >> N;
cin >> Sr >> Sc;
ci... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 870,325 | 870,326 | u551373727 | cpp |
p03054 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.ren... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 870,343 | 870,344 | u837951457 | cpp |
p03054 | #include <algorithm>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
in... | #include <algorithm>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 870,345 | 870,346 | u848504701 | cpp |
p03054 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 870,353 | 870,354 | u516353059 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, N;
cin >> H >> W >> N;
int r, c;
cin >> r >> c;
string S, T;
cin >> S >> T;
bool ans = true;
int left_out_lim = 0, right_out_lim = W + 1;
int upper_out_lim = 0, lower_out_lim = H + 1;
if (S[N - 1] == 'L')
left_out_lim++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, N;
cin >> H >> W >> N;
int r, c;
cin >> r >> c;
string S, T;
cin >> S >> T;
bool ans = true;
int left_out_lim = 0, right_out_lim = W + 1;
int upper_out_lim = 0, lower_out_lim = H + 1;
if (S[N - 1] == 'L')
left_out_lim++;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 870,360 | 870,361 | u826487371 | cpp |
p03054 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
int sr, sc;
cin >> sr >> sc;
string s, t;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
int sr, sc;
cin >> sr >> sc;
string s, t;
... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 870,383 | 870,384 | u110336920 | cpp |
p03054 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 870,395 | 870,394 | u284045566 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 2e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 2e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 870,396 | 870,397 | u906816242 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 2e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 2e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | [
"assignment.value.change",
"identifier.change"
] | 870,398 | 870,397 | u906816242 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 1e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | #include <bits/stdc++.h>
using namespace std;
#define pi pair<int, int>
const int N = 2e5 + 10;
char A[N], B[N];
int dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
char G[5] = "DRUL";
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
int x, y;
scanf("%d%d", &x, &y);
x--, y--;
int x0 = x, y0 = y;
sca... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 870,399 | 870,397 | u906816242 | cpp |
p03054 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define reptr(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define All(x) (x).begin(), (x).end()
#define Rall(a) (a).rbegin(), (a).rend()
#define vll vec... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
#define reptr(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define All(x) (x).begin(), (x).end()
#define Rall(a) (a).rbegin(), (a).rend()
#define vll vec... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 870,418 | 870,419 | u003019316 | cpp |
p03054 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define fir first
#define sec second
#define rep(i, a, b) for (r... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define fir first
#define sec second
#define rep(i, a, b) for (r... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 870,422 | 870,423 | u473013083 | cpp |
p03054 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define fir first
#define sec second
#define rep(i, a, b) for (r... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define fir first
#define sec second
#define rep(i, a, b) for (r... | [
"literal.number.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 870,424 | 870,423 | u473013083 | cpp |
p03054 | /// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for ... | /// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for ... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 870,427 | 870,428 | u603064316 | cpp |
p03054 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#ifdef XLor
#define dbg(args...) \
do { \
cout << #a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
#ifdef XLor
#define dbg(args...) \
do { \
cout << #a... | [
"expression.operation.binary.add"
] | 870,454 | 870,455 | u419811360 | cpp |
p03054 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 200000
string S, T;
bool solve(int H, int W, int N, int r, int c) {
// それぞれ、スタート地点 (sr, sc) から上下左右の境界へのマージン
const int U = r - 1;
const int D = H - c;
const int L = c - 1;
const int R = W - r;
// 高橋くんの移動可能範囲
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 200000
string S, T;
bool solve(int H, int W, int N, int r, int c) {
// それぞれ、スタート地点 (sr, sc) から上下左右の境界へのマージン
const int U = r - 1;
const int D = H - r;
const int L = c - 1;
const int R = W - c;
// 高橋くんの移動可能範囲
... | [
"identifier.change",
"expression.operation.binary.change"
] | 870,471 | 870,472 | u319818856 | cpp |
p03054 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 870,473 | 870,474 | u063043074 | cpp |
p03054 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 870,475 | 870,474 | u063043074 | cpp |
p03054 | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | #include <bits/stdc++.h>
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define pb p... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 870,476 | 870,477 | u063043074 | cpp |
p03054 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, n, sa, sb;
string s, t;
cin >> a >> b >> n >> sa >> sb >> s >> t;
bool ans = true;
int x1 = 0, x2 = a;
for (int i = n - 1; i >= 0; i--) {
if (t[i] == 'U') {
x2 = min(x2 + 1, a);
}
if (t[i] == 'D') {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, n, sa, sb;
string s, t;
cin >> a >> b >> n >> sa >> sb >> s >> t;
bool ans = true;
int x1 = 0, x2 = a;
for (int i = n - 1; i >= 0; i--) {
if (t[i] == 'U') {
x2 = min(x2 + 1, a);
}
if (t[i] == 'D') {
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 870,478 | 870,479 | u179970156 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); i++)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 870,482 | 870,483 | u462560753 | cpp |
p03054 | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define FastRead \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"expression.operation.binary.remove"
] | 870,486 | 870,487 | u612858131 | cpp |
p03054 | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = s + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, s + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = s + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, s + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 870,490 | 870,491 | u996953683 | cpp |
p03054 | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = l + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, s + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = s + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, s + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 870,492 | 870,491 | u996953683 | cpp |
p03054 | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = l + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, l + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | // ihdignite
#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int a, string sa, string sb, char ca, char cb, int s) {
int l = 0, r = s + 1;
for (int i = n - 1; i >= 0; i--) {
if (sb[i] == ca) {
r = min(r + 1, s + 1);
}
if (sb[i] == cb) {
l = max(l - 1, 0);
}
if (sa[... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 870,493 | 870,491 | u996953683 | cpp |
p03054 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 870,504 | 870,505 | u845980916 | cpp |
p03054 | #include <stdio.h>
#include <vector>
using namespace std;
int H[2], N, S[2];
char A[200200], B[200200];
bool solve(int h, int s, vector<int> &a, vector<int> &b) {
int l = 1, r = h;
for (int i = N - 1; i >= 0; i--) {
if (b[i] == 1)
l--;
if (b[i] == -1)
r++;
if (l < 0)
l = 1;
if (... | #include <stdio.h>
#include <vector>
using namespace std;
int H[2], N, S[2];
char A[200200], B[200200];
bool solve(int h, int s, vector<int> &a, vector<int> &b) {
int l = 1, r = h;
for (int i = N - 1; i >= 0; i--) {
if (b[i] == 1)
l--;
if (b[i] == -1)
r++;
if (l < 1)
l = 1;
if (... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 870,506 | 870,507 | u233632872 | cpp |
p03058 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = (j); i <= (k); i++)
#define FFOR(i, j, k) for (int i = (j); i < (k); i++)
#define DFOR(i, j, k) for (int i = (j); i >= (k); i--)
#define bug(x) cerr << #x << " = " << (x) << '\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = (j); i <= (k); i++)
#define FFOR(i, j, k) for (int i = (j); i < (k); i++)
#define DFOR(i, j, k) for (int i = (j); i >= (k); i--)
#define bug(x) cerr << #x << " = " << (x) << '\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (... | [] | 870,545 | 870,546 | u216283258 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0... | [] | 870,549 | 870,550 | u618263300 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
#define repa(i, a, n) for (int i = (a); i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vs = vector<string>;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
#define repa(i, a, n) for (int i = (a); i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vs = vector<string>;... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 870,560 | 870,561 | u124142430 | cpp |
p03059 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a / c;
cout << d * b;
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = c / a;
cout << d * b;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 870,605 | 870,606 | u683078179 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (A / T) * B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
} | [
"expression.operation.binary.remove"
] | 870,607 | 870,608 | u453366189 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b, c;
cin >> a >> b >> c;
cout << c / a * b;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c / a) * b;
}
| [
"variable_declaration.type.primitive.change"
] | 870,621 | 870,622 | u829521436 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t % a * b << endl;
return 0;
}
/* 吾輩はやれば出来る子で... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
return 0;
}
/* 吾輩はやれば出来る子で... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 870,623 | 870,624 | u852449189 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007... | [
"expression.operation.binary.add"
] | 870,636 | 870,637 | u926025622 | cpp |
p03059 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int A, B;
double T;
cin >> A >> B >> T;
double time = 0;
int biscuit = 0;
while (time <= T + 0.5) {
time += A;
biscuit += B;
}
cout << biscuit << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main() {
int A, B;
double T;
cin >> A >> B >> T;
double time = 0;
int biscuit = 0;
while (time <= T + 0.5) {
time += A;
biscuit += B;
}
cout << biscuit - B << endl;
return 0;
... | [
"expression.operation.binary.add"
] | 870,644 | 870,645 | u887938060 | cpp |
p03051 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 870,681 | 870,682 | u558092537 | cpp |
p03051 | #include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
const int M = 1 << 20;
int mod = 1000000007;
int n;
int a[500000];
int ra[500001];
int cnt0[500002];
int dp[2][M];
int lastPos[M];
signed main() {
int i, j;
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) ra[i... | #include <iostream>
#define rep(i, n) for (i = 0; i < n; i++)
#define int long long
using namespace std;
const int M = 1 << 20;
int mod = 1000000007;
int n;
int a[500000];
int ra[500001];
int cnt0[500002];
int dp[2][M];
int lastPos[M];
signed main() {
int i, j;
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) ra[i... | [
"expression.operation.binary.add"
] | 870,691 | 870,692 | u610441939 | cpp |
p03051 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 << 22;
const int mod = 1e9 + 7;
long long exp_mod(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1)
ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
long long dp[MAXN][2], cnt[MAXN];
long long... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 << 22;
const int mod = 1e9 + 7;
long long exp_mod(long long a, long long b) {
long long ret = 1;
while (b) {
if (b & 1)
ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
long long dp[MAXN][2], cnt[MAXN];
long long... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 870,703 | 870,704 | u199179002 | cpp |
p03051 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define PB push_back
#define ll long long
using namespace std;
template <class T> inline void rd(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define PB push_back
#define ll long long
using namespace std;
template <class T> inline void rd(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
... | [
"call.remove",
"control_flow.branch.if.add",
"call.add"
] | 870,708 | 870,709 | u973935896 | cpp |
p03051 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 870,719 | 870,720 | u976045235 | cpp |
p03051 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
#define FORR(i, a, b) for (int i = (a), i##formax = (b); i >= i##formax; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 870,721 | 870,720 | u976045235 | cpp |
p03051 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, n) for (int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for (int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(), (x).end()
#define MOD 100000000... | [
"literal.number.change",
"assignment.value.change"
] | 870,739 | 870,740 | u405923605 | cpp |
p03051 | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#in... | [
"assignment.change"
] | 870,743 | 870,744 | u806695213 | cpp |
p03051 | //第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
//ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
//今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdli... | //第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
//ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
//今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdli... | [
"expression.operation.binary.add"
] | 870,745 | 870,746 | u162364634 | cpp |
p03051 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int MAXN = 500005, MAXM = (1 << 20), mod = 1000000007;
int a[MAXN], n, x, dp[MAXM][2], lazy[MAXM], sett, y, ans;
int main()... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int MAXN = 500005, MAXM = (1 << 20), mod = 1000000007;
int a[MAXN], n, x, dp[MAXM][2], lazy[MAXM], sett, y, ans;
int main()... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 870,748 | 870,749 | u279692478 | cpp |
p03051 | #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",
"variable_access.subscript.index.change"
] | 870,756 | 870,757 | u483814783 | cpp |
p03051 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007LL
vector<int> v[1048576];
int num[500010], pre[500010], sum[500010], n;
inline int rd() {
int x = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
;
for (; ch >= '0' && ch <= '9'; ch = getchar())... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007LL
vector<int> v[1048576];
int num[500010], pre[500010], sum[500010], n;
inline int rd() {
int x = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
;
for (; ch >= '0' && ch <= '9'; ch = getchar())... | [
"call.arguments.change"
] | 870,758 | 870,759 | u293498352 | cpp |
p03052 | const long long MOD = 1e9 + 7;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void dfs(int v, int par, vector<int> &h, vector<int> &edge_in, vector<int> &a,
vector<int> &b) {
if (v == par)
h[v] = 0;
else
h[v] = h[par] + 1;
for (int i = 0; i < h.size() - 1; i++) {
if (... | const long long MOD = 1e9 + 7;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void dfs(int v, int par, vector<int> &h, vector<int> &edge_in, vector<int> &a,
vector<int> &b) {
if (v == par)
h[v] = 0;
else
h[v] = h[par] + 1;
for (int i = 0; i < h.size() - 1; i++) {
if (... | [] | 870,764 | 870,765 | u798339690 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << floor(t / (a + 0.5)) * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << floor((t + 0.5) / a) * b << endl;
} | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 870,775 | 870,776 | u010806195 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << A * (T / B) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 870,791 | 870,792 | u113960459 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * t / a;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b;
return 0;
}
| [
"io.output.change"
] | 870,806 | 870,807 | u000770457 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << ((T + 0.5) / A) * B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
}
| [] | 870,842 | 870,843 | u922449177 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << ((T - 0.5) / A) * B << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
}
| [] | 870,844 | 870,843 | u922449177 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << ((t + 0.5) / a) * b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
return 0;
}
| [] | 870,847 | 870,848 | u977062184 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 870,856 | 870,857 | u569361260 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T + 0.5) / A * B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A * B << endl;
}
| [] | 870,872 | 870,873 | u425231382 | cpp |
p03059 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a, b, t;
cin >> a >> b >> t;
int x = t / b;
cout << x * a << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int a, b, t;
cin >> a >> b >> t;
int x = t / a;
cout << x * b << endl;
}
| [
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 870,880 | 870,881 | u485925545 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t % a) * b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 870,890 | 870,891 | u820690792 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [] | 870,896 | 870,897 | u257571179 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << ((t + 0.5) / a) * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
} | [] | 870,900 | 870,901 | u176218583 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * (a / t) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * (t / a) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 870,906 | 870,907 | u985524697 | cpp |
p03059 | // 007naruto
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < n; i++)
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << (a / c) * b;
} | // 007naruto
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < n; i++)
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << (c / a) * b;
}
| [
"expression.operation.binary.remove"
] | 870,916 | 870,917 | u564430087 | cpp |
p03059 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
... | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans;
... | [] | 870,918 | 870,919 | u281876921 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 870,930 | 870,931 | u917049698 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / 3 * b;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 870,934 | 870,935 | u639300218 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (A / T) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
}
| [
"expression.operation.binary.remove"
] | 870,947 | 870,948 | u457196771 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | [
"expression.operation.binary.remove"
] | 870,949 | 870,950 | u190761897 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = 100100100;
const int M... | [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 870,951 | 870,950 | u190761897 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a, b, t;
int ans = t / a;
cout << (ans * b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = t / a;
cout << ans * b << endl;
return 0;
}
| [] | 870,958 | 870,959 | u589238650 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a, b, t;
int ans = t / a;
cout << ans * b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = t / a;
cout << ans * b << endl;
return 0;
}
| [] | 870,960 | 870,959 | u589238650 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a, b, t;
int g = t / a;
int ans = g * b;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int g = t / a;
int ans = g * b;
cout << ans << endl;
return 0;
}
| [] | 870,961 | 870,962 | u589238650 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t * b;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b;
}
| [] | 870,979 | 870,980 | u065898443 | cpp |
p03059 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 870,999 | 871,000 | u154645927 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t + 0.5) / a * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
} | [] | 871,014 | 871,015 | u294721290 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A, B, T;
cout << (T / A) * B << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
return 0;
} | [] | 871,020 | 871,021 | u767481489 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.