Advertisement
Guest User

Untitled

a guest
Nov 20th, 2019
105
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.22 KB | None | 0 0
  1. ////1
  2. #include <fstream>
  3. using namespace std;
  4. ifstream f("date.in");
  5. ofstream g("date.out");
  6. int s[100],i,n,m;
  7. void tipar(int k)
  8. {
  9. int i;
  10. for(i=1; i<=k; i++)
  11. g<<s[i]<<" ";
  12. g<<endl;
  13. }
  14. int valid(int k)
  15. {
  16. int i;
  17.  
  18. if(k>1 && s[k]<=s[k-1])
  19. return 0;
  20. return 1;
  21. }
  22. void back(int k)
  23. {
  24. int i;
  25. for(i=1; i<=9; i++)
  26. {
  27. s[k]=i;
  28. if(valid(k))
  29. if(k==n)
  30. tipar(k);
  31. else back(k+1);
  32. }
  33. }
  34. int main()
  35. {
  36. f>>n;
  37. back(1);
  38. }
  39.  
  40.  
  41.  
  42. ////2
  43.  
  44. #include <fstream>
  45. #include<cmath>
  46. using namespace std;
  47. ifstream f("date.in");
  48. ofstream g("date.out");
  49. int s[100],i,n,m;
  50. void tipar(int k)
  51. {
  52. int i;
  53. for(i=1; i<=k; i++)
  54. g<<s[i]<<" ";
  55. g<<endl;
  56. }
  57. int valid(int k)
  58. {
  59. int i;
  60. for(i=1; i<k; i++)
  61.  
  62. if(s[i]==s[k])
  63. return 0;
  64. if(k>1 && abs(s[k]-s[k-1])<2)
  65. return 0;
  66. if(k==1 && s[k]==0) return 0;
  67.  
  68. return 1;
  69. }
  70. void back(int k)
  71. {
  72. int i;
  73. for(i=0; i<=9; i++)
  74. {
  75. s[k]=i;
  76. if(valid(k))
  77. if(k==n)
  78. tipar(k);
  79. else back(k+1);
  80. }
  81. }
  82. int main()
  83. {
  84. f>>n;
  85. back(1);
  86. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement