好简单!

编译成功

测试数据 #0: Accepted, time = 15 ms, mem = 468 KiB, score = 10
测试数据 #1: Accepted, time = 0 ms, mem = 472 KiB, score = 10
测试数据 #2: Accepted, time = 0 ms, mem = 476 KiB, score = 10
测试数据 #3: Accepted, time = 0 ms, mem = 468 KiB, score = 10
测试数据 #4: Accepted, time = 15 ms, mem = 468 KiB, score = 10
测试数据 #5: Accepted, time = 0 ms, mem = 472 KiB, score = 10
测试数据 #6: Accepted, time = 0 ms, mem = 472 KiB, score = 10
测试数据 #7: Accepted, time = 0 ms, mem = 468 KiB, score = 10
测试数据 #8: Accepted, time = 0 ms, mem = 472 KiB, score = 10
测试数据 #9: Accepted, time = 0 ms, mem = 472 KiB, score = 10
Accepted, time = 30 ms, mem = 476 KiB, score = 100
返回代码界面 | 关闭

7 条评论

  • @ 2014-08-14 18:45:43

    var
    n,m,i,k,j:longint;
    st:string;
    begin
    read(n,m);
    st:='';
    for i:=n to m do
    begin
    str(i,st);
    for j:=1 to length(st) do
    if st[j]='2' then inc (k);
    end;
    writeln(k);
    end.
    0秒
    本人看一眼就想出来了,只敲了2分钟

  • @ 2014-03-17 20:17:17

    好吧,我终于承认很简单了。。。

  • @ 2014-03-08 20:13:26

    kmp??

  • @ 2014-03-08 15:54:28

    话说就算把1~10000改成1~10^10000也简单的狠吧。
    这又用来提升Ac率的?

  • @ 2014-03-08 14:18:38

    提示
    【数据范围】
    1≤L≤R≤10000
    ====很简单哦!====

  • @ 2014-03-08 13:22:59

    too easy!我用不到五分钟就做出来了!

  • @ 2014-03-05 19:57:05

    我同意

  • 1

信息

ID
1784
难度
2
分类
模拟 点击显示
标签
递交数
2764
已通过
1664
通过率
60%
被复制
19
上传者