Cod sursa(job #1463282)
Utilizator | Data | 20 iulie 2015 17:39:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{
if(b==0) return a;
else return cmmdc(b,a%b);
}
int main()
{
int n;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(int i=1;i<=n;i++)
{
int x,y;
fin>>x>>y;
fout<<cmmdc(x,y)<<'\n';
}
fin.close();
fout.close();
}