Easy Game
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
using namespace std;
int main()
{
int n,cas=0;
cin>>n;
string s;
while(n--)
{
cas++;
cin>>s;
if(s.length()%2==0)
{
printf("Case %d: Even\n",cas);
}
else
{
printf("Case %d: Odd\n",cas);
}
}
return 0;
}
OOXX Game
#include <iostream>
#include <cstdio>
using namespace std;
char _map[1000][1000];
int main()
{
int n;
cin>>n;
int cas=0;
while(n--)
{
cas++;
int c,r;
scanf("%d%d",&c,&r);
int temp=0;
char s[1000];
getchar();
for(int i=0;i<c;i++)
{
scanf("%s",s);
for(int j=0;j<r;j++)
{
if(s[j]=='O')
{
temp++;
}
}
}
if(temp%2!=0)
{
printf("Case %d: Maze\n",cas);
}
else
{
printf("Case %d: Fat brother\n",cas);
}
}
return 0;
}
A-B Game
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int t,cas=1;
cin>>t;
while(t--)
{
long long a,b;
cin>>a>>b;
int num=0;
while(a>b)
{
a=a-(a-1)/2;
num++;
}
printf("Case %d: %d\n",cas++,num);
}
return 0;
}
Moon Game
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
struct point
{
double x,y;
};
point p[1000];
double mianji(double x1,double y1,double x2,double y2)
{
return fabs(x1*y2-x2*y1)/2;
}
int judge(int a,int b,int c,int d)
{
double s1,s2,s3,s4;
s1=mianji(p[a].x-p[b].x,p[a].y-p[b].y,p[a].x-p[c].x,p[a].y-p[c].y);
s2=mianji(p[a].x-p[b].x,p[a].y-p[b].y,p[a].x-p[d].x,p[a].y-p[d].y);
s3=mianji(p[a].x-p[d].x,p[a].y-p[d].y,p[a].x-p[c].x,p[a].y-p[c].y);
s4=mianji(p[d].x-p[b].x,p[d].y-p[b].y,p[d].x-p[c].x,p[d].y-p[c].y);
if(fabs(s1-s2-s3-s4)<1e-6)
{
return 0;
}
else if(fabs(s2-s1-s3-s4)<1e-6)
{
return 0;
}
else if(fabs(s3-s2-s1-s4)<1e-6)
{
return 0;
}
else if(fabs(s4-s2-s3-s1)<1e-6)
{
return 0;
}
return 1;
}
long jiecheng(int n)
{
long sum=1,i=1;
while(i<=n)
{
sum*=i;
i++;
}
return sum;
}
int main()
{
int t,cas=1;
cin>>t;
while(t--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lf%lf",&p[i].x,&p[i].y);
}
int i,j,k,l,sum=0;;
for(i=1;i<=n-3;i++)
{
for(j=i+1;j<=n-2;j++)
{
if(i!=j)
{
for(k=j+1;k<=n-1;k++)
{
if(k!=j)
{
for(l=k+1;l<=n;l++)
{
if(judge(i,j,k,l))
{
sum++;
}
}
}
}
}
}
}
printf("Case %d: %d\n",cas++,sum);
}
return 0;
}