Cod sursa(job #2482463)
Utilizator | Data | 28 octombrie 2019 12:26:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int GCD( int a,int b)
{
if(b)
return a;
return(b, a&b);
}
int main()
{
int x;
int nr1, nr2, rest;
fin >>x;
for(int i = 1; i<= x; i++)
{
fin >> nr1 >> nr2;
fout <<GCD(nr1,nr2) << " \n";
}
return 0;
}