#include #include #include using namespace std; class P { public: int number; vector multiplies; int n_P; int length; P(int n) { number=n; n_P=0; length=0; } P(){ n_P=0;length=0;} bool ismultiple(P* n) { return n->number%number==0; } void addmultiple(P* other) { if (this!=other) { //cout<<(number)<ismultiple(other)) { multiplies[i]->addmultiple(other); length=max(length,multiplies[i]->length+1); t=true; } } if(!t) { multiplies.insert(multiplies.end(),other); n_P++; length=max(length,1); } } } vector printmaxlength() { vector res={}; if(number!=0) res={number}; for(int i=0;ilength+1==length) { vector other=multiplies[i]->printmaxlength(); res.insert(res.end(),other.begin(),other.end()); i=n_P; } } return res; } void printall() { if(number!=0) { cout << number; bool t=false; for(int i=0;iprintall(); } if(t) cout<<"}"; }else { for(int i=0;iprintall(); } } } vector getall() { vector res={this}; for(int i=0;i other=multiplies[i]->getall(); res.insert(res.end(),other.begin(),other.end()); } return res; } }; int main() { int n; vector numbers={1,2,3,5,6,18,36,9};//They now can be unsorted😉 n=numbers.size(); sort(numbers.begin(),numbers.end()); P start=P(0); P* k=new P[n]; for(int i=0;i res=start.printmaxlength(); for(long unsigned int i=0;i all=start.getall(); for(long unsigned int i=0;inumber<

My code 2020/06/14 14:34