Cod sursa(job #2371087)
Utilizator | Data | 6 martie 2019 15:36:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int main()
{
long long int n,j,c,a,b,cmmdc,i,f;
fin>>n;
for(j=1;j<=n;j++){
fin>>a>>b;
if(a>b) c=a;
else c=b;
for(i=1;i<=c;i++){
if(a%i==0 && b%i==0) f=i;
}
fout<<f<<endl;
}
fin.close();
fout.close();
return 0;
}