Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <cstring>
- using namespace std;
- ifstream f("aranjamente.in");
- ofstream g("aranjamente.out");
- int v[10],st[10];
- int n,p;
- void afis()
- {
- for(int i=1;i<=p;i++)
- g<<st[i]<<" ";
- g<<'\n';
- }
- bool valid(int k)
- {
- for(int i=1;i<=k-1;i++)
- if(st[i]==st[k])
- return false;
- return true;
- }
- void backtraking(int k,int p)
- {
- for(int i=1;i<=n;i++)
- {
- st[k]=i;
- if(valid(k))
- {
- if(k==p)
- afis();
- else
- backtraking(k+1,p);
- }
- }
- }
- int main()
- {
- f>>n>>p;
- backtraking(1,p);
- return 0;
- }
- combinari
- #include <iostream>
- #include <fstream>
- #include <cstring>
- using namespace std;
- ifstream f("combinari.in");
- ofstream g("combinari.out");
- int v[10],st[10];
- int n,p;
- void afis()
- {
- for(int i=1;i<=p;i++)
- g<<st[i]<<" ";
- g<<'\n';
- }
- bool valid(int k)
- {
- for(int i=1;i<=k-1;i++)
- if(st[i]==st[k] || st[i]>st[k])
- return false;
- return true;
- }
- void backtraking(int k,int p)
- {
- for(int i=1;i<=n;i++)
- {
- st[k]=i;
- if(valid(k))
- {
- if(k==p)
- afis();
- else
- backtraking(k+1,p);
- }
- }
- }
- int main()
- {
- f>>n>>p;
- backtraking(1,p);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement