View Code of Problem 66

#include <iostream>
#include <sstream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
#include <stack>
#include <map>
#include <set>
#include <queue>
using namespace std;

long long gcb(long long a,long long b)
{
    return b==0?a:gcb(b,a%b);
}

int main()
{
    long long n,m;
    while(cin>>n>>m)
    {
        int p=gcb(m,n);
        if(n==m) {cout<<1<<endl;continue;}
         cout<<n/p<<"/"<<m/p<<endl;
    }



    return 0;
}

Double click to view unformatted code.


Back to problem 66