Cod sursa(job #2217963)
Utilizator | Data | 2 iulie 2018 19:13:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | 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 i,n,a,b;
int euclid(int a,int b){
while(a!=b){
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++){
fin>>a>>b;
fout<<euclid(a,b)<<endl;
}
return 0;
}