Cod sursa(job #1916205)
Utilizator | Data | 9 martie 2017 08:34:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc (int a, int b)
{
if(b==0)return a;
else return cmmdc(b,a%b);
}
int n,a,b,i;
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in>>n;
for(i=1;i<=n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<"\n";
}
return 0;
}