Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <cmath>
- #include <algorithm>
- using namespace std;
- void back(int);
- void afisare(int);
- int solutie(int);
- int valid(int);
- int n, st[100];
- ifstream fin("yolo.in");
- ofstream fout("yolo.out");
- void back(int k)
- {
- for(int i = 1; i <= n; i++)
- {
- st[k] = i;
- if(valid(k))
- {
- if(solutie(k))
- afisare(k);
- else back(k + 1);
- }
- }
- }
- void afisare(int k)
- {
- for(int i = 1; i <= n; i++)
- {
- for(int j = 1; j <= n; j++)
- if(st[i] == j)
- fout << 'd' << ' ';
- else fout << '*' << ' ';
- fout << endl;
- }
- fout << endl;
- }
- int valid(int k)
- {
- for(int i = 1; i < k; i++)
- if(st[k] == st[i] || abs(st[k] - st[i]) == k - i)
- return 0;
- return 1;
- }
- int solutie(int k)
- {
- return n == k;
- }
- int main(void)
- {
- fin >> n;
- back(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement