Cod sursa(job #526154)
Utilizator | Data | 27 ianuarie 2011 16:02:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc (int a,int b)
{
while (a!=b) if (a>b) a=a-b;
else b=b-a;
return a;
}
int main (void)
{
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
int T,a,b,i;
f>>T;
for (i=1;i<=T;i++)
{f>>a>>b;
g<<cmmdc(a,b)<<"\n";}
g.close();
return 0;
}