Hello everyone,

I have been a permanent participant in competitive programming for many years now. I have been participating in ACM-ICPC for 3 years now, and managed to qualify for the world finals 2017.

Now that I have graduated from the department of Computer and Automation Engineering in Damascus University, I want to share with you my graduation project: badminton playing robot. In this project I used many algorithms that I learned from competitive programming (such as BFS, LIS and of course a lot of geometry).

We used LIS to filter noise data of shuttle detection and BFS,DFS to implement Indoor Location System for robot tracking and queries like sum of sub-rectangle in an array, and we didn't use any libraries for image processing.

I’m so glad that I managed to use the techniques I learned from competitive programming in my project. I'm also delighted that I was able to prove wrong those who say that competitive programming isn’t applicable in practical life, since I wouldn’t have been able to do all of this without my experience in ACM and competitive programming.

Badminton playing robot: Flying object detection, tracking and interception in real time project video on youtube

I hope you check and enjoy this demo me and my graduation project team made on the basic ideas in our robot. Please feel free to write comments. I will be more than happy to answer any of your questions as well.

This project was ceated by Me Ahmad1, Majd Wardeh MajdWardeh and Omar Aljubbah Omarjh.

UPD: My new robot for WRO competition: WRO

Hello everyone, I faced this problem at my work, and I was wondering if anyone can help me with it?

A customer has a menu that contains 100 distinct items, and he only knows 6 shops where he can buy these items from.

Let's assume that every shop has all the needed items, and each Item_i has a shipping cost and a price.

Every shop has an offer, which says that if your bill is >= X, you will get a discount by Y%.

We have to help the customer to buy all the required items with the minimal total cost.

Please notice that every shop has its own shipping cost and price for every item, and that discounts only apply on the total bill price (but shipping costs are not included). The total final cost includes the price after the discount and the shipping cost of the chosen items.

I could only come up with a brute force (backtrack) solution that works in 6^100, which is too slow. Can anyone give me an idea to find the optimal solution within a reasonable complexity?

Hello!

I'd like to invite you to participate in an online mirror of HIAST Collegiate Programming Contest 2016. (Higher Institute for Applied Science and Technology is one of the best academic Institution in Syria) The contest will be held on codeforces gym, and will start on Thursday 11 Augest 2016 11:00 AM UTC+2 .

You will be given 5 hours to solve the problems.

The difficulty will be similar to Div2 round .

Good Luck and have fun!

Contest is over! Editorial