Cod sursa(job #1010835)
Utilizator | Data | 15 octombrie 2013 19:40:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
int cmmdc(int a, int b)
{
if(!b)
return a;
else
return cmmdc(b,a%b);
}
int main()
{
f>>n;
int x,y;
for(int i=1; i<=n; i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
f.close();g.close();
return 0;
}