For POINPOLY, i got 100 points in one go.
Frankly, i try to make as less submissions as possible. Otherwise, in longs of 2017, many problems had near 50 submissions of mine, with really minor differences (never reached 100 i guess).
It’s too an achievement, achieved by only a few 
@cis_pie what about those cases in which the mid point of such chords are same, the code does not even checks for such duplicate points
So…looks like I am the only one who made 0 observations and crashed the party with rand() XDDDD I solved this Q only because rand() got me 70 points :3
There might be other users too, still in shadows, remaining masked unlike you.
remaining masked unlike you
Ironically, in real life I prefer remaining masked. I just dont like any kind of spotlight lol.
It's too an achievement, achieved by only a few ;)
True…but I still wont prefer it in Cook-offs 
:3
Probably that N=10 case was the trump card and should have been included for 70 pts case also as a lot of random techniques passed for 70 pts.
They had more N=10 cases in the 70 point subtask. Thing is, the deadliest one wasnt the one they expected- the 30 point one turned out to be deadlier than rest.
But still, "Brute force for N \le100 and apply the “random technique” for other N would still pass. So, its ok. 70 points turned out to be boaster for people tbh :3
Thanks! @taran_1407 got that part.(Thanks to MITOCW)
But can you please tell how you formed the matrix for cos(nx),
means why f[0][0] = 2v and f[0][1] = MOD-1 (why even that -1)
and that return part??
func()
{
…
1. F = new long[][]{{2v,MOD-1},{1,0}};
2. M = new long[][]{{2*v,MOD-1}, {1,0}};
3. power(N-1);
4. return mod(F[0][0]*v+F[0][1]);
}
And i am assuming that your power function works in the same manner, the power() and multiply() of method 4 of Program for Fibonacci numbers - GeeksforGeeks
Well, you won’t have that much time for a problem.
and if you had, RIP your rating if the problem is out of first 3.
Hard for you to remain masked, now that you are a moderator too, an active contributor.
I have posted an answer because it wouldn’t fit in comment.
And what if I skip first 3 and dive at 5? Still RIP 
:3 XD
Well, if u skip first 3, either u r too genius if u manage AC, and then solve others.
If u didn’t get AC in 5th and didn’t attempt, i will take it as intentional rating drop.
PS: I posted an answer below, but couldn’t get the LaTex right…, please help!!
Read about fermat’s little theorem, which states that if p is prime, then modular inverse of x can be found as x^(p-2) modulo p.
If p is not prime, but gcd(x, p) ==1 we may use extended euclid euclid algorithm.
All methods explained here Modular multiplicative inverse - GeeksforGeeks
Sorry, didnt notice! Will do right away
Since I am a moderator, I cannot be masked lol. Else who will people go to resolve queries? XD People will be like “And the legend says that there is some strange force- called a moderator- which looks after the forums. Unseen to the eye, nobody has ever seen or heard any of him” XDXD