niyaton

from bs4 import BeautifulSoup

track2track = {
    'EDU - Software Engineering Education': 'EDU',
    'ERA - Early Research Achievements': 'ERA',
    'SEIP - Software Engineering in Practice': 'SEIP',
    'Technical Track': 'Technical Track'
}

# This file includes appended modal data.

niyaton

# http://editorconfig.org
root = true

[*]
indent_style = space
charset = utf-8
trim_trailing_whitespace = true
insert_final_newline = true
end_of_line = lf

niyaton

passwd
/etc/init.d/sshd start

mkdir $HOME/.ssh
echo 'ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQDhyahXc6freX92BWsjeRZ8Rdw6Oyma/XXab/+fdEHzbV2jGdtqiUzPxDAUXB5gX381EcYZ1BgmmpU1dC4LjZnU+TKd92gFdCdWh+HVnGXP7e7tP5w4f1GpCqZ9X2mlndm91zF7S8+w0aD1BYk6pqaw6eK93CONzCfC+RAfZT+lYMvTZwn+ZUlypUN7szPyRXEYgvNzNfqIhwuWVHItpYw7JezwtZBnwfIF4RmZgGs5GDWQywrY+M1Dsz5VwjGC66bgQubfchD9POX+zCumIXVx2V9UqlkmVl6RZI19e7FMqXH6D5NNNB5uYvSAQZ4fxo7pbvObkCCcIrvXtCbun2aB' > .ssh/authorized_keys

niyaton

# Checking whther zplug is installed
if [[ ! -d ~/.zplug ]]; then
    git clone https://github.com/zplug/zplug ~/.zplug
fi

cat <<EOT > ~/.zshrc
# Essential
source ~/.zplug/init.zsh

# zplug check returns true if all packages are installed

niyaton

#include <stdio.h>

int main(){
	int n;
	
	printf("配列のサイズを入力してください");
	scanf("%d", &n);

	int array[n];
	int i;

niyaton

int a[10]; //配列には適切な値が入っていると仮定する
int tmp; // 一時的に利用する変数．（temporaryの略でtmp）

// a[0]とa[3]を交換する．
tmp = a[0]
a[0] = a[3]; //a[0] = tmpでもよい
a[3] = tmp;

niyaton

#include <stdio.h>

int main(){
  printf("Hello World!");
  return 0;
}

niyaton

# Initialize rbenv.
# "eval rbenv init -" is much heavy. use cached script.
if [ -n "$(printenv TMUX)" ]; then
  source $ZSHHOME/rbenv.init-no-rehash
else
	source $ZSHHOME/rbenv.init
fi

check_rbenv_init() {
	rbenv init - | diff - $ZSHHOME/rbenv.init

niyaton

def gen_fizz_buzz(n):
    for i in xrange(1,n):
        str = ""
        if i % 3 == 0:
            str += "Fizz"
        if i % 5 == 0:
            str += "Buzz"
        yield str if str else i

for i in gen_fizz_buzz(100):

niyaton

#include <stdio.h>
#define MAX 1000000

int is_prime(int n){
  for(int i = 6; (i-1) * (i-1) <= n; i+=6){
		if( n % (i-1) == 0 || n %(i+1) == 0)
			return 0;
	}
	return 1;
}