Cod sursa(job #885653)
Utilizator | Mihai Ion linerunner | Data | 22 februarie 2013 11:24:03 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
using namespace std;
long long dc,a,b,n,i;
int cmmdc(long long a,long long b)
{ while(a!=b)
{ if (a>=b) a-=b;
else b-=a;}
return a;
}
int main()
{ ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n; i=0;
while(i!=n)
{ f>>a>>b;
dc=cmmdc(a,b);
g<<dc<<'\n';
i=i+1;
}
f.close();
g.close();
return 0;
}