思路
由于数据过小,到不了误差。。所以直接输出答案。
代码
#include <bits/stdc++.h>
#define hi cout<<"hi\n";
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
using namespace std;
const ll mod = 1000000009;
const int maxn = 100005;
ll power(long long a, long long b, long long mode)
{
long long sum = 1;
while (b)
{
if (b & 1)
{
sum = (sum * a) % mode;
b--;
}
b /= 2;
a = a * a % mode;
}
return sum;
}
ll gcd(int a,int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
ll lcm(int a,int b)
{
return a/gcd(a,b)*b;
}
const double G=6.67430e-11;
int main()
{
double r=2999.99999999999999982;
double a=100;
double b=100;
double d=1000;
double t=100;
int T;
cin>>T;
while(T--)
{
cin>>a>>b>>d>>t;
printf("%lf\n",d);
}
}