banacorn

-- This exercise covers the first 6 chapters of "Learn You a Haskell for Great Good!"

-- Chapter 1 - http://learnyouahaskell.com/introduction
-- Chapter 2 - http://learnyouahaskell.com/starting-out
-- Chapter 3 - http://learnyouahaskell.com/types-and-typeclasses
-- Chapter 4 - http://learnyouahaskell.com/syntax-in-functions
-- Chapter 5 - http://learnyouahaskell.com/recursion
-- Chapter 6 - http://learnyouahaskell.com/higher-order-functions

-- Download this file and then type ":l Chapter-1-6.hs" in GHCi to load this exercise

daniel-geon-park

#include <algorithm>
#include <type_traits>

template <int... Ints>
struct Row {
    constexpr static bool empty = (sizeof...(Ints) == 0);
};

template <typename Upper, typename Lower>
struct Domino {

Treeki

#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>

// munged from https://github.com/simontime/Resead

namespace sead
{
class Random
{

uogbuji

Pixelbook or Pixel Slate Setup

Partly updated June 2023

General caution: Chrome OS is a secure OS by design, but this has at least one key consequence. If you change your Google account password, you will still be required to enter the old password the next time you access each Chrome OS device. Devices are encrypted with that password, so the OS needs to decrypt using the old password then re-encrypt using the new one. If you forget your old password you will lose access to your Chrome OS device data. As always, make sure you keep backups up to date.

Fast User Switching

If you have multiple Chrome OS accounts (Say, work and play), you can quickly sitch between them without logging out:

flamerecca

譯： Recca、黃雅信

CREDIT

GitLab 的六個價值是合作（Collaboration），結果（Results），效率（Efficiency），多元（Diversity），迭代（Iteration）和透明（Transparency）。這六個字拼成 CREDIT 作為我們送給各位的禮物。這些價值觀是相互關聯的，彼此之間互相合作以保護我們公司的文化。下面逐一解釋這些價值觀的操作方式：

合作

即使對目標沒有立即性的幫助，幫助別人應該是首要項目。相同的，你可以依靠別人的協助與意見 - 事實上你也應該要這樣。 每個人，包含不在 gitlab 公司工作的人，都可以對任何專案提意見。對專案負責的人決定專案要怎麼做，但是他應該要認真看待其他人的意見，並解釋為什麼之前有或者沒有這麼做。

pi314

#include <stdio.h>
#include <string.h>
#ifdef ofst
for i in range(12):
    MID, ofst, _ = 12, lambda o, i: int(o[i], 16), """
#else
#define ofst(o, i) 0
int main () { int t; char *s, *_; for (int i = 0; i < 12; i++) {
    s = " """;
    t = (int)(9+(i%3+(int)(i/3))*2-(i>8)*(2*(i-8)+2)) + ofst("466975754C32", i);

josh-hs-ko

-- programming

data Nat : Set where
  zero : Nat
  suc  : Nat → Nat

_+_ : Nat → Nat → Nat
zero  + n = n
suc m + n = suc (m + n)

HenryYang

對應表

銀行/支付系統	Apple Pay	Google Pay	Samsung Pay	Garmin Pay	Fitbit Pay		支援家數
國泰世華銀行	✅	✅	✅	✅	✅		5
國泰世華銀行 - 金融卡	✅	✅	✅	✅	✅		5
中國信託銀行	✅	✅	✅	✅	✅		5
中國信託銀行 - 金融卡	✅	✅	✅				3
台新國際商業銀行	✅	✅	✅	✅	✅		5
台新國際商業銀行 - 金融卡	✅	✅	✅	✅	✅		5
聯邦銀行	✅	✅	✅	✅	✅		5

serg0x

/* Shadow 0dp */
box-shadow: none;

/* Shadow 1dp */
box-shadow: 0 1px 1px 0 rgba(0,0,0,0.14), 0 2px 1px -1px rgba(0,0,0,0.12), 0 1px 3px 0 rgba(0,0,0,0.20);

/* Shadow 2dp */
box-shadow: 0 2px 2px 0 rgba(0,0,0,0.14), 0 3px 1px -2px rgba(0,0,0,0.12), 0 1px 5px 0 rgba(0,0,0,0.20);

/* Shadow 3dp */

tomnomnom

// How many ways can you alert(document.domain)?
// Comment with more ways and I'll add them :)
// I already know about the JSFuck way, but it's too long to add (:

// Direct invocation
alert(document.domain);
(alert)(document.domain);
al\u0065rt(document.domain);
al\u{65}rt(document.domain);
window['alert'](document.domain);