Hi —

Recently I submit this solution to a polynomial FFT multiplication problem — POLYMUL.

Even on my computer — this solution runs very slow, and I cannot identify the reason. I'm wondering if anyone can assist in optimizing this solution — there must be something wrong for it to run so slowly.

Thanks in advance, Disguised

Hi —

Recently I took look at problem from Hackerrank BACK TO SCHOOL CODESPRINT called Xor Subsequence. I'm wondering if there is solution to this problem that doesn't utilize FFT.

Link to problem

Hi,

I was wondering whether anyone can help me solve this problem from POI. I have reduced the problem to finding a rooted tree with all vertices in the given tree that has 2*l leaves, but cannot get past this point. Any hints/solution are appreciated.

-Disguised