I hereby claim:
- I am ZweiSpeedruns on github.
- I am iamzwei (https://keybase.io/iamzwei) on keybase.
- I have a public key whose fingerprint is A883 0EB3 992B C4D1 91D3 04BE 34BF EECE 365B B9CF
To claim this, I am signing this object:
| # omitted most of file | |
| futures = "0.3.12" | |
| rand = { version = "0.8.3", features = ["small_rng"] } | |
| switchyard = "0.1.1" |
| use bevy::prelude::*; | |
| use std::collections::HashSet; | |
| pub struct InputPlugin; | |
| impl Plugin for InputPlugin { | |
| fn build(&self, app: &mut AppBuilder) { | |
| app | |
| .add_startup_system(connection.system()) | |
| .add_system(connection.system()) |
| { | |
| "FilePath": "D:/home/Project/Blitz/Work/Map/Fld_ShootingRange_Shr/Fld_ShootingRange_Shr.muunt", | |
| "Objs": [ | |
| { | |
| "Anim0": "TalkB", | |
| "AnimStartFrame": 0, | |
| "Id": "obj208", | |
| "IsEnableOverlookFade": false, | |
| "IsLinkDest": false, | |
| "LayerConfigName": "Tmp", |
| /* | |
| * Lattice point counter in C | |
| * | |
| * Works by using shoelace formula for area and then using Pick's theorem from | |
| * there in order to find internal lattice points. External lattice points are | |
| * found using gcd, which is implemented via the Euclidean Algorithm. | |
| */ | |
| #include <stdio.h> | |
| #include <stdlib.h> |
| import authinfo | |
| import json | |
| import requests | |
| import time | |
| jar = requests.cookies.RequestsCookieJar() | |
| jar.set('iksm_session', authinfo.cookie) | |
| base_url = "https://app.splatoon2.nintendo.net" | |
| shop_url = base_url + "/api/onlineshop/merchandises" | |
| hook_url = authinfo.hook_url |
| { | |
| "gachi":[ | |
| { | |
| "start_time":1533002400, | |
| "end_time":1533009600, | |
| "stage_b":{ | |
| "name":"Wahoo World", | |
| "image":"/images/stage/555c356487ac3edb0088c416e8045576c6b37fcc.png", | |
| "id":"20" | |
| }, |
I hereby claim:
To claim this, I am signing this object:
| def polymult(a, b): | |
| exp = 10 | |
| ares = 0 # evaluate a at x | |
| for ac in a: | |
| ares = (ares<<exp) + ac | |
| bres = 0 # evaluate b at x | |
| for bc in b: | |
| bres = (bres<<exp) + bc |
| 0 (0m0s): 1.0000 | |
| 3 (0m1s): 1.0000 | |
| 6 (0m2s): 1.0000 | |
| 9 (0m3s): 1.0000 | |
| 10 (1m0s): 1.0000 | |
| 12 (0m4s): 1.0000 | |
| 13 (1m1s): 1.0000 | |
| 15 (0m5s): 1.0000 | |
| 16 (1m2s): 1.0000 | |
| 18 (0m6s): 1.0000 |
| 0 (0m0s): 0.003000 | |
| 3 (0m1s): 0.002855 | |
| 6 (0m2s): 0.002718 | |
| 9 (0m3s): 0.002587 | |
| 10 (1m0s): 0.002546 | |
| 12 (0m4s): 0.002464 | |
| 13 (1m1s): 0.002425 | |
| 15 (0m5s): 0.002349 | |
| 16 (1m2s): 0.002312 | |
| 18 (0m6s): 0.002240 |