nelithien

Untitled

May 20th, 2013
48
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.69 KB | None | 0 0
  1. #include <iostream>
  2.  
  3.  
  4. using namespace std;
  5.  
  6. int n;
  7. int hanyadik=0;
  8.  
  9. void crash(int db1, int db0, int count, int pm[]){
  10.     if((db1>n && db0>n) || count<0)return;
  11.     else {
  12.         if(db1<n) {pm[db1+db0]=1;db1++;count++;crash(db1, db0, count, pm);}
  13.         if(db0<n) {pm[db1+db0]=-1;db0++;count--;crash(db1, db0, count, pm);}
  14.  
  15.  
  16.  
  17.     }
  18.     if(( (db1+db0)==(2*n) && count==0)  ){
  19.  
  20.         cout<<++hanyadik<<". ";
  21.         for(int i=0;i<2*n;++i){
  22.             cout<<pm[i]<<", ";
  23.         }
  24.         cout<<endl;
  25.     }
  26. }
  27.  
  28. int main(){
  29.     int db1=0, db0=0, count=0;
  30.     cout<<"Adjon meg egy pozitiv egesz szamot: ";cin>>n;
  31.     int pm[n*2];
  32.     crash(db1, db0, count, pm);
  33.  
  34.  
  35.  
  36.  
  37.  
  38.  
  39. }
Advertisement
Add Comment
Please, Sign In to add comment