kitayuta

unsigned int fib(unsigned int n)
{
    if (n < 2) return n;
    else return fib(n - 1) + fib(n - 2);
}

kitayuta

library IEEE;
use IEEE.std_logic_1164.all;

use work.types.all;

entity clock_tb is
    end clock_tb;

architecture behavioral of clock_tb is
    signal clk : std_logic;

kitayuta

require 'set'

class Array
  def subsets
    (0..self.length).flat_map {|n| self.combination(n).to_a}
  end
end

def is_topology(x, o)
  o.to_a.subsets.all? do |osets|

kitayuta

#include <string>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <unistd.h>
using namespace std;

const string token="yazawa",base="http://not-522.appspot.com/coderunner/";

string query(string url) {

kitayuta

import pygame
from pygame.locals import *
import sys

ssize=(750,750)
pygame.init()
screen=pygame.display.set_mode(ssize)
rs=[]
while True:
    screen.fill((255,255,255))

kitayuta

Coq演習 第3回

kitayuta

Coq演習 第2回

kitayuta

Coq演習 第1回

kitayuta

#include <cstdio>
#include <algorithm>
#include <vector>
#include <climits>
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
using namespace std;

const int INF=INT_MAX/2;
vector<int> dstmp;

kitayuta

#include <cstdio>
#include <set>
using namespace std;
#define MP make_pair
typedef pair<int,int> P;
typedef pair<P,P> PP;
typedef long long ll;

int vx[]={1,0,-1,0},vy[]={0,1,0,-1};
char ban[1005][1005];