Cod sursa(job #741989)
Utilizator | Data | 27 aprilie 2012 20:23:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream out("euclid2.out");
int dive(int a,int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main ()
{
int n,i;
long a,b;
f>>n;
for(i=1;i<=n;i++)
{ f>>a>>b;
out<<dive(a,b)<<'\n';
}
}