Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream.h>
- int v[20],u[20],n,p;
- int cont(int k){
- for(int i=1;i<k;i++)
- if(v[i]==v[k])
- return 0;
- return 1;
- }
- int sol(int k){
- return k==p;
- }
- int afisare(int k){
- for(int i=1;i<=k;i++)
- cout<<v[i]<<" ";
- cout<<endl;
- }
- int back(int k){
- for(int i=1;i<=n;i++){
- v[k]=u[i];
- if(cont(k))
- if(sol(k))
- afisare(k);
- else
- back(k+1);
- }
- }
- int main (){
- cin>>n>>p;
- for(int i=1;i<=n;i++)
- cin>>u[i];
- back(1);
- }
Add Comment
Please, Sign In to add comment