約 2,658,175 件
https://w.atwiki.jp/toho/pages/5614.html
SAISEN TURN サークル：ALiCE S EMOTiON Alstroemeria Records Number Track Name Arranger Original Works Original Tune Length 01 Teip Bart A LiCE 東方花映塚 お宇佐さまの素い幡 [03 50] 02 Alone Selene's Light deadmino4ma 東方幻想郷 Selene's Light [04 35] 03 60 Red House ALiCE 東方花映塚 六十年目の東方裁判 ～ Fate of Sixty Years [05 17] 04 Calypso of Life Round Table Minoshima 東方妖々夢 ボーダーオブライフ [06 14] 05 Pon De Spark MAJOR ALiCE 東方永夜抄 恋色マスタースパーク [02 48] 06 Armagemyon Green Minoshima 東方妖々夢 東方妖々夢 ～ Ancient Temple [04 51] 詳細 M3-2010秋(2010/10/31)にて頒布 イベント価格：500円 ショップ価格：735円 レビュー 衝撃の話題作。 聴いた瞬間に元ネタが分かるので思わずにやけてしまう。 BeatPortで神ってる元曲から、"最先端"の元曲まで、お二方の趣味が全開となっている。 曲調は基本的に元曲に即しているので、いつもの簑島節は今回はあまり出ていない。 それにしてもdeadmino4maとはよく思いついたものである。 -- アルマーニ (2010-11-14 09 37 48) 名前 コメント
https://w.atwiki.jp/comedian/pages/1889.html
U-turnをお気に入りに追加 リンク１ ＜U-turn＞ #blogsearch2 キャッシュ ＜U-turn＞ 使い方 サイト名 URL リンク２ ＜U-turn＞ #technorati 報道 ＜U-turn＞ 北海道Ｕ・Ｉターンフェア2022春（WEB合同企業説明会） - 経済部労働政策局産業人材課 - hokkaido.lg.jp アンジャッシュ渡部、「初対面で印象悪すぎ」と土田晃之が明かす（SmartFLASH） - Yahoo!ニュース - Yahoo!ニュース 右折レーンはいつでもUターンしていいの？【今さら聞けない交通ルール】 | clicccar.com - clicccar.com(クリッカー) 土田晃之「有吉弘行を3ヵ月でクビに...後にも先にも有吉を追い込んだのは”S”... - テレビ東京 緊急時でもないのに高速道路で堂々とＵターン! この強引なおまわりさんは実在する!? 【交通取締情報】 - MotorFan[モーターファン] buntaro(R) Waraji Sandalsはただのサンダルではありません！！ - PR TIMES 土田晃之がヒロミに暴露された「ボキャ天」時代のコンビ不仲ぶりが闇すぎる！ (2020年1月10日) - エキサイトニュース ECのミカタ 企業HP 株式会社U-turn - ECのミカタ 土田晃之が起こした「Uターン事故」で「ボキャブラ」世代がザワザワ - アサジョ 欅坂メンバーが土田のためにＵ－ｔｕｒｎのネタを再現！ ファン「出来がすごい」と歓喜 - ZAKZAK 成分解析 ＜U-turn＞ U-turnの70%は果物で出来ています。U-turnの18%はハッタリで出来ています。U-turnの5%は媚びで出来ています。U-turnの3%は陰謀で出来ています。U-turnの2%は下心で出来ています。U-turnの2%は愛で出来ています。 ウィキペディア ＜U-turn＞ U-turn 掲示板 ＜U-turn＞ 名前（ＨＮ） カキコミ すべてのコメントを見る ページ先頭へ U-turn このページについて このページはU-turnのインターネット上の情報を集めたリンク集のようなものです。ブックマークしておけば、日々更新されるU-turnに関連する最新情報にアクセスすることができます。 情報収集はプログラムで行っているため、名前が同じであるが異なるカテゴリーの情報が掲載される場合があります。ご了承ください。 リンク先の内容を保証するものではありません。ご自身の責任でクリックしてください。
https://w.atwiki.jp/javadsge/pages/10097.html
script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.1/jquery.min.js" /script script var point = new Array(); var x = new Array(); var year = new Array(); var pointx = new Array(); var p1; function sample() { for (s = 1; s 1001;s++ ){ point[s] = 0; for(sx=1;sx 11;sx++){ if(Math.random() 0.5)point[s]=point[s]+1; } } for(sx=0;sx 11;sx++){ pointx[sx]=0; } for(s=1;s 1001;s++){ n = point[s]; pointx[n] = pointx[n] + 1; } paint(); } function paint(){ var sub=new svgpaint(); str=" svg width=\"500\" height=\"500\" "; str=str+sub.rect(0,0,500,500,"blue"); for(s=1;s 11;s++){ str=str+sub.rect(40*s,500-pointx[s],40,pointx[s],"red"); } str=str+" /svg "; $("#memo").html(str); } /script script class svgpaint{ chop(strp){ this.strx="\""+strp+"\""; return this.strx; } rect(x1,y1,w1,h1,col){ this.strx=" rect x="+this.chop(x1)+"\" y="+this.chop(y1)+"\" width="+this.chop(w1); this.strx=this.strx+"\" height="+this.chop(h1)+" fill="+this.chop(col)+"/ "; return this.strx; } text(x1,y1,size,strp){ this.strx=" text x="+this.chop(x1)+" y= "+this.chop(y1)+" font-size="+this.chop(size)+" "; this.strx=this.strx+strp; this.strx=this.strx+" /text "; return this.strx; } circle(x1,y1,r,col){ this.strx=" circle cx="+this.chop(x1)+"\" cy="+this.chop(y1)+"\" r="+this.chop(r)+" fill="+this.chop(col)+"/ "; return this.strx; } line(x1,y1,x2,y2,wide,col){ this.strx=" line x1="+this.chop(x1)+" y1="+this.chop(y1)+" x2="+this.chop(x2)+" y2="; this.strx=this.strx+this.chop(y2)+"style= \" stroke "+col+";stroke-width "+wide+"\"/ "; return this.strx; } } /script
https://w.atwiki.jp/mitsu_koh/pages/44.html
これは以前 Python 歴数ヶ月もない僕がコンテストでよく使うだろうと思われるコードをまとめたものです。 こういうまとめが欲しいなと思ったのですが見つけられませんでした。 調べながら書いているので間違っているところがあるかもしれません。 Python のバージョンは 2.6.5 です。3 以降とはけっこう違うところがあるので注意してください。 TODO 入出力 メモ化再帰 イテレーター おまじない #!/usr/bin/env python # coding utf-8 ? 演算子 1 if True else 0 # 1 配列 a[2][5] の宣言 a = [0 for i in xrange(2) for j in xrange(5)] スタック s = [] s.append(100) # push 100 s.pop() # pop and return 100 キュー q = [] q.append(100) # push 10 q.pop(0) # pop and return 100 プライオリティキュー from heapq import heapify,heappush,heappop pq = [] heapify(pq) # change to heap from list heappush(pq, 10) # push 10 heappop(pq) # pop and return 10 map d = dict() d = { a 0, b 1} d = dict(a=0, b=1) d = dict([[ a , 0], [ b , 1]]) len(d) # size d[ c ] = 2 # set key and value d.get( a , -1) # return d[ a ] if a in d else -1 d.pop( a , -1) # if d has key a , remove key a and return d[ a ] # if d don t have key a , return -1 d.clear() # clear a in d # check if d has key a a not in d # check if d don t have key a d.keys(), d.iterkeys() # return key list (iter an iterator over the keys) d.values(), d.itervalues() # return value list (iter an iterator over the values) d.items(), d.iteritems() # return (key, value) (iter an iterator over the items) set st = set() st = set([0, 1, 2, 3]) len(st) # size st.add(10) # insert 10 st.remove(10) # remove 10 (raises KeyError if not 10 in st) st.discard(10) # remove 10 (don t raise KeyError if 10 not in st) st.clear() # clear 10 in st # check if st has 10 10 not in st # check if st don t have 10 配列のソート import operator a = [] a.sort() a.sort(reverse=True) # reverse sort a.sort(cmp=lambda x, y -1 if x y else (0 if x == y else 1)) # sort with comparator a.sort(key=lambda x x) # sort with function which returns a key a.sort(key=operator.attrgetter( key )) # sort with function which returns the key ２分探索 from bisect import bisect_right, bisect_left a = [ 0, 1, 1, 2, 2, 2, 2, 3, 3, 3 ] bisect_left(a, 2) # 3 (lower_bound) bisect_left(a, 100) # 10 bisect_right(a, 2) # 7 (upper_bound) bisect_right(a, 100) # 10 bisect_right(a, 2) - bisect_left(a, 2) # 4 (a.count(2))
https://w.atwiki.jp/zikkenb5/pages/6.html
class Ie{ Pai[] haiPai=new Pai[13]; Pai tumo; //ツモ牌のセット void setTumo(Pai tumo){ this.tumo=tumo; } //チーのチェック ソートされていることが前提 public boolean checkChee(Pai p){ //字牌はチーできない if(p.getSyurui()==3){ return false; } int i; int j; for(i=0;i 12;i++){ if(p.getSyurui()==haiPai[i].getSyurui()){ if(p.getNumber()-2==haiPai[i].getNumber()){ for(j=i;(j 13) (p.getSyurui()==haiPai[j].getSyurui());j++){ if(p.getNumber()-1==haiPai[j].getNumber()){ return true; } } } if(p.getNumber()-1==haiPai[i].getNumber()){ for(j=i;(j 13) (p.getSyurui()==haiPai[j].getSyurui());j++){ if(p.getNumber()+1==haiPai[j].getNumber()){ return true; } } } if(p.getNumber()+1==haiPai[i].getNumber()){ for(j=i;(j 13) (p.getSyurui()==haiPai[j].getSyurui());j++){ if(p.getNumber()+2==haiPai[j].getNumber()){ return true; } } } } } return false; } //ポンのチェック ソートされてることが前提 boolean checkPon(Pai p){ int i; for(i=0;i 12;i++){ if(p.getSyurui()==haiPai[i].getSyurui() p.getNumber()==haiPai[i].getNumber()){ if(p.getSyurui()==haiPai[i+1].getSyurui() p.getNumber()==haiPai[i+1].getNumber()){ return true; } } } return false; } //牌のソート public void sort(){ int i,j,k,min; Pai p; for(i=0;i 13;i++){ k=i; min=haiPai[i].getToshiNumber(); for(j=i+1;j 13;j++){ if(haiPai[j].getToshiNumber() min){ min=haiPai[j].getToshiNumber(); k=j; } } p=haiPai[i]; haiPai[i]=haiPai[k]; haiPai[k]=p; } } //牌の表示 ！暫定！ public String toString(){ int i; String hyozi=""; for(i=0;i 13;i++){ hyozi+=haiPai[i].checkHyozi(); } return hyozi; } }
https://w.atwiki.jp/ookowaikowai/pages/19.html
using System; using System.Collections.Generic; using System.Linq; using System.Text; using DxLibDLL; namespace DesignProject { class KeyBoard { private byte[] data; private byte[] dataOld; public KeyBoard() { this.data = new byte[256]; this.dataOld = new byte[256]; } public bool Push(int Key) { if (this.data[Key] == 1) { return (true); } return (false); } public bool PushMoment(int Key) { if ((this.data[Key] == 1) (this.dataOld[Key] == 0)) { return (true); } return (false); } public bool Leave(int Key) { if (this.data[Key] == 0) { return (true); } return (false); } public bool LeaveMoment(int Key) { if ((this.data[Key] == 0) (this.dataOld[Key] == 1)) { return (true); } return (false); } public void Update() { this.dataOld = this.data; //GetHitKeyStateAllの引数他の修正が必要 DX.GetHitKeyStateAll(out this.data); } } }
https://w.atwiki.jp/yanprog/pages/27.html
単独の整数(n 2^31)を素因数分解する。使う場面は多分あまりない。それなりに早い。 factor.is_prime(ll n) ｎが素数かどうか判定。 prime_divisor(ll n) nを素因数分解(ソートして返す)。例えばn=60なら[2,2,3,5] factor.phi(ll n) ｎのオイラー関数 factor.divisor(ll n) nの約数全体を返す。例えば n=2なら [1,2,5,10] struct FACTOR{ static const int table_size=65536; vvl table; FACTOR(){ table.resize(table_size); for(int p=2; p table_size; p++){ if(table[p].size() 0)continue; for(int k=p; k table_size; k+=p){ int k2=k; while(k2%p==0){ table[k].pb(p); k2/=p; } } } } ll pow(ll a, ll n, ll m){ if(n==0)return 1; return pow(a*a%m, n/2, m) * (n%2==0 ? 1 a ) % m; } unsigned int gcd(unsigned int a, unsigned int b){ return a==0 ? b gcd(b%a, a); } bool miller_rabin_prime(ll n, ll a){ if(n%a==0)return false; if(pow(a,n-1,n)!=1)return false; ll s=1, d=n-1; while(d%2==0){ d/=2; s+=1; } ll v=pow(a,d,n); if(v==1)return true; while(true){ if(v+1==n)return true; if(v==1)return false; v=v*v%n; } } bool is_prime(ll n){ assert(n 0); if(n table_size)return table[n].size()==1; if(miller_rabin_prime(n,2) miller_rabin_prime(n,7) miller_rabin_prime(n,61))return true; } void prime_divisor(ll n, vl ret){ while(n%2==0){ ret.pb(2); n/=2; } while(n%3==0){ ret.pb(3); n/=3; } while(n%5==0){ ret.pb(5); n/=5; } prime_divisor_after(n,ret); } void prime_divisor_after(ll n, vl ret){ assert(n 0); if(n table_size){ REP(i,table[n].size())ret.pb(table[n][i]); return; } if(is_prime(n)){ ret.pb(n); return; } ll a=1,b=a*a+1; int step=0; while(true){ ll d=gcd(abs(a-b), n); if(d!=1 d!=n){ prime_divisor_after(d, ret); prime_divisor_after(n/d, ret); return; } b=(b*b+1)%n; b=(b*b+1)%n; a=(a*a+1)%n; step++; if(a==b){ a=step%n; b=(a*a+1)%n; } } } vl divisor(ll n){ vl ps; prime_divisor(n, ps); map ll, int cnt; REP(i,ps.size()) cnt[ps[i]]++; vl ret; ret.pb(1); EACH(pp, cnt){ vl ds; ll v=1; for(int k=0; k =pp- second; k++){ ds.pb(v); v*=pp- first; } vl ret2; REP(i1, ret.size()) REP(i2, ds.size()) ret2.pb(ret[i1]*ds[i2]); ret=ret2; } sort(ret.begin(), ret.end()); return ret; } ll phi(ll n){ vl ps; prime_divisor(n, ps); set ll set_ps(ps.begin(), ps.end()); EACH(pp, set_ps){ ll p=*pp; n=n/p*(p-1); } return n; } } factor; vl prime_divisor(ll n){ vl ret; factor.prime_divisor(n,ret); sort(ret.begin(), ret.end()); return ret; }
https://w.atwiki.jp/sakaj/pages/22.html
!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN" "http //www.w3.org/TR/REC-html40/strict.dtd" HTML HEAD Title /Title META http-equiv=Content-Type content="text/html; charset=shift_jis" Script function func(){ var div = document.getElementById( ddd ); var log = document.getElementById( log ); div.onclick=function(){ log.innerHTML = div.onclick ; } div.ondblclick=function(){ log.innerHTML = div.ondblclick ; } document.onclick = function(){ var ll = []; ll.push( getWindowWidth() +getWindowWidth()) ll.push( getWindowHeight() +getWindowHeight()) ll.push( event.screenX +event.clientX) ll.push( event.screenY +event.clientY) log.innerHTML = ll.join( Br / ); } } function getWindowWidth(){ var nss = [ window.innerWidth , document.documentElement.clientWidth , document.body.clientWidth ] return getUsableValue( nss ); } function getWindowHeight(){ var nss = [ window.innerHeight , document.documentElement.clientHeight , document.body.clientHeight ] return getUsableValue( nss ); } function getUsableValue( ValueNames ){ var vns = ValueNames; for( var i=0; i vns.length; i++ ){ if( IsGivenNs(vns[i]) ){ return eval(vns[i]); } } return null; } function IsGiven(o){ return typeof(o)!= undefined o!=null; } function IsGivenNs(Ns){ var nn = Ns.split( . ); var o = eval( nn.shift() ); if( !IsGiven(o) ){ return false; } for( var i=0; i nn.length; i++ ){ o = o[nn[i]]; if( !IsGiven(o) ){ return false; } } return true; } /Script /HEAD Body onload="func()" div id="ddd" ddd div div id="log" ddd div /Body /HTML
https://w.atwiki.jp/spellbreakjapan/pages/22.html
Excerpts from the Journal of Garrick, Enlightened Vowkeeper Book 4 - Page 48 The aftershocks started to subside not long ago. It has been only a few days since The Fracture but I can t know for sure. The first survivors who surveyed the devastation have all been consumed by the spellstorm. Even Fort Halcyon is said to be little more than rubble. Castle Bogmore is in disarray and there are no spare men to cover the lookouts. I fear the worst. Massive explosions ring out from the south, even as the quakes settle. Siren s Step had not needed defending in many seasons, so a fresh patrol was dispatched only four nights ago. The men returned this morning and said they had seen the edge of the world. At the cliffs the storm is still raging. Where there was once mountains and marshes, only clouds now remain. It is clear that the Highlands that I have called home have become hollow and I can t help but feel it is our fault. We received word last night that Longwatch still stands. There is little time to waste, we leave within the day. It saddens me that untold amounts of knowledge will be left behind but one day we will return. We must leave the Highlands now, no matter the cost. Book 4 - Page 73 I heard rumors that a group was able to return to the Hollow Lands and escape. Despite my distaste for these looters, I hunger for knowledge of the state of the world. Through my own means I was able to learn what they recovered. Besides several gauntlets, some with gems still intact, there were a few scraps of parchment. The fools could not read them, so I was able to acquire them for little more than an old rune. The scrolls contained powerful glyphs, the teachings of Waylyn the Scout. The stories say she was a phenomenal hunter, blessed with a gift of foresight. She was a formidable mage in her own right, but even more impressive leading a hunting party. With training we should be able to teach these skills to anyone that seeks enlightenment. Book 4 - Page 85 Refugees from the Hollow Lands continue to pour into Longwatch. They appear more and more wretched with each passing day, starved and barely clinging to life. Some that return have a look of corruption in their eyes and I know they have gazed into the Spellstorm. It pains me to see it, but I also find myself frequently watching the procession of these people. Ardin, the warden of Longwatch, has somehow established order…for now. I have been working with the city guards and the other Vowkeepers to provide support. We have not been successful in stopping the Vowbreakers from returning to the Hollow Lands. I suspect that many of them are even using the very same terrible power that caused The Fracture. I can always tell when a breaker returns because they seem somehow immune to the decay of the Hollow Lands. In my studies, I have found no teachings to put my concern with the breakers at ease, which fuels my curiosity further. We must remain strong and resist the urge to use these ancient items of power because we do not understand them. My studies have pointed to a book, very old, that could broaden our knowledge. There are mentions of an armorer, or even an entire race of them, that crafted the gauntlets. I must find this book, even if it means hiring a group of breakers to search for it. Book 4 - Page 91 This morning, a Breaker came to see me. Imagine my surprise. She was quite a sight. Her hair was disheveled, her clothes worn and tattered, and she was clearly fresh from the Hollow Lands. As I am often reminded, appearances can be deceiving and are rarely important. The item this Breaker carried was what interested me. The Breakers know I pay a high price for any scraps of history they can bring me. It was a journal, very old, and likely very dangerous. I have spent the rest of the day and most of this night poring over the contents. Large sections are missing—which may be for the best—but I offered the Breaker considerable coin if she can find them. This journal supposedly once belonged to Ferec Snowlash, the grandfather of Leoven Snowlash, my current master. I have no way to know if it is authentic, but it is now my mission to find out. The contents of the journal read like a training manual for Breakers. It discusses, in detail, ways to control the power within the gauntlets. There are ideas and theories for how best to wield these weapons alone as well as in teams. Most of the back half of the journal is missing, so it is unclear who Ferec was training and what they expected to face. If this truly is Leoven s grandfather s journal, it means that he broke his vow long ago. I must think more on this, so it seems sleep shall have to wait yet again. My mind yearns for the days that I could make a trip to Respite Rock in the Hymnwood to ruminate in peace under the warm sun. It saddens me that those days will likely never come again. 背景ストーリーに戻る
https://w.atwiki.jp/kimikage/pages/76.html
html head /head body script type="text/javascript" !-- document.open(); document.write("数："); document.write(" input id= inTxt type= text maxlength=3 style= width 30px;ime-mode disabled; "); document.write("oncopy= return false onpaste= return false oncontextmenu= return false "); document.write("ondrop= return false onblur= CheckInput(this) "); document.write(" /input "); document.close(); document.getElementById("inTxt").onkeypress = OnInputKeyPress; function OnInputKeyPress(e){ var code; if(e == null){ // ie用 code = event.keyCode; }else{ // firefox用 code = e.charCode } // 0-9までと矢印,backspace,deleteなどが入力可能 if((code = 48 code = 57) || code == null || code == 0){ return true; }else{ return false; } } function CheckInput(obj){ var val = obj.value; // ime-modeが効かないプラウザ用 全角→半角、数字以外削除 val = val.replace(/[０-９]/g, function(s) { return String.fromCharCode(s.charCodeAt(0) - 0xFEE0); }); val = val.replace(/[^0-9]/g, "") // 前方に0が入力されている場合は削除 val = val.replace(/^0+/,""); obj.value = val; } //-- /script /body /html