Cod sursa(job #230003)
| Utilizator | Data | 12 decembrie 2008 16:25:04 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int n,i,a,b;
int cmmdc(int& m, int& n)
{
if(n>=m) m+=n,n=m-n,m=m-n;
int r=m%n;
while(r!=0)
{
m=n;
n=r;
r=m%n;
}
return n;
}
int main()
{
f>>n;
cout<<n<<endl;
for(i=0;i<n;i++) f>>a>>b,g<<cmmdc(a,b)<<endl;
f.close();
g.close();
return 0;
}
