题目链接
https://www.nowcoder.com/acm/contest/85/B
思路
这个 也是 E
AC代码
#include <cstdio> #include <cstring> #include <ctype.h> #include <cstdlib> #include <cmath> #include <climits> #include <ctime> #include <iostream> #include <algorithm> #include <deque> #include <vector> #include <queue> #include <string> #include <map> #include <stack> #include <set> #include <numeric> #include <sstream> #include <iomanip> #include <limits> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair <int, int> pii; typedef pair <ll, ll> pll; const double PI = 3.14159265358979323846264338327; const double E = exp(1); const double eps = 1e-6; const int INF = 0x3f3f3f3f; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; int main() { int t; cin >> t; while (t--) { int a, b, c; scanf("%d%d%d", &a, &b, &c); double sum; sum = pow(a, E); sum /= b; cout << setiosflags(ios::fixed) << setprecision(c) << sum <<endl; } }转载于:https://www.cnblogs.com/Dup4/p/9433253.html
相关资源：JAVA上百实例源码以及开源项目