Cod sursa(job #617396)
Utilizator | Data | 14 octombrie 2011 19:33:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,m,p;
int gcd (int a, int b)
{
int p;
while (b != 0)
{
p = a % b;
a = b;
b = p;
}
return 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);
}
return 0;
}