Cod sursa(job #1987264)
Utilizator | Data | 30 mai 2017 07:26:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
int n,a,b;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>a>>b;
fout<<gcd(a,b)<<"\n";
}
return 0;
}