JavaScript

2018.11.19

最大公約数を求める

const main = () => {
  'use strict'
  const p = console.log
  const calcGreatestCommonFactor = (arg1, arg2) => {
    let a = Number(arg1)
    let b = Number(arg2)
    /* 絶対値にする */
    if (a < 0) {
      a *= -1
    }
    if (b < 0) {
      b *= -1
    }
    /* 同じ値ならそのまま返却する */
    if (a === b) {
      return a
    }
    /* 片方が0ならもう片方の値が最大公約数になる */
    if (a === 0) {
      return b
    }
    if (b === 0) {
      return a
    }
    /* aの方を大きくする */
    if (a < b) {
      const c = a
      a = b
      b = c
    }
    // 余り(初期値は引数の小さい方)
    let rem = b
    /* 最大公約数を求めるループ */
    while (true) {
      rem = a % b
      /* 割り切れたら、その時割った値が最大公約数 */
      if (rem === 0) {
        return b
      }
      a = b
      b = rem
    }
  }
  const spacePadding = (n, keta = 4) => {
    const strN = '' + n
    const nKeta = strN.length
    if (keta < nKeta) {
      return strN
    }
    let pad = ''
    for (let i = 0; i < keta; i++) {
      pad += ' '
    }
    return (pad + strN).slice(-keta)
  }
  const dispGreatestCommonFactor = (a, b) => {
    let gcf = calcGreatestCommonFactor(a, b)
    a = spacePadding(a)
    b = spacePadding(b)
    gcf = spacePadding(gcf)
    p(`${a} と ${b} の最大公約数は ${gcf}`)
  }

  /* 最大公約数を求めて出力する */
  dispGreatestCommonFactor(4997, 7890);
  dispGreatestCommonFactor(147, 105);
  dispGreatestCommonFactor(0, 19);
}
main()

const main = () => {

'use strict'

const p = console.log

const calcGreatestCommonFactor = (arg1, arg2) => {

let a = Number(arg1)

let b = Number(arg2)

/* 絶対値にする */

if (a < 0) {

a *= -1

}

if (b < 0) {

b *= -1

}

/* 同じ値ならそのまま返却する */

if (a === b) {

return a

}

/* 片方が0ならもう片方の値が最大公約数になる */

if (a === 0) {

return b

}

if (b === 0) {

return a

}

/* aの方を大きくする */

if (a < b) {

const c = a

a = b

b = c

}

// 余り(初期値は引数の小さい方)

let rem = b

/* 最大公約数を求めるループ */

while (true) {

rem = a % b

/* 割り切れたら、その時割った値が最大公約数 */

if (rem === 0) {

return b

}

a = b

b = rem

}

const spacePadding = (n, keta = 4) => {

const strN = '' + n

const nKeta = strN.length

if (keta < nKeta) {

return strN

}

let pad = ''

for (let i = 0; i < keta; i++) {

pad += ' '

}

return (pad + strN).slice(-keta)

}

const dispGreatestCommonFactor = (a, b) => {

let gcf = calcGreatestCommonFactor(a, b)

a = spacePadding(a)

b = spacePadding(b)

gcf = spacePadding(gcf)

p(`${a} と ${b} の最大公約数は ${gcf}`)

}

/* 最大公約数を求めて出力する */

dispGreatestCommonFactor(4997, 7890);

dispGreatestCommonFactor(147, 105);

dispGreatestCommonFactor(0, 19);

}

main()

4997 と 7890 の最大公約数は  263
 147 と  105 の最大公約数は   21
   0 と   19 の最大公約数は   19

4997 と 7890 の最大公約数は 263

147 と 105 の最大公約数は 21

0 と 19 の最大公約数は 19

2018.10.14

□に1から9の数を1回ずつ入れて式を完成させましょう。

twitterで見つけた問題を解いた。

小学校にクイズあった pic.twitter.com/r4dQFRvjCk

— うなぎいぬ Amadeus Ver.2.31 (@unagiinu1092) 2018年10月13日

let p = console.log

const getPermutation = arr => {
  const generatePermutation = (perm, pre, post, n) => {
    var elem, i, rest, len
    if (n > 0) {
      for (i = 0, len = post.length; i < len; ++i) {
        rest = post.slice(0)
        elem = rest.splice(i, 1)
        generatePermutation(perm, pre.concat(elem), rest, n - 1)
      }
    } else {
      perm.push(pre)
    }
  }
  const perm = []
  generatePermutation(perm, [], arr, arr.length)
  return perm
}
const isNoDuplication = (a, b, c, d, e, f, g, h, i) => {
  const arr = []
  arr.push(a)
  arr.push(b)
  arr.push(c)
  arr.push(d)
  arr.push(e)
  arr.push(f)
  arr.push(g)
  arr.push(h)
  arr.push(i)
  const arr2 = arr.filter(function (x, i, self) {
    return self.indexOf(x) === i
  })
  return arr2.length === 9
}
const func = (a, b, c, d, e, f, g, h, i) => {
  const left = (((((a * b) / c) * d) / e) * f) + g - h
  return left === i
}
const ret = getPermutation([1, 2, 3, 4, 5, 6, 7, 8, 9])
for (r of ret) {
  if (func(
      r[0],
      r[1],
      r[2],
      r[3],
      r[4],
      r[5],
      r[6],
      r[7],
      r[8],
      r[9]
    ) && isNoDuplication(
      r[0],
      r[1],
      r[2],
      r[3],
      r[4],
      r[5],
      r[6],
      r[7],
      r[8],
      r[9]
    )) {
    p(r)
  }
}

let p = console.log

const getPermutation = arr => {

const generatePermutation = (perm, pre, post, n) => {

var elem, i, rest, len

if (n > 0) {

for (i = 0, len = post.length; i < len; ++i) {

rest = post.slice(0)

elem = rest.splice(i, 1)

generatePermutation(perm, pre.concat(elem), rest, n - 1)

}

} else {

perm.push(pre)

}

const perm = []

generatePermutation(perm, [], arr, arr.length)

return perm

}

const isNoDuplication = (a, b, c, d, e, f, g, h, i) => {

const arr = []

arr.push(a)

arr.push(b)

arr.push(c)

arr.push(d)

arr.push(e)

arr.push(f)

arr.push(g)

arr.push(h)

arr.push(i)

const arr2 = arr.filter(function (x, i, self) {

return self.indexOf(x) === i

})

return arr2.length === 9

}

const func = (a, b, c, d, e, f, g, h, i) => {

const left = (((((a * b) / c) * d) / e) * f) + g - h

return left === i

}

const ret = getPermutation([1, 2, 3, 4, 5, 6, 7, 8, 9])

for (r of ret) {

if (func(

r[0],

r[1],

r[2],

r[3],

r[4],

r[5],

r[6],

r[7],

r[8],

r[9]

) && isNoDuplication(

r[0],

r[1],

r[2],

r[3],

r[4],

r[5],

r[6],

r[7],

r[8],

r[9]

)) {

p(r)

}

順列組み合わせの生成はこのQiitaを使わせてもらった
JavaScriptによる順列組み合わせの生成

2018.09.24

寿司打のランキングの平均タイプ数をグラフ化した

// (Main.js)
const main = () => {
    'strict';
    const p = console.log;
    const data = require('./data.js');
    const foreach = (a, f) => {
        for(const k of Object.keys(a)){
            const v = a[k];
            f(k, v);
        }
    };
    const dispArrayList = a => {
        foreach(a, (k, v) => {
            p(k + " => " + getNumAndLine(v, '.'));
        });
    };
    const getSortedArray = (a) => {
        const startStr = '5.2';
        const limitStr = '7.1';

        const b = [];
        for(let i=5; i<=7; i++){
            for(let j=0; j<=9; j++){
                const s = i + "." + j;
                if(s < startStr){
                    continue;
                }
                if(a[s]){
                    b[s] = a[s];
                }else{
                    b[s] = 0;
                }
                // limitCheck
                if(limitStr <= s){
                    return b;
                }
            }
        }
    };
    const getNumAndLine = (n, d) => {
        let line = '';
        for(let i=0; i<n; i++){
            line += d;
        }
        const nStr = ('  ' + n).slice(-3);
        const retStr = nStr + ' : ' + line;
        return retStr;
    };
    const dispScore = (datastr, title) => {
        p(title);
        const arr = datastr.split('\n');
        const a = [];
        // 読み込み
        arr.forEach((v) => {
            if(a[v]){
                a[v] += 1;
            }else{
                a[v] = 1;
            }
        });
        const b = getSortedArray(a);
        dispArrayList(b);
    };
    const sub = () => {
        dispScore(data.getData601(), "Rank601");
        dispScore(data.getData451(), "Rank451");
        dispScore(data.getData301(), "Rank301");
    };
    sub();
};
main();

// (Main.js)

const main = () => {

'strict';

const p = console.log;

const data = require('./data.js');

const foreach = (a, f) => {

for(const k of Object.keys(a)){

const v = a[k];

f(k, v);

}

};

const dispArrayList = a => {

foreach(a, (k, v) => {

p(k + " => " + getNumAndLine(v, '.'));

});

};

const getSortedArray = (a) => {

const startStr = '5.2';

const limitStr = '7.1';

const b = [];

for(let i=5; i<=7; i++){

for(let j=0; j<=9; j++){

const s = i + "." + j;

if(s < startStr){

continue;

}

if(a[s]){

b[s] = a[s];

}else{

b[s] = 0;

}

// limitCheck

if(limitStr <= s){

return b;

}

};

const getNumAndLine = (n, d) => {

let line = '';

for(let i=0; i<n; i++){

line += d;

}

const nStr = (' ' + n).slice(-3);

const retStr = nStr + ' : ' + line;

return retStr;

};

const dispScore = (datastr, title) => {

p(title);

const arr = datastr.split('\n');

const a = [];

// 読み込み

arr.forEach((v) => {

if(a[v]){

a[v] += 1;

}else{

a[v] = 1;

}

});

const b = getSortedArray(a);

dispArrayList(b);

};

const sub = () => {

dispScore(data.getData601(), "Rank601");

dispScore(data.getData451(), "Rank451");

dispScore(data.getData301(), "Rank301");

};

sub();

};

main();

// (Data.js)
exports.getData601 = _getData601;
exports.getData451 = _getData451;
exports.getData301 = _getData301;

function _getData601() {
return `6.2
5.7
5.8
6.5
5.7
5.7
5.7
6.1
6.3
5.8
6.5
6.0
6.7
5.9
6.1
6.0
6.7
6.2
6.2
5.8
5.6
5.6
5.9
5.8
6.2
6.1
6.7
6.0
6.0
6.5
6.3
6.0
5.8
5.6
5.7
6.4
5.9
6.1
6.6
6.0
5.8
6.2
6.2
6.1
6.0
5.6
5.8
6.0
6.3
6.2
6.2
5.5
6.2
6.2
5.9
5.9
5.8
6.0
5.9
5.9
5.6
5.7
6.1
5.8
5.7
6.0
5.7
5.8
5.7
5.9
6.1
5.8
5.6
6.2
5.9
5.4
5.8
5.4
5.7
6.1
6.0
5.7
5.7
6.2
6.2
5.8
6.0
5.5
6.3
5.9
5.7
5.6
5.7
5.5
6.6
6.1
6.1
5.7
6.4
6.1
5.6
5.5
5.8
5.5
5.6
5.8
5.9
6.1
5.8
5.5
5.5
5.7
6.3
5.8
5.6
5.6
6.2
5.7
5.5
5.6
5.7
5.9
5.6
5.7
5.5
5.8
5.7
5.4
6.2
5.8
5.7
5.7
5.5
6.5
5.8
6.0
5.9
6.0
5.9
6.1
5.7
6.1
5.6
5.7
6.0
6.1
6.3
6.3
5.7
6.1`}

function _getData451() {
return `6.1
6.3
6.2
6.5
5.9
6.1
5.8
6.1
5.9
5.9
6.7
6.0
6.1
6.5
6.3
6.2
6.0
6.0
6.8
6.5
6.1
6.2
6.0
6.3
6.7
6.1
6.1
5.8
5.7
6.1
6.5
6.3
5.6
6.0
6.4
6.2
6.3
5.9
6.2
6.2
5.8
6.0
6.2
6.2
5.8
5.7
5.8
5.9
6.4
5.6
6.6
6.2
6.4
5.8
6.0
6.0
5.7
5.7
5.8
5.6
6.2
6.3
6.1
5.8
5.8
6.5
5.9
6.2
6.4
6.2
6.1
6.1
5.9
6.1
6.0
6.3
6.1
6.2
5.9
5.7
6.2
6.8
6.0
6.4
6.2
5.9
5.6
6.2
6.6
5.8
5.8
6.1
6.2
6.0
5.8
6.6
6.1
5.9
5.7
5.8
6.0
6.5
6.3
6.2
5.6
5.6
5.9
6.0
5.9
5.4
6.0
5.8
5.9
5.8
6.0
6.6
6.2
5.7
6.0
6.2
5.9
6.1
6.2
6.1
5.8
6.0
5.8
5.4
6.0
6.7
6.1
5.8
6.0
6.2
6.4
6.0
5.8
5.6
6.0
6.1
5.9
6.1
5.9
5.8
5.6
5.8
6.0
5.9
5.8
5.9`}

function _getData301() {
return `6.3
6.4
6.8
6.7
6.3
6.6
6.4
6.3
6.5
6.6
6.6
6.3
6.2
6.8
6.5
6.1
6.4
6.3
6.4
6.1
6.5
6.4
6.1
6.2
6.5
6.5
6.7
6.2
7.0
6.4
5.8
6.4
6.3
6.4
6.6
6.2
6.4
6.7
6.2
6.0
6.1
6.3
6.2
6.4
6.3
6.2
6.3
6.8
6.1
6.6
6.8
5.9
6.4
6.2
5.8
6.0
6.5
6.7
6.3
6.3
6.8
6.3
6.0
6.2
6.0
6.4
6.2
6.5
5.9
5.9
5.9
6.4
5.9
6.2
6.2
6.4
5.6
6.4
6.9
6.4
6.2
5.9
5.7
6.1
6.4
5.9
6.7
6.2
6.3
6.0
6.2
6.7
6.1
6.1
6.5
6.3
5.9
5.9
6.5
6.5
6.4
6.0
6.8
5.7
6.1
6.2
6.4
5.8
6.8
6.2
6.3
6.3
5.9
6.0
6.0
5.9
6.1
5.8
6.7
5.8
5.7
5.9
6.2
6.1
5.7
6.0
6.3
5.9
5.8
6.5
6.3
6.0
5.9
5.9
6.1
6.0
6.5
6.3
5.8
5.7
5.7
5.9
5.8
6.7
5.6
6.2
5.9
6.4
6.3
5.9
`;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

// (Data.js)

exports.getData601 = _getData601;

exports.getData451 = _getData451;

exports.getData301 = _getData301;

function _getData601() {

return `6.2

5.7

5.8

6.5

5.7

6.1

6.3

5.8

6.5

6.0

6.7

5.9

6.1

6.0

6.7

6.2

5.8

5.6

5.9

5.8

6.2

6.1

6.7

6.0

6.5

6.3

6.0

5.8

5.6

5.7

6.4

5.9

6.1

6.6

6.0

5.8

6.2

6.1

6.0

5.6

5.8

6.0

6.3

6.2

5.5

6.2

5.9

5.8

6.0

5.9

5.6

5.7

6.1

5.8

5.7

6.0

5.7

5.8

5.7

5.9

6.1

5.8

5.6

6.2

5.9

5.4

5.8

5.4

5.7

6.1

6.0

5.7

6.2

5.8

6.0

5.5

6.3

5.9

5.7

5.6

5.7

5.5

6.6

6.1

5.7

6.4

6.1

5.6

5.5

5.8

5.5

5.6

5.8

5.9

6.1

5.8

5.5

5.7

6.3

5.8

5.6

6.2

5.7

5.5

5.6

5.7

5.9

5.6

5.7

5.5

5.8

5.7

5.4

6.2

5.8

5.7

5.5

6.5

5.8

6.0

5.9

6.0

5.9

6.1

5.7

6.1

5.6

5.7

6.0

6.1

6.3

5.7

6.1`}

function _getData451() {

return `6.1

6.3

6.2

6.5

5.9

6.1

5.8

6.1

5.9

6.7

6.0

6.1

6.5

6.3

6.2

6.0

6.8

6.5

6.1

6.2

6.0

6.3

6.7

6.1

5.8

5.7

6.1

6.5

6.3

5.6

6.0

6.4

6.2

6.3

5.9

6.2

5.8

6.0

6.2

5.8

5.7

5.8

5.9

6.4

5.6

6.6

6.2

6.4

5.8

6.0

5.7

5.8

5.6

6.2

6.3

6.1

5.8

6.5

5.9

6.2

6.4

6.2

6.1

5.9

6.1

6.0

6.3

6.1

6.2

5.9

5.7

6.2

6.8

6.0

6.4

6.2

5.9

5.6

6.2

6.6

5.8

6.1

6.2

6.0

5.8

6.6

6.1

5.9

5.7

5.8

6.0

6.5

6.3

6.2

5.6

5.9

6.0

5.9

5.4

6.0

5.8

5.9

5.8

6.0

6.6

6.2

5.7

6.0

6.2

5.9

6.1

6.2

6.1

5.8

6.0

5.8

5.4

6.0

6.7

6.1

5.8

6.0

6.2

6.4

6.0

5.8

5.6

6.0

6.1

5.9

6.1

5.9

5.8

5.6

5.8

6.0

5.9

5.8

5.9`}

function _getData301() {

return `6.3

6.4

6.8

6.7

6.3

6.6

6.4

6.3

6.5

6.6

6.3

6.2

6.8

6.5

6.1

6.4

6.3

6.4

6.1

6.5

6.4

6.1

6.2

6.5

6.7

6.2

7.0

6.4

5.8

6.4

6.3

6.4

6.6

6.2

6.4

6.7

6.2

6.0

6.1

6.3

6.2

6.4

6.3

6.2

6.3

6.8

6.1

6.6

6.8

5.9

6.4

6.2

5.8

6.0

6.5

6.7

6.3

6.8

6.3

6.0

6.2

6.0

6.4

6.2

6.5

5.9

6.4

5.9

6.2

6.4

5.6

6.4

6.9

6.4

6.2

5.9

5.7

6.1

6.4

5.9

6.7

6.2

6.3

6.0

6.2

6.7

6.1

6.5

6.3

5.9

6.5

6.4

6.0

6.8

5.7

6.1

6.2

6.4

5.8

6.8

6.2

6.3

5.9

6.0

5.9

6.1

5.8

6.7

5.8

5.7

5.9

6.2

6.1

5.7

6.0

6.3

5.9

5.8

6.5

6.3

6.0

5.9

6.1

6.0

6.5

6.3

5.8

5.7

5.9

5.8

6.7

5.6

6.2

5.9

6.4

6.3

5.9

}

Rank601
5.2 =>   0 : 
5.3 =>   0 : 
5.4 =>   3 : ...
5.5 =>  10 : ..........
5.6 =>  14 : ..............
5.7 =>  25 : .........................
5.8 =>  20 : ....................
5.9 =>  14 : ..............
6.0 =>  15 : ...............
6.1 =>  16 : ................
6.2 =>  15 : ...............
6.3 =>   7 : .......
6.4 =>   2 : ..
6.5 =>   4 : ....
6.6 =>   2 : ..
6.7 =>   3 : ...
6.8 =>   0 : 
6.9 =>   0 : 
7.0 =>   0 : 
7.1 =>   0 : 
Rank451
5.2 =>   0 : 
5.3 =>   0 : 
5.4 =>   2 : ..
5.5 =>   0 : 
5.6 =>   8 : ........
5.7 =>   7 : .......
5.8 =>  22 : ......................
5.9 =>  18 : ..................
6.0 =>  22 : ......................
6.1 =>  20 : ....................
6.2 =>  22 : ......................
6.3 =>   8 : ........
6.4 =>   6 : ......
6.5 =>   6 : ......
6.6 =>   4 : ....
6.7 =>   3 : ...
6.8 =>   2 : ..
6.9 =>   0 : 
7.0 =>   0 : 
7.1 =>   0 : 
Rank301
5.2 =>   0 : 
5.3 =>   0 : 
5.4 =>   0 : 
5.5 =>   0 : 
5.6 =>   2 : ..
5.7 =>   6 : ......
5.8 =>   8 : ........
5.9 =>  18 : ..................
6.0 =>  11 : ...........
6.1 =>  12 : ............
6.2 =>  19 : ...................
6.3 =>  20 : ....................
6.4 =>  20 : ....................
6.5 =>  12 : ............
6.6 =>   5 : .....
6.7 =>   8 : ........
6.8 =>   7 : .......
6.9 =>   1 : .
7.0 =>   1 : .
7.1 =>   0 :

Rank601

5.2 => 0 :

5.3 => 0 :

5.4 => 3 : ...

5.5 => 10 : ..........

5.6 => 14 : ..............

5.7 => 25 : .........................

5.8 => 20 : ....................

5.9 => 14 : ..............

6.0 => 15 : ...............

6.1 => 16 : ................

6.2 => 15 : ...............

6.3 => 7 : .......

6.4 => 2 : ..

6.5 => 4 : ....

6.6 => 2 : ..

6.7 => 3 : ...

6.8 => 0 :

6.9 => 0 :

7.0 => 0 :

7.1 => 0 :

Rank451

5.2 => 0 :

5.3 => 0 :

5.4 => 2 : ..

5.5 => 0 :

5.6 => 8 : ........

5.7 => 7 : .......

5.8 => 22 : ......................

5.9 => 18 : ..................

6.0 => 22 : ......................

6.1 => 20 : ....................

6.2 => 22 : ......................

6.3 => 8 : ........

6.4 => 6 : ......

6.5 => 6 : ......

6.6 => 4 : ....

6.7 => 3 : ...

6.8 => 2 : ..

6.9 => 0 :

7.0 => 0 :

7.1 => 0 :

Rank301

5.2 => 0 :

5.3 => 0 :

5.4 => 0 :

5.5 => 0 :

5.6 => 2 : ..

5.7 => 6 : ......

5.8 => 8 : ........

5.9 => 18 : ..................

6.0 => 11 : ...........

6.1 => 12 : ............

6.2 => 19 : ...................

6.3 => 20 : ....................

6.4 => 20 : ....................

6.5 => 12 : ............

6.6 => 5 : .....

6.7 => 8 : ........

6.8 => 7 : .......

6.9 => 1 : .

7.0 => 1 : .

7.1 => 0 :

2018.09.13

5%の確率に挑戦して少なくとも1回成功する割合が85%を超えるのは、何回挑戦したときか→37回

const main = () => {
    'use strict';
    
    const p = console.log;
    const probabilityOf_percent = (percent) => {
        const randomDouble100 = Math.random() * 100;
        return (randomDouble100 < percent);
    };
    const challengeForOneWin = (percent, times) => {
        for(let i=0; i<times; i++){
            if(probabilityOf_percent(percent)){
                return true;
            }
        }
        return false;
    };
    const getOneWinProportion = (percent, times) => {
        let cnt = 0;
        for(let i=0; i<times; i++){
            if(challengeForOneWin(percent, times)){
                cnt++;
            }
        }
        const proportion = cnt * 100.0 / times;
        return proportion;
    };
    const getOneWinProportionAverage_calculation = (percent, challengeTimes, times) => {
        let proportionSum = 0;
        for(let i=0; i<times; i++){
            proportionSum += getOneWinProportion(percent, challengeTimes);
        }
        const proportionAverage = proportionSum / times;
        return proportionAverage;
    };
    const getOneWinProportionAverage_analytic = (percent, challengeTimes) => {
        const result = (1.0 - Math.pow(1 - percent / 100.0, challengeTimes)) * 100;

        return result;
    };
    const sub = () => {
        const times = 10000;
        const challengeTimes = 37;
        const percent = 5.0;
        
        const result_calculation = getOneWinProportionAverage_calculation(percent, challengeTimes, times);
        const result_analytic = getOneWinProportionAverage_analytic(percent, challengeTimes);

        p("result_calculation : " + result_calculation);
        p("result_analytic : " + result_analytic);
    };
    sub();
};
main();

const main = () => {

'use strict';

const p = console.log;

const probabilityOf_percent = (percent) => {

const randomDouble100 = Math.random() * 100;

return (randomDouble100 < percent);

};

const challengeForOneWin = (percent, times) => {

for(let i=0; i<times; i++){

if(probabilityOf_percent(percent)){

return true;

}

return false;

};

const getOneWinProportion = (percent, times) => {

let cnt = 0;

for(let i=0; i<times; i++){

if(challengeForOneWin(percent, times)){

cnt++;

}

const proportion = cnt * 100.0 / times;

return proportion;

};

const getOneWinProportionAverage_calculation = (percent, challengeTimes, times) => {

let proportionSum = 0;

for(let i=0; i<times; i++){

proportionSum += getOneWinProportion(percent, challengeTimes);

}

const proportionAverage = proportionSum / times;

return proportionAverage;

};

const getOneWinProportionAverage_analytic = (percent, challengeTimes) => {

const result = (1.0 - Math.pow(1 - percent / 100.0, challengeTimes)) * 100;

return result;

};

const sub = () => {

const times = 10000;

const challengeTimes = 37;

const percent = 5.0;

const result_calculation = getOneWinProportionAverage_calculation(percent, challengeTimes, times);

const result_analytic = getOneWinProportionAverage_analytic(percent, challengeTimes);

p("result_calculation : " + result_calculation);

p("result_analytic : " + result_analytic);

};

sub();

};

main();

result_calculation : 85.03594594594543
result_analytic : 85.01097459511844

1 2	result_calculation : 85.03594594594543 result_analytic : 85.01097459511844

2018.09.08

厚さ0.1ミリの新聞紙を37回折ったら地球の直径を超えるみたいなやつ

function main() {
  'use strict';
  const p = console.log;
  const getDouble = n => n + n;
  const getDoubleAtTimes = (n, times) => {
    for (let i = 0; i < times; i++) {
      n = getDouble(n);
    }
    return n;
  };
  const foldNewspaper = (m, times) => {
    return getDoubleAtTimes(m, times);
  };
  const dispFoldNewspaper = (m, times) => {
    const mm = foldNewspaper(m, times);
    p(`新聞紙の厚さ:${m}[m], 折った回数:${times}回, 得られた長さ:${mm}[m]`);
  };
  const sub = () => {
    const m = 0.0001;
    dispFoldNewspaper(m, 0);
    dispFoldNewspaper(m, 1);
    dispFoldNewspaper(m, 10);
    dispFoldNewspaper(m, 37);
    dispFoldNewspaper(m, 100);
  };
  sub();
}
main();

function main() {

'use strict';

const p = console.log;

const getDouble = n => n + n;

const getDoubleAtTimes = (n, times) => {

for (let i = 0; i < times; i++) {

n = getDouble(n);

}

return n;

};

const foldNewspaper = (m, times) => {

return getDoubleAtTimes(m, times);

};

const dispFoldNewspaper = (m, times) => {

const mm = foldNewspaper(m, times);

p(`新聞紙の厚さ:${m}[m], 折った回数:${times}回, 得られた長さ:${mm}[m]`);

};

const sub = () => {

const m = 0.0001;

dispFoldNewspaper(m, 0);

dispFoldNewspaper(m, 1);

dispFoldNewspaper(m, 10);

dispFoldNewspaper(m, 37);

dispFoldNewspaper(m, 100);

};

sub();

}

main();

新聞紙の厚さ:0.0001[m], 折った回数:0回, 得られた長さ:0.0001[m]
新聞紙の厚さ:0.0001[m], 折った回数:1回, 得られた長さ:0.0002[m]
新聞紙の厚さ:0.0001[m], 折った回数:10回, 得られた長さ:0.1024[m]
新聞紙の厚さ:0.0001[m], 折った回数:37回, 得られた長さ:13743895.3472[m]
新聞紙の厚さ:0.0001[m], 折った回数:100回, 得られた長さ:1.2676506002282295e+26[m]

新聞紙の厚さ:0.0001[m], 折った回数:0回, 得られた長さ:0.0001[m]

新聞紙の厚さ:0.0001[m], 折った回数:1回, 得られた長さ:0.0002[m]

新聞紙の厚さ:0.0001[m], 折った回数:10回, 得られた長さ:0.1024[m]

新聞紙の厚さ:0.0001[m], 折った回数:37回, 得られた長さ:13743895.3472[m]

新聞紙の厚さ:0.0001[m], 折った回数:100回, 得られた長さ:1.2676506002282295e+26[m]

2018.09.08

1000000 以下の素数の個数の計算にかかる時間(ミリ秒)

JavaScriptはCよりおよそ4倍の時間がかかる。

function main() {
  'use strict';
  const p = console.log;
  const isPrime = n => {
    if (n <= 1) {
      return false;
    }
    if (n === 2 || n === 3) {
      return true;
    }
    if (n % 2 === 0) {
      return false;
    }
    const floorSqrt = Math.floor(Math.sqrt(n));
    for (let i = 3; i <= floorSqrt; i++) {
      if (n % i === 0) {
        return false;
      }
    }
    return true;
  };
  const countPrimeUnderNorN = n => {
    let cnt = 0;
    for (let i = 0; i < n; i++) {
      if (isPrime(i)) {
        cnt++;
      }
    }
    return cnt;
  };
  const calcTimeLapseMs = func => {
    const start_ms = new Date().getTime();
    const result = func();
    const end_ms = new Date().getTime();
    const elapsed_ms = end_ms - start_ms;
    return [elapsed_ms, result];
  };
  const sub = () => {
    const n = 1000000;
    let timeLapseMs, result;
    [timeLapseMs, result] = calcTimeLapseMs(() => {
      return countPrimeUnderNorN(n);
    });
    p(n + " 以下の素数の個数の計算にかかる時間(ミリ秒)");
    p();
    p("timeLapseMs : " + timeLapseMs + " ミリ秒");
    p("result : " + result + " 個");
  };
  sub();
}
main();

function main() {

'use strict';

const p = console.log;

const isPrime = n => {

if (n <= 1) {

return false;

}

if (n === 2 || n === 3) {

return true;

}

if (n % 2 === 0) {

return false;

}

const floorSqrt = Math.floor(Math.sqrt(n));

for (let i = 3; i <= floorSqrt; i++) {

if (n % i === 0) {

return false;

}

return true;

};

const countPrimeUnderNorN = n => {

let cnt = 0;

for (let i = 0; i < n; i++) {

if (isPrime(i)) {

cnt++;

}

return cnt;

};

const calcTimeLapseMs = func => {

const start_ms = new Date().getTime();

const result = func();

const end_ms = new Date().getTime();

const elapsed_ms = end_ms - start_ms;

return [elapsed_ms, result];

};

const sub = () => {

const n = 1000000;

let timeLapseMs, result;

[timeLapseMs, result] = calcTimeLapseMs(() => {

return countPrimeUnderNorN(n);

});

p(n + " 以下の素数の個数の計算にかかる時間(ミリ秒)");

p();

p("timeLapseMs : " + timeLapseMs + " ミリ秒");

p("result : " + result + " 個");

};

sub();

}

main();

1000000 以下の素数の個数の計算にかかる時間(ミリ秒)

timeLapseMs : 391 ミリ秒
result : 78498 個

1000000 以下の素数の個数の計算にかかる時間(ミリ秒)

timeLapseMs : 391 ミリ秒

result : 78498 個

2018.09.07

1000本のワインの中から1本の毒入りワインを見つける問題を解いた

/*
一滴でも飲むと20時間後に死ぬ毒が、1000本のワインのうち1本にだけ入っている。
奴隷に飲ませて、24時間以内にどれが毒入りか調べるとき、奴隷は何人必要か。

こたえ 10人。
検出アルゴリズムのテスト。
*/
class Wine {
    constructor(id, isPoison) {
        this.id = id;
        this.isPoison = isPoison;
    }
    pour() {
        return this.isPoison;
    }
}
class Slave {
    constructor(pos) {
        this.pos = pos;
        this.poisoned = false;
    }
    drink(wine){
        this.isPoisoned = (this.isPoisoned || wine.pour());
    }
}

const p = console.log;

function readSlaves(slaves) {
    const len = slaves.length;
    let s = '';
    for(let i=len-1; 0<=i; i--){
        const slave = slaves[i];
        s += (slave.isPoisoned ? '1' : '0');
    }
    return s;
}

function decimalToBinaryStrPadded(n) {
    return ('0000000000' + n.toString(2)).substr(-10);
}

function binaryDrinking(slaves, wines) {
    wines.forEach(wine => {
        const binStrPadded = decimalToBinaryStrPadded(wine.id);
        slaves.forEach(slave => {
            if(binStrPadded.substr(9 - slave.pos, 1) === '1'){
                slave.drink(wine);
            }
        });
    });
}

function setWinePoison(wines, id) {
    wines.forEach(wine => {
        if(wine.id === id){
            wine.isPoison = true;
            return;
        }
    });
}

function binKetaToNum(binKeta) {
    if(binKeta < 0) {
        return 0;
    }
    return Math.pow(2, binKeta);
}

function binStrToDecimal(s) {
    const len = s.length;
    let sum = 0;
    for(let i=len-1; 0<=i; i--){
        const binKeta = len-1-i;
        const on = (s.substr(i, 1) === '1');
        if(on){
            sum += binKetaToNum(binKeta);
        }
    }
    return sum;
}

function generateSlaves() {
    const slaves = [];
    for(let i=0; i<10; i++) {
        slaves.push(new Slave(i));
    }
    return slaves;    
}

function generateWines() {
    const wines = [];
    for(let i=0; i<1000; i++){
        wines.push(new Wine(i+1, false));
    }
    return wines;    
}

function tasting(poisonWineId){
    const slaves = generateSlaves();
    const wines = generateWines();

    setWinePoison(wines, poisonWineId);
    binaryDrinking(slaves, wines);
    const binaryStr = readSlaves(slaves);

    p(
        "poisonWineId : " + poisonWineId + ", "
        + "readSlaves(slaves) : " + binaryStr
    );
}

function main() {
    tasting(0);
    tasting(777);
    tasting(1000);
}

main();

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

一滴でも飲むと20時間後に死ぬ毒が、1000本のワインのうち1本にだけ入っている。

奴隷に飲ませて、24時間以内にどれが毒入りか調べるとき、奴隷は何人必要か。

こたえ 10人。

検出アルゴリズムのテスト。

class Wine {

constructor(id, isPoison) {

this.id = id;

this.isPoison = isPoison;

}

pour() {

return this.isPoison;

}

class Slave {

constructor(pos) {

this.pos = pos;

this.poisoned = false;

}

drink(wine){

this.isPoisoned = (this.isPoisoned || wine.pour());

}

const p = console.log;

function readSlaves(slaves) {

const len = slaves.length;

let s = '';

for(let i=len-1; 0<=i; i--){

const slave = slaves[i];

s += (slave.isPoisoned ? '1' : '0');

}

return s;

}

function decimalToBinaryStrPadded(n) {

return ('0000000000' + n.toString(2)).substr(-10);

}

function binaryDrinking(slaves, wines) {

wines.forEach(wine => {

const binStrPadded = decimalToBinaryStrPadded(wine.id);

slaves.forEach(slave => {

if(binStrPadded.substr(9 - slave.pos, 1) === '1'){

slave.drink(wine);

}

});

}

function setWinePoison(wines, id) {

wines.forEach(wine => {

if(wine.id === id){

wine.isPoison = true;

return;

}

});

}

function binKetaToNum(binKeta) {

if(binKeta < 0) {

return 0;

}

return Math.pow(2, binKeta);

}

function binStrToDecimal(s) {

const len = s.length;

let sum = 0;

for(let i=len-1; 0<=i; i--){

const binKeta = len-1-i;

const on = (s.substr(i, 1) === '1');

if(on){

sum += binKetaToNum(binKeta);

}

return sum;

}

function generateSlaves() {

const slaves = [];

for(let i=0; i<10; i++) {

slaves.push(new Slave(i));

}

return slaves;

}

function generateWines() {

const wines = [];

for(let i=0; i<1000; i++){

wines.push(new Wine(i+1, false));

}

return wines;

}

function tasting(poisonWineId){

const slaves = generateSlaves();

const wines = generateWines();

setWinePoison(wines, poisonWineId);

binaryDrinking(slaves, wines);

const binaryStr = readSlaves(slaves);

"poisonWineId : " + poisonWineId + ", "

+ "readSlaves(slaves) : " + binaryStr

);

}

function main() {

tasting(0);

tasting(777);

tasting(1000);

}

main();

poisonWineId : 0, readSlaves(slaves) : 0000000000
poisonWineId : 777, readSlaves(slaves) : 1100001001
poisonWineId : 1000, readSlaves(slaves) : 1111101000

poisonWineId : 0, readSlaves(slaves) : 0000000000

poisonWineId : 777, readSlaves(slaves) : 1100001001

poisonWineId : 1000, readSlaves(slaves) : 1111101000

2018.09.04

bignumber.jsを使った小数点以下の計算

// https://github.com/MikeMcl/bignumber.js/blob/master/bignumber.js
const BigNumber = require('./bignumber.js') 
const p = console.log

const a = new BigNumber(0.000000000000000001)
const b = new BigNumber(1000000000)
const c = a.multipliedBy(b)

p("a * b = c")
p("a : " + a.toFixed())
p("b : " + b.toFixed())
p("c : " + c.toFixed())

// https://github.com/MikeMcl/bignumber.js/blob/master/bignumber.js

const BigNumber = require('./bignumber.js')

const p = console.log

const a = new BigNumber(0.000000000000000001)

const b = new BigNumber(1000000000)

const c = a.multipliedBy(b)

p("a * b = c")

p("a : " + a.toFixed())

p("b : " + b.toFixed())

p("c : " + c.toFixed())

a * b = c
a : 0.000000000000000001
b : 1000000000
c : 0.000000001

a * b = c

a : 0.000000000000000001

b : 1000000000

c : 0.000000001

2018.09.04

非同期処理も順番守って出力させたい

class PrinterBuffer {
  constructor(id) {
    this.isConsole = (id === undefined)
    this.ps = []
    if (this.isConsole) {
      this.lineFeedMark = '\n'
    } else {
      this.lineFeedMark = '<br>'
      this.element = document.getElementById(id)
    }
  }
  output(s) {
    if (this.isConsole) {
      console.log(s)
    } else {
      this.element.innerHTML = s
    }
  }
  flush() {
    Promise.all(this.ps).then(results => {
      let s = "";
      for (const result of results) {
        s += result + this.lineFeedMark
      }
      this.output(s)
    })
  }
  push(s) {
    this.ps.push(new Promise(resolve => {
      resolve(s)
    }))
  }
  pushPromise(promise, writeBack) {
    this.ps.push(new Promise(resolve => {
      promise.then(result => {
        resolve(writeBack(result))
      })
    }))
  }
  pushPromiseArray(promiseArray, arrayWriteBack) {
    this.ps.push(new Promise(resolve => {
      Promise.all(promiseArray).then(results => {
        resolve(arrayWriteBack(results))
      })
    }))
  }
}

function main() {
  // const p = new PrinterBuffer('p1')
  const p = new PrinterBuffer()
  const getPromiseVar = (len) => {
    const ps = []
    for (var i = 0; i < len; i++) {
      ps.push(new Promise(resolve => {
        setTimeout(() => {
          resolve(i)
        }, 0);
      }))
    }
    return ps
  }
  const getPromiseLet = (len) => {
    const ps = []
    for (let i = 0; i < len; i++) {
      ps.push(new Promise(resolve => {
        setTimeout(() => {
          resolve(i)
        }, 0);
      }))
    }
    return ps
  }
  const len = 5;

  p.push("first")
  p.pushPromise(new Promise(resolve => {
    resolve("pushPromise() first");
  }), ret => ret)

  p.pushPromiseArray(getPromiseVar(len), rets => rets)

  p.push("second")
  p.pushPromise(new Promise(resolve => {
    resolve("pushPromise() second");
  }), ret => ret)

  p.pushPromiseArray(getPromiseLet(len), rets => rets)

  p.push("third")
  p.pushPromise(new Promise(resolve => {
    resolve("pushPromise() third");
  }), ret => ret)

  p.flush()
}

main()

class PrinterBuffer {

constructor(id) {

this.isConsole = (id === undefined)

this.ps = []

if (this.isConsole) {

this.lineFeedMark = '\n'

} else {

this.lineFeedMark = '<br>'

this.element = document.getElementById(id)

}

output(s) {

if (this.isConsole) {

console.log(s)

} else {

this.element.innerHTML = s

}

flush() {

Promise.all(this.ps).then(results => {

let s = "";

for (const result of results) {

s += result + this.lineFeedMark

}

this.output(s)

})

}

push(s) {

this.ps.push(new Promise(resolve => {

resolve(s)

}))

}

pushPromise(promise, writeBack) {

this.ps.push(new Promise(resolve => {

promise.then(result => {

resolve(writeBack(result))

})

}))

}

pushPromiseArray(promiseArray, arrayWriteBack) {

this.ps.push(new Promise(resolve => {

Promise.all(promiseArray).then(results => {

resolve(arrayWriteBack(results))

})

}))

}

function main() {

// const p = new PrinterBuffer('p1')

const p = new PrinterBuffer()

const getPromiseVar = (len) => {

const ps = []

for (var i = 0; i < len; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i)

}, 0);

}))

}

return ps

}

const getPromiseLet = (len) => {

const ps = []

for (let i = 0; i < len; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i)

}, 0);

}))

}

return ps

}

const len = 5;

p.push("first")

p.pushPromise(new Promise(resolve => {

resolve("pushPromise() first");

}), ret => ret)

p.pushPromiseArray(getPromiseVar(len), rets => rets)

p.push("second")

p.pushPromise(new Promise(resolve => {

resolve("pushPromise() second");

}), ret => ret)

p.pushPromiseArray(getPromiseLet(len), rets => rets)

p.push("third")

p.pushPromise(new Promise(resolve => {

resolve("pushPromise() third");

}), ret => ret)

p.flush()

}

main()

first
pushPromise() first
5,5,5,5,5
second
pushPromise() second
0,1,2,3,4
third
pushPromise() third

first

pushPromise() first

5,5,5,5,5

second

pushPromise() second

0,1,2,3,4

third

pushPromise() third

2018.08.28

Promise.all()は本当に並列処理しているのか

⇒Promise.all()は本当に並列処理している

main();

function main() {
  const p = console.log;
  const getTimeoutPromise = timespan_ms => {
    return new Promise(resolve => {
      setTimeout(() => {
        resolve("timespan_ms : " + timespan_ms);
      }, timespan_ms);
    });
  };
  const sub = () => {
    const ps = [];
    ps.push(getTimeoutPromise(50));
    ps.push(getTimeoutPromise(40));
    ps.push(getTimeoutPromise(100));
    ps.push(getTimeoutPromise(30));
    ps.push(getTimeoutPromise(20));
    ps.push(getTimeoutPromise(10));

    const start = new Date();
    new Promise(resolve => {
      Promise.all(ps).then(results => {
        resolve(results);
      });
    }).then(result => {
      p(result);
      const end = new Date();
      const timelapse = end.getTime() - start.getTime();
      p("timelapse : " + timelapse + "[ms]");
    });
  };
  sub();
}

main();

function main() {

const p = console.log;

const getTimeoutPromise = timespan_ms => {

return new Promise(resolve => {

setTimeout(() => {

resolve("timespan_ms : " + timespan_ms);

}, timespan_ms);

});

};

const sub = () => {

const ps = [];

ps.push(getTimeoutPromise(50));

ps.push(getTimeoutPromise(40));

ps.push(getTimeoutPromise(100));

ps.push(getTimeoutPromise(30));

ps.push(getTimeoutPromise(20));

ps.push(getTimeoutPromise(10));

const start = new Date();

new Promise(resolve => {

Promise.all(ps).then(results => {

resolve(results);

});

}).then(result => {

p(result);

const end = new Date();

const timelapse = end.getTime() - start.getTime();

p("timelapse : " + timelapse + "[ms]");

});

};

sub();

}

[ 'timespan_ms : 50',
  'timespan_ms : 40',
  'timespan_ms : 100',
  'timespan_ms : 30',
  'timespan_ms : 20',
  'timespan_ms : 10' ]
timelapse : 103[ms]

[ 'timespan_ms : 50',

'timespan_ms : 40',

'timespan_ms : 100',

'timespan_ms : 30',

'timespan_ms : 20',

'timespan_ms : 10' ]

timelapse : 103[ms]

4 5 6 789 10 11 12

JavaScript

最大公約数を求める

□に1から9の数を1回ずつ入れて式を完成させましょう。

寿司打のランキングの平均タイプ数をグラフ化した

5%の確率に挑戦して少なくとも1回成功する割合が85%を超えるのは、何回挑戦したときか→37回

厚さ0.1ミリの新聞紙を37回折ったら地球の直径を超えるみたいなやつ

1000000 以下の素数の個数の計算にかかる時間(ミリ秒)

1000本のワインの中から1本の毒入りワインを見つける問題を解いた

bignumber.jsを使った小数点以下の計算

非同期処理も順番守って出力させたい

Promise.all()は本当に並列処理しているのか

最近の投稿

サイトマップ

カテゴリー

アーカイブ

人気の投稿とページ

Twitter