Cod sursa(job #617408)
Utilizator | Data | 14 octombrie 2011 19:52:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long int m,p;
int n;
long long int gcd (long long int a, long long int b)
{
if (!b) return a;
return gcd (b, a % b);
}
int main ()
{
ifstream finput ("euclid2.in");
finput>>n;
ofstream foutput ("euclid2.out");
for (int i = 1; i<=n; i++)
{
finput>>m>>p;
foutput<<gcd(m,p)<<endl;
}
return 0;
}