program p1008_image_encoding;
const
  ele:array[1..4]of char=('R','T','L','B');

var
  b,v:array[0..11,0..11]of boolean;
  e,e1,xx,yy,h,num,swap,i,j,s,t:longint;
  x,y:array[1..10]of longint;
  a:array[0..11,1..2]of longint;
  ret,k:string;

begin
  readln(ret);
  if pos(' ',ret)=0
    then begin
    val(ret,num);
    readln(x[1],y[1]);
    b[x[1],y[1]]:=true;
    for i:=2 to num do begin
      readln(x[i],y[i]);
      b[x[i],y[i]]:=true;
      end;
    {for i:=1 to num-1 do
      for j:=i+1 to num do
      if (x[i]>x[j])or((x[i]=x[j])and(y[i]>y[j])) then begin
        swap:=x[i];x[i]:=x[j];x[j]:=swap;
        swap:=y[i];y[i]:=y[j];y[j]:=swap;
        end;}
    writeln(x[1],' ',y[1]);
    for i:=1 to num do
      if not v[x[i],y[i]] then begin
      v[x[i],y[i]]:=true;
      e:=1;e1:=1;h:=1;
      a[1,1]:=x[i];a[1,2]:=y[i];
      while true do begin
        for j:=h to e do begin
        if (a[j,1]+1<=10)and(b[a[j,1]+1,a[j,2]])and(not v[a[j,1]+1,a[j,2]])
          then begin
          inc(e1);a[e1,1]:=a[j,1]+1;a[e1,2]:=a[j,2];
          v[a[j,1]+1,a[j,2]]:=true;write('R');
          end;
        if (a[j,2]+1<=10)and(b[a[j,1],a[j,2]+1])and(not v[a[j,1],a[j,2]+1])
          then begin
          inc(e1);a[e1,2]:=a[j,2]+1;a[e1,1]:=a[j,1];
          v[a[j,1],a[j,2]+1]:=true;write('T');
          end;
        if (a[j,1]-1>0)and(b[a[j,1]-1,a[j,2]])and(not v[a[j,1]-1,a[j,2]])
          then begin
          inc(e1);a[e1,1]:=a[j,1]-1;a[e1,2]:=a[j,2];
          v[a[j,1]-1,a[j,2]]:=true;write('L');
          end;
        if (a[j,2]-1>0)and(b[a[j,1],a[j,2]-1])and(not v[a[j,1],a[j,2]-1])
          then begin
          inc(e1);a[e1,1]:=a[j,1];a[e1,2]:=a[j,2]-1;
          v[a[j,1],a[j,2]-1]:=true;write('B');
          end;
        if j<>num then writeln(',') else writeln('.');
        end;
        if e1=e then break;
        h:=e+1;e:=e1;
      end;
    end;
  end
  else begin
     k:=copy(ret,1,pos(' ',ret)-1);
     val(k,s);
     delete(ret,1,pos(' ',ret));
     val(ret,t);
     x[1]:=s;y[1]:=t;
     num:=1;
     xx:=x[1];yy:=y[1];
     h:=1;e:=1;e1:=1;
     while ret<>'.' do begin
       for j:=h to e do begin
       readln(ret);
       for i:=1 to 4 do
         if pos(ele[i],ret)<>0 then begin
           inc(num);
           case i of
           1:begin x[num]:=x[j]+1; y[num]:=y[j]; end;
           2:begin x[num]:=x[j]; y[num]:=y[j]+1; end;
           3:begin x[num]:=x[j]-1; y[num]:=y[j]; end;
           4:begin x[num]:=x[j]; y[num]:=y[j]-1; end;
           end;
         end;
       end;
       h:=e+1;e:=num
       end;
     for i:=1 to num-1 do
       for j:=i+1 to num do
       if (x[i]>x[j])or((x[i]=x[j])and(y[i]>y[j]))
         then begin
         swap:=x[i];x[i]:=x[j];x[j]:=swap;
         swap:=y[i];y[i]:=y[j];y[j]:=swap;
         end;
    writeln(num);
    for i:=1 to num do writeln(x[i],' ',y[i]);
  end;
end.

please help me


Edited by author 28.09.2009 20:32

Remember, that in input there are "end-of-line characters".
And you must read string lines until your find "end-of-file characters".
If Java
while (in.hasNextLine()) {
   char input[] = in.nextLine().toCharArray();
      /* analyse-code
      */
}
This method (while(in.hasNext***()) often use, when you don't know the number of input data or you can find "end-of-line characters" in text line.


Edited by author 30.04.2009 18:26

Hi, I've solved this problem in C++ but when trying it in Java   I can't avoid TL on test11. What should I do in order ot improve my IO operations. I use BufferedReader and PrintWriter. I can share my code if necessary

Edited by author 26.09.2009 19:06

А призы то еще есть? ;)

I can't find my mistake, if someone know suggest me my mistake please:
#include <iostream>
#include <string>
#include <string.h>
using namespace std;

char* reverse(char* str)
{
    char* temp = new char[strlen(str) + 1];
    int i, n = strlen(str);
    if(str[n-1] == ',' || str[n-1] == '-' || str[n-1] == '.' || str[n-1] == '?' || str[n-1] == ':' || str[n-1] == ';')
    {
        temp[n-1] = str[n-1];
        n-=1;
    }

    for(i = 0; i<n; i++)
    {
        temp[i] = str[n - i - 1];
    }
    if(n == strlen(str) - 1)
        temp[i+1] = '\0';
    else temp[i] = '\0';
    return temp;
}


int main()
{
    string *as = new string[1000];
    int i = 0;

    #ifndef ONLINE_JUDGE
        freopen("input.txt", "rt", stdin);
        freopen("output.txt", "wt", stdout);
    #endif

    while(getline(cin,as[i++]))
    {

    }

    for(int j = 0; j<i-1; j++)
    {
        const char* str = as[j].c_str();
        char* ch = new char[strlen(str) + 1];
        strcpy(ch,str);
        //ch[strlen(str)] = '\0';
        //cout<<ch;
        char* temp = strtok(ch," ");
        cout<<reverse(temp);
        while(temp != NULL)
        {
            temp = strtok(NULL," ");
            if(temp != NULL)
                cout<<" "<<reverse(temp);
        }
        cout<<endl;
    }

    return 0;
}

Old TL was set according to slow testing computer. Now more than half of AC solutions work in 0.1 sec and faster.
So we decided to decrease TL to 1 sec. 10 authors lost AC.

RT.thx

Why?

1.You can't use ';' at the end of the program
2.You can't use space in the pro except in " " or ' '!

Hope it will be helpful for you!

Though I spent lot of time on it ,but it give me so much fun that I could never forget it!!!

>At first, neighbors of the lowest left pixel are specified

That is not true. The first pixel to be processed is the lowest among the leftmost ones, not vice verse.

My prog uses only
        private static byte[] mat;// max 3000 * 1 byte
    private static boolean ok;// 1 byte
    private static byte x, y; // 2 byte
    private static int n, m, i, j; // 4*4 byte=16 byte
field variables its memory cant be 5 510 KB.
total memory is 3019 B.
I cant understand why i'm getting memory limit on test6

Hello.
The 1001 problem is the third problem I attempted in this site and I am new here. I am not familiar with 64-bit compiler system. The code written by me resulted in a crash, so I need some help.
I wrote the code as follows:
#include<stdio.h>
#include<math.h>
int main()
{
    unsigned long long a[32768];
    long i=0;
    while(scanf("%I64u",&a[i])==1) i++;
    for(i=i-1;i>=0;i--)
       printf("%.4lf\n", sqrt(a[i]));
    return 0;
}

I do know there are some fatal faults....but I really need help.
Thanks.

var
a,b,c:integer;
begin
write('a,b='); read(a,b);
c:=a+b;
write('c=',c);
end.

What can be tricky test?

Note: edge unidirectional(not undirectional).

Edited by author 31.08.2010 01:23

My program gets the right results on each test in discussion of the 1033 problem but I always get WA on test №1!!! My mind is broken... please whyyyy... What's the matter?!

somebody please help. In case of multiple solution which one to aouput? all my efforts for AC seems to go in vain.