ABCDEF | Atcoder Beginner Contest 361 Solution Discussion

ABCDEF | Atcoder Beginner Contest 361 Solution Discussion
My submissions - atcoder.jp/contests/abc361/su...
Community discord server - / discord
LinkedIn - / yt403
Twitter - / aryanc403
My Atcoder Profile - atcoder.jp/users/aryanc403
Tags -
#icpc #ioi #codeforces #codeforcessolution #codeforcessolutions #codechef #codechefsolution #codechefsolutiontoday #atcoder #geekforgeeks #topcoder#hackerearth #hackerrank #hackerranksolution #hackerranksolutions #leetcode #leetcodesolutions #leetcodesolution #leetcodecontest

[@shahbazkhan1864]

good work

[@rushikeshkulkarni7758]

F is good, I used inclusion exclusion on kth root to solve it
With bit of precomputation, it got accept with 1ms runtime

[@mihirmallick1698]

Yeah, mine got accepted with 1ms runtime too. Though I only considered counting numbers of the form a^p, where p is a prime, so this reduced the task to checking 2,3, 5, 7, 11, ... , 59th power of numbers and applying inclusion exclusion on that

[@anshsingh9739]

Won't there be (N+1) places where we can have 2 consecutive Dots.

[@aryanc403]

Yes, we will have N+1 places.

[@shitposting2234]

I was able to solve ABCE . Any tips for solving problems with lower constraints? I am only able to solve O(n) and O(nlogn) ish solutions and just can't think when the constraints are lower

[@tommyshelby6277]

i am so dumb for D still

[@Ahryno781]

is G that hard?

[@aryanc403]

I felt it was hard, but editorial makes it look easy.