Egyptian Informatics Olympiad 2009

Hanadi has N flower pots each with a unique flower. The pots are arranged along a line. One day she decided to change their order under the condition that no two pots that were originally next to each other remain next to each other. Find no of days she can continue this way :

For 5 pots there are 14 orders satisfying Hanadi’s condition, assuming the original order of pots was “ABCDE” then the 14 possible orders are:

ACEBD ADBEC BDACE BDAEC BECAD CADBE CAEBD CEADB CEBDA DACEB DBEAC DBECA EBDAC ECADB

Note by Anurag Choudhary
4 years, 6 months ago

No vote yet
6 votes

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Probably Catalan numbers, but that's just my first guess.

Ivan Stošić - 4 years, 6 months ago

Log in to reply

principle of IEB,let the unrestricted cas e be N,that is n factorial,now by the principle,we knw N(A1 un A2 unA3....An)=N-n(1)+n(2).......

Nayan Pathak - 4 years, 6 months ago

Log in to reply

Comment deleted Nov 11, 2013

Log in to reply

That would be infinity

Avinash Iyer - 4 years, 6 months ago

Log in to reply

Answer would come from some kind of recurrence relation and for your information correct answer is is (N - 1)! - Σk! (k from 0 ko N-2)

Anurag Choudhary - 4 years, 6 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...