Horner's method.

Why isn't the output for 1 just:

1

?

It is equivalent to:

0
X
*
1
+

... but it is shorter. The problem asks for minimal length doesn't it?

There are no tests where N=0 xD)

Well, everybody here knows, that best scheme is 0(X*i+) . But lot of us get WA1. I've found why we fail like this. The last line of output shouldn't contain line break, so I've changed string "X\n*\ni\n+\n" to "\nX\n*\ni\n+" and got AC.

Input: 2
Ouput: 0 X X * * 1 X * 2 + +

Input: 3
Output: 0 X X X * * * 1 X X * * 2 X * 3 + + +

Input: 4
Output: 0 X X X X * * * * 1 X X X * * * 2 X X * * 3 X * 4 + + + +

In mathematics it's right, but here I'd got WA 2.

Why?

>
This is my solution:
--------------program-----------------
var n:integer; i:integer;
begin
 readln(n);
 if n=0 then writeln(0) else  begin
  writeln('0'); writeln('X'); writeln('*');
   for i:=1 to n-1 do  begin
    writeln(i); writeln('+');
    writeln('X'); writeln('*'); end;
  writeln(n); writeln('+'); send;
end.
---------------------------------------

I readed MirTrudMay message, sended his solution and got AC(0.02 sec,
28K). Then I wrote my solution
  Program Task1059;
   Const First : String = 'X0*1+';
   Var I,N : Word;

   BEGIN
    ReadLn(N);
    For I := 1 To 5 Do
     WriteLn(First[I]);
    For I := 2 To N Do
     begin
      WriteLn('X');
      WriteLn('*');
      WriteLn(I);
      WriteLn('+');
     end;
   END.
 and got AC to, but 0.01 sec, 28K. Paradox???!!!

I got AC with this code:
begin write(1); end.

I think that there must be some 'X' one after another, because it is
said 'ai*X^(n-1)' like this for n=2:

0
X
X
*
*
1 --> I'm only not quite sure for this '1'
X
* --> and if there is no '1' this row also turns off
+
2
+


I have tried to write something but it sucked, so I got a Pascal
code and turned it to C++!

AC 0.02 sec

///////////////////////////////////////////////
// 1059

#include <stdio.h>

int i,n;

int main()
{
  scanf("%d",&n); puts("0");
  for (i=1;i<=n;i++)
    printf("X\n*\n%d\n+\n",i);
  //getch();
  return 0;
}
/////////////////////////////////////////////////

I lately got AC for this

var
    N:integer;
   i:integer;

begin
   readln(N);
   if n=0 then writeln(0) else
   begin
      writeln('0');
      writeln('X');
      writeln('*');
      for I:=1 to n-1 do
      begin
         writeln(i);
         writeln('+');
         writeln('X');
         writeln('*');
      end;
      writeln(n);
      writeln('+');
   end;
end.

Who Can Post a just-solved program, I think it is hard to solve this
problem now.

I think that if there are more than 1 tests to task,
my program simultaneously start all of this, and they say the result
of first wrong.

If so, I can say that my program (the same with old right solution)
generates WA for N == 1 ! My output is the same with example but WA!

I tried very many things to get AC. I failed. If tests or task was
changed, change example, please!

In any case, there is a mistake on TIMUS. Can anybody write me
(o_09@star.math.spbu.ru) who can fix this mistake?
I send many letters to acm.timus.ru but no answer.

I think there are many people who tried to solve this problem for a
lot of time. I know at least 11 persons (exclude me). This is so bad,
that I have no words.

Who can advise me something?

Spb SU #9 - 1.

As far as I know the scheme of Horner:
f (x) = an + x*(an-1 + x*(an-2 + ...
gives the minimum operations needed to calculate the polynom

is there something wrong with the input or output of this problem
(the solution is obvious)

Thank you.

0
X
*
1
1
X
*
+
+

Why it isn't this?

I tried more than 3 versions of the prog, including one which wrote
one char/line, one which wrote a number/line, etc. All of them got
WA.

I don't have the slightest idea what to do. If anyone got AC on this
problem after the test data was modified, i would be grateful if he
would post the source code.

Thanx in advance.

I tried more than 3 versions of the prog, including one which wrote
one char/line, one which wrote a number/line, etc. All of them got
WA.

I don't have the slightest idea what to do. If anyone got AC on this
problem after the test data was modified, i would be grateful if he
would post the source code.

Thanx in advance.