Octetpus

Keybase proof

I hereby claim:

• I am octetpus on github.
• I am bidouilleuse (https://keybase.io/bidouilleuse) on keybase.
• I have a public key ASAiSjKyc2Nr3eXCjzhhUXbqQZD1j3FkhGtk0enhxm3rxAo

To claim this, I am signing this object:

Octetpus

;;; droit-cours.el --- AUCTeX style file for droit-cours
(TeX-add-style-hook "droit-cours"
		    (function
		     (lambda ()
		       ;; Basic definitions
		       (LaTeX-section-list-add-locally '(
							 ("partie" -2)
							 ("titre" -1)
							 ("chapitre" 0)
							 ("section" 1)

Octetpus

TO sigle 
	REPEAT 360 [
		FORWARD 1
	LEFT 1
	]
	PENUP
	LEFT 180
	REPEAT 90 [
		FORWARD 1
		RIGHT 1

Octetpus

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>

typedef struct {
  int x;
  int y;
  int visited;
} city;

Octetpus

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

int main()
{
  char tab[1024];
  int index = 0;
    
  char expression[2049];

Octetpus

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

void removeSpaces(char* source){
  /*Simple fonction pour enlever les espaces d'une chaine de caractère*/
  char* i = source;
  char* j = source;
  while(*j != 0){
      *i = *j++;

Octetpus

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/
 
int sumDigits(int n){

Octetpus

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

long long sumDigits(long long n){
  long long t, sum = 0; 
  long long remainder;
  t = n;
 
  while (t != 0){