C

@cstuny

Examen level 1 ft_putstr.c version courte

C
1 year ago
#include <unistd.h> void ft_putstr(char *str) { while (*str) write(1, str++, 1); } int main(void)

Examen Level 1 otone.c

C
1 year ago
#include <unistd.h> void ft_putchar(char c) { write(1, &c, 1); } void rotone(char *s) { while (*s)

Examen Level 1 ft_putstr.c

C
1 year ago
#include <unistd.h> void ft_putstr(char *str) { while (*str) write(1, str++, 1); }

Examen Level 1 izzbuzz.c

C
1 year ago
#include <unistd.h> void ft_write_number(int number) { if (number > 9) ft_write_number(number / 10); write(1, &"0123456789"[number % 10], 1); } int main(void)

Examen level 1 first_word.c

C
1 year ago
#include <unistd.h> int main(int ac, char **av) { if (ac == 2) { while (*av[1] && (*av[1] == ' ' || *av[1] == '\t')) ++av[1]; while (*av[1] != '\0' && (*av[1] != ' ' && *av[1] != '\t')) write(1, av[1]++, 1);

Examen Level 1 rot_13.c

C
1 year ago
#include <unistd.h> void ft_putchar(char c) { write(1, &c, 1); } int rot_13(char c) {

Examen level 1 ulstr.c

C
1 year ago
#include <stdio.h> int main() { printf("Hello world!\n"); return 0; }

Examen Level 1 search_and_replace.c

C
1 year ago
#include <unistd.h> int main(int argc, char **argv) { int i; // we only need three parameters if (argc != 4) { write(1, "\n", 1); return 0; }

Examen Level 1 repeat_alpha.c

C
1 year ago
#include <unistd.h> int letter_count(char c) { int repeat; if (c >= 'A' && c <= 'Z') repeat = c - 'A' + 1; else if (c >= 'a' && c <= 'z') repeat = c - 'a' + 1;

Examen level 1 ft_strcpy.c test printf a tester dans vim

C
1 year ago
#include <stdio.h> #include <unistd.h> char *ft_strcpy(char *s1, char *s2) { int i; i = 0; while (s2[i])

Examen Level 1 rev_print.c

C
1 year ago
#include <unistd.h> void ft_putchar(char c) { write(1, &c, 1); } int ft_strlen(char *s) {

C03 Ex00 copie fonction strcmp

C
1 year ago
#include <stdio.h> #include <string.h> int main(void) { char *firt; char *second; firt = "World!"; second = "World!";

C05 ex04 Fibonacci

C
1 year ago
/* int ft_fibonacci(int index) { if (index == 0 || index == 1) return (index); else if (index < 0) return (-1); else return (ft_fibonacci(index -2) + ft_fibonacci(index -1)); }

C05 Ex03 t_recursive_power.c

C
1 year ago
/* int ft_recursive_power(int nb, int power) { if (power < 0) return (0); else if (power != 0) return (nb * ft_recursive_power(nb, power -1)); else return (1); }

C05 Ex02 ft_iterative_power.c

C
1 year ago
int ft_iterative_power(int nb, int power) { int res_int; res_int = 1; if (power < 0) return (0); else { while (power > 0)

C5 Ex01 ft_recursive_factorial.c

C
1 year ago
/* int ft_recursive_factorial(int nb) { if (nb < 0) return (0); else if (nb <= 1) return (1); else return (nb * ft_recursive_factorial(nb -1)); // sens ne change pas meme resultat }

C06 Ex02 ft_rev_params.c

C
1 year ago
#include <unistd.h> void ft_putstr(char *av) { int i; i = 0; while (av[i] != '\0') { write(1, &av[i], 1);

C06 Ex01 ft_print_params.c

C
1 year ago
#include <unistd.h> void ft_putstr(char *av) { int i; i = 0; while (av[i] != '\0') { write(1, &av[i], 1);

C06 Ex00 ft_print_program_name.c

C
1 year ago
#include <unistd.h> void ft_putstr(char *argv) { int i; i = 0; while (argv[i]) { write(1, &argv[i], 1);

C03 Exercice 04 : ft_strstr ma version

C
1 year ago
/* char *ft_strstr(char *str, char *to_find) { int i; int j; if (to_find[0] == '\0') return (str); i = 0; while (str[i])