Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int s[100],n;
- int valid (int k);
- void afisare ();
- void backt (int k)
- {
- int val;
- for (val=1;val<=n;val=val+2)
- {
- s[k]=val;
- if (valid (k))
- if (k>=n-1) afisare ();
- else backt (k+2);
- }
- }
- int valid (int k)
- {
- int i;
- for (i=1;i<k;i++)
- if (s[i]==s[k]) return 0;
- return 1;
- }
- void afisare ()
- {
- for (int i=1; i<=n;i++)
- cout << s[i] << " ";
- cout << endl;
- }
- int main ()
- {
- cin >> n;
- for (int i=1; i<=n;i++)
- s[i]=i;
- backt (1);
- }
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("anagrame1.in");
- ofstream fout("anagrame1.out");
- char a[10];
- char b[10];
- bool caract[10];
- void bkt(int k)
- {
- if(k == strlen(a))
- {
- fout << b << '\n';
- return;
- }
- for(int i = 0; i < strlen(a); i++)
- {
- if(!caract[i])
- {
- caract[i] = 1;
- b[k] = a[i];
- bkt(k + 1);
- caract[i] = 0;
- }
- }
- }
- int main()
- {
- fin>>a;
- sort(a,a+strlen(a));
- strcpy(b,a);
- bkt(0);
- }
- #include <bits/stdc++.h>
- using namespace std;
- int s[100],n;
- char cuv[100];
- int valid (int k);
- void afisare ();
- void backt (int k)
- {
- int val;
- for (val=1;val<=n;val++)
- {
- s[k]=val;
- if (valid (k))
- if (k==n) afisare ();
- else backt (k+1);
- }
- }
- int valid (int k)
- {
- int i;
- if (k==1)
- if (strchr("aeiou", cuv[s[1]-1])==0) return 0;
- if (k==n)
- if (strchr("aeiou", cuv[s[n]-1])==0) return 0;
- for (i=1;i<k;i++)
- if (s[i]==s[k])
- return 0;
- return 1;
- }
- void afisare ()
- {
- for (int i=1; i<=n;i++)
- cout << cuv[s[i]-1];
- cout << endl;
- }
- int main ()
- {
- cin >> cuv;
- n=strlen(cuv);
- sort (cuv ,cuv+n);
- for (int i=1; i<=n;i++)
- s[i]=i;
- backt (1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement