Cod sursa(job #230006)
Utilizator | Data | 12 decembrie 2008 16:34:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int n,i,a,b;
int cmmdc(int m, int n)
{
if(!n) return m;
return cmmdc(n,m%n);
}
int main()
{
f>>n;
for(i=0;i<n;i++) f>>a>>b,g<<cmmdc(a,b)<<"\n";
f.close();
g.close();
return 0;
}