Cod sursa(job #2640277)
Utilizator | Data | 5 august 2020 20:32:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int x;
fin >> x;
for(int i=1; i<=x; i++)
{
int n, m;
fin >> n >> m;
while(n!=m)
{
if(n>m)
n-=m;
else
m-=n;
}
fout << m << endl;
}
return 0;
}