makequeen.cpp

来自「一个通过皇后算法构造稀疏矩阵的c++代码 矩阵以数组形式存储」· C++ 代码 · 共 72 行

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#include "Random.h"
#include "queen.h"


void usage(void);

int main(int argc, char* argv[])
{
	int *QueenArray;
	int i,n;
	char junk;
	char *file;
	FILE *f;

	/* Look at initial arguments. */

    if (!(file = argv[1])
     || !argv[2] || sscanf(argv[2],"%d%c",&n,&junk)!=1 || n<=0 || n%24)
	{ usage();
	}
    
    /* Make the queenarray. */

	n=n/24;  

    QueenArray = new int[n];
	
	Queen(n,QueenArray);

    /* test */    
/*
	for(i=0;i<n;i++)
	{
		printf("%d\t",QueenArray[i]);
	}

	printf("\n");
*/

	/* Write out the queenarray. */

	f = fopen(file,"wb");

	if (f==NULL) 
	{
		fprintf(stderr,"Can't create parity check file: %s\n",file);
		exit(1);
	}

	for(i=0;i<n;i++)
	{
		fprintf(f,"%d ",QueenArray[i]);
	}
	
	delete []QueenArray;

	
	
	return 0;
}

void usage(void)
{ 
	fprintf(stderr,"Usage:  make-queen queen-file n-bits\n");
    exit(1);
}