由于数据过小,到不了误差。。所以直接输出答案。
#include <bits/stdc++.h>
#define hi cout<<"hin";
#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;elsereturn 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("%lfn",d);}}
本文发布于:2024-01-27 16:36:36,感谢您对本站的认可!
本文链接:https://www.4u4v.net/it/17063445951460.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
留言与评论(共有 0 条评论) |