Cod sursa(job #2321760)
Utilizator | Data | 16 ianuarie 2019 16:42:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(int n, int m)
{
while(n!=m)
{
if(n>m)
n-=m;
else
m-=n;
}
return n;
}
int n,a,b,i;
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>a>>b;
out<<euclid(a,b)<<endl;
}
return 0;
}