Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <bits/stdc++.h>
- using namespace std;
- const int maxn=1e3;
- int n;
- int x[maxn];
- void backtracking(int k,int n)
- {
- for (int i=1;i<=n;i++){
- x[k]=i;
- n-=i;
- if (n==0){
- for (int j=1;j<=k;j++)
- cout<<x[j]<<' ';
- cout<<'\n';
- } else backtracking(k+1,n);
- n+=i;
- }
- }
- int main()
- {
- cin>>n;
- backtracking(1,n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement