Skip to content

Instantly share code, notes, and snippets.

// ==UserScript==
// @id iitc-plugin-power-of-defense@Route288
// @name IITC plugin: Power of Defense
// @category Layer
// @version 0.0.1.20140810
// @namespace https://github.com/jonatkins/ingress-intel-total-conversion
// @updateURL https://dl.dropboxusercontent.com/u/4145113/IITC-plugin-Defense-power.user.js
// @downloadURL https://dl.dropboxusercontent.com/u/4145113/IITC-plugin-Defense-power.user.js
// @description Show diffense power of resonators on map.
// @include https://www.ingress.com/intel*
\sum_{i=m}^{n} f(x) = f(m) + f(m+1) + \cdots + f(n) \\
# coding: utf-8
# Here your code !
import numpy as np
# (n Σ i = m) = func(m) + func(m+1) + ... + func(n)
def sigma(m, n, func, s = 0) :
if m > n: return s
return sigma(m + 1, n, func, s + func(m))
print(sigma(1, 10, lambda x : x))
static void Main(string[] args)
{
var sources = "123456789";
var comm = " +-";
var insertPoint = sources.Length - 1;
var commCount = comm.Length;
const int value = 100;
@sheepcloud
sheepcloud / script.js
Created March 2, 2014 13:56
三和数 JavaScript
//var elem = [ 3,11,12,102,111,120 ];
var elem = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15];
var maxVal = Math.max.apply(null, elem);
function IsTreeAddingNumber(n1, n2, n3) {
var flags = new Array(elem.length);
var addingArray = new Uint32Array(4);
addingArray[0] = parseInt(0);
addingArray[1] = parseInt(n1);
@sheepcloud
sheepcloud / Program.cs
Created May 15, 2012 04:58
貼り付けテスト
using System;
using System.Collections.Generic;
using System.Windows.Forms;
namespace WindowsFormsApplication1
{
static class Program
{
/// <summary>
/// アプリケーションのメイン エントリ ポイントです。