tile

通分
求最小公倍数

#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<cmath>#include<queue>#include<vector>#include<climits>#include<string>#include<cstdlib>#include<ctime>#define LL long long#define MOD 1000000007#define pi 3.141592653589using namespace std;int t,i,a,b,c,d,p,pika,chu,aa,cc,p1,p2;int gcd(int x,int y){    int tmp;    if(x<y) swap(x,y);    while(y)    {        tmp=x;        x=y;        y=tmp%y;    }    return x;}int main(){    freopen("tile.in","r",stdin);    freopen("tile.out","w",stdout);     scanf("%d",&t);    for(i=1;i<=t;i++)    {        scanf("%d%d%d%d",&a,&b,&c,&d);        p=gcd(b,d);        p=(b*d)/p;        p1=p/b;        p2=p/d;        aa=a*p1;        cc=c*p2;        pika=gcd(aa,cc);        pika=(aa*cc)/pika;        chu=gcd(pika,p);        pika/=chu;        p/=chu;             if(p==1)        {            printf("%d\n",pika);            continue;        }        if(pika==p)        {            printf("1\n");            continue;                   }        printf("%d/%d\n",pika,p);    }       return 0;}