With linear search you'd get TLE.

Go for Binary search!!

Edited by author 31.01.2012 21:26

I have wrong answer in my 7th testcase!
can you tell me Why?

can anyone here tell me the test data for test#7?
and thanks

I used pascal strings and got AC.

This problem does NOT have any special cases. It is just a formula and its CAREFUL implementation.

char x[100] -- is Wa
while char x[101] -- is AC

I got 0.218, 104Kb with this code:

#include <cstdio>
#include <cstdlib>



int main()
{
     char str[8];
     gets (str);
     int n=atoi(str);

    char s,sum=0;

    int count=0;

    while (n)
    {
        gets(str);

        s=str[0]+str[2];

        if (s==105) {putchar(57); --n;}
        else {sum=s; --n; break; }
    }

    if (!n) return 0;


    for (int i=0; i<n; ++i)
    {
        gets(str);

        s=str[0]+str[2];


        if (s==105) {++count;}
        else
        {


            if (s<=104)
            {

                putchar(sum-48);

                for (; count>0; --count)
                    putchar(57);

                sum=s;

            }
            else
            {

                if (s>=106)
                {

                    putchar(sum-47);

                    for (; count>0; --count)
                    putchar(48);

                sum=s-10;

                }
            }
        }


    }

    if (s==105)
    {

            putchar(sum-48);

        for (; count>0; --count)
                putchar(57);

    }
    else
        if (sum)

            (s>=106)?putchar(s-58):putchar(s-48);
}

Could anyone tell me what should i do to make it faster?

I make problem 1012 with long ariphmetic, but got WA #6
During some time I searched an error, and she appeared interesting:
in each slot of array I wrote down 7 numbers. For example number 76192801046017773930 (n=20, k=10) in my array looked so:
a[]={7773930, 104601, 761928, 0, ... 0}
but as you see the second (104601) number has 6 numbers: it must look so 0104601, and the first zero did not hatch. Through this my number looked so 7619281046017773930.

errors are different... :P

Can anyone post some test cases for 1020 Rope problem? My code works fine for the test cases that I created. But getting #WA

Edited by author 19.01.2012 00:47

Edited by author 19.01.2012 00:48

My solution (without answers precalculation) is about O(N^2). How could it be solved faster?

I've got wa16 :( Please give me some useful tests.

I got WA2, when used usual rounding.
And when i rounded all my cuts to the smallest grater than one  than get AC.

In test #6 we must write 2nd representation in 1st.

This get WA6
while( 1 ){
    string cur;
    getline( cin, cur );
    if( cur == "." ) break;//!!!!!!!
    pT p = Q.front();
    Q.pop_front();
    IsBl[p.x][p.y] = true;
<secret deleted code here =) >
}


This get AC:
while( 1 ){
    string cur;
    getline( cin, cur );
    pT p = Q.front();
    Q.pop_front();
    IsBl[p.x][p.y] = true;
    if( cur == "." ) break;//!!!!!!!
<secret deleted code here =) >
}


PS: sily mistake.

Edited by author 18.01.2012 21:52

calculate : fmax(n) = max(fmax(n-1)+value(n),value(n));

var
      i,k,j,p,min,q,x,n:integer;
      a,b:array [1..6] of integer;
      c:array [0..6] of integer;
      t:boolean;
begin
   min:=32000;
   a[1]:=10;
   a[2]:=50;
   a[3]:=100;
   a[4]:=500;
   a[5]:=1000;
   a[6]:=5000;
   n:=6;
   for i:=1 to n-1 do
   begin
      read (b[i]);
      x:=x+b[i]*a[i];
   end;
   readln (b[n]);
   readln (k);
   t:=false;
   i:=1;
   while not t do
      begin
          while  (i<=n) and (c[i]>=b[i]) do
         begin
            c[i]:=0;
                inc(i);
         end;
      if i>n then
             begin
            t:=true;
                continue;
             end;
      inc(c[i]);
      for j:=1 to n do
        p:=p+c[j]*a[j];
       if p=k then
       begin
          q:=p;
          break;
       end;
       if p>=k then
          begin
             for j:=1 to i-1 do
            c[j]:=0;

          end
       else
          i:=1;
      if  (p>=k) and (p-k<min) then
        begin
           min:=p-k;
               q:=p;
        end;
      end;
   q:=(x-q) div k;
   writeln ((x div k)-q);
   for i:=q+1 to x div k do
      write (i,' ');

end.

#include<stdio.h>
#include<stdlib.h>
 #include<math.h>
int main()

{
int s,i,sum=0;
scanf("%d",&s);

if(abs(s)<10000)
{
if(s>0)
{
for(i=1;i<=s;i++)
{
sum=sum+i;
}
printf("%ld",sum);
}
else
{

for(i=1;i>=s;i--)
{
sum=sum+i;
}
printf("%ld",sum);
}
}
return 0;
}

I got WA#3 and can't anderstand why...



Edited by author 08.04.2005 22:01

Is there any link where I can access\download the input test vectors for problem "1027. D++ Again" ?

-Hari