问题1:Diagonal Cut
题意:
一个大巧克力蛋糕,有m*n块矩形小块
切一刀,从左上角到右下角。
输出有多少块矩形小块恰好被分成一半
解析:无
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
ll GCD(ll m,ll n)
{
while(n)
{
ll r=m%n;
m=n;
n=r;
}
return m;
}
int main()
{
ll n,m;
scanf("%lld %lld",&n,&m);
ll s=GCD(n,m);
ll a=n/s;
ll b=m/s;
if(a%2==0||b%2==0)
printf("0\n");
else
printf("%lld\n",s);
return 0;
}