Cod sursa(job #1470005)
Utilizator | Data | 10 august 2015 10:54:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int x, int y)
{
while((x!=0)&&(y!=0))
{
if(x>y) x%=y;
else y%=x;
}
return (x+y);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
f >> n;
for(int i=1; i<=n; i++)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
f.close();
g.close();
return 0;
}