Cod sursa(job #1105651)
| Utilizator | Data | 11 februarie 2014 22:43:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
long n,i,a,b;
long cmmdc (long a,long b)
{ int d=a,i=b,r=d%i;
while (r)
{ d=i;
i=r;
r=d%i;
}
return i;
}
int main()
{ f>>n;
for (i=1;i<=n;i++)
{f>>a>>b;g<<cmmdc(a,b)<<'\n';}
return 0;
}
