2864.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 36 行

Source

Problem Id:2864  User Id:fzk 
Memory:24K  Time:15MS
Language:C++  Result:Accepted

Source 

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

int main( ) {
	int n, d, i, t, sign[101];

	while( 1 ) {
		scanf( "%d%d", &n, &d );
		if( n == 0 && d == 0 )
			break;
		for( i=0; i<=n; i++ )
			sign[i] = 1;
		while( d-- ) {
			for( i=0; i<n; i++ ) {
				scanf( "%d", &t );
				sign[i] &= t;
			}
		}
		for( i=0; !sign[i]; i++ )
			;
		printf( "%s\n", i==n?"no":"yes" );
	}

	return 0;
}