Cod sursa(job #1983447)
Utilizator | Data | 22 mai 2017 08:26:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int i,n,a,b,c;
int cmmd(int a, int b)
{
while (a!=b)
{
if (a>b) a=a-b;
else if(a<b) b=b-a;
}
return a;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
fin>>b;
fout<<cmmd(a,b)<<endl;
}
return 0;
}