This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Copyright (C) 2012 Canonical Ltd. | |
# Copyright (C) 2012, 2013 Hewlett-Packard Development Company, L.P. | |
# Copyright (C) 2012 Yahoo! Inc. | |
# | |
# Author: Scott Moser <scott.moser@canonical.com> | |
# Author: Juerg Haefliger <juerg.haefliger@hp.com> | |
# Author: Joshua Harlow <harlowja@yahoo-inc.com> | |
# | |
# This file is part of cloud-init. See LICENSE file for license information. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Future versions of Hyper may add additional config options, | |
// which will not automatically be merged into this file. | |
// See https://hyper.is#cfg for all currently supported options. | |
module.exports = { | |
config: { | |
// choose either `'stable'` for receiving highly polished, | |
// or `'canary'` for less polished but more frequent updates | |
updateChannel: 'stable', |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# coding: utf-8 | |
# http://abc035.contest.atcoder.jp/tasks/abc035_c | |
N, Q = map(int, input().split()) | |
piece = 0b0 | |
for _ in range(Q): | |
l, r = map(int, input().split()) | |
tmp = ['1' if l <= x <= r else '0' for x in range(1, N+1)] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
[‘ズン’, ‘ドコ’]のいずれかをランダムで出力し続け | |
どこかで「ズンズンズンズンドコ」に一致したら「キヨシ」を出力して終了する問題 | |
twitterで先頭に | |
@paiza_run python3: | |
を含めツイート出来るバイト数にする。 | |
''' | |
# coding: utf-8 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# coding: utf-8 | |
''' | |
紙を上記のように折る回数Nが与えられるので | |
紙を折って広げたあとの山折り谷折りの折り目を計算する | |
プログラムを作成してください。 | |
http://paiza.hatenablog.com/entry/2016/02/15/ITエンジニアを目指す学生が、就活を有利に進める | |
''' | |
''' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# coding: utf-8 | |
''' | |
「さて 、では 、もう一つ問題を出そう 。 | |
五つのビリヤ ードの玉を 、真珠のネックレスのように 、リングにつなげてみるとしよう 。 | |
玉には 、それぞれナンバが書かれている 。 | |
さて 、この五つの玉のうち 、幾つ取っても良いが 、隣どうし連続したものしか取れないとしよう 。 | |
一つでも 、二つでも 、五つ全部でも良い 。しかし 、離れているものは取れない 。 | |
この条件で取った玉のナンバを足し合わせて 、 1から 2 1までのすべての数ができるようにしたい 。 | |
さあ 、どのナンバの玉を 、どのように並べて 、ネックレスを作れば良いかな ?」 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# coding: utf-8 | |
# Paiza Lerning 長テーブルのうなぎ屋 (paizaランク B 相当) | |
# https://paiza.jp/learning/long-table | |
n, m = map(int, input().split()) | |
seat = 0 | |
for i in range(m): | |
a, b = map(int, input().split()) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fizzbuzz :: Int -> String | |
fizzbuzz n | |
| n `mod` 15 == 0 = "fizzbuzz" | |
| n `mod` 3 == 0 = "fizz" | |
| n `mod` 5 == 0 = "buzz" | |
| otherwise = show n | |
main = do | |
print $ map fizzbuzz [1..30] |