va_list args; va_start(args, fmt); int count = 0; while (*fmt) if (*fmt == '%') else count += write(1, fmt, 1); fmt++; va_end(args); return (count);
| Project | Difficulty | Trap | Why interesting? | |---------|------------|------|------------------| | | High | Handling %p (null pointer prints "(nil)" ? Or 0x0 ?) | It's the real test of parsing and variadic functions. | | get_next_line | Medium | The static variable, buffer size 1 edge case, newline hunting. | It forces you to understand static memory across calls. | exam rank 02
Start with ft_printf . If you nail its parser, you've proven you understand memory and flags. If you struggle after 1 hour, abort to get_next_line . Pass 3: The "No Man Page" Survival (Remaining time) You will forget syntax. It's fine. Keep these in your muscle memory: va_list args; va_start(args, fmt); int count = 0;
// Write these from memory NOW (practice before exam) #include <stdlib.h> // malloc, free #include <unistd.h> // write #include <stdarg.h> // va_list (for ft_printf) // ft_strlen - your lifeline size_t ft_strlen(const char *s) | | get_next_line | Medium | The static
size_t i = 0; while (s[i]) i++; return (i);
if (!s) return ; write(fd, s, ft_strlen(s));
Go get that rank 02. 🎓