ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1651. Shortest Subchain

Testset is weak!
Posted by Teacher30 16 Nov 2008 20:24
AC in 0.14... but on my tests my program works > 2 sec.
If I understand statements right, this test is correct:

#include <cstdio>

int main()
{
  int n = 10000, sum = 0;

  printf("%d\n", 99951);
  for (int i = 6; i <= n; i++)
  {
    printf("1 %d 2 %d 3 %d 4 %d 5 %d ", i, i, i, i, i);
    sum += 10;
  }
  puts("1");
  sum++;
  fprintf(stderr, "%d\n", sum);
  return 0;
}
Re: Testset is weak!
Posted by Vladimir Yakovlev (USU) 20 Nov 2008 00:55
Your test was added. Solutions were rejudged.