Cod sursa(job #457948)
Utilizator | Data | 22 mai 2010 13:13:44 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
int a,b,n,i;
int cmmdc(int a, int b)
{
if(!b)
return a;
return cmmdc(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
}
return 0;
}