215 条题解
-
0
gxz LV 8 @ 2013-11-15 19:09:13
#include <stdio.h>
int a[1000];
int main()
{
int sum = 0 , i , ans = 0 , n , temp = 0;scanf("%d" , &n);
for(i = 0 ; i < n ; i ++ )
{
scanf("%d" , &a[i]);
sum += a[i];
}
sum /= n;for(i = 0 ; i < n ; i ++ )
{
temp = a[i] + temp - sum;
if(temp != 0)
{
ans ++ ;
}
}
printf("%d\n" , ans);return 0;
} -
0
12行- =
评测结果
编译成功测试数据 #0: Accepted, time = 0 ms, mem = 536 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 540 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 536 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 544 KiB, score = 10
测试数据 #4: Accepted, time = 0 ms, mem = 540 KiB, score = 10
Accepted, time = 0 ms, mem = 544 KiB, score = 50
代码
#include<cstdio>
int n,a[110],r=0;
int main(){
scanf("%d",&n);
for (int i=1; i<=n; i++) {
scanf("%d",&a[i]);
a[i] += a[i - 1] ;
} a[n] /= n ;
for (int i=1; i< n; i++)
if (a[i] != a[n]*i) r++;
printf("%d",r);
} -
0
测试数据 #0: Accepted, time = 0 ms, mem = 824 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 820 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 824 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 824 KiB, score = 10
测试数据 #4: Accepted, time = 0 ms, mem = 820 KiB, score = 10
Accepted, time = 0 ms, mem = 824 KiB, score = 50
极短代码：
var
n,i,sum,ans:longint;
a:array[0..101]of longint;
begin
readln(n);
for i:=1 to n do
begin
read(a[i]);
sum:=sum+a[i];
end;
sum:=sum div n; ans:=n-1;
for i:=1 to n-1 do
if a[i]<>sum then inc(a[i+1],a[i]-sum) else dec(ans);
writeln(ans);
end. -
0
编译成功
测试数据 #0: Accepted, time = 0 ms, mem = 732 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 732 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 732 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 728 KiB, score = 10
测试数据 #4: Accepted, time = 3 ms, mem = 732 KiB, score = 10
Accepted, time = 3 ms, mem = 732 KiB, score = 50
个人觉得此代码比较容易理解，先算出平均个数再移动；
program junfen;
var n,i:longint;
a:array[1..101] of longint;
x,sum,num:longint;
begin
readln(n);
for i:=1 to n do read(a[i]);
readln;
sum:=0;
num:=0;
for i:=1 to n do sum:=sum+a[i];
x:=sum div n;
for i:=1 to n do begin
if a[i]>x then begin
a[i+1]:=a[i+1]+a[i]-x;
a[i]:=x;
num:=num+1;
end;
if a[i]<x then begin
a[i+1]:=a[i+1]-(x-a[i]);
a[i]:=x;
num:=num+1;
end;
if a[i]=x then
continue;
end;
writeln(num);
end. -
0
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define maxn 100using namespace std;
int n,a[maxn+1];
int main()
{
int i,j,k,t,y,head,tial,ans,maxx;
while(~scanf("%d",&n))
{
k=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
k+=a[i];
}
k/=n;
for(i=0;i<n;i++)
a[i]-=k;
ans=0;
for(i=0;i<n;i++)
if(a[i]!=0)
{
a[i+1]+=a[i];
a[i]=0;
ans++;
}
else continue;
printf("%d\n",ans);
}
return 0;
} -
0
program p1123;
var n:longint;
a:array[1..1000] of longint;
procedure init;
var i,pj:longint;
begin
pj:=0;
readln(n);
for i:=1 to n do begin read(a[i]); inc(pj,a[i]); end;
pj:=pj div n;
for i:=1 to n do a[i]:=a[i]-pj;
for i:=1 to n do writeln(a[i]);
end;
procedure work;
var k,total:longint;
begin
k:=1; total:=0;
repeat
if a[k]=0 then inc(k)
else begin a[k+1]:=a[k+1]+a[k]; a[k]:=0; inc(total); inc(k); end;
until k>=n;
writeln(total);
end;
begin
init;
work;
end. -
0
编译通过...
├ 测试数据 01：答案正确... 0ms
├ 测试数据 02：答案正确... 0ms
├ 测试数据 03：答案正确... 0ms
├ 测试数据 04：答案正确... 0ms
├ 测试数据 05：答案正确... 0ms
---|---|---|---|---|---|---|---|-
Accepted 有效得分：100 有效耗时：0msprogram cmove;
var
a:array[1..100] of integer;
n,m,i,j,t:longint;
begin
t:=0;
m:=0;
readln(n);
for i:=1 to n do begin read(a[i]); t:=t+a[i]; end;
t:=t div n;
for i:=2 to n do begin
if a-t0 then begin a[i]:=a[i]-(t-a);
inc(m);
end;
end;
writeln(m);
end.Flag Accepted
题号 P1123
类型(?) 模拟
通过 5426人
提交 11060次
通过率 49%
难度 1提交 讨论 题解
终于对了十题！纪念！！！
-
0
-
0
zerotonine LV 6 @ 2009-11-02 18:05:02
program jfzp;
var
a:array[1..100] of longint;
n,i,ave,s:longint;
procedure dayin;
begin
writeln(s);
end;
procedure duru;
begin
readln(n);
for i:=1 to n do
begin
read(a[i]);
inc(ave,a[i]);
end;
ave:=ave div n;
end;
procedure chushihua;
begin
ave:=0;
s:=0;
end;
procedure junfen;
begin
for i:=1 to n do
if a[i]ave then
begin
a:=a+a[i]-ave;
inc(s);
end;
end;
begin
chushihua;
duru;
junfen;
dayin;
end.
多帅的过程!!!
还有个问题:
为什么有人过不了第五个数据? -
0
liu384287422 LV 8 @ 2009-10-31 16:54:26
var
s,n,i,m,j:longint;
a:array[1..100] of longint;
begin
readln(n);
s:=0;
for i:= 1 to n do
begin
read(a[i]);
s:=s+a[i];
end;
m:= s div n;
j:=0;
for i:= 1 to n-1 do
begin
if a[i]m then
begin
a:=a+(m-a[i]);
j:=j+1;
end;
if a[i]=m then
begin
a[i]:=m;
end;
end;
write(j);
end.
gxz
LV 8
@ 2013-11-15 19:09:13
