Cod sursa(job #708065)
Utilizator | Data | 6 martie 2012 13:05:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream g("euclid2.in");
ofstream f("euclid2.out");
int n , a ,b;
int cmmdc(int a , int b)
{
while(a!=b)
{
if(a>b) a-=b;
else b-=a;
}
return a;
}
int main ()
{
g>>n;
while(n)
{
g>>a;
g>>b;
f<<cmmdc(a,b)<<'\n';
n--;
}
f.close();
g.close();
return 0;
}