-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathqueen.c
42 lines (42 loc) · 811 Bytes
/
queen.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n;
scanf("%d",&n);
int **a=(int **)malloc(sizeof(int *)*n);
for(int i=0;i<n;i++)
a[i]=(int *)malloc(sizeof(int *)*n);
int mid;
if(n%2==0)
mid=n/2-1;
else
mid=n/2;
int n1=n;
int pos;
int c=0;
for(int i=0;i<n;i++)
{
if(i%2!=0)
{
c++;
if(i+c==n/2+1)
{
pos=n1;
n1--;
}
a[i][n1-1]=1;
n1--;
}
else
{
a[i][mid]=1;
mid--;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
printf("%d",a[i][j]);
printf("\n");
}
}