Hi everyone,

X-Camp Academy will provide a Free USACO Mock test on Feb 18th, 4PM-8PM PT. Open to all, and FREE.

A brief introduction about X-Camp (x-camp.org): we are a silicon valley based institute focusing on foundation buildup for the majority of students, and competitive programming for students who are passionate about competitions.

Since founded in 2017, we have been proud of our systematic curriculum from beginner to master class level. More than 22 USACO Platinum division contestants in the past 2 years.

Top students from USACO Grandmaster Class: 5 students entered US National Camp in the past two years, and 2 current students are among the top 10 from the 22/23 Season Dec Platinum Division.

Some highlights:

a. Mock Test Problems are arranged by X-Camp Academy teaching research team and catch the newest USACO problem trends.

b. Simulation of a real competition environment. Best preparation for what’s to be expected for the coming USACO contest in late Feb.

c. Covering Bronze to Platinum levels.

d. On our own designed IDE and real-time ranking.

Registration form: https://forms.gle/uRtSjtpqcvsjXEQLA

Dear X-Camp friends, X-Camp has cultivated nearly 20 USACO Platinum division contestants in the past 5 years since its establishment. However, their codes and our teaching content have never been made public.

Since 3 X-Camp students accessed US Camp this year, there has been more inquiring about how exactly the top-level class work, and what are our students learning in class these days? Please follow me to find out more. It’s also time for you to vote — which code do you like the best?

This week's teaching content: Fast Fourier Transform

The Fast Fourier Transform(FFT) is one of the most important algorithms in the field of signal processing and data analysis. It reduces the complexity of computing the Discrete Fourier Transform(DFT) from O(N2) to O(NlogN) by exploiting the symmetry of the model itself.

Interestingly, this algorithm appears in many informatics competitions because of its excellent properties and wide range of applications. It is one of the most important knowledge points in number theory of competitions. Specifically, the algorithm helps players quickly compute convolutions to perform tasks such as generating function solutions, string matching, high-precision multiplication, polynomial multiplication, etc.

How is it taught? In a Way Where No Standard Answer is Provided.

So how is such a difficult algorithm taught? To be honest, if the standard code is given to the students directly, they tend to dig less into the algorithm without getting to the essence of it.

During the classes, the teacher only teaches the methodology without providing any guidance on code implementation, and encourages students to complete the implementation of the algorithm independently and add necessary comments. This will allow students to understand the algorithm thoroughly and develop good coding habits.

This knowledge point is indeed not easy to follow. With no access to the standard code, students will need to absorb it by themselves and add quite some comments. So here are all the codes!

Links to Codes A. https://www.ideone.com/yEkBY2 B. https://www.ideone.com/mo8ZYw C. https://www.ideone.com/MLcdwn D. https://www.ideone.com/rejh0z E. https://www.ideone.com/35iCAi F. https://www.ideone.com/fYB5iv G. https://www.ideone.com/cbyTP4

What are the voting criteria? Like alignment of codes, detailed comments, standardized labeling of variables, and more-we trust your professional judgment.

The deadline will be on May 6th EOD Pacific Time. Click on it and leave your comments on the codes.