OJ Board

IMHO, this problem is about graph coloring.
We have a bipartite graph with first set of vertices representing rows & second set of vertices representing columns. Row vertex is connected with appropriate column vertex
if and only if there is a rook in the appropriate cell.
So, we have to find a ...

Hi!
Your brute force algorithms obviously cant pass the online judge because in the worst case it has to make as much as 2^30 procedure calls .
:lol:

Note, that permutation number is just number of permutations which are lesser than given one (+1). So you just have to count all permutations which ...

Hi!

I tried to submit this program more than 30 times but always got WA.
Can anybody said me what is wrong?
Thanks in advance :-D

#include<vector>
#include<string>
#include<set>
#include<map>
#include<list>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<stdio.h>
#include<queue ...

Hi!

I can give you a hint if you want.
You should find first 10 pairs of numbers n, m with a property
that 1 + 2 + ... + (n-1) = (n+1) + (n+2) + ... + ,m

For example, 1 + ... + 5 = 7 + 8 = 15.

Here, n corresponds to the programmer house number and m to the maximum house number on this street.

Hi!

After small changes this program was submitted successfully.
The main bug was that you used lexicografical comparison in next function instead
of alphabetic one (function lessthan).
Also, youd better care about possible spaces in the input, nobody said that word starts
from the line beginning ...

Hi!
Im not sure but may be you should change

next_permutation(order, order+3)

to

next_permutation((VI::iterator)order, (VI::iterator)(order+3))

BTW, you can submit your solutions by email, in this case you will receive the reply with exact description of compilation error.