Advertisement
Guest User

Untitled

a guest
Dec 15th, 2018
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.94 KB | None | 0 0
  1. #include <fstream>
  2.  
  3. using namespace std;
  4. ifstream fin("permutari.in");
  5. ofstream gout("permutari.out");
  6. int st[100],n,k;
  7.  
  8. void init()
  9. {
  10. st[k]=0;
  11. }
  12. int succesor()
  13. {
  14. if (st[k]<n)
  15. {
  16. st[k]++;
  17. return 1;
  18. }
  19. return 0;
  20. }
  21.  
  22. int valid ()
  23. {
  24. int i;
  25. for(i=1; i<k; i++)
  26. if(st[i]==st[k])
  27. return 0;
  28. return 1;
  29. }
  30. int solutie()
  31. {
  32. return k==n;
  33. }
  34. void tipar()
  35. {
  36. int i;
  37. for (i=1; i<=n; i++)
  38. gout<<st[i]<<" ";
  39. gout<<endl;
  40. }
  41.  
  42. void bkt()
  43. {
  44. int as;
  45. k=1;
  46. init();
  47. while(k>0)
  48. {
  49. do { } while ((as=succesor())&&!valid() );
  50. if (as)
  51. if(solutie()) tipar();
  52. else
  53. {
  54. k++;
  55. init ();
  56. }
  57. else k--;
  58. }
  59.  
  60. }
  61.  
  62. int main()
  63. { fin>>n;
  64. bkt();
  65. return 0;
  66. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement