#include <stdio.h>
int p,t,n,m;
int main()
{
    scanf("%d%d%d%d",&p,&t,&n,&m);
    if (p<2 || p>10000 || t<2 || t>200 || (t&1) || n<1 || n>10 || m<1 || m>100)
        return 1/(p-p);
    return 0;
}

This program gets "Crash (integer division by zero)" at test #1.
http://acm.timus.ru/status.aspx?space=1&num=1526

is graph just full on 49 test?

after 2 days, found DP solution, and AC with 0.046 s.

Edited by author 15.08.2012 16:07

I tried to read data string by string and then by characters but in both cases I got Crash(access violation) on 1st test :(

Edited by author 18.08.2012 20:30

Dear all,

all tests I found in this discussion worked, but when I run my code I do have WA on test 7 (or 13 for another version of my code). Can someone please give a kind of inputs with some test? I checked everything I could think of and it worked.

Thank you!

If you have WA15, you should think about the height of the plate and the height of the box.

use sort, wa. use stable_sort, ac

May be w=0 or not? Is it possible?

http://acm.timus.ru/author.aspx?id=116635
He was at first position today, and suddenly he lost two hundered AC (1000-1226).

take me idea what is wrong:
var a,b,c:integer;
begin
read(a,b);
c:= (2*a) div b;
if c=2*a/b then write(c)else write (c+1);
end.
p.s sorry for my english

A
a
ans = 0
---------------------
A
A
ans = 0
---------------------
aB
ans = 2
---------------------
asasa.!sds
sdsdsd!!!..::dsd
ans = 3
---------------------
-a.
ans = 1
--------------------
090aA is a number.
ans = 2
--------------------
this sentence have one mistake
ans = 1
--------------------
Hello! 238 my Friend
ans = 1
--------------------
Asf,.,a
ans = 1
--------------------

You guys better use "cin" for solving this problem, because they put some gaps in input data and "scanf" give you WA.
Sorry for my poor English.

Or is this possible:
bring 1,
bring 2,
take 2 away,
bring 3,
take 3 away,
take 1 away?

Or what is the answer for
9999 6 1 0 ?
4 or 5?

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
#define N 900000
struct seq
{
    int l;
    int r;
};
seq se[N];
int m;
bool cmp(const seq &s1,const seq &s2)
{
    if(s1.l==s2.l)
        return s1.r>s2.r;
    return s1.l<s2.l;
}
int main()
{
    //while(scanf("%d",&m)!=EOF)
    //{
    scanf("%d",&m);
        int left,right;
        queue<int>que;
        while(!que.empty())que.pop();
        int i=0,j;
        while(scanf("%d%d",&left,&right))
        {
            if(left==0&&right==0)break;
            se[i].l=left;
            se[i].r=right;
            i++;
        }
        sort(se,se+i,cmp);
        int rightf=0;
        int maxlen=0;
        int num=0;
        int p=-1;
        int ff=0;
        for(j=0;j<i;j++)
        {

            if(se[j].l<=rightf&&se[j].r-rightf>maxlen)
            {
                maxlen=se[j].r-rightf;
                p=j;
            }
            else if(p!=-1&&maxlen>0)
            {
                que.push(p);
                rightf=rightf+maxlen;
                maxlen=0;
                num++;
                j=j-1;
            }
            if(rightf>=m)
            {
                ff=1;
                break;
            }
        }
        if(maxlen>0)
        {

            rightf=rightf+maxlen;
            maxlen=0;
            num++;
            if(rightf>=m)
            {
                que.push(p);
                ff=1;
            }
        }
        if(ff)
        {
            printf("%d\n",num);
            while(!que.empty())
            {
                int top=que.front();
                printf("%d %d\n",se[top].l,se[top].r);
                que.pop();
            }
        }
        else
            printf("No solution\n");
    //}
    return 0;
}

AC!!!! :D

Don't use overflowing (int64 or int) in your hash function! :D


Edited by author 10.08.2012 18:07