Skip to content

Instantly share code, notes, and snippets.

View sota1235's full-sized avatar
🤟
software engineer

Sota Sugiura sota1235

🤟
software engineer
View GitHub Profile
#! /usr/bin/ruby
# Date 2014/02/08
# Created by sota1235
require 'open-uri'
# 成功したら配列から削除
$array = [*1..1368]
def save_pic(url)
/* Created by sota1235
* Date:2014/02/14
*/
PImage img, img2;
img = loadImage("path/image");
int w = img.width, h = img.height;
size(w, h);
img2 = createImage(w,h,RGB);
# !/usr/bin/env python
# -*- coding:utf-8 -*-
# Written by sota1235
# Date 2014/3/2
import sys
"""
board上の(x,y)の縦横斜めの値にnを足す
while True:
n = int(raw_input())
if n == 0: break
print sum(map(int, list(str(n))))
while True:
a,b = map(int, sorted(raw_input().split()))
# GCD
for i in range(a, 1, -1):
if a%i == 0 and b%i == 0:
GCD = i
break
# LCM
for i in range(1, a+1):
if (b * i) % a == 0:
#!/usr/bin/python
def sieve(n):
nums = [i+1 for i in range(2, n, 2)]
ans = [2]
while len(nums) != 0:
for i in range(nums[0]*2, nums[-1]+1, nums[0]):
if i in nums: nums.remove(i)
ans.append(nums.pop(0))
return ans
for i in range(1,101): print "FizzBuzz" if (i%3==0 and i%7==0) else ("Fizz" if i%3==0 else ("Buzz" if i%7==0 else i))

GitHubを使うための準備(OS X 10.8)

by sota1235

概要

GitHubを使うための手順です

  • Homebrewのインストール
@sota1235
sota1235 / prime.py
Created April 14, 2014 06:15
エラトステネスの篩を頑張って高速化する
#!/usr/bin/python
import math
def sieve(n):
nums = [i+1 for i in range(2, n, 2) if (i+1) % 3 != 0 and (i+1) % 5 !=0]
ans = [2,3,5]
while nums[0] <= math.sqrt(n):
for i in range(nums[0]**2, nums[-1]+1, nums[0]):
if i in nums: nums.remove(i)
ans.append(nums.pop(0))
@sota1235
sota1235 / prime.py
Created April 14, 2014 06:45
エラトステネスの篩 -暫定最強版-
def sieve(n):
num = [True]*n
num[0] = num[1] = False
for i in xrange(2,int(n**0.5)+1):
if num[i]:
for j in xrange(i**2, n, i):
num[j] = False
return [i for i in xrange(2,n) if num[i]]
print sieve(999999)