Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <math.h>
- using namespace std;
- int n,k,st[20];int t=0;
- int main()
- {
- st[k]=0;
- }
- int succesor(int k)
- {
- if(st[k]<n)
- (st[k]++
- return 1;)
- else
- return 0;
- }
- int valid(int k)
- {
- int i;
- for(i=1;i<k;i++)
- {
- if(st[k]==st[i])return 0;
- if(fabs(k-i)==fabs(st[k]-st[i])) return 0;
- }
- return 1;
- }
- int solutie
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement