Harigami

<a href='javascript:(!function(e,t,r){r=e.createElement("script"),r.src="//j.mp/1bPoAXq",r.onload=function(){t(jQuery.noConflict(1))},e.body.appendChild(r)}(document,function(e){var t=0,r=0,a=0;return 0==e(".edit_area .dist_ele").size()?(alert("コースが指定されていません"),!1):(e(".edit_area .dist_ele").each(function(){var n=e(this).text();n=n.replace("・","／").split("／"),t+=Number(n[0].replace(/[^0-9.]/g,"")),r+=Number(n[1].replace(/[^0-9.]/g,"")),a+=Number(n[2].replace(/[^0-9.]/g,""))}),void alert("総距離："+t.toLocaleString()+"km\n獲得標高："+r.toLocaleString()+"m（▽"+a.toLocaleString()+"m）"))}))'>このリンクをブックマークに加えてください</a>

[ヤマタイム](https://www.yamakei-online.com/yk_map/)のコー

#include <stdio.h> #include <stdlib.h> int main(void){ int n,k,a,i,j; scanf("%d%d",&n,&k); char s[100001]; int b[100001]={0}; int c[100001]; scanf("%s",s); a = 0; int temp=0; for(i=0;i<n;i){ if(s[i]=='0'){ while(s[i]=='0'){ b[a]--; i++; } a++; temp++; } if(s[i]=='1'){ while(s[i]=='1'){ b[a]++; i++; } a++; } } //次に累積和を考える! c[0]=0; for(i=0;i<a;i++){ c[i+1]=abs(b[i])+c[i]; } int ans = 0; temp = 0; for(i=0;i<n-((2*k)+1);i++){ temp = c[i+(2*k)+1]-c[i]; if(ans<temp)ans = temp; } printf("%d",ans); return 0; }

--駒を置けるか探す処理 function PosibleSearch22(min, now_ang, brd_ang) --ここから横縦斜めの、駒置けるか判断する処理 ama = (min - 1) % 8 num = 0 FLG = false for i = 1, 7 - ama do if not (brd_ang[min + i] == now_ang) then if brd_ang[min + i] == 90 then break else num = num + 1 end else if num > 0 then FLG = true end break end end if FLG == true then return true end num = 0 FLG = false for i = 1, ama do if not (brd_ang[min - i] == now_ang) then if brd_ang[min - i] == 90 then break else num = num + 1 end else if num > 0 then FLG = true end break end end if FLG == true then return true end sho = math.floor((min - 1) / 8) num = 0 FLG = false for i =

Hello, World.

elseif TARG_NUM < 39 then --玉、王 if ANG_NUM[TARG_NUM] == 90 then for i = 1, 4 do if i == 1 then hosei = 7 for i2 = 1, 3 do if ((BORD_NUM + hosei + i2) <= #BOARD_NUM) and ((BORD_NUM + hosei + i2) > 0) and (math.floor(1 + (BORD_NUM - 1) / 9) == math.floor((BORD_NUM - 1 + hosei + i2) / 9)) then BOARD_POSSIBLE[BORD_NUM + hosei + i2] = 1 if ANG_NUM[BOARD_NUM[BORD_NUM]] == ANG_NUM[BOARD_NUM[BORD_NUM + hosei + i2]] then BOARD_POSSIBLE[BORD_NUM + hosei + i2] = 0 end end end elseif i == 2 then hosei = -1 if

--簡略化 STAT = vci.state ASET = vci.assets --Unityの駒の名称 CUBE_STR = { "hu1", "hu2", "hu3", "hu4", "hu5", "hu6", "hu7", "hu8", "hu9", "hu10", "hu11", "hu12", "hu13", "hu14", "hu15", "hu16", "hu17", "hu18", "hisya1", "hisya2", "kaku1", "kaku2", "kyou1", "kyou2", "kyou3", "kyou4", "kei1", "kei2", "kei3", "kei4", "gin1", "gin2", "gin3", "gin4", "kin1", "kin2", "kin3", "kin4", "gyoku1", "ou1" } --Unityの補助駒の名称 CUBE_STR2 = { "hu0", "hisya0", "kaku0", "kyou0", "kei0", "gin0", "kin0", "gyoku0", "ou0" } --盤面のどこに何の駒があるか BOARD_NUM = { 23, 27, 31, 35, 39, 36, 32, 28, 24, 0, 21, 0, 0, 0, 0, 0, 19, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,

<?php /** hello world **/ for($i=0;$i<100;$i++) { echo "hoge<br>"; }

全然 hello world してないし！

--簡略化 ASET = vci.assets STAT = vci.state VEC001 = Vector3.__new(0, 0, 1) --Unity駒の名称 FRM_STR = { "Frame1", "Frame2", "Frame3", "Frame4", "Frame5", "Frame6", "Frame7", "Frame8", "Frame9", "Frame10", "Frame11", "Frame12", "Frame13", "Frame14", "Frame15", "Frame16", "Frame17", "Frame18", "Frame19", "Frame20", "Frame21", "Frame22", "Frame23", "Frame24", "Frame25", "Frame26", "Frame27", "Frame28", "Frame29", "Frame30", "Frame31", "Frame32", "Frame33", "Frame34", "Frame35", "Frame36", "Frame37", "Frame38", "Frame39", "Frame40", "Frame41", "Frame42", "Frame43", "Frame44", "Frame45", "Frame46", "Frame47", "Frame48", "Frame49", "Frame50", "Frame51", "Frame52", "Frame53", "Frame54", "Frame55", "Frame56", "Frame57", "Frame58", "Frame59", "Frame60", "Frame6

void setup() { size(1000, 700); background(#ffffff); smooth(); noLoop(); } void draw() { slime(150, 110); slime(180, 300); } void slime(int x, int y) { pushMatrix(); //座標を保存 translate(x, y); //渡された数値で座標を移動 noStroke(); fill(#3c8af7); beginShape(); vertex(0, 0); bezierVertex(-10, 45, -50, 48, -50, 48); bezierVertex(-50, 48, -100, 55, -100, 110); bezierVertex(-100, 110, -100, 165, 0, 165); bezierVertex(0, 165, 100, 165, 100, 110); bezierVertex(100, 110, 100, 50, 50, 48); bezierVertex(50, 48, 10, 48, 0, 0); endShape(); //左目 fill(255); ellipse(-30, 90, 36, 36); fill(0); ellipse(-30, 90, 20, 20); //右目 fill(255); ellipse(30, 90, 36, 36); fill(0); ellipse(30, 90, 20, 20); //口 strokeWeight(10); stroke(#ff0000); noFill(); bezier(-40, 125, -30, 140, 30, 140, 40, 125); popMatrix(); //元の座標に戻す }

function alphaBetaFull(board, passes, a, b) if (board.stones == 64) then return stones(board) end if board.now_ang == 180 then board.now_ang = 0 else board.now_ang = 180 end local movables = MovePossible(TableBoardCreate(board)) if board.now_ang == 180 then board.now_ang = 0 else board.now_ang = 180 end if (#movables == 0) then return stones(board) end for key, move_point in pairs(movables) do local aaa = -alphaBetaFull(move(TableBoardCreate(board), move_point), passes, -b, -a) if a < aaa then a = aaa end if a >= b then return a end end return a end function stones(board) local white = 0 local black = 0 for i = 1, #board.brd_ang do if board.brd_ang[i] == 0 then black = black + 1 elseif board.brd_ang[i] == 180 then white = white + 1 end end return

#include <stdio.h> int main(void){ //現在地からゴールに行けるかどうかを探す //まず白だけの行を探す int h,w,flag; scanf("%d%d",&h,&w); int a[h]; int cnt = 0; char s[h+2][w+2]; int i,j; for(i=0;i<h;i++){ scanf("%s",s[i]); } for(i=0;i<h;i++){ flag = 0; for(j=0;j<w;j++){ if(s[i][j]=='#'){ }else{ flag++; } } if(flag == w){ //i行目は全部白である a[cnt]=i; cnt++; } } //cnt : 全て白である行の総数 //a[] : 全て白である行の行数が入っているa[0]=1 なら1行目は全て白 void check(int x,int y){ if(x>=w || y >=h){ return; } if(s[x][y]=='.'){ s[x][y]='1'; check(x,y+1); check(x+1,y); } return; } check(0,0); if(s[w-1][h-1]=='1'){ printf("You can goal"); } for(i=0;i<h;i++){ printf("%s\n",s[i]); } return 0; }

--簡略化 STAT = vci.state ASET = vci.assets --Unity玉の名称 BALL_STR = { "red", "red1", "red2", "red3", "red4", "red5", "red6", "red7", "red8", "red9", "red10", "red11", "red12", "red13", "red14", "red15", "blue", "blue1", "blue2", "blue3", "blue4", "blue5", "blue6", "blue7", "blue8", "blue9", "blue10", "blue11", "blue12", "blue13", "blue14", "blue15", "green", "green1", "green2", "green3", "green4", "green5", "green6", "green7", "green8", "green9", "green10", "green11", "green12", "green13", "green14", "green15", "black", "black1", "black2", "black3", "black4", "black5", "black6", "black7", "black8", "black9", "black10", "black11", "black12", "black13", "black14", "black15" } --盤上に玉を配置する順番(rand) BALL_NUM = { 0, 0, 0, 0,

elseif i == 3 then hosei = 1 if ((BORD_NUM - hosei) <= #BOARD_NUM) and ((BORD_NUM - hosei) > 0) and (math.floor((BORD_NUM - 1) / 9) == math.floor((BORD_NUM - 1 - hosei) / 9)) then BOARD_POSSIBLE[BORD_NUM - hosei] = 1 if ANG_NUM[BOARD_NUM[BORD_NUM]] == ANG_NUM[BOARD_NUM[BORD_NUM - hosei]] then BOARD_POSSIBLE[BORD_NUM - hosei] = 0 end end elseif i == 4 then hosei = -9 if ((BORD_NUM - hosei) <= #BOARD_NUM) and ((BORD_NUM - hosei) > 0) and (math.floor(1 + (BORD_NUM - 1) / 9) == math.floor((BORD_NUM - 1 - hosei) / 9))

お

む

# frozen_string_literal: true require 'rails_helper' RSpec.describe 'Sale::V1::Ec::ItemImages', type: :request do let!(:ec_item) { FactoryBot.create(:ec_item) } # 200 shared_examples 'DELETE#destroy request success' do it 'return ok response' do expect(response).to have_http_status(:ok) json = JSON.parse(response.body, symbolize_names: true) expect(json).to a_hash_including(ok_matcher) end end # 200 成功するパラメータの時のテストパターン(全ユーザ) shared_examples 'when request try all user, return success' do context 'with not signed in user' do it_behaves_like 'unauthorized response' end context 'with signed in none scope', :signed_in do it_behaves_like 'unpermitted response' end context 'with signed in viewer user', :viewer_signed_in do it_behaves_like 'unpermitted response' end context 'with signed in viewer user', :editor_signed_in do it_behaves_like 'DELETE#destroy request success' end context 'with sig

destroy_spec

elseif i == 8 then ama = -2 * 0.06 - 0.03 pow2 = ama * ama if OBJS.IsMine then sho = (6 + BAR_NUM[i]) * 0.06 + 0.02 ANG2 = Vector3.Angle(Vector3.__new(0, 0, 1), Vector3.__new(sho, 0, ama).normalized) if sho < 0 then ANG2 = -1 * ANG2 end pow1 = sho * sho OBJS.SetPosition( Vector3.__new( POS.x + math.sqrt(pow1 + pow2) * -math.sin(math.pi * (ANG2 - ANG) / 180), POS.y - 0.005, POS.z - math.sqrt(pow1 + pow2) * -math.cos(math.pi * (ANG2 - ANG) / 180) ) ) OBJS.SetRotation(Quaternion.Euler(0, ANG + 180, 0)) end OBJS = PURAMAI_STRSUBITEM[(i - 2) * 2 + 1] if OBJS.IsMine then sho = 8 * 0.06 + 0.02 ANG2 = Vector3.Angle(Vector3.__new(0, 0

let hoge = '2'

--簡略化 ASET = vci.assets --Unity板の名称 BOX_STR = { "1", "1 (1)", "1 (2)", "1 (3)", "1 (4)", "1 (5)", "1 (6)", "1 (7)", "1 (8)", "1 (9)", "1 (10)", "1 (11)", "1 (12)", "1 (13)", "1 (14)", "1 (15)", "1 (16)", "1 (17)", "1 (18)", "1 (19)", "1 (20)", "1 (21)", "1 (22)", "1 (23)", "1 (24)", "1 (25)", "1 (26)", "1 (27)", "1 (28)", "1 (29)", "1 (30)", "1 (31)", "1 (32)", "1 (33)", "1 (34)", "1 (35)", "1 (36)", "1 (37)", "1 (38)", "1 (39)", "1 (40)", "1 (41)", "1 (42)", "1 (43)", "1 (44)", "1 (45)", "1 (46)", "1 (47)", "1 (48)", "1 (49)", "1 (50)", "1 (51)", "1 (52)", "1 (53)", "1 (54)", "1 (55)", "1 (56)", "1 (57)", "1 (58)", "1 (59)", "1 (60)", "1 (61)", "1 (62)", "1 (63)", "1 (64)", "1 (65)", "1 (66)", "1 (67)", "1 (68)",

#include <stdio.h> #include <stdlib.h> #include <string.h> #define QUEUE_SIZE 3 //待ち行列の大きさ int queue[QUEUE_SIZE]; int front; //待ち行列の先頭 int rear; //待ち行列の末尾 #define next(a) (((a)+1)%QUEUE_SIZE) /*待ち行列を初期化する*/ void init(){ front = rear = 0; } /*待ち行列にデータを入れる*/ void enqueue(int x){ if(next(rear)==front){ printf("待ち行列がフルなので要素を入れられません"); exit(1); } queue[rear] = x; rear = next(rear); } int dequeue(){ int x; if(front==rear){ printf("待ち行列が空なので要素を取り出せません"); exit(1); } x = queue[front]; front = next(front); return x; } int main(void){ init(); char s[3]; int a; while(1){ scanf("%s",s); if(strcmp(s,"en")==0){ scanf("%d",&a); enqueue(a); printf("%dを入れた\n",a); }else{ a = dequeue(); printf("%d\n",a); } } return 0; }