Cod sursa(job #617404)
| Utilizator | Data | 14 octombrie 2011 19:47:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long int n,m,p;
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)<<'/n';
}
return 0;
}
