Submission #9693

# Submission time Handle Problem Language Result Execution time Memory
9693 2014-09-28T08:09:00 Z pichulia Zu (kriii2_Z) C++
1 / 4
0 ms 3036 KB
#include<stdio.h>
int n, m;
char a[999][999];
char b[999][999];
int main()
{
	scanf("%d %d",&n,&m);
	int i, j;
	for(i=0;i<6*n-1;i++)
	{
		scanf("%s",a[i]);
	}
	for(i=0;i<n;i++)
		for(j=0;j<m;j++)
		{
			int k, l;
			int t = 0;
			for(k=6*i+0;k<6*i+5;k++)
				for(l=6*j+0; l<6*j+5;l++)
				{
					t*=2;
					if(a[k][l] == '#')t++;
				}
			if(t==32655359)
				b[j][i] = 'a';
			else if(t == 0)
				b[j][i] = '_';
			else if(t == 33084479)
				b[j][i] = 'b';
			else if(t == 33453983)
				b[j][i] = 'c';
			else if(t == 33553655)
				b[j][i] = 'd';
			else
				b[j][i] = 'z';
		}
	for(i=m-1;i>=0;i--)
		printf("%s\n",b[i]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 3036 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3036 KB Output isn't correct