Cod sursa(job #264200)
Utilizator | Data | 21 februarie 2009 18:30:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long i,n,a,b,r;
int cmmdc(int a, int b)
{
r=a%b;
while(r!=0){a=b;b=r;r=a%b;}
return b;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
}