Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <string.h>
- using namespace std;
- int St[20];//a nevek sorszama
- int N;// a nevek szama;
- int Szam;//megoldasok sorszama
- char Nev[20][15];
- int l;//lanyokszama
- void Kiir()
- {
- Szam++;
- cout<<Szam<<": ";
- for(int i=1;i<=N;i++)
- {
- cout<< Nev[St[i]] << " ";
- }
- cout<<endl;
- }
- void Mutat()
- {
- for(int i=1;i<=N;i++)
- {
- cout<< Nev[i] << " ";
- }
- cout<<endl;
- }
- int Lany(char S[])
- {
- int u=strlen(S)-1;
- if(S[u]=='a')
- return 1;
- else
- return 0;
- }
- void Olvas()
- {
- ifstream g("nevek.txt");
- N=1;
- while (g>>Nev[N])
- {
- if(Lany(Nev[N]))
- l++;
- N++;
- }
- g.close();
- N--;
- }
- int Jo(int k)
- {
- if(k<=l && !Lany(Nev[St[k]]))
- return 0;
- for(int i=1;i<k;i++)
- if(St[i]==St[k])
- return 0;
- return 1;
- }
- int Back(int k)
- {
- if(k==N+1)
- Kiir();
- else
- for(int i=1;i<=N;i++)
- {
- St[k]=i;
- if(Jo(k))
- Back(k+1);
- }
- }
- int main()
- {
- Olvas();
- Mutat();
- Back(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement