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 |
|---|---|---|---|---|---|---|---|
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a / b, c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 912,828 | 912,829 | u578969098 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a / b, c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 912,830 | 912,829 | u578969098 | cpp |
p03105 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a > c)
cout << b / a << endl;
else
cout << c << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c)
cout << b / a << endl;
else
cout << c << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,833 | 912,834 | u206390098 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a >= b * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= a * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 912,839 | 912,840 | u492660436 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= a * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 912,841 | 912,840 | u492660436 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c < b)
cout << b / a << endl;
else
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c > b)
cout << b / a << endl;
else
cout << c << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,853 | 912,854 | u136086822 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, a / b);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a);
}
| [
"expression.operation.binary.remove"
] | 912,859 | 912,860 | u371051907 | cpp |
p03105 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= a * c) {
cout << a * c << endl;
} else {
cout << b / a << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b >= a * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
} | [
"expression.operation.binary.remove"
] | 912,865 | 912,866 | u303621502 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, a / c) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 912,873 | 912,874 | u123745130 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r, p;
cin >> a >> b >> c;
r = b / a;
if (r > c) {
cout << 4 << endl;
} else {
cout << r << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r, p;
cin >> a >> b >> c;
r = b / a;
if (r > c) {
cout << c << endl;
} else {
cout << r << endl;
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 912,880 | 912,881 | u466947057 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r, p;
cin >> a >> b >> c;
r = b / a;
if (r >= c) {
cout << 4 << endl;
} else {
cout << r << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, r, p;
cin >> a >> b >> c;
r = b / a;
if (r > c) {
cout << c << endl;
} else {
cout << r << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 912,882 | 912,881 | u466947057 | cpp |
p03105 |
#include <bits/stdc++.h>
using namespace std;
void Main() {
int a, b, c;
cin >> a >> b >> c;
int ret = c;
if (b / a > c) {
ret = b / a;
}
cout << ret;
}
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
#ifdef DEBUG_BUILD
... |
#include <bits/stdc++.h>
using namespace std;
void Main() {
int a, b, c;
cin >> a >> b >> c;
int ret = c;
if (b / a < c) {
ret = b / a;
}
cout << ret;
}
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
#ifdef DEBUG_BUILD
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,890 | 912,891 | u588369531 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << max(c, b / a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a);
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,894 | 912,895 | u548977290 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min((A / B), C) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min((B / A), C) << endl;
} | [
"expression.operation.binary.remove"
] | 912,896 | 912,897 | u548977290 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(c, b / a) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(c, b / a) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,902 | 912,903 | u559578080 | cpp |
p03105 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | [
"expression.operation.binary.remove",
"assignment.change"
] | 912,910 | 912,911 | u757628628 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 912,914 | 912,915 | u592686932 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int c = A * C;
if (c >= B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int c = A * C;
if (c <= B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 912,918 | 912,919 | u537507471 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int c = A * C;
if (c >= C) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int c = A * C;
if (c <= B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
} | [] | 912,920 | 912,919 | u537507471 | cpp |
p03105 | // https://atcoder.jp/contests/abc120/tasks/abc120_a
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a / b, c) << endl;
return 0;
} | // https://atcoder.jp/contests/abc120/tasks/abc120_a
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 912,923 | 912,924 | u021483982 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c / a);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c);
} | [
"expression.operation.binary.remove"
] | 912,930 | 912,931 | u206772137 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C, A / B) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C, B / A) << endl;
}
| [
"expression.operation.binary.remove"
] | 912,939 | 912,940 | u285358283 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = b / c;
if (d > c) {
cout << c << endl;
} else {
cout << d << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = b / a;
if (d < c) {
cout << d << endl;
} else {
cout << c << endl;
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 912,952 | 912,953 | u026375009 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b / a, c);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c);
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,954 | 912,955 | u260907804 | cpp |
p03105 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.... | [
"expression.operation.binary.remove"
] | 912,960 | 912,961 | u969116807 | cpp |
p03105 | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#define printv(val) ... | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (ll i##_len = (n), i = i##_len - 1; i >= 0; --i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define printd(val) std::cout << #val " = " << val << "\n";
#define printv(val) ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 912,968 | 912,969 | u954176652 | cpp |
p03105 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"expression.operation.binary.remove"
] | 912,977 | 912,978 | u552122040 | cpp |
p03105 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 912,979 | 912,978 | u552122040 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C <= B) {
cout << C;
} else if (A * C >= B) {
cout << C / A;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C <= B) {
cout << C;
} else if (A * C >= B) {
cout << B / A;
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 912,992 | 912,993 | u318329027 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res = b / a;
int ans = max({res, c});
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res = b / a;
int ans = min({res, c});
cout << ans << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 912,998 | 912,999 | u631558039 | cpp |
p03105 | #include <stdio.h>
int main(void) {
int a; //一回分の値段
int b; //所持金
int c; //必要な回数
int sum; //回答
scanf("%d %d %d", &a, &b, &c);
if (b / a <= c)
printf("%d", c);
else
printf("%d", b / a);
return 0;
} | #include <stdio.h>
int main(void) {
int a; //一回分の値段
int b; //所持金
int c; //必要な回数
int sum; //回答
scanf("%d %d %d", &a, &b, &c);
if (b / a >= c)
printf("%d", c);
else
printf("%d", b / a);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 913,002 | 913,003 | u120775901 | cpp |
p03105 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,004 | 913,005 | u043443359 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int answer = (b / a, c);
cout << answer << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int answer = min(b / a, c);
cout << answer << endl;
} | [
"call.add"
] | 913,016 | 913,017 | u353748264 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int answer = (b / a, c);
cout << answer << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int answer = min(b / a, c);
cout << answer << endl;
}
| [
"call.add"
] | 913,016 | 913,021 | u353748264 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = b / a;
if (x < c)
cout << c << endl;
else
cout << x << endl;
}
| #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, c;
cin >> a >> b >> c;
int x = b / a;
if (x < c)
cout << x << endl;
else
cout << c << endl;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 913,027 | 913,028 | u902803949 | cpp |
p03105 | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
typedef long long llong;
typedef long double ldouble;
int main() {
cout << fixed << setprecision(10);
int A, B, C;
cin >> A >> B >> C;
cout << max(B / A, C) << endl;
} | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
typedef long long llong;
typedef long double ldouble;
int main() {
cout << fixed << setprecision(10);
int A, B, C;
cin >> A >> B >> C;
cout << min(B / A, C) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,029 | 913,030 | u108484707 | cpp |
p03105 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <boost/multiprecision/cpp_int.hpp>... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,033 | 913,034 | u457790148 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, b / a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, b / a);
cout << ans;
return 0;
} | [] | 913,041 | 913,042 | u900688325 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = max(c, b / a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ans = min(c, b / a);
cout << ans;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 913,043 | 913,042 | u900688325 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b / a, c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,048 | 913,049 | u703537155 | cpp |
p03105 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c < b)
cout << c << endl;
else
cout << a ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * c < b)
cout << c << endl;
else
cout << b ... | [
"expression.operation.binary.add"
] | 913,050 | 913,051 | u932319885 | cpp |
p03105 | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | /* 実行時間1s制限の場合
10^6 1,000,000 : 余裕をもって間に合う
10^7 10,000,000 : おそらく間に合う
10^8 100,000,000 : 非常にシンプルな処理でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; // long longはデータモデル(... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 913,052 | 913,053 | u234248338 | cpp |
p03105 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | [
"identifier.change",
"io.output.change"
] | 913,056 | 913,057 | u355371431 | cpp |
p03105 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 913,058 | 913,057 | u355371431 | cpp |
p03105 | #include <algorithm>
#include <cmath>
#include <functional>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
ll mod = 1000000007;
using namespace std;
priority_queue<ll int> A; //きゅー
int main(void) {
int A, B,... | #include <algorithm>
#include <cmath>
#include <functional>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
ll mod = 1000000007;
using namespace std;
priority_queue<ll int> A; //きゅー
int main(void) {
int A, B,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 913,063 | 913,064 | u956941456 | cpp |
p03105 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [
"expression.operation.binary.remove"
] | 913,069 | 913,070 | u132033278 | cpp |
p03105 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
int ans;
cin >> a >> b >> c;
ans = b / a;
if (ans >= c) {
ans = c;
}
cout << c << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int a;
int b;
int c;
int ans;
cin >> a >> b >> c;
ans = b / a;
if (ans >= c) {
ans = c;
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 913,071 | 913,072 | u190553247 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a, b, c;
if (a * c <= b) {
d = c;
} else {
d = b / a;
}
cout << d << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
if (a * c <= b) {
d = c;
} else {
d = b / a;
}
cout << d << endl;
return 0;
}
| [] | 913,083 | 913,084 | u738164318 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,091 | 913,092 | u338791285 | cpp |
p03105 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a, b, c;
cin >> a >> b >> c;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a, b, c;
cin >> a >> b >> c;
... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 913,099 | 913,100 | u283907492 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max((b / a), c) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min((b / a), c) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,115 | 913,116 | u225581241 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int a, b, c;
cin >> a >> b >> c;
cout << (b >= a * c ? a * c : b / a) << endl;
// end
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// start
int a, b, c;
cin >> a >> b >> c;
cout << (b >= a * c ? c : b / a) << endl;
// end
return 0;
}
| [
"expression.operation.binary.remove"
] | 913,126 | 913,127 | u376234649 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int, int>
#define vpi vector<ppi>
#define ppl pair<ll, ll>
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 913,130 | 913,131 | u460819600 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int answer = A * C;
if (answer > B) {
cout << B / A << endl;
} else if (answer < B) {
cout << C << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int answer = A * C;
if (answer > B) {
cout << B / A << endl;
} else if (answer < B || answer == B) {
cout << C << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 913,136 | 913,137 | u388787692 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int answer = A * C;
if (answer > B) {
cout << B / A << endl;
} else if (answer < B) {
cout << C << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int answer = A * C;
if (answer > B) {
cout << B / A << endl;
} else if (answer < B || answer == B) {
cout << C << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 913,138 | 913,137 | u388787692 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 913,145 | 913,146 | u211681714 | cpp |
p03105 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b / a, c) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,147 | 913,148 | u741134767 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
if (b / a > c) {
std::cout << c << std::endl;
} else {
std::cout << a / b << std::endl;
}
// ここにプログラムを追記
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
std::cin >> a >> b >> c;
if (b / a > c) {
std::cout << c << std::endl;
} else {
std::cout << b / a << std::endl;
}
// ここにプログラムを追記
} | [
"expression.operation.binary.remove"
] | 913,149 | 913,150 | u801884816 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c) {
cout << a / b << endl;
} else {
cout << c << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c) {
cout << b / a << endl;
} else {
cout << c << endl;
}
} | [
"expression.operation.binary.remove"
] | 913,182 | 913,183 | u687204015 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A <= C) {
cout << B / A * C;
} else if (B / A > C) {
cout << C;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A < C) {
cout << B / A;
} else if (B / A >= C) {
cout << C;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 913,192 | 913,193 | u077051605 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = b / a;
if (d >= 4)
cout << 4 << endl;
else
cout << d << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = b / a;
if (d >= c)
cout << c << endl;
else
cout << d << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 913,194 | 913,195 | u661461084 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(b / a, c);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c);
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,200 | 913,201 | u340494803 | cpp |
p03105 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ld long double
#define ll long long int
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 913,202 | 913,203 | u961198482 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D, E;
D = B / A;
if (D <= C) {
cout << C << endl;
} else if (C < D) {
cout << C << endl;
}
system("pause");
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int D;
D = B / A;
if (D <= C) {
cout << D << endl;
} else if (C < D) {
cout << C << endl;
}
system("pause");
return 0;
} | [
"variable_declaration.remove",
"identifier.change",
"io.output.change"
] | 913,211 | 913,212 | u705644950 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A > C) {
cout << C << endl;
} else if (B / A < C) {
cout << B / A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A >= C) {
cout << C << endl;
} else if (B / A < C) {
cout << B / A << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 913,213 | 913,214 | u190066528 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C >= B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * C <= B) {
cout << C << endl;
} else {
cout << B / A << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 913,215 | 913,216 | u904123392 | cpp |
p03105 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ONLINE_JUDGE
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
#define fu(a, b, c) for (int a = b; a <= (int)c; ++a)
#define fd(a, b, c) for (int a = b; a >= (int)c; --a)
#define cu(a, b, c) for (int a = b; a... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 913,232 | 913,233 | u730731139 | cpp |
p03105 | #include <algorithm>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
bool temp;
long long arr[(int)1e3 + 1];
void swap(long long &x, long long &y) {
int temp;
temp = x;
x = y;
y = temp;
}
int main() {
ios::sync_with_stdio(... | #include <algorithm>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
bool temp;
long long arr[(int)1e3 + 1];
void swap(long long &x, long long &y) {
int temp;
temp = x;
x = y;
y = temp;
}
int main() {
ios::sync_with_stdio(... | [
"identifier.change",
"io.output.change"
] | 913,236 | 913,237 | u809799005 | cpp |
p03105 | #include <algorithm>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
bool temp;
long long arr[(int)1e3 + 1];
void swap(long long &x, long long &y) {
int temp;
temp = x;
x = y;
y = temp;
}
int main() {
ios::sync_with_stdio(... | #include <algorithm>
#include <cstring>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
bool temp;
long long arr[(int)1e3 + 1];
void swap(long long &x, long long &y) {
int temp;
temp = x;
x = y;
y = temp;
}
int main() {
ios::sync_with_stdio(... | [
"control_flow.branch.else.add"
] | 913,238 | 913,237 | u809799005 | cpp |
p03105 | #include <bits/stdc++.h>
#include <random>
#include <unistd.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typed... | #include <bits/stdc++.h>
#include <random>
#include <unistd.h>
using namespace std;
typedef long long int LL;
typedef long long int LLint;
typedef pair<int, int> intpair;
typedef pair<bool, bool> boolpair;
typedef pair<string, string> strpair;
typedef pair<LL, LL> LLpair;
typedef pair<double, double> doublepair;
typed... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,239 | 913,240 | u550995059 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a, b, c;
cin >> a >> b >> c;
b = min(a * c, (b - b % a) / a);
cout << b / a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a, b, c;
cin >> a >> b >> c;
b = min(a * c, b - b % a);
cout << b / a << endl;
return 0;
} | [
"call.arguments.change"
] | 913,243 | 913,244 | u073082475 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b > a * c) {
cout << c << endl;
} else {
cout << b / a << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 913,247 | 913,248 | u469451657 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int A, B, C;
cin >> A >> B >> C;
cout << max(C, B / A) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int A, B, C;
cin >> A >> B >> C;
cout << min(C, B / A) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,249 | 913,250 | u238312012 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans;
B *C > A ? ans = C : ans = B / A;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans;
B >= A *C ? ans = C : ans = B / A;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 913,255 | 913,256 | u726060136 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(B / A, C) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(B / A, C) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,264 | 913,265 | u132364782 | cpp |
p03105 | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | [
"expression.operation.binary.remove"
] | 913,293 | 913,294 | u409343817 | cpp |
p03105 | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | /*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
// pll pp; -> (pp.first,pp.second)
// vector<vl> pp(n,vl(2)); sort(pp.begin(),pp.end(),[](vl a,vl b){return
// a[0]<b[0];});
#define REP(i, n) for... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 913,315 | 913,316 | u401373764 | cpp |
p03105 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#de... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#de... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 913,331 | 913,332 | u370867568 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b * a >= c)
cout << c << endl;
else
cout << b * a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a >= c)
cout << c << endl;
else
cout << b / a << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 913,333 | 913,334 | u820341516 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(int(a / b), c) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | [
"call.remove",
"io.output.change",
"call.arguments.change"
] | 913,335 | 913,336 | u476534289 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a / b, c) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(b / a, c) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"expression.operation.binary.remove"
] | 913,337 | 913,336 | u476534289 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
// input
int a, b, c;
cin >> a >> b >> c;
int res = a * c;
int ans;
if (res <= b) { //お金を十分持っている場合
ans = c;
} else {
ans = a / b;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
// input
int a, b, c;
cin >> a >> b >> c;
int res = a * c;
int ans;
if (res <= b) { //お金を十分持っている場合
ans = c;
} else {
ans = b / a;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 913,338 | 913,339 | u653001393 | cpp |
p03105 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
... | [
"expression.operation.binary.remove"
] | 913,340 | 913,341 | u775507068 | cpp |
p03105 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,342 | 913,343 | u966508131 | cpp |
p03105 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | [
"expression.operation.binary.remove"
] | 913,346 | 913,347 | u098844816 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int buf;
buf = min(c, a / b);
cout << buf << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = (int)1e9 + 7;
int main() {
int a, b, c;
cin >> a >> b >> c;
int buf;
buf = min(c, b / a);
cout << buf << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 913,354 | 913,355 | u494379309 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int answer = 0;
cin >> A >> B >> C;
answer = B / A;
if (B > C) {
answer = C;
}
cout << answer << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int answer = 0;
cin >> A >> B >> C;
answer = B / A;
if (answer > C) {
answer = C;
}
cout << answer << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 913,372 | 913,373 | u306716491 | cpp |
p03105 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int answer;
cin >> A >> B >> C;
answer = B / A;
if (B > C) {
answer = C;
}
cout << answer << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B, C;
int answer = 0;
cin >> A >> B >> C;
answer = B / A;
if (answer > C) {
answer = C;
}
cout << answer << endl;
} | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 913,374 | 913,373 | u306716491 | cpp |
p03105 | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = (B / A, C);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = min(B / A, C);
cout << ans << endl;
return 0;
} | [
"call.add"
] | 913,377 | 913,378 | u090074105 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(A / B, C) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(B / A, C) << endl;
} | [
"expression.operation.binary.remove"
] | 913,390 | 913,391 | u826764011 | cpp |
p03105 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a > c)
cout << b / a << endl;
else
cout << c << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if ((b / a) <= c)
cout << b / a << endl;
else
cout << c << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 913,392 | 913,393 | u959815036 | cpp |
p03105 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ans;
ans = (int)A / B;
if (ans > C) {
cout << C << endl;
} e... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int A, B, C;
cin >> A >> B >> C;
int ans;
ans = (int)B / A;
if (ans > C) {
cout << C << endl;
} e... | [
"expression.operation.binary.remove",
"assignment.change"
] | 913,406 | 913,407 | u149583407 | cpp |
p03105 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c) {
cout << a / b << endl;
} else {
cout << c << endl;
}
return 0;
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c) {
cout << b / a << endl;
} else {
cout << c << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 913,408 | 913,409 | u127768253 | cpp |
p03105 | #include <bits/stdc++.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", b / a > c ? b / a : c);
} | #include <bits/stdc++.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
printf("%d\n", b / a < c ? b / a : c);
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 913,412 | 913,413 | u355780225 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A < C) {
cout << B / A << endl;
} else {
cout << B / A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B / A < C) {
cout << B / A << endl;
} else {
cout << C << endl;
}
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 913,416 | 913,417 | u425834921 | cpp |
p03105 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c)
cout << a / b << endl;
else
cout << c << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (b / a < c)
cout << b / a << endl;
else
cout << c << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 913,420 | 913,421 | u454349421 | cpp |
p03105 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c >= b / a)
cout << c << endl;
else
cout << b / a << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (c <= b / a)
cout << c << endl;
else
cout << b / a << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 913,433 | 913,434 | u407416173 | cpp |
p03105 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C, A / B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(C, B / A) << endl;
} | [
"expression.operation.binary.remove"
] | 913,439 | 913,440 | u261514692 | cpp |
p03105 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int lis_max = B / A;
cout << max(C, lis_max) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int lis_max = B / A;
cout << min(C, lis_max) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 913,445 | 913,446 | u353789691 | cpp |
p03105 | #include <iostream>
int a, b, c;
int main() {
std::cin >> a >> b >> c;
int x = static_cast<int>(b / c);
if (x >= c) {
std::cout << c << std::endl;
return 0;
} else {
std::cout << x << std::endl;
}
} | #include <iostream>
int a, b, c;
int main() {
std::cin >> a >> b >> c;
int x = static_cast<int>(b / a);
if (x >= c) {
std::cout << c << std::endl;
return 0;
} else {
std::cout << x << std::endl;
}
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 913,453 | 913,454 | u537538698 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.