Cod sursa(job #1652320)
| Utilizator | Data | 14 martie 2016 21:11:47 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
unsigned int div(unsigned int a,unsigned int b)
{
while (a!=b)
{
if (a>b)
{
if (a%b) a%=b;
else a=b;
}
else
{
if (b%a) b%=a;
else b=a;
}
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
unsigned int T,i,a,b;
f>>T;
for (i=1;i<=T;i++)
{
f>>a>>b;
g<<div(a,b)<<'\n';
}
f.close();
g.close();
return 0;
}
