| Name | Code | Successful Submissions | Accuracy |
|---|---|---|---|
| Traversing Grid | BTCODE_A | 14 | 8.81 |
| Finding Minimum | BTCODE_B | 3 | 9.09 |
| Fun With Inequalities | BTCODE_C | 37 | 23.2 |
| Maximum Profit | BTCODE_D | 99 | 23.28 |
| Recover Polynomials | BTCODE_E | 7 | 41.18 |
| Life Game | BTCODE_F | 41 | 34.45 |
| Coloring Trees | BTCODE_G | 10 | 18.33 |
| Trie Expectation | BTCODE_H | 19 | 34.55 |
| Permutation Game | BTCODE_I | 0 | 0 |
| Grid Tiling | BTCODE_J | 0 | 0 |
| Array Sorting | BTCODE_K | 2 | 0.95 |
Please read the rules before starting the contest
General Rules:
1. All the teams should register at: http://www.codechef.com/teams/register/BYTCDE11 before the contest starts. While registering, the teams should enter their CodeChef username in the "member information" text-box.
2. In case you are a new user, you will need to first register for a CodeChef ID here
3. Participation can be in teams of utmost 3 members (not necessarily from the same institute). Each participant should be the member of one and only one team.
4. Registrations are open till the contest begins.
5. Teams need to register on the Pragyan site as well to be eligible for prizes.
6. Teams will be able to view problems individually, but will be able to submit solutions only by logging in with their team id.
7. Discussion of strategy, suggestions or tips in the comments during a live contest shall lead to disqualification. Posting questions clarifying the problem statement is ok. Comments will be published only after admin approval during the contest. If you have any further queries, organizers will be available for chat during the contest at bytecode@pragyan.org
Rules for Ranking:
1. Users will receive one point for solving a problem (passing all test cases - no partial credit), regardless of the level of difficulty of that problem.
2. The final ranking is based on the total number of problems solved, ties broken by the total time consumed.
3. The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submission of the first accepted run plus 20 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved.
Announcements
The contest is now over. Hope you enjoyed playing the contest.
Congratulations to Egor & team sierpenski for solving 8 problems.
Prize winners will be declared soon.
Please give feedback here.
Judge solutions and test data can be downloaded here.
Solutions sketches for all problems can be downloaded here.
The prize winners are as follows:
Top 3 Global Teams:
01) Egor Kulikov
02) sierpinski
03) Navi
Top 10 Indian Teams:
01) Proof
02) UsualSuspects
03) phoenix
04) Simplex Ants
05) RIP
06) SK
07) Neuron
08) Heisenbug
09) ram
10) Hypothetical
Top 3 Teams from NITT
01) firewall
02) kompsci_nitt
03) Fanatic_Dreamers
Prize winners will be contacted individually to dispatch the prizes.
For any queries, just drop in a mail to bytecode@pragyan.org.
Fetching successful submissions
RECENT COMMENTS FOR THIS SECTION: