zoj模拟题二

zoj1052

#include<stdio.h>
#include<memory.h>
const int MAXN=51;

int main()
{
	int i,j;
	int mask[32];
	for(i=0;i<32;i++)
		mask[i]=1<<i;
	int iCase;
	scanf("%d",&iCase);
	int line=0;
	while(iCase--)
	{
		if(line)
			printf("\n");
		line=1;
		int output[MAXN];
		int dump[MAXN];
		int neutra[MAXN];
		char c;
		int n;
		scanf("%d\n",&n);
		for(i=1;i<=n;i++)
		{
			int temp=0;
			do{
				c=getc(stdin);
				if(c>='A')
					temp |=mask[c-'A'];
			}while(c!=' ');
			dump[i]=output[i]=temp;
			temp=0;
			while((c=getc(stdin))!='\n')
				if(c>='A')
					temp|=mask[c-'A'];
			neutra[i]=temp;
			dump[i]&=~temp;
			output[i]&=~temp;
		}
		bool graph[MAXN][MAXN];
		bool table[MAXN];
		memset(graph,0,sizeof(graph));
		for(i=1;i<=n;i++)
			table[i]=true;
		int a,b;
		while(scanf("%d %d",&a,&b)&&(a||b))
			graph[a][b]=true;
		bool flag;
		do{
			flag=false;
			for(i=1;i<=n;i++)
				if(table[i])
				{
					table[i]=false;
					int temp=output[i];
					for(j=1;j<=n;j++)
						if(graph[i][j])
						{
							int newOut=(output[j]|temp)&(~neutra[j]);
							if(output[j]!=newOut)
							{
								output[j]=newOut;
								table[j]=true;
							}
						}
					flag=true;
					break;
				}
		}while(flag);
		for(i=1;i<=n;i++)
		{
			printf(":");
			for(j=0;j<=25;j++)
				if((output[i]&mask[j])!=0)
					printf("%c",char(j+'A'));
			printf(":\n");
		}
	}
	return 0;
}

zoj1056

#include<stdio.h>
#include<memory.h>
#define MAXN 100
#define Row 51
#define Column 51
struct location
{
	int x,y;
}head,nail;
int step;

int moves(int n,char data[])
{
	bool board[Row][Column];
	memset(board,false,sizeof(board));
	int i;
	for(i=11;i<=30;i++)
		board[25][i]=true;
	head.x=25;
	head.y=30;
	nail.x=25;
	nail.y=11;
	for(step=0;step<n;step++)
	{
		switch(data[step])
		{
		case 'N':
			head.x--;break;
		case 'W':
			head.y--;break;
		case 'E':
			head.y++;break;
		case 'S':
			head.x++;break;
		}
		if(head.x>=Row || head.x<=0 || head.y>=Column || head.y<=0)
			return 2;
		board[nail.x][nail.y]=false;
		if(board[head.x][head.y])
			return 3;
		else
			board[head.x][head.y]=true;
		if(step<19)
			nail.y++;
		else
		{
			switch(data[step-19])
			{
			case 'N':
				nail.x--;break;
			case 'W':
				nail.y--;break;
			case 'E':
				nail.y++;break;
			case 'S':
				nail.x++;break;
			}
		}
	}
	return 1;
}

int main()
{
	char data[MAXN];
	int n;
	while(scanf("%d",&n)==1&&n>0)
	{
		scanf("%s",data);
		switch(moves(n,data))
		{
			case 1:
				printf("The worm successfully made all %d moves.\n",n);
				break;
			case 2:
				printf("The worm ran off the board on move %d.\n",step+1);
				break;
			case 3:
				printf("The worm ran into itself on move %d.\n",step+1);
				break;
		}
	}
	return 0;
}

zoj1063

#include<stdio.h>
#include<memory.h>
char grid[62][62][62];
int n,m,k;
void mark(int x,int y,int z);
void set(int x,int y,int z)
{
	grid[x][y][z]=2;
	mark(x,y,z);
}
void mark(int x,int y,int z)
{
	if(x>=0&&x<=n&&grid[x+1][y][z]==0) set(x+1,y,z);
	if(x>=1&&x<=n+1&&grid[x-1][y][z]==0) set(x-1,y,z);
	if(y>=0&&y<=k&&grid[x][y+1][z]==0) set(x,y+1,z);
	if(y>=1&&y<=k+1&&grid[x][y-1][z]==0) set(x,y-1,z);
	if(z>=0&&z<=m&&grid[x][y][z+1]==0) set(x,y,z+1);
	if(z>=1&&z<=m+1&&grid[x][y][z-1]==0) set(x,y,z-1);
}

int main()
{
	int l;
	while(scanf("%d%d%d%d",&n,&m,&k,&l)&&(n||m||k||l))
	{
		int i,j,p;
		int number;
		memset(grid,0,sizeof(grid));
		while(l--)
		{
			scanf("%d",&number);
			int x=number%n+1;
			int y=number/(m*n)+1;
			int z=(number-(y-1)*m*n)/n + 1;
			grid[x][y][z]=1;
		}
		grid[0][0][0]=2;
		mark(0,0,0);
		int total=0;
		for(i=1;i<=n;i++)
			for(j=1;j<=k;j++)
				for(p=1;p<=m;p++)
				{
					if(grid[i][j][p]==1)
					{
						if(grid[i+1][j][p]==2) total++;
						if(grid[i-1][j][p]==2) total++;
						if(grid[i][j+1][p]==2) total++;
						if(grid[i][j-1][p]==2) total++;
						if(grid[i][j][p+1]==2) total++;
						if(grid[i][j][p-1]==2) total++;
					}
				}
				printf("The number of faces needing shielding is %d.\n",total);
	}
	return 0;
}

zoj1066

#include <stdio.h>
#include <memory.h>

#define MaxN 12
int pattern[MaxN][MaxN];
int dashes[MaxN][MaxN];
int bars[MaxN][MaxN];

int main( )
{
	int cases = 1;
	int m;
	while(scanf("%d", &m) && m)
	{	
		memset(pattern, 0, sizeof(pattern));
		int i, j, k;
		for (i = 1; i <= m; i++)
			for (j = 1; j <= m; j++) 
				scanf("%d", &pattern[i][j]);
		memset(bars, 0, sizeof(bars));
		memset(dashes, 0, sizeof(dashes));
		for (i = 1; i <= m; i++)
			for (j = 1; j <= m; j++)
				if (pattern[i][j])
				{	
					k = j-1;
					while (k >= 1)
					{	
						if (pattern[i][k] != 0) break;
						dashes[i][k] = -pattern[i][j];
						k--;
					}
					k = j+1;
					while (k <= m)
					{	
						if (pattern[i][k] != 0) break;
						dashes[i][k] = pattern[i][j];
						k++;
					}
					k = i-1;
					while (k >= 1)
					{	
						if (pattern[k][j] != 0) break;
						bars[k][j] = pattern[i][j];
						k--;
					}
					k = i+1;
					while (k <= m)
					{	
						if (pattern[k][j] != 0) break;
						bars[k][j] = -pattern[i][j];
						k++;
					}
				}
		if (cases != 1) printf("\n");
		printf("Case %d:\n\n", cases++);
		for (i = 1; i <= 3+(m<<2); i++) printf("*");
		printf("\n");
		for (i = 1; i <= m; i++)
		{	
			if (i != 1)
			{	
				printf("* ");
				for (j = 1; j <= m; j++) printf(" H  ");
				printf("*\n");
				printf("*");
				for (j = 1; j <= m; j++)
				{	
					printf(" ");
					if (bars[i][j] != 1 && pattern[i][j] != 1) printf(" |");
					else printf("  ");
					printf(" ");
				}
				printf(" *\n");
			}
			printf("*");
			for (j = 1; j <= m; j++)
			{	
				if (dashes[i][j] != 1 && pattern[i][j] != -1) printf("H-");
				else printf(" ");
				printf("O");
				if (dashes[i][j] != -1 && pattern[i][j] != -1) printf("-H");
				else printf(" ");
			}
			printf("*\n");
			if (i != m)
			{	
				printf("*");
				for (j = 1; j <= m; j++)
				{	
					printf(" ");
					if (bars[i][j] != -1 && pattern[i][j] != 1) printf(" |");
					else printf("  ");
					printf(" ");
				}
				printf(" *\n");
			}
		}
		for (i = 1; i <= 3+(m<<2); i++) printf("*");
		printf("\n");
	}
	return 0;
}

zoj1088

#include<stdio.h>
#include<memory.h>
#define MaxN 150
int n;
int m;
int next[MaxN];
bool cut[MaxN];

int main()
{
	while(scanf("%d",&n)&&n)
	{
		int i;
		next[n]=1;
		for(i=1;i<=n-1;i++)
			next[i]=i+1;
		m=1;
		bool find=false;
		while(!find)
		{
			m++;
			memset(cut,true,sizeof(cut));
			int from=1;
			cut[1]=false;
			int number=n-1;
			int nextCut,jump;
			while(number>1)
			{
				nextCut=from;
				jump=0;
				while(jump<m)
				{
					nextCut=next[nextCut];
					if(cut[nextCut])
						jump++;
				}
				cut[nextCut]=false;
				number--;
				from=nextCut;
				if(from==2&&number!=1)
					break;
			}
		if(number==1&&cut[2]==true)
			find=true;
		}
		printf("%d\n",m);
	}
	return 0;
}

#include<stdio.h>
int m,n;
int check()
{
	int i;
	int from=0;
	for(i=2;i<n;++i)
		from=(from+m)%i;
	if(from==0)
		return 1;
	else
		return 0;
}

int main()
{
	while(scanf("%d",&n)&&n)
	{
		m=1;
		while(!check())
			++m;
		printf("%d\n",m);
	}
	return 0;
}