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