ICPC Live Archive 7895 - Just in Time URI 2353 – JUST IN TIME

uva Zinnatul Islam Morol Friday, February 01, 2019

Problem link


A solution in c++






Tags
Zinnatul Islam Morol

Posted by Zinnatul Islam Morol

I love to introduce myself as a competitive programmer. I have a strong motivation for writing server-side code. I take a special interest in Designing REST and GraphQL APIs, Open source contribution, Querying databases. I love to learn new things. I'm highly motivated and ready for newer challenges and want to learn new technologies.

Post a Comment

2 Comments

  1. UnknownMonday 8 July 2019 at 11:42:00 GMT+6

    Yeah we need to find the biggest prime not greater than N, but why??

    ReplyDelete
    Replies
    1. Zinnatul Islam MorolMonday 8 July 2019 at 21:08:00 GMT+6

      you need to save maximum your balloons, so we know that prime number divisor is only 1 and own number. so you can find maximum prime number 1 to N and you can save maximum your balloons, understand idea ?

      Delete

If you have any doubts, Please let me know