ypizarroza's blog

By ypizarroza, history, 7 years ago, In English

Hello users!

We are glad to invite you to take part in the 11th edition of "The COJ Progressive Contest".

The contest duration is 10 days (from 2017-06-05 16:00:00 to 2017-06-15 16:00:00). The tasks are in English. The allowed programming languages are C, C++, C++11, C#, Java, Ruby, Pascal and Python. The contest will be held on the rules for progressive competitions in the COJ. If you have any question, please feel free to ask on [email protected]

To participate you need to have an account in the Caribbean Online Judge (COJ — http://coj.uci.cu/user/createnewaccount.xhtml). You don't need to register in the contest: the registration in the contest is effective with the first submission.

The challenge is as follows: The problems are divided by difficulty levels, and in the beginning you only have access to the first level of problems. In order to gain access to the next level of problems, you must solve a specific number of problems from the current level (defined by the Contest-Setter). Not all levels require the same amount of problems and, of course, we design each level to be more challenging than the previous one. About the ranking of the contest: There will be not penalty time for rejected submissions. There will be not (less or more) points by solve any problem after or before another user. Points are assigned when you solve a problem. Each problem has a fixed number of points, so no matter the number of users who solved it will always worth the same. The gained points are in this form: TPOINTS / (TLEVELS — PLEVEL + 1) where TPOINTS is the Total Points defined for all the problems in the contest, TLEVELS is the Total Levels defined for the contest and PLEVEL is the level of the given problem. Note that problems in the first level gives you TPOINTS / TLEVELS points, and problems on the last level gives you TPOINTS points (full points). The higher the level, the more points are gained. If two users have the same points in the ranking, the user who has solved its problems before, must be in a higher rank. For this 11th edition of "The COJ Progressive Contest" we have 6 levels of problems, and you need to solve 4 problems from each one to pass to the next level. On the other hand, you can solve 25 problems in the entire contest to see (unblock by special rule) all the problems in all the levels. The value for TPOINTS is 60 points (in this edition).

Problems by levels: Level 1: 7 problems. Level 2: 6 problems. Level 3: 5 problems. Level 4: 5 problems. Level 5: 4 problems. Level 6: 3 problems. Can you get to the last level? Can you solve all the problems? This is the real challenge for you!

We hope that you enjoy it very much. Thank you and have fun!

Full text and comments »

  • Vote: I like it
  • +16
  • Vote: I do not like it

By ypizarroza, history, 9 years ago, In English

We are glad to invite you to take part in the 1st Edition of the COJ Round Contest link.... This is a iniciative of some usual cuban problemsetters of COJ in order to give you more chances of training and solving problems about computing algorithms.

Full text and comments »

  • Vote: I like it
  • -2
  • Vote: I do not like it

By ypizarroza, 9 years ago, In English

All interested, in learn a new method extremely fast for calculate the fibonacci numbers. Please read the next article link... It's very good.

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it

By ypizarroza, 9 years ago, In English

I'm studing Matrix exponentiation please someone can give me some exercice that can solve.

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it

By ypizarroza, 9 years ago, In English

please someone that help me whith this problem http://www.spoj.com/problems/POWERUP/ i'm using the fermat little theorem a^p-1=a (mod p). Grace in advance

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it