思路

照着题目写就能过了。

代码

//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define int long long
using namespace std;
const int N=2e5+7;
const int mod=1e9+7;

//int read(){	int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=f*-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}

int n,m,v,avg[N],sum[N],ans=0;

signed main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
//  freopen("in.cpp","r",stdin);
//  freopen("out.cpp","w",stdout);
	cin>>m>>n;
	for(int i=1;i<=m;i++){
		int res=0,flag=0;
		for(int j=1;j<=n;j++){
			cin>>v;
			res+=v;
			if(v>100||v<0) flag=1;
		}
		cin>>avg[i]>>sum[i];
		if(res!=sum[i]||res/n!=avg[i]) flag=1;
		if(flag) ans++;
	}
	cout<<ans<<"\n";
	return 0;
}