Cod sursa(job #627653)
| Utilizator | Data | 30 octombrie 2011 12:18:14 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a,b,n,i;
void afisare()
{
g<<a<<endl;
}
void citire()
{
f>>a;
f>>b;
}
int cmmdc(int x,int y)
{
while(x!=y)
{
if(x>y) x=x-y;
else y=y-x;
}
return x;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
citire();
a=cmmdc(a,b);
afisare();
}
f.close();
g.close();
return 0;
}
