Cod sursa(job #2144908)
Utilizator | Data | 26 februarie 2018 23:38:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int a,b,c,t,d,n1,n2;
int cmmdc(int x,int y){
if(y==0){
n1=x;
n2=y;
return x;
}
return cmmdc(y,x&y);
}
int main(){
f>>t;
for(int i=1;i<=t;i++){
f>>a>>b>>c;
d=cmmdc(a,b);
if(c%d==0)g<<n1<<" "<<n2;
}
return 0;
}