2019牛客国庆集训派对day4 J Similar Subsequence （斐蜀定理+思维）

题目链接：https://ac.nowcoder.com/acm/contest/1109/I
占坑，之后有空了写详解

代码

#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define maxm 1006
#define ll long long int
#define INF 0x3f3f3f3f
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
#define mem(a) memset(a,0,sizeof(a))
#define sqr(x) (x*x)
#define inf (ll)2e18+1
#define PI acos(-1)
#define mod 10007
#define auto(i,x) for(int i=head[x];i;i=ed[i].nxt)
ll read(){
    ll x=0,f=1ll;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
     while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
     return f*x;
}
ll n,m;
ll gcd(ll x,ll y){return x==0?y:gcd(y%x,x); }
int main()
{
    while(~scanf("%lld%lld",&n,&m)){
        ll xx=gcd(n,m);
        ll p=1ll*n*m/xx;
        ll q=p*2ll;
        printf("1/%lld\n",q);
    }
    return 0;
}