*Hello All,*

Thank to all for participating in the last contest (FOUNDATION-ACM CONTEST). Here goes some discussion about the problems:

(A) Can you solve it?

Problemsetter: Anupam Bhattacharjee

This is the easiest problem. Just derive a formula. Dont try to simulate.

(B) Easy Combination

Problemsetter: Anupam Bhattacharjee

This is one of the moderate problems. Use Bigint and derive combinatorial formula and use DP.

(C) Floor Tiles

Problemsetter: Yin Zhao (aka Bugz Podder)

This may be the hardest problem. Use DP.

(D) Menu

Problemsetter: Adrian Kuegel

This is one of the moderate problems. Use DP (something like 0/1 knapsack).

(E) What is the Card?

Problemsetter: Miraj Hasnaine & Anupam Bhattacharjee

This is also a moderate problem. Use mathematics to simulate it (need basic card game concept).

(F) Optimal House Placement

Problemsetter: Adrian Kuegel

This is one of the hard problems. Optimization problem.

(G) Chocolate Box

Problemsetter: A. K. M. Saifun Nabi

This is one of the easy problems. You need basic probability concepts.

(H) Danger Point

Problemsetter: Enamul Haque

This is one of the moderate problems. You may use formula or binary search.

(I) Determinate Prime

Problemsetter: Hasan Shihab Uddin

Though this problem seems easy it is one of the hardest problem (as there are many special cases). Read the problem description carefully.

-----------------------

Your inspiration is the best gift to us

Foundation Contest Team.

Thank to all for participating in the last contest (FOUNDATION-ACM CONTEST). Here goes some discussion about the problems:

(A) Can you solve it?

Problemsetter: Anupam Bhattacharjee

This is the easiest problem. Just derive a formula. Dont try to simulate.

(B) Easy Combination

Problemsetter: Anupam Bhattacharjee

This is one of the moderate problems. Use Bigint and derive combinatorial formula and use DP.

(C) Floor Tiles

Problemsetter: Yin Zhao (aka Bugz Podder)

This may be the hardest problem. Use DP.

(D) Menu

Problemsetter: Adrian Kuegel

This is one of the moderate problems. Use DP (something like 0/1 knapsack).

(E) What is the Card?

Problemsetter: Miraj Hasnaine & Anupam Bhattacharjee

This is also a moderate problem. Use mathematics to simulate it (need basic card game concept).

(F) Optimal House Placement

Problemsetter: Adrian Kuegel

This is one of the hard problems. Optimization problem.

(G) Chocolate Box

Problemsetter: A. K. M. Saifun Nabi

This is one of the easy problems. You need basic probability concepts.

(H) Danger Point

Problemsetter: Enamul Haque

This is one of the moderate problems. You may use formula or binary search.

(I) Determinate Prime

Problemsetter: Hasan Shihab Uddin

Though this problem seems easy it is one of the hardest problem (as there are many special cases). Read the problem description carefully.

-----------------------

Your inspiration is the best gift to us

Foundation Contest Team.