Cod sursa(job #617449)
| Utilizator | Data | 14 octombrie 2011 20:53:54 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd (int a, int b)
{
if (!b) return a;
return gcd (b, a % b);
}
int main ()
{
int m,p;
int n;
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;
}
finput.close ();
foutput.close ();
return 0;
}