Cod sursa(job #2639315)
| Utilizator | Data | 1 august 2020 13:46:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(long int a,long int b)
{
long int r=0;
while (b!=0)
{
r = a % b;
a=b;
b=r;
}
return a;
}
int main()
{
int nr;
f>>nr;
long int x,y;
for(int i=0;i<nr;i++)
{
f>>x,f>>y;
g<<cmmdc(x,y)<<endl;
}
return 0;
}
