Hi, everybody

In a good way after the contest i decided to see some solutions for E, then i opened the solutions by users 300iq [code] and aydarboss [code] and i found that the codes are the same instead user aydarboss added the big-integer library to the code to hide the crime.

thanks.

Hello Everyone,

ACM ECPC 2016 (Egyptian Collegiate Programming Contest) problem set will be available in Codeforces Gym on Sunday, 10/30/2016 18:30 Cairo time.

The problem set was prepared by msoos , Whistle, Hossam Samy, nooralasadi10, eagle93, muaztw, RedNextCentury, heba_gamal, Zanaty, ahmed gafer, Marcil, nnahas.

Good luck, and I hope you to enjoy the problem set.

Hello everybody,

I'm trying to solve this problem i noticed something in the tags "fast-moebius-transform" so i ask if someone has an idea about the topic or any idea to solve this problem.

My observation till now, - The total number of divisors for any given N will be at most 5^7

Many Thanks.

Hello everybody,

I think that codeforces rounds has many different types of contests now, such as Educational Codeforces Round, Normal Codeforces Round, CROC, and VK cup. so i suggest adding filter feature, like Training filter in GYM.

Why some red coders sometime try to get low rating? Example: .o.