okumurakengo okumurakengo

## 円周率の計算チュドノフスキーの公式ベイリー＝ボールウェイン＝プラウフの公式.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                okumurakengo
                / 円周率の計算 チュドノフスキーの公式 ベイリー＝ボールウェイン＝プラウフの公式.ipynb
            
            
              Created
              June 22, 2022 20:56
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## フロイドの循環検出法.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                okumurakengo
                / フロイドの循環検出法.ipynb
            
            
              Created
              June 8, 2022 00:19
            
              
                フロイドの循環検出法
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## ガウス＝ルジャンドルのアルゴリズム.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                okumurakengo
                / ガウス＝ルジャンドルのアルゴリズム.ipynb
            
            
              Last active
              April 27, 2022 17:45
            
              
                jupyter test
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## a.py
import math
n = 30 # 30人の場合
print(1 - (math.factorial(365) / (math.factorial(365 - n) * (365 ** n))))

## index.php
<?php
if (!array_key_exists('category', $_GET)) {
    exit('¯\_(ツ)_/¯');
}

date_default_timezone_set('Asia/Tokyo');

$pdo = new PDO('sqlite:db.sqlite');
$pdo->exec(<<<'EOL'
    create table if not exists tbl_rss (

## index.js
(()=>{let old_id=document.getElementsByClassName("item-list")[2].firstElementChild.dataset.id;const timer=setInterval(()=>{let new_id=document.getElementsByClassName("item-list")[2].firstElementChild.dataset.id;console.log(old_id,new_id);if(old_id!==new_id){old_id=new_id;console.log("new toot!");new Audio("data:audio/wav;base64,UklGRnoGAABXQVZFZm10IBAAAAABAAEAQB8AAEAfAAABAAgAZGF0YQoGAACBhYqFbF1fdJivrJBhNjVgodDbq2EcBj+a2/LDciUFLIHO8tiJNwgZaLvt559NEAxQp+PwtmMcBjiR1/LMeSwFJHfH8N2QQAoUXrTp66hVFApGn+DyvmwhBTGH0fPTgjMGHm7A7+OZSA0PVqzn77BdGAg+ltryxnMpBSl+zPLaizsIGGS57OihUBELTKXh8bllHgU2jdXzzn0vBSF1xe/glEILElyx6OyrWBUIQ5zd8sFuJAUuhM/z1YU2Bhxqvu7mnEoODlOq5O+zYBoGPJPY88p2KwUme8rx3I4+CRZiturqpVITC0mi4PK8aB8GM4nU8tGAMQYfcsLu45ZFDBFYr+ftrVoXCECY3PLEcSYELIHO8diJOQcZaLvt559NEAxPqOPwtmMcBjiP1/PMeS0GI3fH8N2RQAoUXrTp66hVFApGnt/yvmwhBTCG0fPTgjQGHW/A7eSaRw0PVqzl77BeGQc9ltvyxnUoBSh+zPDaizsIGGS56+mjTxELTKXh8bllHgU1jdT0z3wvBSJ0xe/glEILElyx6OyrWRUIRJve8sFuJAUug8/y1oU2Bhxqvu3mnEoPDlOq5O+zYRsGPJLZ88p3KgUme8rx3I4+CRVht+rqpVMSC0mh4fK8ai

## index.js
document.body.style.position = 'relative'
document.body.insertAdjacentHTML('beforeend', `
<div class="user_css_container">
  <div class="user_css_box">
    <h1>簡易モーダル</1>
  </div>
</div>
<style>
    .user_css_container {
        box-sizing: border-box;

## index.html
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
    <link rel="stylesheet" href="./jquery-thickbox/thickbox.css">
</head>
<body>

## ishi.c
#include <stdio.h>
#include <stdlib.h>

int main(void)
{
    int x, r, my_turn;
    int one_times_max = 5;
    int total = 22;

    printf("最後に石を取った側が負けです. パスはできません.\n");

## marrige.c
#include <stdio.h>
#include <stdlib.h>
#define N  3  /* 各性の人数 */

int
  /* 添字(女性1..3) => 値(男性1..3) */
  boy[4] = {0, 0, 0, 0}

  /* 各女性の好み */
  // rank[女性1..3][男性1..3] = ランク
	import math
	n = 30 # 30人の場合
	print(1 - (math.factorial(365) / (math.factorial(365 - n) * (365 ** n))))
	<?php
	if (!array_key_exists('category', $_GET)) {
	exit('¯\_(ツ)_/¯');
	}

	date_default_timezone_set('Asia/Tokyo');

	$pdo = new PDO('sqlite:db.sqlite');
	$pdo->exec(<<<'EOL'
	create table if not exists tbl_rss (
	document.body.style.position = 'relative'
	document.body.insertAdjacentHTML('beforeend', `
	<div class="user_css_container">
	<div class="user_css_box">
	<h1>簡易モーダル</1>
	</div>
	</div>
	<style>
	.user_css_container {
	box-sizing: border-box;
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<title>Document</title>
	<link rel="stylesheet" href="./jquery-thickbox/thickbox.css">
	</head>
	<body>
	#include <stdio.h>
	#include <stdlib.h>

	int main(void)
	{
	int x, r, my_turn;
	int one_times_max = 5;
	int total = 22;

	printf("最後に石を取った側が負けです. パスはできません.\n");
	#include <stdio.h>
	#include <stdlib.h>
	#define N 3 /* 各性の人数 */

	int
	/* 添字(女性1..3) => 値(男性1..3) */
	boy[4] = {0, 0, 0, 0}

	/* 各女性の好み */
	// rank[女性1..3][男性1..3] = ランク