Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n;
- int hanyadik=0;
- void crash(int db1, int db0, int count, int pm[]){
- if((db1>n && db0>n) || count<0)return;
- else {
- if(db1<n) {pm[db1+db0]=1;db1++;count++;crash(db1, db0, count, pm);}
- if(db0<n) {pm[db1+db0]=-1;db0++;count--;crash(db1, db0, count, pm);}
- }
- if(( (db1+db0)==(2*n) && count==0) ){
- cout<<++hanyadik<<". ";
- for(int i=0;i<2*n;++i){
- cout<<pm[i]<<", ";
- }
- cout<<endl;
- }
- }
- int main(){
- int db1=0, db0=0, count=0;
- cout<<"Adjon meg egy pozitiv egesz szamot: ";cin>>n;
- int pm[n*2];
- crash(db1, db0, count, pm);
- }
Advertisement
Add Comment
Please, Sign In to add comment