链接:http://codeforces.com/problemset/problem/87/A
模拟下就知道了。。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
ll a,b,c,n,m;
scanf("%lld%lld",&a,&b);
c=gcd(a,b);
ll res=a*b/c;
res--;
n=res/a;
m=res/b;
if(n>m)m++;
else if(n<m)n++;
else
{
printf("Equal\n");
return 0;
}
if(n>m)puts("Dasha");
else if(n==m)printf("Equal\n");
else printf("Masha\n");
return 0;
}