What's the test number 2 ?

1 20 19 18 17
2 21 22 15 16
3 24 23 14 13
4 25 8 9 12
5 6 7 10 11

I have WA5. Give me some explanation and tests please

What may be in test #5?

I think following phrase should be changed:
"Every member of each team must have friends in another team."

Because firstly I thought that every member must have more than 1 friend, since it is "friends".

so something like
"Every member of each team must have at least one friend in another team"
should work

that's so strange
I`m getting WA on test 1
my code prints for sample input #1
1
2
3
1
2
1 2
1 3
1 5
2 3
and for second :
1
2
1
2
1 2
1 4
2 3
3 4
please help me !
thank you

не могу решить

int main()
{
    int n;
    scanf("%d", &n);
    d[0] = 5;
    d[1] = 20;
    d[2] = 12;
    d[3] = 2;
    d[4] = 1;
    d[5] = 4;
    d[6] = 6;
    d[7] = 1;
    d[8] = 4;
    d[9] = 4;
    d[10] = 1;
    d[11] = 0;
    printf("%d", d[n]);
    return 0;
}

There is a typo in statement in the first part of it. The sentence:
"This numbers are not necessarily different"
should be written as:
"These numbers are not necessarily different".

Try this test (it helped me, but real test #36 has N = 10000):
7
4
4
4
5
5
5
5
Answer, of course, is for example
3
5
4
5

After AC, I find that the answer is NO.

Edited by author 20.08.2010 09:25

#include <iostream>
#include <vector>
#include <math.h>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
   long long m,h = 0,i,t,l,n,f;
   string a,s;
   cin >> a;
   s = a;
   for(i = a.length()-1 ;i >= 0 ;i--)
   s[h] = a[i],h++;

    f = s.length()-2;
    i = 0;
    n = f;

    while(n >= 1 && m != 0)
     {
        t = n;
        m = 0;
       while(i <= n - (n  / 2) - 1)
     {
         if(s[i] != s[t])
       {
          m = 1;
          break;
       }
        i++;
        t--;
     }
         n--;
         i = 0;
     }
        if(m == 0)
         n++;
       for(i = 0 ;i < a.length() ;i++)
        cout << a[i];
       for(i = n + 1 ;i < s.length() ;i++)
        cout << s[i];
        cout << endl;
    return 0;
}

Hello, pleaze help me to read data correctly in Java. I've spend a lot of time with no result.

The next 2^N worst-case algo gets AC.

searchSolution(i) {
   if (i==N+1) {
       throw new FoundException();
   }
   group[i] = 1;
   if (checkThisAndAdvsHasNotMoreThan1Adv(i)) {
      searchSolution(i+1);
   }
   group[i] = 2;
   if (checkThisAndAdvsHasNotMoreThan1Adv(i)) {
       searchSolution(i+1);
   }
   group[i] = 0;
}

............

try {
   searchSolution(1);
} catch (FoundException e) {
   outputResult();
}
output("NO SOLUTION");


Judges, please do something with it :)
This is cool graph problem, i think in order to get AC one should write O(N) solution :)
But this obvious brute-force gets AC
SAD :(

Edited by author 01.08.2016 10:52

What's mean this problem?   why the example one should output 14 3?

It seems that lots of people can solve this problem with hashing. Well, I'm using 64 bit hashing and am using sufficiently large prime p (I'm using the usual polynomial hashing i.e. s[0]+s[1]*p+s[2]*p*p ...). I have tried 5 different p's and I'm always catching collisions at test 52 !!! I added code to check for collision and keep working with a different random chosen p ... and now I get TL !!!

My question is: what is the smart solution to the problem that I have? What hashing have you used?

To admins: How can you guys make solutions with random p get collisions? That's probably a really good test. I know how to build anti-hash for certain p, but I cannot imagine a test that hacks 10 random p's in a row. Good job! Or more like "my solution sucks" :)