words = count_words(str, c); result = malloc(sizeof(char *) * (words + 1)); if (!result) return (NULL); // ... fill the array ... result[words] = NULL; return (result);
While Exam 00 simply tests your ability to interface with the 42 command-line environment and the examshell , Exam 01 demands actual algorithmic thinking and functional C coding. Passing this exam is crucial for building the momentum needed to survive the Piscine.
Exercises like ft_div_mod , which require using pointers to store the results of division and remainders. c piscine exam 01
While the exact problems vary, Exam 01 generally pulls from concepts covered in of the Piscine curriculum. Expect exercises ranging from Level 0 to Level 3. Level 0: The Absolute Basics
Are you having trouble passing , or is it the logic causing failures? What text editor are you currently using in the cluster? Share public link words = count_words(str, c); result = malloc(sizeof(char *)
The exam runs on a strict automated grading system (the Moulinette). Code that works "99% of the time" gets a score of 0. Pay absolute attention to these system rules:
Based on your progress, the system presents you with random exercises from a pool, grouped by difficulty level (e.g., Level 0, Level 1). If you pass an exercise, you move up in difficulty. If you fail, the exam will give you a different exercise of the same level with a lower point value. The key concepts you must master to succeed in Exam 01 are: Passing this exam is crucial for building the
If you fail, don't rush to resubmit. Use the 10 or 20-minute wait time to quadruple-check your logic.
Reversing arrays or copying data from a source string to a destination string. Archetype 2: Mathematical Operations
Exam 01 is usually the first serious hurdle. It bridges the gap from basic syntax to actual algorithmic logic. The primary focus is on , Conditions , and Arithmetic logic .
While the exam dynamically pulls from a pool of questions, the standard progression typically looks like this: Level 0: The Baseline