Hi Codeforces. Today i sawGreenGrapesolution of the problemD. Robot Vacuum Cleaner:35053688. And i find there : #definedebug(...)fprintf(stderr,__VA_ARGS__),fflush(stderr)while(t--){clock_tz=clock();solve();debu
Given a number x and a number y how can I count the number of relatively prime numbers with x that are less then y? More Formally; Is there any way to count how many z exists that:(1<=z<=y and gcd(x,z)==1) (x<=4005,y<=10^9). Sorry for my bad England....
Codeforces Round #277(Div. 2) (A Calculating Function, B OR in Matrix, C Palindrome Transformation) View Code