Cod sursa(job #1394607)
Utilizator | Data | 20 martie 2015 14:44:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
long euclid (long a,long b)
{
if (a%b==0)
return b;
long r;
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int i,n;
long a,b;
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
fin>>a>>b;
fout<<euclid(a,b)<<endl;
}
return 0;
}