Cod sursa(job #2477156)
| Utilizator | Data | 19 octombrie 2019 18:38:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long cmmdc(long long a , long long b){
long long temp;
while( b != 0 ){
temp = a % b;
a = b;
b = temp;}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int numarperechi;
f>>numarperechi;
while(numarperechi!=0){
long long a,b;
f>>a>>b;
g<<cmmdc(a,b)<<endl;
numarperechi--;
}
return 0;
}
