DCP-513: Charming Numbers

[rayhan50001]

Why Time Limit is now 2s.
it was 2.5 / 4 s.

another thing is when i am trying to use bitset it takes much time.

Update:

my solution: https://pastebin.ubuntu.com/p/jzBSNQ8W5k/
verdict : TLE
memory: 184MB (according to CF)

how should i improve my code

[feodorv]

[rayhan50001]

link: http://codeforces.com/group/HtnK54FR7R/ ... /problem/D

i submitted my all possible solution. when i am trying to use two bitset it takes more time on devskill, and also i used O(n) sieve.

above link i submitted my code upto 30/34 times to check my time limit and memory.

and yes highest prime upto 200000000/15 is 13333291.

see this: https://paste.ubuntu.com/p/jd9Ps3Jdq8/

it accepted on CF with time 1076ms and memory:190MB

[rayhan50001]

update AC in C implementation.


re implementation always works.

thank you for pointing out " full of constant " and "char declaration".

i still confuse C implementation takes 1336ms on CF and on devskill 1.60s.
and C++ lowest 940ms on CF and devskill TLE.

i just implement BITSET in C that's it.

[feodorv]

Congrats!

The limits on CF are more friendly, yes. Here we have more competitive air.
And it's a big question why a bitset class is so slow on DevSkill.