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 9
values |
|---|---|---|---|---|---|---|---|
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,625 | 934,626 | u614217744 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
cout << a / b << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
return (0);
}
| [
"variable_declaration.type.primitive.change"
] | 934,629 | 934,630 | u490965711 | cpp |
p03135 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
double answer;
answer = A / B;
cout << answer;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
double A, B;
cin >> A >> B;
double answer;
answer = A / B;
cout << answer;
} | [
"variable_declaration.type.primitive.change"
] | 934,640 | 934,641 | u994956045 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = double(T) / X;
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 934,642 | 934,643 | u434355956 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
} | #include <iostream>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,644 | 934,645 | u434355956 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans = t / x;
printf("%.10lf", ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
double t, x;
cin >> t >> x;
double ans = t / x;
printf("%.10lf", ans);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,649 | 934,650 | u071554349 | cpp |
p03135 | #include <iostream>
using namespace std;
class A {
int T, X;
public:
void solve() {
double ans{T / X};
cout << ans << endl;
}
A() { cin >> T >> X; }
};
int main() {
A solution;
solution.solve();
return 0;
} | #include <iostream>
using namespace std;
class A {
int T, X;
public:
void solve() {
double ans{(double)T / X};
cout << ans << endl;
}
A() { cin >> T >> X; }
};
int main() {
A solution;
solution.solve();
return 0;
} | [
"type_conversion.add"
] | 934,659 | 934,660 | u815659544 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int t;
double x;
cin >> t >> x;
cout << x / t << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
double t;
int x;
cin >> t >> x;
cout << t / x << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 934,663 | 934,664 | u741134767 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a, b;
cout << fixed << setprecision(3);
cout << a / b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << fixed << setprecision(3);
cout << a / b << endl;
} | [] | 934,668 | 934,669 | u275786410 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define In(i) cin >> i;
int main() {
int T, X;
cin >> T >> X;
cout << setprecision(10) << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define In(i) cin >> i;
int main() {
double T, X;
cin >> T >> X;
cout << setprecision(10) << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,670 | 934,671 | u826764011 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, x;
cin >> T >> x;
cout << T / x << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, x;
cin >> T >> x;
cout << T / x << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,672 | 934,673 | u553183019 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (double)t / 3 << endl;
} | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << (double)t / x << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 934,674 | 934,675 | u967915578 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = (double)T / (double)X;
cout << ans << endl;
} | [
"type_conversion.add"
] | 934,676 | 934,677 | u726060136 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
long ans = (long)T / (long)X;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = (double)T / (double)X;
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,678 | 934,677 | u726060136 | cpp |
p03135 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int T, X;
cin >> T >> X;
double ans;
ans = T / X;
printf("%.12f\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
double T, X;
cin >> T >> X;
double ans;
ans = T / X;
printf("%.12f\n", ans);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,682 | 934,683 | u895536055 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a, b;
cout << a / b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
cout << a / b << endl;
} | [] | 934,684 | 934,685 | u757584836 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a, b;
cout << a / b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
cout << a / b << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,686 | 934,685 | u757584836 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i <= (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
float c = a / b;
cout << c << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define rep0(i, n) for (int i = 0; i <= (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
int main() {
float a, b;
cin >> a >> b;
float c = a / b;
cout << c << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,698 | 934,699 | u820341516 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
double x, y = 0, z, w, i, j;
cin >> x >> y;
cout << y / x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;
signed main() {
double x, y = 0, z, w, i, j;
cin >> x >> y;
cout << x / y << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 934,706 | 934,707 | u893330446 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, T;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double X, T;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,708 | 934,709 | u690326065 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double N, M, K;
cin >> N >> M;
K = N / M;
cout << setprecision(10) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double N, M, K;
cin >> N >> M;
K = N / M;
cout << setprecision(10) << K << endl;
}
| [
"io.output.change"
] | 934,712 | 934,713 | u618604643 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,714 | 934,715 | u998251394 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << X / T;
} | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X;
} | [
"expression.operation.binary.remove"
] | 934,720 | 934,721 | u534015096 | cpp |
p03135 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << X / T << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
} | [
"expression.operation.binary.remove"
] | 934,722 | 934,723 | u964124095 | cpp |
p03135 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
Int T, X;
cin >> T >> X;
cout << T / X;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define endl "\n"
typedef long long Int;
int main() {
double T, X;
cin >> T >> X;
cout << T / X;
} | [
"variable_declaration.type.change"
] | 934,734 | 934,735 | u477204532 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
float ans = t / x;
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
float t, x;
cin >> t >> x;
float ans = t / x;
cout << ans;
}
| [
"variable_declaration.type.primitive.change"
] | 934,736 | 934,737 | u583276018 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
int t, x;
cin >> t >> x;
double ans = t / x;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(10);
int t, x;
cin >> t >> x;
double ans = double(t) / x;
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change"
] | 934,748 | 934,749 | u098026368 | cpp |
p03135 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = T / X;
cout << setprecision(10) << time << endl;
}
| #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = double(T) / X;
cout << fixed << setprecision(10) << time << endl;
}
| [
"call.add",
"call.arguments.change",
"io.output.change"
] | 934,750 | 934,751 | u300956826 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,754 | 934,755 | u274317341 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T * X << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 934,756 | 934,755 | u274317341 | cpp |
p03135 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int t;
int x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,757 | 934,758 | u033602950 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
} | #include <iostream>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,761 | 934,762 | u483747145 | cpp |
p03135 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int i, t;
cin >> i >> t;
cout << (double)(i / t) << endl;
return 0;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int i, t;
cin >> i >> t;
cout << (double)i / (double)t << endl;
return 0;
} | [
"io.output.change"
] | 934,778 | 934,779 | u288432959 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans;
ans = T / X;
cout << ans << "\n";
} | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans;
ans = T / X;
cout << ans << "\n";
} | [
"variable_declaration.type.primitive.change"
] | 934,781 | 934,782 | u637834578 | cpp |
p03135 | #include <bits/stdc++.h>
#define inf 1000000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
}
| #include <bits/stdc++.h>
#define inf 1000000000
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
int main() {
int T, X;
cin >> T >> X;
cout << (double)T / X << endl;
}
| [
"type_conversion.add"
] | 934,791 | 934,792 | u654998183 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3")
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9;
const LL LINF = 1e16;
const LL MOD = 1000000007;
const double PI = acos(-1.0);
int DX[8] = {0, 0, 1, -1, 1, 1, -1, -1};
int DY[8] = {1, -1, 0, 0, 1, -1, 1, -1};
/* ----- __MAKE_TIME__ Problem: __PROBLEM__ / Link: __CONTEST_URL__ ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
double T, X;
cin >> T >> X;
double ans = T / X;
cout << fixed << setprecision(10) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3")
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9;
const LL LINF = 1e16;
const LL MOD = 1000000007;
const double PI = acos(-1.0);
int DX[8] = {0, 0, 1, -1, 1, 1, -1, -1};
int DY[8] = {1, -1, 0, 0, 1, -1, 1, -1};
/* ----- __MAKE_TIME__ Problem: __PROBLEM__ / Link: __CONTEST_URL__ ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
double T, X;
cin >> T >> X;
double ans = T / X;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| [
"io.output.change"
] | 934,807 | 934,808 | u788341294 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,815 | 934,816 | u816580121 | cpp |
p03135 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rer(i, a, b) for (ll i = a - 1; i >= b; i--)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
double x, t;
signed main() {
cin >> x >> t;
cout << t / x << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rer(i, a, b) for (ll i = a - 1; i >= b; i--)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
double x, t;
signed main() {
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 934,817 | 934,818 | u876442898 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
float t = T / X;
cout << t << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double t = double(T) / X;
cout << t << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 934,824 | 934,825 | u684556267 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double t = T / X;
cout << t << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double t = double(T) / X;
cout << t << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 934,826 | 934,825 | u684556267 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,828 | 934,829 | u067481442 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,830 | 934,831 | u319001729 | cpp |
p03135 | #include <iostream>
int main() {
int T, X;
std::cin >> T >> X;
double t = T / X;
std::cout << t << std::endl;
} | #include <iostream>
int main() {
int T, X;
std::cin >> T >> X;
double t = (double)T / X;
std::cout << t << std::endl;
} | [
"type_conversion.add"
] | 934,832 | 934,833 | u094406988 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,838 | 934,839 | u929829215 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << x / t << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
} | [
"expression.operation.binary.remove"
] | 934,844 | 934,845 | u626463672 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
float output = T / X;
cout << output << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
float output = T / X;
cout << output << endl;
} | [
"variable_declaration.type.primitive.change"
] | 934,846 | 934,847 | u677705680 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(void) {
int t, x;
cin >> t >> x;
double ans;
ans = t / x;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
double t, x;
cin >> t >> x;
double ans;
ans = t / x;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,858 | 934,859 | u407416173 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
cout << X % Y << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double X, Y;
cin >> X >> Y;
cout << (X / Y) << endl;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 934,860 | 934,861 | u955534952 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = b / a;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double ans = a / b;
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 934,872 | 934,873 | u827250617 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,883 | 934,884 | u762627766 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T * X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 934,885 | 934,884 | u762627766 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << fixed;
cout << setprecision(10);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = double(T) / X;
cout << fixed;
cout << setprecision(10);
cout << ans << endl;
} | [
"call.add",
"call.arguments.change"
] | 934,893 | 934,894 | u974285535 | cpp |
p03135 | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
cout << A * B - B << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
cout << A / B << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 934,901 | 934,902 | u899108527 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << double(T / X) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << double(T) / double(X) << endl;
return 0;
}
| [
"call.arguments.change",
"call.add"
] | 934,905 | 934,907 | u734620960 | cpp |
p03135 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int t, x;
double ans;
cin >> t >> x;
ans = t / x;
printf("%.8f", ans);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int t, x;
double ans;
cin >> t >> x;
ans = (double)t / x;
printf("%.8f\n", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 934,921 | 934,924 | u783922005 | cpp |
p03135 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF_MAX INT_MAX
#define INF_MIN ((int)1 << 31) - 1
using namespace std;
class Segtree {
vector<int> tree;
int n = 1, m, Inf;
void Set(vector<int> vec) {
rep(i, n * 2 - 2) tree[i + 1] = Inf;
rep(i, vec.size()) tree[i + n] = vec.at(i);
update(0, n - 1);
}
int sum(int a, int b) {
if (m == 0)
return max(a, b);
else if (m == 1)
return min(a, b);
else if (m == 2)
return a + b;
else
return a * b;
}
int query(int a, int b, int x, int l, int r) {
if (r < a || b < l)
return Inf;
if (a <= l && b >= r)
return tree[x];
return sum(query(a, b, x * 2, l, (l + r) / 2),
query(a, b, x * 2 + 1, (l + r) / 2 + 1, r));
}
void update(int l, int r) {
l += n, r += n;
l /= 2, r /= 2;
while (1) {
if (l == 0)
break;
int xl = l;
for (; xl <= r; xl += 2) {
tree[xl] = sum(tree[xl * 2], tree[xl * 2 + 1]);
}
l /= 2, r /= 2;
}
}
public:
void Max(vector<int> vec) {
m = 0;
Inf = INF_MAX;
Set(vec);
}
void Min(vector<int> vec) {
m = 1;
Inf = INF_MIN;
Set(vec);
}
void Add(vector<int> vec) {
m = 2;
Inf = 0;
Set(vec);
}
void Multiply(vector<int> vec) {
m = 3;
Inf = 1;
Set(vec);
}
Segtree(int in) {
for (; in > n; n *= 2)
;
tree.resize(n * 2);
}
void Set(int a, int b) {
tree[a + n] = b;
update(a, a);
}
int query(int a, int b) { return query(a, b, 1, 0, n - 1); }
};
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
};
signed main() {
double a, b;
cin >> a >> b;
double c = a / b;
printf("%12.8f/n", c);
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF_MAX INT_MAX
#define INF_MIN ((int)1 << 31) - 1
using namespace std;
class Segtree {
vector<int> tree;
int n = 1, m, Inf;
void Set(vector<int> vec) {
rep(i, n * 2 - 2) tree[i + 1] = Inf;
rep(i, vec.size()) tree[i + n] = vec.at(i);
update(0, n - 1);
}
int sum(int a, int b) {
if (m == 0)
return max(a, b);
else if (m == 1)
return min(a, b);
else if (m == 2)
return a + b;
else
return a * b;
}
int query(int a, int b, int x, int l, int r) {
if (r < a || b < l)
return Inf;
if (a <= l && b >= r)
return tree[x];
return sum(query(a, b, x * 2, l, (l + r) / 2),
query(a, b, x * 2 + 1, (l + r) / 2 + 1, r));
}
void update(int l, int r) {
l += n, r += n;
l /= 2, r /= 2;
while (1) {
if (l == 0)
break;
int xl = l;
for (; xl <= r; xl += 2) {
tree[xl] = sum(tree[xl * 2], tree[xl * 2 + 1]);
}
l /= 2, r /= 2;
}
}
public:
void Max(vector<int> vec) {
m = 0;
Inf = INF_MAX;
Set(vec);
}
void Min(vector<int> vec) {
m = 1;
Inf = INF_MIN;
Set(vec);
}
void Add(vector<int> vec) {
m = 2;
Inf = 0;
Set(vec);
}
void Multiply(vector<int> vec) {
m = 3;
Inf = 1;
Set(vec);
}
Segtree(int in) {
for (; in > n; n *= 2)
;
tree.resize(n * 2);
}
void Set(int a, int b) {
tree[a + n] = b;
update(a, a);
}
int query(int a, int b) { return query(a, b, 1, 0, n - 1); }
};
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
};
signed main() {
double a, b;
cin >> a >> b;
double c = a / b;
printf("%.8f\n", c);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 934,934 | 934,941 | u073057072 | cpp |
p03135 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << 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 T, X;
cin >> T >> X;
double ans = (double)T / X;
cout << ans << endl;
return 0;
} | [
"type_conversion.add"
] | 934,906 | 934,909 | u221769213 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double X, T;
cin >> X >> T;
cout << T / X << setprecision(10);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double X, T;
cin >> X >> T;
cout << X / T << setprecision(10);
} | [
"expression.operation.binary.remove"
] | 934,911 | 934,912 | u393754572 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X << endl;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,918 | 934,920 | u532401120 | cpp |
p03135 | #include <stdio.h>
int main(void) {
int t, x;
scanf("%d %d", &t, &x);
double ans = t / x;
printf("%lf\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int t, x;
scanf("%d %d", &t, &x);
double ans = (double)t / (double)x;
printf("%lf\n", ans);
return 0;
} | [
"type_conversion.add"
] | 934,922 | 934,923 | u497418592 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int t, x;
double ans;
cin >> t >> x;
ans = t / x;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
double t, x;
double ans;
cin >> t >> x;
ans = t / x;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,925 | 934,927 | u073082475 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double ans;
ans = t / x;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
double ans;
ans = t / x;
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 934,928 | 934,932 | u800100718 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
double ans;
cin >> a >> b;
ans = a / b;
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double a, b;
double ans;
cin >> a >> b;
ans = a / b;
cout << ans;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 934,945 | 934,946 | u340494803 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = T / X;
// cout << ans <<endl;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = (double)T / X;
// cout << ans <<endl;
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| [
"type_conversion.add"
] | 934,953 | 934,954 | u355424600 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
double x, t;
cin >> x >> t;
cout << t / x;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double x, t;
cin >> t >> x;
cout << t / x;
} | [
"expression.operation.binary.remove"
] | 934,955 | 934,956 | u166378830 | cpp |
p03135 | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define LL long long
#define inf 0x7fffffff
#define mod 1000000007
#define pb push_back
#define ppi pair<int, int>
#define vi vector<int>
#define vii vector<ppi>
#define vll vector<LL>
#define mp make_pair
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void inputread() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio();
inputread();
double T, X;
cin >> T >> X;
printf("%.10f", (T / X));
return 0;
} | /**
* Name: Ajay Subhash Jadhav
* Institute: International Institute of Technology Hyderabad
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define LL long long
#define inf 0x7fffffff
#define mod 1000000007
#define pb push_back
#define ppi pair<int, int>
#define vi vector<int>
#define vii vector<ppi>
#define vll vector<LL>
#define mp make_pair
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void inputread() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio();
double T, X;
cin >> T >> X;
printf("%.10f", (T / X));
return 0;
} | [
"call.remove"
] | 934,957 | 934,958 | u139573956 | cpp |
p03135 | #include <iostream>
int main(void) {
int T, X;
std::cin >> T >> X;
std::cout << T / X << std::endl;
} | #include <iostream>
int main(void) {
double T, X;
std::cin >> T >> X;
std::cout << T / X << std::endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,961 | 934,962 | u960268186 | cpp |
p03135 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,963 | 934,964 | u389766217 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << T / X;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
cout << T / X;
}
| [
"variable_declaration.type.primitive.change"
] | 934,965 | 934,966 | u389766217 | cpp |
p03135 | #include <bits/stdc++.h>
int main() {
int t, x;
std::cin >> t >> x;
std::cout << t / x << std::endl;
}
| #include <bits/stdc++.h>
int main() {
double t, x;
std::cin >> t >> x;
std::cout << t / x << std::endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,979 | 934,980 | u537538698 | cpp |
p03135 | #include <iostream>
using namespace std;
int t, x;
int main() {
cin >> t >> x;
cout << t * x;
} | #include <iostream>
using namespace std;
float t, x;
int main() {
cin >> t >> x;
cout << t / x;
} | [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 934,985 | 934,986 | u486908386 | cpp |
p03135 | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / b << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
cout << a / b << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 934,987 | 934,988 | u143492911 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << double(t) / x << endl;
} | [
"call.add",
"call.arguments.change"
] | 934,991 | 934,992 | u655975843 | cpp |
p03135 | #include <iostream>
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
cout << (double)T / 3 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int T, X;
cin >> T >> X;
cout << (double)T / X << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 934,993 | 934,994 | u121243942 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = T % X;
cout << fixed << setprecision(10) << time << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double time = double(T) / X;
cout << fixed << setprecision(10) << time << endl;
} | [
"call.add",
"expression.operation.binary.change"
] | 934,999 | 935,000 | u539675863 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(void) {
ll result;
ll T, X;
cin >> T >> X;
result = T / X;
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(void) {
double result;
double T, X;
cin >> T >> X;
result = T / X;
cout << result << endl;
}
| [
"variable_declaration.type.change"
] | 935,001 | 935,002 | u050445028 | cpp |
p03135 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(void) {
ll result;
ll T, X;
cin >> T >> X;
result = T / X;
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(void) {
double result;
double T, X;
cin >> T >> X;
result = T / X;
cout << result << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 935,001 | 935,003 | u050445028 | cpp |
p03135 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define REV(v) reverse(v.begin(), v.end())
typedef long long ll;
typedef tuple<int, int, bool> Tb;
int atcoder() {
//入力
int t, x;
cin >> t >> x;
double ans = t / x;
//処理
//出力
cout << ans << ENT;
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ENT "\n"
#define REV(v) reverse(v.begin(), v.end())
typedef long long ll;
typedef tuple<int, int, bool> Tb;
int atcoder() {
//入力
double t, x;
cin >> t >> x;
double ans = t / x;
//処理
//出力
cout << ans << ENT;
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
atcoder();
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,004 | 935,005 | u635484372 | cpp |
p03135 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << "\n";
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,006 | 935,007 | u064362379 | cpp |
p03135 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double ans = T / 3.0;
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << "\n";
return 0;
} | [
"variable_declaration.type.primitive.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 935,008 | 935,007 | u064362379 | cpp |
p03135 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / 3;
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double ans = T / X;
cout << ans << "\n";
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 935,009 | 935,007 | u064362379 | cpp |
p03135 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
double t, x;
cin >> t >> x;
cout << t / x << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,011 | 935,012 | u317177661 | cpp |
p03135 | #include <stdio.h>
int main(void) {
int t, x;
double hyouji;
scanf("%d %d", &t, &x);
printf("%f", double(t / x));
return 0;
} | #include <stdio.h>
int main(void) {
int t, x;
double hyouji;
scanf("%d %d", &t, &x);
printf("%f", (double)t / x);
return 0;
} | [
"call.arguments.change"
] | 935,015 | 935,016 | u129632905 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double c = a / b;
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
double c = a / b;
cout << c << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,021 | 935,022 | u511379665 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
double answer;
answer = T / X;
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
double answer;
answer = T / X;
cout << answer << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 935,023 | 935,024 | u665871498 | cpp |
p03135 | #include <iostream>
int T, X;
int main() {
std::cin >> T >> X;
std::cout << T / X;
} | #include <iostream>
double T, X;
int main() {
std::cin >> T >> X;
std::cout << T / X;
} | [
"variable_declaration.type.primitive.change"
] | 935,030 | 935,031 | u909102981 | cpp |
p03135 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
double x, t;
cin >> x >> t;
cout << t / x << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
double x, t;
cin >> t >> x;
cout << t / x << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 935,042 | 935,043 | u189404681 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int T, X;
cin >> T >> X;
cout << (T / X) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << (T / X) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 935,044 | 935,045 | u519766654 | cpp |
p03135 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int t, x;
cin >> t >> x;
cout << x * t << endl;
return 0;
} | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
double t, x;
cin >> t >> x;
cout << t / x << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 935,060 | 935,061 | u057611820 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = T / X;
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int T, X;
double ans;
cin >> T >> X;
ans = (double)T / (double)X;
cout << ans << endl;
} | [
"type_conversion.add"
] | 935,062 | 935,063 | u545674098 | cpp |
p03135 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int t, x;
cin >> t >> x;
std::cout << (double)x / t << std::endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int t, x;
cin >> t >> x;
std::cout << (double)t / x << std::endl;
}
int main(int argc, char *argv[]) {
solve();
return 0;
}
| [
"expression.operation.binary.remove"
] | 935,066 | 935,067 | u576524226 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
float c;
cin >> a >> b;
c = float(a / b);
cout << c << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
float c;
cin >> a >> b;
c = float(a) / b;
cout << c << endl;
} | [
"call.arguments.change"
] | 935,075 | 935,076 | u981068718 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int a, b;
float c;
cin >> a, b;
c = float(a / b);
cout << c << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
float c;
cin >> a >> b;
c = float(a) / b;
cout << c << endl;
} | [
"call.arguments.change"
] | 935,077 | 935,076 | u981068718 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
cout << A / B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double A;
double B;
cin >> A >> B;
cout << A / B << endl;
} | [
"variable_declaration.type.primitive.change"
] | 935,080 | 935,081 | u390306292 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double atime;
atime = t / x;
cout << atime << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
double atime;
atime = double(t) / x;
cout << atime << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 935,092 | 935,093 | u670773128 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T, X;
cout << T / X << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,094 | 935,095 | u078210090 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T;
cin >> X;
cout << T / X << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 935,096 | 935,095 | u078210090 | cpp |
p03135 | #include <iostream>
using namespace std;
int main() {
int T, X;
cin >> T;
cin >> X;
cout << T * X << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
double T, X;
cin >> T >> X;
cout << T / X << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 935,097 | 935,095 | u078210090 | cpp |
p03135 | #include <stdio.h>
int main() {
double t, x;
scanf("%d %d", &t, &x);
printf("%f", t / x);
return 0;
} | #include <stdio.h>
int main() {
int t, x;
scanf("%d %d", &t, &x);
printf("%f", double(t) / x);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"call.add",
"call.arguments.change"
] | 935,104 | 935,105 | u102044654 | cpp |
p03135 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
double x, y;
cin >> x >> y;
cout << y / x << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
double x, y;
cin >> x >> y;
cout << x / y << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 935,106 | 935,107 | u386907894 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.