Cod sursa(job #627825)
| Utilizator |  Lazar Catalin-Alexandru lazarik1992 |
Data | 30 octombrie 2011 18:57:04 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
int cmmdc(int a, int b)
{
while(a!=b)
{
if(a>b)a=a-b;
else b=b-a;
}
return a;
}
void main()
{
fstream f("euclid2.in",ios::in);
fstream g("euclid2.out",ios::out);
int n,v[20],i,a,b;
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
v[i]=cmmdc(a,b);
}
for(i=1;i<=n;i++)g<<v[i]<<endl;
f.close();
g.close();
}