cartman_nabana Cartman0

## getRssFeed.html
<!DOCTYPE html>
<html>
  <head>
    <meta charset="utf-8">
    <title>GoogleFeedApiテスト</title>
  </head>
  <body>
    <div id="codezine"></div>

    <script type="text/javascript" src="https://www.google.com/jsapi"></script>

## bitCount.java
/*
解説
http://www.mwsoft.jp/programming/java/java_lang_integer_bit_count.html
*/
public static int bitCount(int i) {
  i = i - ((i >>> 1) & 0x55555555);
  i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
  i = (i + (i >>> 4)) & 0x0f0f0f0f;
  i = i + (i >>> 8);
  i = i + (i >>> 16);

## slect_and_read_image_and_print_WidthHeight_image_DataURL_with_fileAPI.html
<!DOCTYPE html>
<html lang="ja">
  <head>
    <meta charset="UTF-8">
    <title>FileAPI で画像を選択またはドラッグ&ドロップし、表示</title>
    <style>
      html, body {
        font-size: 20px;
        text-align: center;
      }

## ProjectEuler_ 1_Solution.swift
// Project Euler #1 Solution in Swift
/*Project Eulerの1問目
http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%201
*/
func anyMultipleOf(value: Int, numbers: [Int]) -> Bool {
    return numbers.reduce(false) {
        any, number in
        print("any")
        print(" : ")
        print(any)

## SelectReadImage_withFileAPI_DrawImage_onCanvas.html
<!DOCTYPE html>
<html lang="ja">
  <head>
    <meta charset="UTF-8">
    <title>FileAPI で画像を選択またはドラッグ&ドロップし、Canvasで表示</title>
    <style>
      html, body {
        font-size: 20px;
        text-align: center;
      }

## UserAgentTest.html
<!DOCTYPE html>
<html lang="ja">
  <head>
    <meta charset="utf-8">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <title>UserAgent Test</title>
    <meta name="description" content="">

    <style>
      @import url(http://fonts.googleapis.com/earlyaccess/notosansjapanese.css);

## FileAPI_capture_camera.html
<!DOCTYPE html>
<html lang="ja">
  <head>
    <meta charset="utf-8">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <title>ファイル選択（カメラ起動）テスト</title>
    <style>
      @import url(http://fonts.googleapis.com/earlyaccess/notosansjapanese.css);
      html, body {
          font-size: 16px;

## Canvas_onkeydown_caeru.html
<!DOCTYPE html>
<html lang="ja">
	<head>
		<meta charset="UTF-8">
		<title>canvas</title>
		<style>
			@import url(http://fonts.googleapis.com/earlyaccess/notosansjapanese.css);
		  html, body{
				width: 100%;
				height: 100%;

## geolocation_test.html
<!DOCTYPE html>
<html lang="ja">
  <head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <meta name="description" content="">
    <title>現在地取得</title>
    <style>
      @import url(http://fonts.googleapis.com/earlyaccess/notosansjapanese.css);
      html, body{

## binary_search.cpp
#include <iostream>
#include <algorithm>

//二分探索
bool mybinary_search( const int a[], const unsigned int start_idx, const unsigned int end_idx, const int target, int& idx){
	unsigned int start = start_idx;
	unsigned int end = end_idx;
	while((end - start) >= 0){
		int mid = (end + start) / 2;
		if(a[mid] == target){
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<title>GoogleFeedApiテスト</title>
	</head>
	<body>
	<div id="codezine"></div>

	<script type="text/javascript" src="https://www.google.com/jsapi"></script>
	/*
	解説
	http://www.mwsoft.jp/programming/java/java_lang_integer_bit_count.html
	*/
	public static int bitCount(int i) {
	i = i - ((i >>> 1) & 0x55555555);
	i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
	i = (i + (i >>> 4)) & 0x0f0f0f0f;
	i = i + (i >>> 8);
	i = i + (i >>> 16);
	<!DOCTYPE html>
	<html lang="ja">
	<head>
	<meta charset="UTF-8">
	<title>FileAPI で画像を選択またはドラッグ&ドロップし、表示</title>
	<style>
	html, body {
	font-size: 20px;
	text-align: center;
	}
	// Project Euler #1 Solution in Swift
	/*Project Eulerの1問目
	http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%201
	*/
	func anyMultipleOf(value: Int, numbers: [Int]) -> Bool {
	return numbers.reduce(false) {
	any, number in
	print("any")
	print(" : ")
	print(any)
	#include <iostream>
	#include <algorithm>

	//二分探索
	bool mybinary_search( const int a[], const unsigned int start_idx, const unsigned int end_idx, const int target, int& idx){
	unsigned int start = start_idx;
	unsigned int end = end_idx;
	while((end - start) >= 0){
	int mid = (end + start) / 2;
	if(a[mid] == target){