1-01-01から1年間の記事一覧

テスト用ページ

あ

Cookie Clicker Android v.06 Phase 2 Strategy

== Day 21 == CpS Cost Bank 2.22T 192.00Qa 19.59Qa (5.1h) +0.579% 64.00 [UPG:Bingo:GMGM4%] +5.000% 128.00 [UPG:Bingo:5%] <A Wrinkler 1> <A Wrinkler 50> <A Wrinkler 200> <A Pledge 1> <A Pledge 5> <A Pact> CpS Cost Bank 2.32T 293.09Qa 28.18Qa (6.4h) +0.359% 256.00 [UPG:Bingo:GMPT5%] +3.963% 17.09 PR:16…</a></a></a></a></a></a>

prime number calculation

Sieve primes upto 2^32 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> class pbuf { public: int sizbit; unsigned int siz0; unsigned char *buf; unsigned long long starti; pbuf(int bit) { sizbit=bit; siz0=1<<(bit-3-1); buf=(unsigned char *)malloc(si</math.h></string.h></stdlib.h></stdio.h>…

Cookie Clicker Android v.6 Phase 1 Strategy

== Day 1 == CpS Cost Buy 10.00 499.34 GM:01-04 14.00 166.00 CS:01-07 <A6 CS:1><A7 CS:2> 14.70 100.00 [UPG:CS1] 15.40 174.90 GM:05 <A9 Bake 1.0k> 16.40 1.10k FM:01 (1m) <A9 FM:1> 24.40 201.14 GM:06 25.40 1.00k [UPG:GM1] 31.40 1.15k GM:07-10 39.40 2.72k FM:02-03 (1m) 55.40 547.70 C</a9></a9></a7></a6>…

Cookie Clicker Early stage strategy

J

Manual Clicks 5/sec 00:00:03 C001 00:00:22 C[1](20 s) [Achievement: 100 cookies] 00:01:01 C[2](39 s) 00:01:02 C002 00:01:03 C003 00:01:04 C004 00:01:05 C005 00:01:07 C006 00:01:08 C007 00:01:10 C008 00:01:12 C009 00:01:14 C010 00:01:35 FM0…

クッキークリッカー v.1.0375 称号 Hardcore

J

Achievementは92持ち越し。HC400枚。アップグレードなしで1,000,000,000枚クッキー -- hour 000(000): Chips 0 : Acv 92 -- 9.00e-01 C001 +15 clicks 1.80e+00 C002 +15 clicks 2.70e+00 C003 +15 clicks 3.60e+00 C004 +15 clicks 8.10e+00 GM001 (10 s) +…

クッキークリッカー v.1.0375 Heavenly Chips 2000枚の場合の戦略

J

Achievementは92持ち越し。 -- hour 000(000): Chips 0 : Acv 92 -- 4.10e+00 C001 +15 clicks 8.20e+00 C002 +10 clicks 1.23e+01 C003 +8 clicks 1.64e+01 C016 1.31e+02 C[1] 2.62e+02 C[2] 4.26e+02 FM019 3.40e+03 GM030 4.36e+03 GM[1] 5.14e+03 FM[1]…

クッキークリッカー二周目以降の戦略

J

Achievementは88〜92持ち越しを想定。 リセット一回目はチップ177枚でスタート -- hour 000(000): Chips 0 : Acv 92 -- 4.54e-01 C001 +15 clicks 9.08e-01 C[1](15 s) +92 clicks 1.82e+00 C002 +8 clicks 2.72e+00 C003 +8 clicks 3.63e+00 C004 +9 clicks…

クッキークリッカー戦略、一周目

J

-- hour 000(000): Chips 0 : Acv 1 -- 1.00e-01 C001 +15 clicks 2.00e-01 C[1] (16 s) +98 clicks [Achievement: 100 cookies] 4.00e-01 C[2] (33 s) +196 clicks 8.00e-01 C002 +4 clicks 1.20e+00 C003 +4 clicks 1.60e+00 C004 +5 clicks 2.00e+00 C005…

クッキークリッカー戦略、旧データ

J

Old, V1.036 -- hour 000: 0 Chips : 1 Acv -- CpS Buy Wait time 1.00e-01 C001 +15 clicks 2.00e-01 C[1] (16 s) +98 clicks 4.00e-01 C[2] (33 s) +196 clicks 8.00e-01 C002 +4 clicks 1.20e+00 C003 +4 clicks 1.60e+00 C004 +5 clicks 2.00e+00 C005 +…

クッキークリッカー3周目以降の戦略

J

リセットするタイミング。その周での獲得HC/その周のプレイ時間、が最大になる時点。 Reset 2 HC 642 (+247) hour 1.8875e+02 HC/H 1.31 Cookie 206,430,000,000,000 Reset 3 HC 922 (+279) hour 3.7772e+02 HC/H 1.48 Cookie 425,079,000,000,000 Reset 4 H…

クッキークリッカー二周目以降の戦略

J

Achievementは86〜88持ち越しを想定。 リセット一回目はチップ168枚でスタートし、+227枚獲得でリセット Start HC 168 +HC 227 Cookies 78,210,000,000,000,000 -- hour 000: 0 Chips : 86 Acv -- 4.60e-01 C001 +3 clicks 9.20e-01 C[1] (15 s) +20 clicks …

Seating Optimization

code

Solve http://q.hatena.ne.jp/1355418360 #include <stdio.h> #include <math.h> #include <stdlib.h> class WangLandau { public: // 1-dim constructor WangLandau(long long emin, long long emax,double pip = 0.2, int histmin=10000); // constructor for multi-dimensional energ</stdlib.h></math.h></stdio.h>…

Enumeration of Self-Avoiding Walks

up.c #include <stdio.h> #include <stdlib.h> #define DIM 2 // square lattice #define NDIR (2*DIM) int L; // grid size int nsite; // = (L+1)^2 int *f_visited; // 0/1 = un/occupied int *nnp; // neighbour index int drvec[NDIR][DIM] = { {-1,0}, {0,-1}, {1,0}, {0,</stdlib.h></stdio.h>…

Maximize (L1+L2+..)!/L1!L2!..

Under restriction of Li>1 and L1+2L2+3L3..=N #include <stdio.h> #include <stdlib.h> #include <math.h> #define NMAX 300 int N; double lfactab[NMAX]; // log(n!) double logfac(int n) { double res=0; int i; for(i=2;i<=n;i++)res += log(i*1.0); return res; } // tabulize l</math.h></stdlib.h></stdio.h>…

French fry Length distribution Monte Carlo

#include <stdio.h> #include <stdlib.h> #include <math.h> #include "mymath.h" #define RAD1 13.0 #define RAD2 10.0 #define RAD3 10.0 double ax1[3], ax2[3], ax3[3]; double co2; void i_axis() { double th1=rand()*1.0/RAND_MAX*3.14159*2; // 0 to 2pi double z=rand()*2.0/RA</math.h></stdlib.h></stdio.h>…

Optimization of grouping of 10 to 30 attendants

http://q.hatena.ne.jp/1317373518 #include <stdio.h> #include <stdlib.h> #include <strings.h> #include "wl.h" // default group size #define GS 4 int np;// number of attendants int ngroup; // number of groups int ns; // number of stages int *groupid, *nmember, *g_ofs; in</strings.h></stdlib.h></stdio.h>…

isort.h isort.cc

isort.h #ifndef BTREEH #define BTREEH // binary tree class class Btree { public: // insert a pointer associated with a key into the list class BtNode *Insert(int key, void *iptr); // delete a node class BtNode *Delete(class BtNode *bt); //…

multi-dimensional data comparison: using sort list

#include <stdio.h> #include <stdlib.h> #include "isort.h" #define NDAT 100000 #define DIM 10 class Obj { public: BtNode *bn[DIM]; int val[DIM]; int rank[DIM]; int idx; int flag; int flag2; class Obj *next; class Obj *prev; }; //simple list Obj *oHead=NULL; v</stdlib.h></stdio.h>…

multi-dimensional data comparison: simple comparison

#include <stdio.h> #include <stdlib.h> #define NDAT 10000000 #define DIM 3 class Obj { public: int val[DIM]; int rank[DIM]; int idx; int flag; int flag2; class Obj *next; class Obj *prev; }; //simple list Obj *oHead=NULL; void AddObj(Obj *o) { o->prev=NULL; </stdlib.h></stdio.h>…

Risk/Return calculation

//risk and return calculation #include <stdio.h> #include <stdlib.h> #include <math.h> // number of games #define N 100 // return #define R 1.5 // win prob #define P 0.8 // log of binary distribution probability // log( nCm p^n (1-p)^m) double logBP(double p, int n,</math.h></stdlib.h></stdio.h>…

Prime number table

#include <stdio.h> #include <stdlib.h> #include <strings.h> #include <math.h> int main(int argc, char **argv) { long long start = atoll(argv[1]); long long end = atoll(argv[2]); // make start even start -= start&1; printf("start = %015lld end=%015lld ",start, end); long long l</math.h></strings.h></stdlib.h></stdio.h>…

Z^Z^Z.. Julia set

#include <stdio.h> #include <stdlib.h> #include <math.h> // color stuff void hue2rgb(int hue, int vmax, int *r, int *g, int *b) { int *max=r; int *p1=g; int *p2=b; int h0= hue+60; if(h0>=360)h0-=360; if(h0>=240) { max=b; p1=r; p2=g; h0-=240; } else if(h0>=120) { max</math.h></stdlib.h></stdio.h>…

Z^Z^Z^Z .. Mandelblot set

#include <stdio.h> #include <stdlib.h> #include <math.h> // color stuff void hue2rgb(int hue, int vmax, int *r, int *g, int *b) { int *max=r; int *p1=g; int *p2=b; int h0= hue+60; if(h0>=360)h0-=360; if(h0>=240) { max=b; p1=r; p2=g; h0-=240; } else if(h0>=120) { max</math.h></stdlib.h></stdio.h>…

Marhjong win check: ver 0.1

%a.out 1112345678999 Initial:1112345678999 [OK]:(99)(*111)(*123)(456)(789) [OK]:(99)(*123)(*111)(456)(789) [OK]:(*22)(111)(345)(678)(999) [OK]:(11)(12*3)(*345)(678)(999) [OK]:(99)(111)(23*4)(*456)(789) [OK]:(*55)(111)(234)(678)(999) [OK]:(…

Marhjong win check: ver 0.2

%a.out 1112345678999 [23](111)(456)(789)(99) (123)[11](456)(789)(99) (111)(345)(678)(999)[2] (123)[45](678)(999)(11) (111)(234)[56](789)(99) (111)(234)(678)(999)[5] (123)(456)[78](999)(11) (111)(234)(567)[89](99) (111)(234)(567)(999)[8] (1…

Tetris AllRGB

// Block shapes // block type *7, rotation*4, x-posision*4 int nrot[7]; // number of rotated shapes int bs_wid[7][4]; // width int bs_ofs[7][4][4]; int bs_hei[7][4][4]; int bs_min[7][4]; //min y at x int bs_pos[7][4][4]; void init_bs_aux(i…

RingBuffer Code

RingBuf.h #ifndef RINGBUFH #define RINGBUFH // Ring Buffer manager class RingBuf { public: RingBuf(int size); void Loop1(); bool Loop2(); void Loop3(); int LoopIdx(); #define RBFOR(x) for((x)->Loop1();(x)->Loop2();(x)->Loop3()) // example:…

Diffusion-limited aggregation code

This code generates this picture http://allrgb.com/dla which uses each 2^24 color once and only once. DLA rule is tweaked a bit to generate nice picture.Save as dla.cc , just compile it cc dla.cc, and run "a.out Number.of.Seeds" // Bits pe…

AllRGB Monte Carlo

// Bits per plane. Must be even and <=8, namely either 2, 4, 6, 8 #define CBIT 8 //Address scheme 4=fastest #define ADR_SCHEME4 //Color Address scheme #define CADR_SCHEME0 //#define CIDX3 // norm L1 or L2N or HIE #define L1 // temperature …