求大佬看看,就是全wa

P1031 [NOIP2002 提高组] 均分纸牌

真麻烦! 代码给你看看: ```c #include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<string> #include<cstring> #include<cstdlib> using namespace std; int a[10005]; int main(){ int N,ave=0,ans=0; cin>>N; for(int i=0;i<N;++i){ cin>>a[i]; ave+=a[i]; } ave/=N; for(int i=0;i<N;++i){ a[i]-=ave; } for(int i=0;i<N;++i){ if(a[i]!=0){ a[i+1]+=a[i]; ans++; } } cout<<ans; return 0; } ```
by YosemiteHe @ 2019-07-08 16:13:48


|