Vincent Massey's Seven Week Challenge is back! In the seven weeks leading into CCC, we'll be writing weekly contests to prepare everyone for it. Each contest will have three problems, in order of difficulty: Bronze, Silver, and Gold. You'll have a week to solve them all, so take it easy.
In this contest, you'll follow a scrappy young computational mathematician by the name of Leo Feng as he realizes his dreams: Project Feng, a weapon to surpass Project Euler. Under his guidance, you will learn the secrets to prime factorization, the mysteries of logical thinking, and the lost art of Russian palindrome cultivation.
The problem writer for this week is JeffreyZ. Bronze and Silver should be solvable with Python. Gold was done in C++ and I'm not going to make any guarantees about that one.
This round will be unrated.
The contest consists of three problems with a difficulty range similar to that of CCC Junior. If you cannot solve a problem fully, we encourage you to go for partial marks.
After joining the contest, you proceed to the Problems tab to begin. You can also go to Users if you wish to see the rankings.
We have listed below some advice as well as contest strategies:
- Start from the beginning. Ties will be broken by the sum of times used to solve the problems starting from the beginning of the contest. The last submission time of your highest score will be used.
- Remove all extra debugging code and/or input prompts from your code before submitting. The judge is very strict — most of the time, it requires your output to match exactly.
- Do not pause program execution at the end. The judging process is automated. You should use
stdoutto perform input / output, respectively.
- It is guaranteed that all the problems will be solvable with C++.
Don't panic. Good luck!
|VM7WC '16 #1 Bronze - A New Prime Factorization||3||28.7%||202|
|VM7WC '16 #1 Silver - Project Feng: Multiple Statements||5||17.8%||88|
|VM7WC '16 #1 Gold - Russian Palindrome Cultivation||10||13.1%||60|