proveus's blog

By proveus, history, 5 months ago, In English

Hello everyone. Today i meet a problem like find the intersection areas of n rectangles. i use IT tree but i can't not solve with case have a area that more than 3 rectangles intersection. Very thanks you help me to solve this proplem.

Full text and comments »

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

By proveus, history, 11 months ago, In English

Hi guys. Today i meet the problem that calculate sum of (n / gcd(i,n)) with i = 1,...,n and n <= 1e7 and have 1e6 testcase with n. I can find sum of (n / gcd(i,n)) = sum of (t * phi(t)) with t is divisor of n and phi(t) is euler totient function. Help me to make it fast and can run 1s on codeforces. Thanks for your help.

Full text and comments »

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

By proveus, history, 2 years ago, In English

Hi. Today,i try a problem about number theory. This is a problem : Given three positive integers M, A, P where P is a prime number and find minimum positive integer B : M ≡ A^B (mod P) Sorry because my english is not good . Thanks your help about this problem

Full text and comments »

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