Hello Codrforces,

I don't have a quite strong grisp of FFT, although I have a question, what if I wanted to apply FFT on an array whose size is not a power of two, pretty much every implementation I've seen on the interent assumes the length of the input array is a power of two, would it be possible to pad the array with zeros?

I'm wondering what the right approach would be? Thank you all

Hello pals!

I used to look for such a thread this time of year and as the ACPC (Arab Collegiate Programming Contest) is getting closer, where all the qualifying national contests to the ACPC have been conducted -the event starts in less than two weeks- I couldn't find a list of the teams advanced to the ACPC with their codeforces handles, so I thought we could start one.

I think it's fun to get to know the participants as well as the exquisite team names.

Please if you're going to the ACPC, leave a comment with your tame name, university, country and teammate handles, I'll update the blog every night.

See ya there and good luck!

Hey codeforces, I have two issues and I need your help in them :

1. Last round Codeforces Round #287 (Div. 2) I faced such an odd issue, I solve the first problem and I submit it, luckily my code has passed the pretests, then during the system test my code failed at case 30, since the problem A was such an easy, unmistakable problem, I opened the test cases to see where did my code fail, I found that, my code print a 67 elements which actually more than the whole input (whereas the problem was to select some elements from input) . I work on Code::Blocks IDE, which has g++ compiler, and submit my code at GNU G++ 4.9.2 compiler on codeforces as I always do, I revised my code, and make sure it's totally correct, I tried to submit it again at Microsoft visual C++ 2010, and it got AC . Could anyone explain what happened ?

2. I tried to solve B. DZY Loves Chemistry and almost I have the same problem above, my computer correctly produces answers and I got WA on test 4, here is my submission . I debugged my code and checked the array each step I modified it, and all went right, I tried to submit it at another compiler but it still gets WA on test 4, I roughly made sure that, my algorithm/code were absolutely right, but couldn't realize why that happens

Any tips, tricks, and notes would be appreciated, and I'd be so grateful if someone elaborates what exactly happens to evade it in the next times. Thanks in advance codeforces :")

(sorry for bothering but I don't post this, till I ran out of my all attempts to figure out what's going on in these issues)

Hey there,

I participated today at the elimination round and it was awful (as a platform, I hope it was held on CodeForces) I stuck in the first problem and I spent almost two hours on it, I submitted it five times and I got it wrong answer ( They warned us "The decision of the judges are final in all matters." ) Finally I lost my enthusiasm and I turned my computer off, Now I'm surprising that all my attempts were AC . I think it's gunna be unfair to determain the winners and the qualifiers depending on this round. Even though I'm not that good to participate in "onsite" round but I was worth a better rank Hopefully BYN will do something due these mistakes we faced .

How it went with you guys ?

Hello

I am a newbie in this field and I have tried to solve such a trivial problem, first time my code got wrong answer on test 6 then I fixed it and it's getting MLE, I tried so much to recognize why my code crams the memory down but I culminated with no thing, here is my submission I would be so grateful if anyone could help me ! Thanks in advance