Things I've noticed:

1) (En) There is no other tags in the text of blog
(Ru) В тексте блога нет других тэгов <blog>

I believe the English translation implies that the text of the blog can't contain any tags at all except for <blog>

2) (En) string of small Latin between the symbols

Should it be "string of small Latin _letters_" ?

3) (En) consists a name of the blogger

Shouldn't it be 'consists of the name of' or 'contains the name of'?

4) (En) The input contains only small and capital Latin letters, digits, symbols greater than, lower than, slash, full stops, commas and underlining symbols.

Input may also contain line feeds - they're not mentioned in both translations.

5) (En) a list of those who’s blogs

Should be "whose", not "who's".

6) (En) you are to output s string “1: ”

"s string" -> "a string"

7) (En) A tag is the line that consist of

"consist" -> "consists"

My WA#7-program had two mistakes:
1) The output information about bloggers should have the same order as in the input. I.e. for sample test the answer

_denplusplus_
1:
2: strange_human, xoposhiy
3:

xoposhiy
1: _denplusplus_, strange_human
2: strange_human
3: strange_human

strange_human
1: _denplusplus_, xoposhiy
2: xoposhiy
3: xoposhiy

is wrong. By the way, there's nothing said about it in the problem!
But when I corrected this mistake I still had WA#7.

2) Wrong output: in several cases a comma was outputed before first name in list. Just a stupid mistake :) After correcting it I got AC.

Help!!! I have WA#17!!!

1
a
<blog>
<friend>x<friend>b<friend>c</friend></friend></friend>
</blog>

Thanks beforehand

The only trick is that the mentioned friends (type 1) may not be in the n blogger names.
a test:
1
<blog><friend>x</friend></blog>
answer:
a
1: x
2:
3:

1
Adham
<blog>
<friend>Siroj</friend>
<friend>Adham</friend>
 next friend is <friend>Agabek</friend>
</blog>

ans :

Adham
1: Agabek, Siroj
2:
3:

You can use STL and iostream without time limit:

typedef vector<string> VS;
typedef set<string> SS;
typedef map<string,SS> M;

getline(cin,s);

I just got a WA#5 on this problem. I've checked everything, can't understand what is wrong. Can anybody give me some tests or hints?

My program will not work if inside <blog> tag will be nested <blog>. It does not happen in tests, but I suggest to add notice to the statement that <blog> tag can be only top level and cannot be nested.

Alternatively test like this may be added:
2
a
<blog>
<blog>
</blog>
b
<blog>
<friend>b</friend>
</blog>
</blog>
b
<blog>
</blog>

i submit my solution over 100, but still crash #7, please give me tricky test.
sorry for my poor english.

One blogger can mark another as his friend more than once. Of course, you should print his name in the list of friends only once.
Good luck!

Sentence on page: "A is the string of small Latin between the symbols"

HTML source: "A <closing tag> is the string of small Latin between the symbols"

"closing tag" should be surrounded by < i> and < /i> (without spaces), not < and >.

Edited by author 04.02.2009 16:55

Al the bloggers’ names are different

(maybe All)?

Please tell 7 test :)

Here is my code!!! Please help me!!! What my mistake?
Const stroka='friend';
TYpe lmas=array[1..5000]of string;
VAR n     :integer;
    fr    :array[1..100]of string;
    a,b,c :array[1..100]of lmas;
    d,g,h :array[0..100]of integer;
Procedure INIT;
var i,j,p :integer;
    ch    :char;
    s,s1  :string;
begin
  readln(n);
  for i:=1 to n do begin
    readln(fr[i]);
    readln(s); j:=0; s1:='';
    while s<>'</blog>' do begin
      s1:=copy(s,pos('<',s)+1,6);
      while s1=stroka do begin
        p:=pos('<',s);
        if stroka=s1 then begin
           delete(s,pos('<',s),8);
           if copy(s,p,pos('<',s)-p)<>fr[i] then begin inc(j); a[i,j]:=copy(s,p,pos('<',s)-p); end;
        end;
        s1:=copy(s,pos('<',s)+1,6);
      end;
      s1:='';
      for p:=length(s) downto 1 do
        if s[p]<>' ' then begin s1:=s[p]+s1; if s1='</blog>' then begin s:=''; break; end else if length(s1)>7 then break;  end;
      if s='' then break; readln(s);
    end;
    d[i]:=j;
  end;
end;
Function FRIEND(x,y:integer):integer;
var i   :integer;
begin
  FRIEND:=0;
  for i:=1 to n do
    if x<>i then if fr[i]=a[x,y] then begin FRIEND:=i; exit end;
end;
Function OK(x,y:integer):boolean;
var i,j   :integer;
begin
  i:=FRIEND(x,y); OK:=FALSE;
  for j:=1 to d[i] do
    if a[i,j]=fr[x] then begin OK:=TRUE; exit end;
end;
Procedure SORT(var s:lmas;n:integer);
var i,j :integer;
    k   :string;
begin
  for j:=1 to n-1 do
    for i:=1 to n-j do
      if s[i]>s[i+1] then begin k:=s[i]; s[i]:=s[i+1]; s[i+1]:=k; end;
end;
Procedure SOLVE;
var i,j,p :integer;
begin
  for i:=1 to n do
    for j:=1 to d[i] do begin
      p:=FRIEND(i,j);
      inc(g[p]); b[p,g[p]]:=fr[i];
    end;
  for i:=1 to n do
    for j:=1 to d[i] do
      if OK(i,j) then begin inc(h[i]); c[i,h[i]]:=a[i,j]; end;
  for i:=1 to n do SORT(a[i],d[i]);
  for i:=1 to n do SORT(b[i],g[i]);
  for i:=1 to n do SORT(c[i],h[i]);
end;
Procedure OUT;
var i,j   :integer;
begin
  for i:=1 to n do begin
    writeln(fr[i]);
    write('1: '); j:=1; while j<d[i] do begin write(a[i,j],', '); inc(j); end; if a[i,j]<>'' then writeln(a[i,j]) else writeln;
    write('2: '); j:=1; while j<g[i] do begin write(b[i,j],', '); inc(j); end; if b[i,j]<>'' then writeln(b[i,j]) else writeln;
    write('3: '); j:=1; while j<h[i] do begin write(c[i,j],', '); inc(j); end; if c[i,j]<>'' then writeln(c[i,j]) else writeln;
    writeln;
  end;
end;
BEGIN
  INIT;
  SOLVE;
  OUT;
END.

Is it okay when my code gets accepted (0.35 seconds) and same code after few minutes gets TL.
I write programs in Java. And it was very hard for me to tune up my program to run it in time, because in this problem we have to read and write large amount of data. Usually jury increases timelimits for Java in such situations.
And most surprising thing:
why
BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
always gets TL
and
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
gets AC (sometimes :))))

How to get it in time using Java? Two different versions of my programs get TL on test 16 and test 9 (I tried to create less objects in this version but it is even slower).

PS: I use BufferedReader, StringTokenizer, Collections.sort() to sort ArrayList of strings and BufferedWriter. Which of that slows down my program?

1
a
<blog><c><friend>b</friend></c></blog>

Edited by author 13.06.2007 19:14

may be teg have space


P.S. Sorry my bad English

I have WA on test #7. I read about thing that blogger is not friend of himself. My program gives correct answer in this case.

There is a phrase in the statement, that we need to sort list alphabetically. So i have a question. if the list has three items "A" "a" and "_" which order we need to output?

Could somebody help me?

Thanks beforehand.