I guess that there must be something wrong in the test of system.

Execution time is just 0.14 (even less), and Memory used: 2 008 KB

My solution:

        static void Main(string[] args)
        {
            char[] chs = Console.In.ReadToEnd().TrimEnd().ToCharArray();
            string tmpStr="";
            foreach (char ch in chs)
            {
                if (char.IsLetter(ch))
                {
                    tmpStr = ch + tmpStr;
                }
                else
                {
                    Console.Write(tmpStr+ch);
                    tmpStr = "";
                }
            }
            if (tmpStr != "") Console.Write(tmpStr);
            Console.ReadLine();

        }

Edited by author 26.02.2013 06:18

Edited by author 26.02.2013 06:34

program URAL1299(input,output);
  var n,np,m,mp,p,x,yg:longint;
    ch:char;
  procedure gfire;
    begin
      if (abs(yg)>=10)or(m=0)
         then writeln('FRONT ',x)
         else writeln( 'FIRE ',p);
    end;
  procedure bfire;
    begin
      if (abs(yg)>=5)or(m=0)
         then writeln('BACKWARD ',x)
         else writeln('FIRE ',p);
    end;
  procedure attack;
    begin
      readln(n,np);
      if n*np>=3*m*mp
         then gfire
         else bfire;
    end;
  procedure guard;
    begin
      if m=0 then begin
         writeln('STOP');exit;
      end;
      if abs(yg)<5
         then writeln('FIRE ',p)
         else begin
         if yg>=+5 then writeln( 'LEFT ',x);
         if yg<=-5 then writeln('RIGHT ',x);
         end;
    end;
  procedure defense;
    begin
      if m*20>=p
      then bfire
      else guard;
    end;
  procedure patrol;
    begin
      readln(yg);//yg:=yg+180;
      if m>0 then defense else begin
        if abs(yg)<=20 then writeln('FRONT ',x) else
        if abs(yg)>=160then writeln('BACKWARD ',x)else
           begin
             if yg<-90 then yg:=+180-abs(yg);
             if yg>+90 then yg:=-180+abs(yg);
             if yg>  0 then writeln('LEFT ',x)
                       else writeln('RIGHT ',x);
           end;
      end;
    end;
  begin
    readln(x,p);
    if x>100 then x:=100;
    if p> 20 then p:= 20;
    readln(ch);readln(m,mp,yg);
    case ch of
      'G':guard;
      'A':attack;
      'P':patrol;
      'D':defense;
    end;
  end.

??

Could you please give me the file of test node #11???

Combo fail: floating-point + division by zero
var y,n,m,c,e,f:int64;x,p:integer;
begin
read(n,m,y);
for x:=0 to m-1 do
begin
   f:=trunc(exp(ln(x)*n));
   if f mod m = y then inc(p);
end;
If p=0 then write ('-1');
for x:=0 to m-1 do
begin
   f:=round(exp(ln(x)*n));
   if f mod m = y then write (x,' ');
end;
end.
WHY????

test 6 is something like this:

1 1
.

answer:
1
1 1

I got TLE 15 times beacuse of this test!

check your solution for this case:

0 0 1 0
0 1 1 1

answer is -1.

How to optimize my code?
I know there is a lot of convertions from one type to another. How to avoid it? Or problem of speed not in convertions?

import sys, re, math
str1 = str(sys.stdin.readlines())
Data = re.findall('\\b\\d+\\b', str1)

for i in reversed (Data):
    print('%.4f' % math.sqrt(float(i)))

Edited by author 19.02.2013 23:58

I send my solution for problem 1837 in Java and got this. I used in my program Collections.sort, sun.misc.Queue, HashMap. Can anyone help me?

From the sample test and the test on board (a = 10000 and b = 1), I have worked out the solution by guessing, and ACed online.

For input a and b, the solution is:
(a ^ 2 + b ^ 2) / 4 + Sqrt(2) * a * b / 2

However, I could not find the proof for this.

Any help or suggestion for me?

It is very tempting to start solving using angles. But I would advice you to start with distances from the origin along x and y directions (say x and y). Following steps should easily guide you to the answer.
1) Area = 1/2*(xy+ ab Sin(ArcCos([a^2+b^2-x^2-y^2]/[2ab])))
2) Using partial derivatives show x=y
3) substitute x=y in area and using first derivative of area show that
   x^2= [a^2+b^2+sqrt(2)ab]/2
4) Substituting y=x and the result from (3) Area =[a^2+b^2]/4 + ab/sqrt(2)

Edited by author 08.02.2013 15:38

code1, code2 = [int(x) for x in input().split()]

if not (int(code1) % 2) or (int(code2) % 2):
    print("yes")
else:
    print("no")

#What's wrong?

This test helped me with WA#17:
5
5
1
right answer is 9

What 's special in 18'th test?

Hallo. I have already solved this problem, but I want try to do it on different languages. So I need help with VB.NET 2010. Explain me, please, how I should read the input data.

try:
3 2
0 0
0

Компилирую на компьютере, все нормально. Но на проверке ломается на первом же тесте.

#include <stdio.h>
#include <conio.h>
main()
{
  char A[999];
  int i=0, s=0, n=0;
  for (i=0;i<=999;i++)
    {
      A[i]='\n';
    }
  while (s!=1)
    {
      scanf("%c", &A[i]);
      if (A[i]=='\n') {s=1; n=i;}
      i++;
    }
  s=0;
  for (i=0;i<=n;i++)
    {
      switch (A[i])
        {
          case 'c': case 'f': case 'i': case 'l': case 'o': case 'r': case 'u': case 'x': case '!': s=s+3; break;
          case 'b': case 'e': case 'h': case 'k': case 'n': case 'q': case 't': case 'w': case 'z': case ',': s=s+2 ; break;
          case 'a': case 'd': case 'g': case 'j': case 'm': case 'p': case 's': case 'v': case 'y': case '.': case ' ': s=s+1 ; break;
        }
    }
  printf ("%d", s);
}

I used Djkstra search. Why didn't this work?
By the way, is 1<=K<=1000 or K may become zero or negative?

Sample Input:    Sample Output:
6                2 3
2 3              RT,
2 4              RT,
3 3              ,
3 4              B,
4 2              ,
4 3              .

I just wonder why there is only one comma on the end.
It seems that there should be two - first for squere "4 2" and second
squere "3 4".

So my question is what does this last comma referrs to ?
And obvious - why the other comma isn't in the output ?

Thank You.
Mike