Cod sursa(job #3366617)
| Utilizator | Data | 2 octombrie 2026 20:32:18 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
int n, t1, t2, pr;
int main(){
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(int i=0; i<3; i++){
fin>>t1>>t2;
while(t1!=0 || t2!=0){
if(t1>t2){
pr=t1;
t1=t1%t1;
}else{
pr=t2;
t2=t2%t1;
}
if(t1==0 || t2==0){
cout<<pr<<endl;
pr=0;
}
}
}
}
