Cod sursa(job #3188365)
Utilizator | Daiana Florea daiana999 | Data | 2 ianuarie 2024 18:57:01 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.in");
/*int euclid(int a, int b){
while (b!=0) {
int nr=b;
b=a%b;
a=nr;}
if(a==1) return 0;
return a;
}*/
int main() {
int n;
fin>>n;
int a[99999],b[99999],i;
for(i=1; i<n; i++)
fin>>a[i]>>b[i];
for(i=1; i<n; i++){
while (b[i]!=0) {
int nr=b[i];
b[i]=a[i]%b[i];
a[i]=nr;}
if(a[i]==1) fout<<"0"<<endl;
else fout<<a[i]<<endl;}
return 0;
}