3112.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:3112  User Id:fzk 
Memory:44K  Time:453MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>

int m[1000];

int main( ) {
	int n, p, c, i, j, t, ans;

	while( 1 ) {
		scanf( "%d%d%d", &p, &n, &c );
		if( n == 0 && p == 0 && c == 0 )
			break;

		for( j=0; j<p; j++ )
			m[j] = 0;
		
		ans = 0;

		for( i=0; i<n; i++ ) {
			for( j=0; j<p; j++ ) {
				scanf( "%d", &t );
				if( t == 0 ) {
					if( m[j] >= c )ans++;
					m[j] = 0;
				}
				else
					m[j]++;
			}
		}
		for( j=0; j<p; j++ )
			if( m[j] >= c )
				ans++;
		printf( "%d\n", ans );
	}
	return 0;
}