Cod sursa(job #2180588)
Utilizator | Data | 20 martie 2018 23:07:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a,int b){
if(b)
return a;
return(b, a%b);
}
int main()
{
int i,n,a,b;
fin>>n;
for(i=0;i<n;i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<endl;
}
return 0;
}