Cod sursa(job #3204554)
Utilizator | Data | 17 februarie 2024 04:25:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int n,a[50],b[50];
int main(){
ifstream fin("euclid2.in");
ofstream fout ("euclid2.out");
fin>>n;
for(int i=0; i<n; i++){
fin>>a[i]>>b[i];
}
for(int i=0; i<n; i++){
while(a[i]!=b[i]){
if(a[i]>b[i]) a[i]-=b[i];
else b[i]-=a[i];
}
fout<<a[i]<<endl;
}
return 0;
}