Cod sursa(job #2488824)
Utilizator | Data | 7 noiembrie 2019 17:44:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstring>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long i, m, n, cmmdc, ok, T, k, j;
int main()
{
fin>>T;
for(i=1;i<=T;i++)
{
cmmdc=0;
fin>>m>>n;
while(n!=m)
{
while(n>m)n-=m;
while(m>n)m-=n;
}
cmmdc=n;
fout<<cmmdc<<endl;
}
return 0;
}