280 条题解

  • 0
    @ 2009-08-14 10:49:15

    program p_1;

    var i,x,y,a:integer;

    begin

    x:=0; y:=0;

    for i:=1 to 12 do

    begin

    readln(a);

    y:=y+300-a;

    if y>=100 then begin

    x:=x+y div 100;

    y:=y mod 100;

    end

    else if y=0 then write(x*120+y);

    end.

  • 0
    @ 2009-08-09 14:19:48

    program p1096;

    var i,x,y,a:integer;

    begin

    x:=0; y:=0;

    for i:=1 to 12 do

    begin

    readln(a);

    y:=y+300-a;

    if y>=100 then begin

    x:=x+y div 100;

    y:=y mod 100;

    end

    else if y=0 then write(x*120+y);

    end.

    交了两次,一次是忘了加上余钱;二者则忘了加等号

  • 0
    @ 2009-08-04 08:50:42

    var

    a:array[0..14] of longint;

    i,s:longint;

    begin

    for i:=1 to 12 do read(a[i]);

    for i:=1 to 12 do

    begin

    if a+300=100 then

    begin

    s:=s+100*(a[i] div 100);

    a[i]:=a[i]-100*(a[i] div 100);

    end;

    end;

    write((a[12]+s*1.2):0:0);

    end.

    纯数学~

  • 0
    @ 2009-08-01 10:51:24

    感动ing

    祝贺自己终于没看题解作出了题目~~

    虽然是传说中的水题。。。

    我相信会越来越好的

  • 0
    @ 2009-07-30 17:03:39

    program jinjin;

    var a:array [1..12] of integer;

    b:array [1..12] of integer;

    sheng:array[1..12]of integer;

    i:integer;

    gei:real;

    be:boolean;

    begin

    sheng[1]:=0;

    sheng[2]:=0;

    a[1]:=0;

    b[1]:=0;

    gei:=0;

    for i:=1 to 12 do

    a[i]:=a[i]+300;

    for i:=1 to 12 do

    read(b[i]);

    for i:=1 to 12 do

    begin

    sheng[i]:=a[i]-b[i];

    if sheng[i]100 then if sheng[i]>200 then

    begin

    sheng[i]:=sheng[i]-200 ;

    gei:=gei+200; end;

    if sheng[i]>100 then if sheng[i]

  • 0
    @ 2009-07-27 22:54:40

    编译通过...

    ├ 测试数据 01:答案正确... 0ms

    ├ 测试数据 02:答案正确... 0ms

    ├ 测试数据 03:答案正确... 0ms

    ├ 测试数据 04:答案正确... 0ms

    ├ 测试数据 05:答案正确... 0ms

    ├ 测试数据 06:答案正确... 0ms

    ├ 测试数据 07:答案正确... 0ms

    ├ 测试数据 08:答案正确... 0ms

    ├ 测试数据 09:答案正确... 0ms

    ├ 测试数据 10:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:0ms

    题目一大串...终于一次AC...yeah!

    type yh=record

    yusuan:longint;

    dedao:longint;

    shengyu:longint;

    end;

    var m,chucun:longint;a:array[1..13]of yh;

    begin

    chucun:=0;

    for m:=1 to 12 do begin

    readln(a[m].yusuan);

    a[m].dedao:=300;

    end;

    for m:=1 to 12 do begin

    a[m].shengyu:=a[m].dedao-a[m].yusuan;

    if a[m].shengyu0 then

    begin

    chucun:=a[m].shengyu-a[m].shengyu mod 100+chucun;

    a[m].shengyu:=a[m].shengyu-(a[m].shengyu div 100)*100;

    end;

    a[m+1].dedao:=a[m+1].dedao+a[m].shengyu;

    end;

    writeln(trunc(a[12].shengyu+chucun+chucun/5));

    end.

  • 0
    @ 2009-07-24 23:42:19

    我爱水题...

  • 0
    @ 2009-07-24 20:11:44

    program renshu;

    var

    i:longint;

    a,b:array[0..12]of longint;

    j,k,l:longint;

    begin

    for i:=1 to 12 do begin

    read(a[i]);

    b[i]:=300-a[i]+b;

    if (b[i] div 100)>=1

    then k:= b[i] div 100+k;

    b[i]:=b[i] mod 100;

    if b[i]

  • 0
    @ 2009-07-24 18:04:40

    编译通过...

    ├ 测试数据 01:答案正确... 0ms

    ├ 测试数据 02:答案正确... 0ms

    ├ 测试数据 03:答案正确... 0ms

    ├ 测试数据 04:答案正确... 0ms

    ├ 测试数据 05:答案正确... 0ms

    ├ 测试数据 06:答案正确... 0ms

    ├ 测试数据 07:答案正确... 0ms

    ├ 测试数据 08:答案正确... 0ms

    ├ 测试数据 09:答案正确... 0ms

    ├ 测试数据 10:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:0ms

    var a,money,save:integer;

    s:array[1..12] of integer;

    begin

    for a:=1 to 12 do

    readln(s[a]);

    money:=0;

    save:=0;

    for a:=1 to 12 do

    begin

    money:=money+300;

    money:=money-s[a];

    if money

  • 0
    @ 2009-07-24 14:52:50

    program save;

    var

    a:array[1..12]of integer;

    i,s,ma:integer;

    begin

    ma:=0;

    s:=0;

    for i:=1 to 12 do

    read(a[i]);

    for i:=1 to 12 do

    begin

    if s+300-a[i]

  • 0
    @ 2009-07-22 21:15:37

    死BT的题目!!!!!!!!!

    就改了一个名字!!!就不给过了!!!!!!!!!!!!

    SO B视!!!!

  • 0
    @ 2009-07-22 19:08:41

    编译通过...

    ├ 测试数据 01:答案正确... 0ms

    ├ 测试数据 02:答案正确... 0ms

    ├ 测试数据 03:答案正确... 0ms

    ├ 测试数据 04:答案正确... 0ms

    ├ 测试数据 05:答案正确... 0ms

    ├ 测试数据 06:答案正确... 0ms

    ├ 测试数据 07:答案正确... 0ms

    ├ 测试数据 08:答案正确... 0ms

    ├ 测试数据 09:答案正确... 0ms

    ├ 测试数据 10:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:0ms

    program p1096(input,output);

    var ab:array [0..15] of longint;

    hand,save,a,i:longint;

    begin

    for i:=1 to 12 do

    readln(ab[i]);

    hand:=0;

    save:=0;

    for i:=1 to 12 do

    begin

    hand:=hand+300-ab[i];

    if hand

  • 0
    @ 2009-07-21 21:37:24

    #include

    main()

    {

    int yusuan[12],yu,mama,s;

    int i,j;

    for(i=0;i

  • 0
    @ 2009-07-18 15:29:38

    program money;

    var

    i,j,m:integer;

    a,b:array[0..13] of integer;

    begin

    for i:=1 to 12 do readln(a[i]);

    for i:=1 to 12 do begin

    b[i]:=b+300-a[i];

    j:=(b[i] div 100)*100;

    if b[i]>=100 then begin m:=m+j;

    b[i]:=b[i]-j;

    end;

    if b[i]

  • 0
    @ 2009-07-18 15:29:09

    program save;

    var i,j,k,n:integer;

    begin

    k:=0;

    for i:=1 to 12 do

    begin

    readln(n);

    if k+300>=n then

    begin

    k:=k+300-n;

    j:=(k div 100)*100+j;

    k:=k mod 100;

    end

    else

    begin

    write('-',i);

    exit;

    end;

    end;

    write((j div 5)*6+k);

    end.

  • 0
    @ 2009-07-16 23:02:04

    program P1096;

    var

    a:array[1..12] of integer;

    b:array[0..12] of integer;

    i,sy,yb,cd:integer;

    begin

    for i:=1 to 12 do

    readln(a[i]);

    for i:=1 to 12 do

    begin

    sy:=300+b-a[i];

    if sy

  • 0
    @ 2009-07-15 13:54:21

    var

    t,k,i,x:longint;

    begin

    t:=0;k:=0;

    for i:=1 to 12 do

    begin

    read(x);

    if t+300-x

  • 0
    @ 2009-07-11 19:09:35

    注意加上手上的余钱

  • 0
    @ 2009-07-09 11:32:37

    program skyline;

    var

    i:byte;

    pay,money,monther:longint;

    begin

    money:=0;monther:=0;

    for i:=1 to 12 do

    begin

    readln(pay);

    if 300+money

  • 0
    @ 2009-07-09 10:27:40

    最后钱还要加上自己没存妈妈那里的,晕,还我死了几次~~~

信息

ID
1096
难度
5
分类
模拟 点击显示
标签
递交数
16002
已通过
5681
通过率
36%
被复制
38
上传者