Cod sursa(job #2866250)
| Utilizator | Data | 9 martie 2022 15:20:50 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
std :: ifstream fin("euclid2.in");
std :: ofstream fout("euclid2.out");
int cmmdc(int x, int y);
int main (){
int n, v[200000];
fin>>n;
for(int i=0; i<n*2; i++){
fin>>v[i];
}
for(int i=0; i<n*2; i+=2){
fout<<cmmdc(v[i], v[i+1])<<'\n';
}
return 0;
}
int cmmdc(int x, int y){
while(y!=0){
int r=x%y;
x=y;
y=r;
}
return x;
}