近日一些水题

中秋在家堕落了···今天贴的都是中秋之前的题，先来水题

//toj2917#include<iostream>#include<iomanip>#include<cmath>using namespace std;int main(){    double n;    while(cin>>n)    {        if(n<0)break;        cout<<fixed<<setprecision(2);        cout<<(double)pow((double)2*n,1.0/2)<<endl;             }    return 0;   }

//toj2698--注意怎样使其不超时，要进行一些预处理#include<iostream>#include<cmath>using namespace std;long n,i,j,k,num;int prime(long x){    j=sqrt((long)x);    for(k=2;k<=j;k++)        if(x%k==0)            return 0;    return 1;}int main(){    while(cin>>n)    {       if(n==0)break;         num=0;       if(prime(n-2)==1)num++;       for(i=3;i<=n/2;i+=2)//从奇数里找          if(prime(i)==1&&prime(n-i)==1)              num++;       cout<<num<<endl;               }       return 0;}

//toj3005--进制转换大水题#include<iostream>#include<iomanip>using namespace std;int main(){   int n,i;   double x,y;   char s[3];   cin>>n;   for(i=1;i<=n;i++)   {       cin>>x>>s;       cout<<fixed<<setprecision(4);       if(s[0]=='l'&&s[1]=='b')       {   y=x*0.4536;           cout<<i<<" "<<y<<" kg"<<endl;   }                          else if(s[0]=='l')       {   y=x*0.2642;           cout<<i<<" "<<y<<" g"<<endl;   }       else if(s[0]=='k')       {   y=x*2.2046;           cout<<i<<" "<<y<<" lb"<<endl;   }       else        {   y=x*3.7854;           cout<<i<<" "<<y<<" l"<<endl;   }                }    return 0;    } 

//toj2526#include<iostream>#include<cmath>using namespace std;int main(){   int b,n,a,i;   while(cin>>b>>n)   {       if(b==0&&n==0)break;       int m=(int)pow(b,1.0/n);        //判断是否加1       if(pow((m+1)*1.0,n)+pow(m*1.0,n)-2*b<0)          m++;        cout<<m<<endl;                }    return 0;   }

//toj2346#include<iostream>using namespace std;int main(){    int cases,i;    long long sum,a,b;    cin>>cases;    for(i=1;i<=cases;i++)    {        sum=0;        cin>>a>>b;        sum=(b-a+1)*(a+b)/2;         cout<<"Scenario #"<<i<<":"<<endl;         cout<<sum<<endl<<endl;             }    return 0;   }

//toj2027#include<iostream>#include<memory.h>#include<iomanip>using namespace std;int main(){    int flag[1000005];    long long s,m,tmp,len;    while(cin>>s>>m)    {         memset(flag,0,sizeof(flag));         len=1;tmp=0;flag[0]=1;//seed0=0         while(1)         {            tmp=(tmp+s)%m;             if(flag[tmp]!=0)            {                  if(len==m)cout<<setw(10)<<s<<setw(10)<<m<<"    Good Choice"<<endl;                  else cout<<setw(10)<<s<<setw(10)<<m<<"    Bad Choice"<<endl;                  break;            }            flag[tmp]=1;            len++;                         }         cout<<endl;             }    return 0;   }

//toj1833#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>using namespace std;int main(){    char s[10],str[110];    int i;    while(cin>>s)    {        if(strcmp(s,"ENDOFINPUT")==0)break;         getchar();        gets(str);          //getchar();        cin>>s;        int len=strlen(str);        for(i=0;i<len;i++)        {              if(str[i]>='A'&&str[i]<='E')//注意顺序！！！                str[i]=str[i]+21;            else if(str[i]>='F'&&str[i]<='Z')               str[i]=str[i]-5;          }         cout<<str<<endl;          }    return 0;   }

//toj1571#include<iostream>#include<iomanip>using namespace std;int main(){    int n,i;    cout<<"PERFECTION OUTPUT"<<endl;    while(cin>>n)    {         if(n==0)break;          int sum=0;         for(i=1;i<n;i++)         {             if(n%i==0)sum+=i;                     }          if(sum==n)cout<<setw(5)<<n<<"  PERFECT"<<endl;          else if(sum<n)cout<<setw(5)<<n<<"  DEFICIENT"<<endl;         else cout<<setw(5)<<n<<"  ABUNDANT"<<endl;           }    cout<<"END OF OUTPUT"<<endl;    return 0;   }

//toj1425#include<iostream>using namespace std;int main(){    int start,a,b,c,i,j;    while(cin>>start>>a>>b>>c)    {       if(start==0&&a==0&&b==0&&c==0)break;       int sum=3*360;       if(start-a<0)          sum+=(40+start-a)*9;       else sum+=(start-a)*9;       if(a-b<0)          sum+=(b-a)*9;       else sum+=(40+b-a)*9;       if(b-c<0)          sum+=(40+b-c)*9;       else sum+=(b-c)*9;       cout<<sum<<endl;    }    return 0;   }

//toj3013#include<iostream>using namespace std;int main(){   int r,a,b,i=1;   while(cin>>r)   {        if(r==0)break;       cin>>a>>b;       if(a*a+b*b>4*r*r)cout<<"Pizza "<<i<<" does not fit on the table."<<endl;       else cout<<"Pizza "<<i<<" fits on the table."<<endl;        i++;   }    return 0;   }

#include<iostream>using namespace std;int main(){    int cases,n,i,a[20],b[20];    cin>>cases;    while(cases--)    {        cin>>n;        int sum=0;        for(i=0;i<n;i++)           cin>>a[i];        for(i=0;i<n;i++)        {           cin>>b[i];           sum+=a[i]*b[i];        }        cout<<sum<<endl;              }    return 0;}

//toj1393:大圆柱体积-小圆柱体积-圆锥台体积=V #include<iostream>#include<iomanip>#include<cmath>#define PI 3.141592653589using namespace std;int main(){    int D,V;    while(cin>>D>>V)    {        if(D==0&&V==0)break;        cout<<fixed<<setprecision(3);        cout<<pow((D*D*D-6*V/PI),(1.0/3))<<endl;                    }    return 0;}

//toj3059#include<iostream>using namespace std;int main(){    int cases,n,sum1,sum2;    char s1,s2;    cin>>cases;    while(cases--)    {        cin>>n;         sum1=0;sum2=0;         while(n--)        {            cin>>s1>>s2;             if(s1=='R'&&s2=='S')sum1++;            if(s1=='R'&&s2=='P')sum2++;            if(s1=='P'&&s2=='R')sum1++;            if(s1=='P'&&s2=='S')sum2++;             if(s1=='S'&&s2=='R')sum2++;            if(s1=='S'&&s2=='P')sum1++;            }             if(sum2>sum1)cout<<"Player 2"<<endl;        else if(sum2<sum1)cout<<"Player 1"<<endl;        else cout<<"TIE"<<endl;       }       return 0;}

//toj3861#include<iostream>using namespace std;int main(){    int n;    while(cin>>n)    cout<<"Ann wins."<<endl;    return 0;   }