Cod sursa(job #779313)
Utilizator | Data | 17 august 2012 14:37:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
unsigned long int a, b, n;
int EU(int a, int b)
{
if(!b) return a;
else return (b, b%a);
}
int main(void)
{
fin>>n;
for(; n; n--)
{
fin>>a>>b;
fout<<EU(a,b)<<"\n";
}
fin.close();
fout.close();
return 0;
}