hdu多校6
这个场要恶心死我了。。
1001
积分题,不要四舍五入
//#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast,no-stack-protector") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> #define fi first #define se second #define db double #define mp make_pair #define pb push_back #define pi acos(-1.0) #define ll long long #define vi vector<int> #define mod 1000000007 #define ld long double #define C 0.5772156649 #define ls l,m,rt<<1 #define rs m+1,r,rt<<1|1 #define pll pair<ll,ll> #define pil pair<int,ll> #define pli pair<ll,int> #define pii pair<int,int> //#define cd complex<double> #define ull unsigned long long #define base 1000000000000000000 #define Max(a,b) ((a)>(b)?(a):(b)) #define Min(a,b) ((a)<(b)?(a):(b)) #define fio ios::sync_with_stdio(false);cin.tie(0) template<typename T> inline T const& MAX(T const &a,T const &b){return a>b?a:b;} template<typename T> inline T const& MIN(T const &a,T const &b){return a<b?a:b;} inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;} inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;} inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;} inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;} using namespace std; const double eps=1e-8; const ll INF=0x3f3f3f3f3f3f3f3f; const int N=100000+10,maxn=400000+10,inf=0x3f3f3f3f; int a,b; int main() { int T;scanf("%d",&T); while(T--) { scanf("%d%d",&a,&b); double ans=pi*a+2.0*b; ll ret = ans * 1000000; printf("%.6f ", 1.0 * ret / 1000000); } return 0; } /******************** ********************/
1012
物理题。。。。
#include<bits/stdc++.h> using namespace std; const int N = 300; const int mod = 1000000007; double a, b, x, y; int main() { int T; scanf("%d", &T); while(T--) { scanf("%lf%lf%lf%lf", &a, &b, &x, &y); a=fabs(a); b=fabs(b); x=fabs(x); y=fabs(y); double h = x * (b) / a; double val = b / sqrt(a * a + b * b);//sin double H=y-h; double t=sqrt(2*9.8*H)/9.8; double hi=0; for(int i = 1;i <=100; i++) { hi+=4*i*9.8*t*t*val*val; if(hi>h){ printf("%d ",i); break; } } } }