Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream fin("combinari.in");
- ofstream fout("combinari.out");
- int n,p, x[11];
- void back(int k);
- int valid(int k);
- void Afis(int k);
- int main()
- {
- fin>>n>>p;
- back(1);
- return 0;
- }
- void back(int k)
- {
- for(int i=x[k-1]+1;i<=n;i++)
- {
- x[k]=i;
- if(valid[k])
- {
- if(k == p)
- Afis(k);
- else
- back(k+1);
- }
- }
- }
- int valid(int k)
- {
- if(k>1&&x[k]<=x[k+1])
- return 0;
- return 1;
- }
- void Afis(int k)
- {
- for(int i = 1; i <= k; i++)
- fout << x[i] <<" ";
- fout << '\n';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement