Cod sursa(job #1980898)
| Utilizator | Data | 14 mai 2017 12:49:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<stdio.h>
#include<stdlib.h>
#include<fstream>
#include<iostream>
using namespace std;
int cmmdc(int a, int b){
int r;
for(;;){
r=a%b;
//if(r==0 && b==1) return 0;
if(r==0) return b;
a=b;
b=r;
}
return 0;
}
int main(){
ifstream in; ofstream out;
in.open("euclid2.in"); out.open("euclid2.out");
out.clear();
int t;
long long a, b, c;
in>>t;
for(int i=1;i<=t;i++){
in>>a>>b;
/*while((c=a%b)!=0){
a=b; b=c;
} */
out<<cmmdc(a,b)<<endl;
}
in.close(); out.close();
}
