Cod sursa(job #277919)
Utilizator | Data | 11 martie 2009 23:08:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream.h>
using namespace std;
int n,a,b,i;
int gcd (int a, int b)
{ if (!b) return a;
return gcd (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<<gcd(a,b)<<"\n";}
return 0;
}