uva 11130 斯诺克

   uva上交题还真是不容易..一直redirect.. 这个是cl童鞋上java的时候问的..本来看着是模拟..其实把球台折叠拓展到无限就可以直接求了..因为全部都是完全弹性碰撞..并且四角也没有球袋...

 

  #include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>using namespace std;int main(void){//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout); double a,b,v,A,s; while(scanf("%lf %lf %lf %lf %lf",&a,&b,&v,&A,&s)!=EOF) {if(fabs(a+b+v+A+s)<=1e-6)break;A=A/180.0*3.1415926;double hor=v*s/2.0*cos(A);double ver=v*s/2.0*sin(A);if(hor>=a/2.0){int ans=round(hor/a);printf("%d ",ans);}elseprintf("0 ");if(ver>=b/2.0){int ans=round(ver/b);printf("%d/n",ans);}elseprintf("0/n");//cout<<"hor="<<hor<<"ver="<<ver<<endl;} return 0;}