kira924age

• This is Visualization of Simple Solving A Maze by C.

• To generate gif file, we need ImageMagick.

• We can generate gif file following commands.

• DFS

gcc main.c img.c -std=c99 -o main && ./main dfs;

kira924age

#include <stdio.h>
 
int main(int argc, char *argv[])
{
    int n;
    unsigned long long int count = 0;
    FILE *fp;
 
    if(argc != 2){
        puts("Usage: hex [file_name]");

kira924age

package main

import (
	"database/sql"
	"encoding/json"
	"fmt"
	"log"
	"net/http"

	"github.com/go-chi/chi"

kira924age

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

void swap(char *x, char *y) {
    char tmp; tmp = *x;
    *x = *y;
    *y = tmp;
}

void *reverse(char *s) {

kira924age

#!/usr/bin/env python2
# coding: utf-8

import itertools

def decrypt(msg, k):
    m = "*" * len(msg)
    c = 0
    for i in k:
        for j in range(i, len(msg), 8):

kira924age

#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <cstdlib>
#include <cctype>

using namespace std;

void str2arr(string s, string A[]) {

kira924age

#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <cstdlib>
#include <cctype>
#include <cstdio>

using namespace std;

kira924age

def era(n)
    $primes = Array.new(n, true)
    $primes[0], $primes[1] = false, false
    (2..Math.sqrt(n)).each do |i|
        if $primes[i]
            (i * i).step(n, i).each do |j|
                $primes[j] = false
            end
        end
    end

kira924age

#!/usr/bin/env python2
# coding: utf-8

def caesar(s, n):
    d = {}
    for c in (65, 97):
        for i in range(26):
            d[chr(i+c)] = chr((i+n) % 26 + c)

    return "".join([d.get(c, c) for c in s])

kira924age

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

void *test(char *s) {
    int i;

    for (i = 0; i < strlen(s); i++) {
        // ポインタが指す値を表示する3通りの方法
        printf("%c\n", s[i]);
        printf("%c\n", *(&s[0] + i));