四校训练 warm up 14

A:Pythagoras's Revenge

代码：

 #include<cstdio>
 #define ll long long
 using namespace std;
 int main()
 {
     ll a;
     while(scanf("%lld",&a)!=EOF)
     {
         if (a==) break;
         ll aa=a*a;
         int ans=;
         for(ll i=;i<a;i++)
         {
             ll x=i;
             if (aa%i!=) continue;
             ll y=aa/i;
             if ((x+y)*(y-x)%!=) continue;
             if ((y-x)/>a) ans++;
         }
         printf("%d\n",ans);
     }
     return ;
 }

B:Digit Solitaire

代码：

 #include<cstdio>
 using namespace std;

 int main()
 {
     int b;
     while(scanf("%d",&b)&&b)
     {
         printf("%d",b);
         while(b/>)
         {
             int tmp=;
             while(b>)
             {
                 tmp*=b%;
                 b/=;
             }
             b=tmp;
             printf(" %d",tmp);
         }
         printf("\n");
     }
     return ;
 }

C：Any Way You Slice It

计算几何

代码：

 #include<cstdio>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #define maxn 150
 #define pi acos(-1)
 #define eps 1e-5
 using namespace std;

 struct point
 {
     double x,y;
     point(double x=,double y=):x(x),y(y){}
 } p[maxn];
 point operator-(point a,point b){return point(a.x-b.x,a.y-b.y);}
 double cross(point a,point b){return a.x*b.y-a.y*b.x;}
 int dcmp(double x)
 {
     if(fabs(x)<eps)return ;
     else return x<?-:;
 }
 bool xiangjiao(point a1,point a2,point b1,point b2)
 {
     double c1=cross(a2-a1,b1-a1),c2=cross(a2-a1,b2-a1);
     double c3=cross(b2-b1,a1-b1),c4=cross(b2-b1,a2-b1);
     return dcmp(c1)*dcmp(c2)<&&dcmp(c3)*dcmp(c4)<;
 }

 int main()
 {
     int n;
     double d,x;
     while(scanf("%d",&n)&&n)
     {
         bool flag=;
         int ans=;
         p[]= point(,);
         double ang=pi/;
         for(int i=; i<n; i++)
         {
             scanf("%lf%lf",&d,&x);
             ang+=d/*pi;
             p[i+].x=p[i].x+cos(ang)*x;
             p[i+].y=p[i].y+sin(ang)*x;
             if(i>&&flag==)
             {
                 for(int j=; j<i; j++)
                 {
                     if(xiangjiao(p[j],p[j+],p[i],p[i+])==)
                         {
                             flag=;
                             ans=i+;
                         }
                 }
             }

         }
         if(flag==)puts("SAFE");
         else printf("%d\n",ans);
     }
     return ;
 }

D：Is the Name of This Problem

代码：

 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<iostream>
 #define maxn 109
 using namespace std;

 char s1[maxn];
 char s2[maxn];
 int main()
 {
 //    freopen("in.txt","r",stdin);
     while(gets(s1))
     {
         bool flag=;
         memset(s2,,sizeof s2);
         if(s1[]=='E'&&s1[]=='N'&&s1[]=='D'&&!s1[])break;
         int l=strlen(s1);
         if(s1[]!='\"')
         {
             puts("not a quine");
             continue;
         }
         int i,cnt=;
         for(i=; i<l; i++)
         {
             if(s1[i]=='\"')break;
             s2[cnt++]=s1[i];
         }
         if(cnt==)
         {
             puts("not a quine");
             continue;
         }
         i++;
         if(s1[i]!=' ')
         {
             flag=;
         }
         i++;
         int j=;
         for(;j<cnt;j++)
         {
             if(s2[j]>='A'&&s2[j]<='Z')continue;
             else if(s2[j]==' ')continue;
             else
             {
                 flag=;break;
             }
         }
         j=;
         for(;i<l;i++)
         {
             if(s1[i]!=s2[j])
             {
                 flag=;break;
             }
             j++;
             if(j>cnt){flag=;break;}
         }
         if(j<cnt)flag=;
         if(flag)printf("Quine(%s)\n",s2);
         else puts("not a quine");
     }
     return ;
 }
 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<iostream>
 #define maxn 109
 using namespace std;

 char s1[maxn];
 char s2[maxn];
 int main()
 {
 //    freopen("in.txt","r",stdin);
     while(gets(s1))
     {
         bool flag=;
         memset(s2,,sizeof s2);
         if(s1[]=='E'&&s1[]=='N'&&s1[]=='D'&&!s1[])break;
         int l=strlen(s1);
         if(s1[]!='\"')
         {
             puts("not a quine");
             continue;
         }
         int i,cnt=;
         for(i=; i<l; i++)
         {
             if(s1[i]=='\"')break;
             s2[cnt++]=s1[i];
         }
         if(cnt==)
         {
             puts("not a quine");
             continue;
         }
         i++;
         if(s1[i]!=' ')
         {
             flag=;
         }
         i++;
         int j=;
         for(;j<cnt;j++)
         {
             if(s2[j]>='A'&&s2[j]<='Z')continue;
             else if(s2[j]==' ')continue;
             else
             {
                 flag=;break;
             }
         }
         j=;
         for(;i<l;i++)
         {
             if(s1[i]!=s2[j])
             {
                 flag=;break;
             }
             j++;
             if(j>cnt){flag=;break;}
         }
         if(j<cnt)flag=;
         if(flag)printf("Quine(%s)\n",s2);
         else puts("not a quine");
     }
     return ;
 }

F：LRU Caching

代码：

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define maxn 1000009
 using namespace std;
 int frecount;
 int n;
 struct node
 {
     int id;
     int fre;
     bool operator <(const node &t)const
     {
         return fre<t.fre;
     }
 } no[];

 void shuchu()
 {
     sort(no,no+n);
     for(int i=; i<n; i++)
     {
         if(no[i].id>)
             printf("%c",no[i].id+'A'-);
     }
     puts("");
 }

 void add(char s)
 {
     bool flag=;
     frecount++;
     for(int i=; i<n; i++)
         if(no[i].id==s-'A'+)
         {
             no[i].fre=frecount;
             flag=;
             break;
         }
     if(flag==)
     {
         sort(no,no+n);
         no[].id=s-'A'+;
         no[].fre=frecount;
     }
 }

 char s[maxn];

 int main()
 {
 //    freopen("in.txt","r",stdin);
     int ca=;
     while(scanf("%d",&n)&&n)
     {
         printf("Simulation %d\n",ca++);
         frecount=;
         for(int i=; i<n; i++)
         {
             no[i].id=-;
             no[i].fre=-;
         }
         scanf("%s",s);
         int l=strlen(s);
         for(int i=; i<l; i++)
         {
             if(s[i]=='!')
                 shuchu();
             else add(s[i]);
         }
     }
     return ;
 }

G：Jugglefest

代码：

 #include<cstdio>
 #include<cstring>
 using namespace std;
 int p[];
 char s[];
 int main()
 {
 //    freopen("in.txt","r",stdin);
     int n;
     while(scanf("%d",&n)&&n)
     {
         bool flag=;
         memset(p,,sizeof p);
         memset(s,,sizeof s);
         for(int i=; i<n; i++)
         {
             scanf("%d",&p[i]);
         }
         int cnt=,num=;
         for(int i=; i<; i++)
         {
             if(s[i]==)s[i]='A'+cnt++;
             if(s[i+p[num%n]]!=&&(i+p[num%n]<))flag=;
             else s[i+p[num%n]]=s[i];
             num++;
         }
         if(flag)
         {
             for(int i=;i<;i++)
                 putchar(s[i]);
             puts("");
         }
         else puts("CRASH");
     }
     return ;
 }