题解

457 条题解

  • 0
    @ 2013-10-22 22:27:14

    记录信息
    评测状态 Accepted
    题目 P1102 陶陶摘苹果
    递交时间 2013-10-22 22:26:36
    代码语言 C
    评测机 上海红茶馆
    消耗时间 0 ms
    消耗内存 544 KiB
    评测时间 2013-10-22 22:26:37

    评测结果
    编译成功

    测试数据 #0: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #1: Accepted, time = 0 ms, mem = 544 KiB, score = 10

    测试数据 #2: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #3: Accepted, time = 0 ms, mem = 540 KiB, score = 10

    测试数据 #4: Accepted, time = 0 ms, mem = 540 KiB, score = 10

    测试数据 #5: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #6: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #7: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #8: Accepted, time = 0 ms, mem = 536 KiB, score = 10

    测试数据 #9: Accepted, time = 0 ms, mem = 540 KiB, score = 10

    Accepted, time = 0 ms, mem = 544 KiB, score = 100

    代码
    #include <stdio.h>
    int main (){
    int tt,sum=0,i,a[10];
    for (i=0;i<10;i++)
    {scanf ("%d",&a[i]);
    }
    scanf ("%d",&tt);
    for (i=0;i<10;i++)
    {if ((tt+30)>=a[i]) sum++;
    }
    printf ("%d\n",sum);
    return 0;
    }

  • 0
    @ 2013-10-15 13:06:35

    var a:array[1..10] of integer;
    b,c,d:integer;
    begin
    for b:=1 to 10 do
    read(a[b]);
    read(c);
    c:=c+30;
    for b:= 1 to 10 do
    if c>=a[b] then
    inc(d);
    write(d);
    end.

  • 0
    @ 2013-10-12 13:25:25

    var a:array[1..10] of integer;
    b,c,d:integer;
    begin
    for b:=1 to 10 do
    read(a[b]);
    read(c);
    c:=c+30;
    for b:= 1 to 10 do
    if c>=a[b] then
    inc(d);
    write(d);
    end.

  • 0
    @ 2013-10-03 16:14:14

    这题目难道是在秀智商下限吗。。。

    C++ Code:
    #include <iostream>
    using namespace std;
    int main(){
    int height[10];
    int tall;
    int result;
    result =0;
    for(int i=0;i<10;i++){
    cin>>height[i];
    }
    cin>>tall;
    tall+=30;
    for(int i=0;i<10;i++){
    if(height[i]<=tall){
    result++;
    }
    }
    cout<<result;
    }

  • 0
    @ 2013-09-19 16:14:02

    pascal
    源代码

    语言: Pascal 用户名: moment 题号: 1131

    var
    a:array[1..10] of integer;
    n,i,s:integer;
    begin
    for i:=1 to 10 do
    read(a[i]);
    readln(n);
    n:=n+30;
    s:=0;
    for i:=1 to 10 do
    if n>=a[i] then
    inc(s);
    writeln(s);
    end.

  • 0
    @ 2013-09-12 00:19:20

    #include <iostream>
    using namespace std;

    int main()
    {
    int distance[10];
    for(int i=0;i<10;i++)
    cin>>distance[i];
    int height;
    int apple;
    cin>>height;
    height+=30;
    for(int j=0;j<10;j++)
    {
    if(height>=distance[j])
    apple++;
    }
    cout<<apple<<endl;
    return 0;
    }

  • 0
    @ 2013-07-29 17:03:54

    水题不可放过

    测试数据 #0: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #1: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #2: Accepted, time = 0 ms, mem = 436 KiB, score = 10
    测试数据 #3: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #4: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #5: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #6: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #7: Accepted, time = 0 ms, mem = 436 KiB, score = 10
    测试数据 #8: Accepted, time = 0 ms, mem = 440 KiB, score = 10
    测试数据 #9: Accepted, time = 0 ms, mem = 436 KiB, score = 10
    Accepted, time = 0 ms, mem = 440 KiB, score = 100
    代码
    #include<stdio.h>
    #include<stdlib.h>
    #include<mem.h>
    using namespace std;
    int a[20];
    int main(){
    int i,j,n,s=0;;
    for (i=1;i<=10;i++) scanf("%d",&a[i]);
    scanf("%d",&n);
    for (i=1;i<=10;i++) if (n+30>=a[i]) s++;
    printf("%d\n",s);
    //system("PAUSE");
    return 0;
    }

  • 0
    @ 2013-04-17 22:49:11

    var a:array[1..10]of integer;
    i,n,j:integer;
    begin
    for i:=1 to 10 do
    read(a[i]);
    readln(n);
    j:=0;
    for i:=1 to 10 do
    if n+30>=a[i] then
    j:=j+1;
    writeln(j);
    readln;
    end.

  • 0
    @ 2013-02-20 17:51:35

    #include<stdio.h>
    int main(void)
    {
    int i,sum=0,a[10],h;
    for(i=0;i<10;i++)
    scanf("%d",&a[i]);
    scanf("%d",&h);
    for(i=0;i<10;i++)
    if(a[i]<=h+30)
    sum++;
    printf("%d\n",sum);
    return 0;
    }

  • 0
    @ 2012-11-29 20:27:43

    program xf;

    var

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

    n,j,i:integer;

    begin

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

    read(n);

    j:=0;

    for i:=1 to 10 do begin

    if a[i]

  • 0
    @ 2012-11-09 16:15:43

    +Rp

  • 0
    @ 2012-11-08 23:08:54

    卖得一手好水题。。。。。。。。。。。。。。

    点这里查看程序源码+详细题解

  • 0
    @ 2012-11-07 20:59:20

    var

    a:array[1..10] of longint;

    n,s,i:longint;

    begin

    for i:=1 to 10 do

    read(a[i]);

    readln(n);

    n:=n+30;

    for i:=1 to 10 do

    if n>=a[i] then inc(s);

    writeln(s);

    end.

  • 0
    @ 2012-11-01 18:38:57

    // 陶陶摘苹果; 

    #include

    using namespace std;

    int main ( )

    {

    int pingguo[10];

    int shengao;

    int zhai = 0;

    for ( int i = 0; i < 10; i++ )

    {

    cin >> pingguo[i];

    }

    cin >> shengao;

    shengao += 31;

    for ( int i = 0; i < 10; i++ )

    {

    if ( shengao > pingguo[i] )

    {

    zhai += 1;

    }

    }

    cout

  • 0
    @ 2012-10-30 17:21:57

    没有人发这题C++的题解吗?

  • 0
    @ 2012-09-12 22:21:19

    var a:array[1..10] of integer;i,x,y:integer;beginy:=0;for i:=1 to 10 doread(a[i]);read(x);for i:=1 to 10 doif x+30>=a[i] then y:=y+1;write(y);end.

  • 0
    @ 2012-08-04 16:08:28

    点击查看代码

  • 0
    @ 2012-08-02 14:47:11

    点击查看代码

  • 0
    @ 2012-07-26 11:33:07

    好吧 我直接在提交框里编辑的 最后一个符号'.'被我打成了';'所以提交了两次。。

  • 0
    @ 2010-07-23 09:36:57

    var i,j,z,n,m,t,k:longint;

      a,b:array[1..2000] of longint;

    procedure try;

    begin

    for j:=1 to m do

    begin

    if (a[i]>b[j])and(b[j]>0) then begin

       z:=z+1;b[j]:=maxint;exit;end;

    end;

    end;

    begin

    readln(n,m);k:=1;

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

    for i:=1 to m do readln(b[i]);

    for i:=1 to n-1 do

    for j:=i+1 to n do

       begin

       if a[i]

信息

ID
1102
难度
3
分类
模拟 点击显示
标签
递交数
16806
已通过
8840
通过率
53%
被复制
67
上传者