Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Best way for getting more precision no.
//g++ 7.4.0 #include <bits/stdc++.h> #include <boost/lexical_cast.hpp> using namespace std; using boost::lexical_cast; using std::string; #define ll long long #define boost ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); void solve() { int n;cin>>n; ll P, Q; cin>>P>>Q; double S = (double) P/(double)Q; string Str = lexical_cast<string>(S); //cout.setprecision(10); cout<<Str; } int main() {boost; int t;cin>>t; while(t--)solve(); }
run
|
edit
|
history
|
help
0
Making pyramid using nested loop 2/2
HeapSort
Test 1(2021)
CountingSort
325324
std::string(pid_t)
Addition of two matrix **Part 2
Double_wrapper gcc
quickselect
threadpool01