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 |
|---|---|---|---|---|---|---|---|
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (b * (t) / a) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * (t / a) << '\n';
return 0;
} | [] | 871,046 | 871,047 | u551519692 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, s, d;
cin >> a >> s >> d;
cout << (d) / a * s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
cout << (d) / a * s << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 871,054 | 871,055 | u103850114 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, s, d;
cin >> a >> s >> d;
cout << (d + 0.5) / a * s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
cout << (d) / a * s << endl;
}
| [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 871,056 | 871,055 | u103850114 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
cout << (d + 0.5) / a * s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, d;
cin >> a >> s >> d;
cout << (d) / a * s << endl;
}
| [
"expression.operation.binary.remove"
] | 871,057 | 871,055 | u103850114 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = 0;
int bis = 0;
while (time <= t) {
bis += b;
time += a;
}
cout << bis << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = 0;
int bis = 0;
while (time <= t) {
bis += b;
time += a;
}
bis -= b;
cout << bis << endl;
} | [
"assignment.add"
] | 871,060 | 871,061 | u615258936 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = 0;
int bis = 0;
while (time < t) {
bis += b;
time += a;
}
cout << bis << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = 0;
int bis = 0;
while (time <= t) {
bis += b;
time += a;
}
bis -= b;
cout << bis << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"assignment.add"
] | 871,062 | 871,061 | u615258936 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int count = 0;
int time = 0;
while (time < T + 0.5) {
time += A;
count += B;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int count = 0;
int time = 0;
while (time < T + 0.5) {
time += A;
count += B;
}
cout << count - B << endl;
} | [
"expression.operation.binary.add"
] | 871,063 | 871,064 | u615258936 | cpp |
p03059 | // 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤�... | // 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤
// //
// 🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤🖤�... | [
"expression.operation.binary.remove"
] | 871,067 | 871,068 | u652633828 | cpp |
p03059 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = t / 1;
cout << time * b << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int time = t / a;
cout << time * b << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 871,075 | 871,076 | u902803949 | cpp |
p03059 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [] | 871,108 | 871,109 | u926242698 | cpp |
p03059 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
#defin... | [] | 871,108 | 871,110 | u926242698 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int t;
cin >> a >> b >> t;
cout << ((t + 0.5) / a) * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
} | [] | 871,145 | 871,146 | u559112776 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int A, B, T;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int A, B, T;
... | [
"expression.operation.binary.remove"
] | 871,158 | 871,159 | u680707192 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / b) * a << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
}
| [
"identifier.change",
"io.output.change"
] | 871,162 | 871,163 | u806149832 | 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;
cout << (t + 0.5) / a * b;
}
| #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;
cout << t / a * b;
}
| [] | 871,164 | 871,165 | u009870106 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * t / a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
}
| [
"io.output.change"
] | 871,180 | 871,181 | u264265458 | cpp |
p03059 | #include <iostream>
int main() {
int A, B, T;
std::cin >> A >> B >> T;
int ans = A / T * B;
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
int main() {
int A, B, T;
std::cin >> A >> B >> T;
int ans = T / A * B;
/*
int ans = 0;
for (int i = 0; i <= T; i++) {
if (i % A == 0) ans += B;
}
*/
std::cout << ans << std::endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 871,189 | 871,190 | u922974720 | cpp |
p03053 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 871,239 | 871,240 | u375619974 | cpp |
p03053 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 871,241 | 871,240 | u375619974 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
vector<string> a;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
n = h * w;
a.resize(h);
for (auto &i : a)
cin >> i;
vector<int> d(n, 1e9);
q... | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
vector<string> a;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
n = h * w;
a.resize(h);
for (auto &i : a)
cin >> i;
vector<int> d(n, 1e9);
q... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 871,246 | 871,247 | u207036582 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
vector<string> a;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
n = h * w;
a.resize(h);
for (auto &i : a)
cin >> i;
vector<int> d(n, 1e9);
q... | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
vector<string> a;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
n = h * w;
a.resize(h);
for (auto &i : a)
cin >> i;
vector<int> d(n, 1e9);
q... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 871,248 | 871,247 | u207036582 | cpp |
p03053 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 871,256 | 871,257 | u109256064 | cpp |
p03053 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define ll long long
#define forn(i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define ll long long
#define forn(i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 871,262 | 871,263 | u375639297 | cpp |
p03053 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define ll long long
#define forn(i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define ll long long
#define forn(i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 871,264 | 871,263 | u375639297 | cpp |
p03053 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
typedef long long ll;
usin... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <vector> //動的配列
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
typedef long long ll;
usin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 871,267 | 871,268 | u652150585 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define _overload3(_1, _2, _3, name... | [
"expression.operation.binary.add"
] | 871,280 | 871,281 | u564460375 | cpp |
p03053 | // AGC033 A - Darker and Darker
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
using Pos = pair<int, int>;
using veci = vector<int>;
int h, w;
int main() {
#if LOCAL & 0
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin >> h >> w;
vector<string> cl(h);
for (auto &&l :... | // AGC033 A - Darker and Darker
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
using Pos = pair<int, int>;
using veci = vector<int>;
int h, w;
int main() {
#if LOCAL & 01
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
#endif
cin >> h >> w;
vector<string> cl(h);
for (auto &&l ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 871,304 | 871,305 | u182321487 | cpp |
p03053 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 10000001
int main() {
int H, W;
std::cin >> H >> W;
int d[1001][1001];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
std::queu... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 10000001
int main() {
int H, W;
std::cin >> H >> W;
int d[1001][1001];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
std::queu... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 871,314 | 871,315 | u893523678 | cpp |
p03053 | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
inline void PaintMass(vector<vector<int>> &Mass,
queue<pair<int, int>> &Blacks) {
const auto &black = Blacks.front();
const int h = black.first, w = black.second;
// 上下左右を塗る
if (h > 0 && !Mass[h - 1][w]) {
Ma... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
inline void PaintMass(vector<vector<int>> &Mass,
queue<pair<int, int>> &Blacks) {
const auto &black = Blacks.front();
const int h = black.first, w = black.second;
// 上下左右を塗る
if (h > 0 && !Mass[h - 1][w]) {
Ma... | [] | 871,318 | 871,319 | u919919505 | cpp |
p03053 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 871,328 | 871,329 | u387013436 | cpp |
p03053 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (INT_MAX / 2 - 1)
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int H, W;
cin >> H >> W;
vector<string> A(H);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (INT_MAX / 2 - 1)
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
int H, W;
cin >> H >> W;
vector<string> A(H);
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 871,334 | 871,335 | u864171425 | cpp |
p03053 | #include <bits/stdc++.h>
#define INF INT_MAX
typedef long long ll;
using namespace std;
char a[1005][1005];
int memo[1005][1005];
vector<pair<int, int>> b;
int main(void) {
int H, W;
cin >> H >> W;
queue<pair<int, int>> q;
for (int j = 0; j < H; j++) {
for (int i = 0; i < W; i++) {
cin >> a[j][i];... | #include <bits/stdc++.h>
#define INF INT_MAX
typedef long long ll;
using namespace std;
char a[1005][1005];
int memo[1005][1005];
vector<pair<int, int>> b;
int main(void) {
int H, W;
cin >> H >> W;
queue<pair<int, int>> q;
for (int j = 0; j < H; j++) {
for (int i = 0; i < W; i++) {
cin >> a[j][i];... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 871,341 | 871,342 | u855087874 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / (2 * A) * B << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A * B << endl;
return 0;
}
| [] | 871,355 | 871,356 | u319179101 | 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 << (T / A) * B << endl;
} | [
"identifier.change",
"io.output.change"
] | 871,357 | 871,358 | u280120599 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, n) for (int i = (a); i < (n); ++i)
using namespace std;
typedef long long ll;
void Main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * T / A << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, n) for (int i = (a); i < (n); ++i)
using namespace std;
typedef long long ll;
void Main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(fals... | [] | 871,378 | 871,379 | u215692812 | cpp |
p03059 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int A, B, T;
cin >> A, B, T;
T = T / A;
B = B * T;
cout << B;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int A, B, T;
cin >> A >> B >> T;
T = T / A;
B = B * T;
cout << B;
}
| [] | 871,390 | 871,391 | u447604786 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std... | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 871,403 | 871,404 | u155216115 | 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,441 | 871,442 | u974931918 | cpp |
p03059 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c % a * b;
}
| #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c / a * b;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,458 | 871,459 | u677400065 | cpp |
p03059 | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c % b * a << endl;
}
| #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
map<char, int> a;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c / a * b;
}
| [
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 871,460 | 871,459 | u677400065 | cpp |
p03059 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * T / A << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
return 0;
} | [] | 871,461 | 871,462 | u964124095 | cpp |
p03059 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * T / A << endl;
return 1;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
return 0;
} | [
"literal.number.change",
"function.return_value.change"
] | 871,463 | 871,462 | u964124095 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll A, B, T;
cin >> A >> B >> T;
printf("%lld", T * B / A);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ll A, B, T;
cin >> A >> B >> T;
printf("%lld", (T / A) * B);
} | [
"call.arguments.change",
"expression.operation.binary.remove",
"call.arguments.add"
] | 871,466 | 871,467 | u527058497 | cpp |
p03059 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * T / A << endl;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
}
| [] | 871,468 | 871,469 | u108484707 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A + B;
}
| #include <bits/stdc++.h>
using namespace std;
// atcoder125
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A * B;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,470 | 871,471 | u116136539 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A + B;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T / A * B;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,470 | 871,472 | u116136539 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll gcd(ll n, ll m) {
if (m == 0)
return n;
else
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
string bit(ll n) {
string ans = "";
whil... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll gcd(ll n, ll m) {
if (m == 0)
return n;
else
return gcd(m, n % m);
}
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
string bit(ll n) {
string ans = "";
whil... | [
"identifier.change",
"io.output.change"
] | 871,490 | 871,491 | u179970156 | cpp |
p03059 | //おまじない
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (a / b) * t << endl;
} | //おまじない
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
} | [
"identifier.change",
"io.output.change"
] | 871,492 | 871,493 | u277253335 | cpp |
p03059 | #include <stdio.h>
int main(void) {
int A, B, T;
scanf("%d%d%d", &A, &B, &T);
printf("%d", ((T + 0.5) / A) * B);
}
| #include <stdio.h>
int main(void) {
int A, B, T;
scanf("%d%d%d", &A, &B, &T);
printf("%d", (T / A) * B);
}
| [
"call.arguments.change"
] | 871,498 | 871,499 | u013168870 | cpp |
p03059 | #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... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 871,500 | 871,501 | u754514364 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count;
count = ((c + 0.5) / a) * b;
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count;
count = (c / a) * b;
cout << count << endl;
}
| [] | 871,508 | 871,509 | u818393512 | cpp |
p03059 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T % A) * B << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,510 | 871,511 | u221769213 | cpp |
p03059 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T % A * B << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,512 | 871,511 | u221769213 | cpp |
p03059 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define ll ... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (begin); i > (end); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define ll ... | [
"call.add",
"call.arguments.change"
] | 871,513 | 871,514 | u973797979 | 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"
] | 871,515 | 871,516 | u393754572 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a;
cin >> b;
int n;
n = t / a;
cout << b * n << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a;
cin >> b;
cin >> t;
int n;
n = t / a;
cout << b * n << endl;
return 0;
}
| [] | 871,532 | 871,533 | u313043608 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define MOD (1000 * 1000 * 1000 + 7)
typedef long long ll;
typedef pair<int, int> pint;
int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IREP(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define MOD (1000 * 1000 * 1000 + 7)
typedef long long ll;
typedef pair<int, int> pint;
int... | [
"assignment.value.change"
] | 871,541 | 871,542 | u159117533 | cpp |
p03059 | ///...................................*****.................................................///
/// Mujahidul Islam ( mujahidulislam2923@gmail.com ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.............................. | ///...................................*****.................................................///
/// Mujahidul Islam ( mujahidulislam2923@gmail.com ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.............................. | [
"identifier.change",
"io.output.change"
] | 871,554 | 871,555 | u191752096 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b >> n;
cout << b * ((n + 0.5) / a);
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> a >> b >> n;
cout << b * floor((n + 0.5) / a);
}
| [
"import.add",
"call.add"
] | 871,566 | 871,567 | u843985264 | cpp |
p03059 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
float T;
cin >> A >> B >> T;
int ans;
ans = (T / A) * B;
cout << ans;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
int T;
cin >> A >> B >> T;
int ans;
ans = (T / A) * B;
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 871,571 | 871,572 | u475310126 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t, n;
double tt, i;
cin >> a >> b >> t;
tt = t + 0.5;
n = 0;
while (tt > i) {
n++;
i = n * a;
}
int ans = n * b;
cout << ans << "\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, t, n;
double tt, i;
cin >> a >> b >> t;
tt = t + 0.5;
n = 0;
while (tt > i) {
n++;
i = n * a;
}
int ans = (n - 1) * b;
cout << ans << "\n";
return 0;
} | [] | 871,573 | 871,574 | u271651326 | cpp |
p03059 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
//入力
int a, b, t, ans;
cin >> a >> b >> t;
//処理
ans = (t / b) * a;
//出力
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
//入力
int a, b, t, ans;
cin >> a >> b >> t;
//処理
ans = (t / a) * b;
//出力
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 871,579 | 871,580 | u483697387 | cpp |
p03059 | #include <iostream>
using namespace std;
int main(void) {
int a, b, t;
cin >> a >> b >> t;
int createNum = a * (t / b);
cout << createNum << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, t;
cin >> a >> b >> t;
int createNum = b * (t / a);
cout << createNum << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 871,585 | 871,586 | u344131382 | cpp |
p03059 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
long gcd(long x, long y) {
if (x > y) {
return gcd(y, x);
}
long r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
using namespace std;
long gcd(long x, long y) {
if (x > y) {
return gcd(y, x);
}
long r;
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return... | [
"expression.operation.binary.remove",
"assignment.change"
] | 871,595 | 871,596 | u545674098 | cpp |
p03059 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << ((t + 0.5) / a) * b << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
}
| [] | 871,616 | 871,617 | u959815036 | 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,598 | 871,635 | u535810324 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T % A) * B;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,650 | 871,651 | u614576698 | cpp |
p03059 | #include <iostream>
int main() {
int A;
int B;
int T;
scanf("%d%d%d", &A, &B, &T);
printf("%d", (T + 0.5) / A * B);
}
| #include <iostream>
int main() {
int A;
int B;
int T;
scanf("%d%d%d", &A, &B, &T);
printf("%d", (T) / A * B);
}
| [
"expression.operation.binary.remove"
] | 871,654 | 871,655 | u077867937 | cpp |
p03059 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア タイプでふ
int main() {
int A, B, T;
cin >> A;
cin >> B;
cin >> T;
cout << (int)(B * (((T + 0.5) - T % A) / A));
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) // for文マクロ
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア タイプでふ
int main() {
int A, B, T;
cin >> A;
cin >> B;
cin >> T;
cout << (int)(B * ((T - T % A) / A));
// int A, B, C;
// cin >... | [] | 871,656 | 871,657 | u369980487 | cpp |
p03059 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, t;
cin >> a >> b >> t;
cout << b * t / a;
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, t;
cin >> a >> b >> t;
cout << b * (t / a);
}
| [] | 871,676 | 871,677 | u562319622 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T % A) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,690 | 871,691 | u182791129 | cpp |
p03059 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int a, b, t;
int time = 0;
int flag = 0;
string s;
cin >> a >> b >> t;
time = t / a;
cout << t * b;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int a, b, t;
int time = 0;
int flag = 0;
string s;
cin >> a >> b >> t;
time = t / a;
cout << time * b;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 871,702 | 871,703 | u942591696 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / B) * 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;
} | [
"identifier.change",
"io.output.change"
] | 871,730 | 871,731 | u598952997 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int A = 0, B = 0, T = 0, C = 0;
cin >> A;
cin >> B;
cin >> T;
cout << (T % A) * B << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A = 0, B = 0, T = 0, C = 0;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,748 | 871,749 | u887035188 | cpp |
p03059 | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T) / A << 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"
] | 871,764 | 871,765 | u074003648 | cpp |
p03059 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define SIZE 10005
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
char str[SIZE];
int main... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define SIZE 10005
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
char str[SIZE];
int main... | [] | 871,799 | 871,800 | u509607636 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b;
double t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
int t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 871,803 | 871,804 | u361344213 | 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;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 871,825 | 871,826 | u276588887 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << A * (B / T) << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 871,836 | 871,837 | u001858868 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << A * (T / B) << endl;
return 0;
} | #include <bits/stdc++.h>
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"
] | 871,840 | 871,841 | u539880178 | cpp |
p03059 | #include <stdio.h>
int main(void) {
int a, b, t;
scanf("%d %d %d", &a, &b, &t);
printf("%d¥n", t / a * b);
return 0;
} | #include <stdio.h>
int main() {
int a, b, t;
scanf("%d %d %d", &a, &b, &t);
printf("%d", t / a * b);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 871,869 | 871,870 | u679951803 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / b) * a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b << endl;
} | [
"identifier.change",
"io.output.change"
] | 871,880 | 871,881 | u798086274 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C * B / A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C / A * B << endl;
}
| [
"expression.operation.binary.remove"
] | 871,884 | 871,885 | u764365016 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B / C << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << C / A * B << endl;
}
| [
"expression.operation.binary.remove"
] | 871,886 | 871,885 | u764365016 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << a * (b / t) << endl;
return 0;
} | #include <bits/stdc++.h>
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",
"expression.operation.binary.remove"
] | 871,909 | 871,910 | u138245026 | cpp |
p03059 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int count = floor(t / a);
cout << a * count << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int count = floor(t / a);
cout << b * count << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 871,926 | 871,927 | u724169530 | cpp |
p03059 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int count = floor(t / a);
cout << count << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int count = floor(t / a);
cout << b * count << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 871,928 | 871,927 | u724169530 | cpp |
p03059 | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | [
"expression.operation.binary.remove"
] | 871,941 | 871,942 | u190907730 | cpp |
p03059 | #include <iostream>
#include <vector>
int main() {
int a, b, t;
std::cin >> a >> b >> t;
std::cout << (a / t) * b << std::endl;
} | #include <iostream>
#include <vector>
int main() {
int a, b, t;
std::cin >> a >> b >> t;
std::cout << (t / a) * b << std::endl;
} | [
"expression.operation.binary.remove"
] | 871,961 | 871,962 | u675512317 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << T * B / A << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 871,977 | 871,978 | u841641310 | cpp |
p03059 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"expression.operation.binary.remove"
] | 871,990 | 871,991 | u468700753 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / b * a << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
}
| [
"expression.operation.binary.remove"
] | 872,046 | 872,047 | u115106582 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int C;
C == T / A;
cout << B * C << endl;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int C;
C = T / A;
cout << B * C << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 872,048 | 872,049 | u119012830 | cpp |
p03059 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << A * (T / B) << "\n";
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << "\n";
return 0;
} | [
"identifier.change",
"io.output.change"
] | 872,071 | 872,072 | u890870565 | cpp |
p03059 | #include <stdio.h>
int main(int argc, char *argv[]) {
int A, B, T;
scanf("%d %d %d", &A, &B, &T);
int c = A / T;
printf("%d", c * B);
return 0;
} | #include <stdio.h>
int main(int argc, char *argv[]) {
int A, B, T;
scanf("%d %d %d", &A, &B, &T);
int c = T / A;
printf("%d", c * B);
return 0;
}
| [
"expression.operation.binary.remove"
] | 872,116 | 872,117 | u770567389 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int i = t % a;
i = a - i;
cout << (i / a) * b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int i = t % a;
int n = t - i;
cout << (n / a) * b << endl;
} | [
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 872,118 | 872,119 | u766873156 | cpp |
p03059 | #include <bits/stdc++.h>
#define REP(n) for (int i = 0; i < (n); ++i)
#define RREP(n) for (int i = (n); i >= 0; --i)
#define FOR(m, n) for (int i = (m); i < (n); ++i)
#define SZ(x) ((int)(x).size())
#define BIT(n) (1LL << (n))
#define EXIST(x) ((x).find() != (x).end())
#define DEBUG(n) cerr << #n << " : " << n << '\n';... | #include <bits/stdc++.h>
#define REP(n) for (int i = 0; i < (n); ++i)
#define RREP(n) for (int i = (n); i >= 0; --i)
#define FOR(m, n) for (int i = (m); i < (n); ++i)
#define SZ(x) ((int)(x).size())
#define BIT(n) (1LL << (n))
#define EXIST(x) ((x).find() != (x).end())
#define DEBUG(n) cerr << #n << " : " << n << '\n';... | [] | 872,126 | 872,127 | u691380397 | 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 + 1 / 2) / A * B << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 872,174 | 872,175 | u085887707 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
ios_base::sync_with_stdio(0);
int a, b, t;
cin >> a >> b >> t;
cout ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define f(n) fr(i, 0, n)
#define f1(n) fr(i, 1, n + 1)
#define ms(i) memset(i, -1, sizeof(i));
#define pb push_back
int main() {
ios_base::sync_with_stdio(0);
int a, b, t;
cin >> a >> b >> t;
cout ... | [
"expression.operation.binary.remove"
] | 872,186 | 872,187 | u308590217 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int b, d, t;
int a, c, u;
cin >> a >> b >> t;
c = t / a;
d = a * c;
cout << d << endl;
}
| #include <iostream>
using namespace std;
int main() {
int b, d, t;
int a, c, u;
cin >> a >> b >> t;
c = t / a;
d = b * c;
cout << d << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 872,198 | 872,199 | u443479321 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.