I did so in the program:

void GoWrong()
{
 int a = 0;
 fprintf(Fou,"%d",1/a);
}

for (i=1; i<=n; i++)
 fscanf(Fin,"%*d %d %d %d", p[i], p[i]+1, p[i]+2);
for (i=1; i<=n; i++) for (j=0; j<3; j++) if (p[i][j]>0)
 if ( p[p[i][j]][0]!=i && p[p[i][j]][1]!=i && p[p[i][j]][2]!=i ) GoWrong();

and i really got RE(divided by 0). I think such testcase is illeagle. BTW if I use "if n=9 then writeln('2.0000')" I'll get AC.

There was an error in input of test 8.
I fixed it. Your first submit is AC now.

Edited by author 03.03.2006 17:38

I have exactly the same problem on test 20. I figured out (with binary search on what assertions failed) that some rope isn't matched, and after that I read your message, and, just for the sake of being precise, rewrote my code in the following way, copypasting from yours:

#define ASSERT(x) if (!(x)) while (1) cout << 1;else 1

...

int t[1000][4];
int n;

int main()
{
  int i, j;
  cin >> n;
  for (i=1; i<=n; i++)
    scanf("%*d %d %d %d", t[i], t[i]+1, t[i]+2);
  for (i=1; i<=n; i++) for (j=0; j<3; j++) if (t[i][j]>0)
    if ( t[t[i][j]][0]!=i && t[t[i][j]][1]!=i && t[t[i][j]][2]!=i )
      ASSERT(false);

...
}

This code gets Output Limit Exceeded on test 20. Replacing ASSERT(false) with ASSERT(true) in that line makes it get Crash at test 20, which means this exact assertion has failed.

Admins, please clarify.

[EDITED BY RYBAK]
The story looks very similar. Instead of ASSERT(false) I wrote:

    {
      cout << "1.0000";
      return 0;
    }

and got AC. Still I wonder how everyone else treat such situation?



Edited by author 02.03.2006 21:15

People must have a chance to AC this problem not reading forum before ))

I think, tests were corrected - I've ACed the problem without reading forum =)

It doesn't mean anything. In 20 test there is a block A, which connected to block B, but block B doesn't connect to block A.