zoukankan      html  css  js  c++  java
  • Hello World!

    (color{purple}{markdown ext{入门笔记}})


    字体

    ({ t for(int i=1;i<=n;++i)})

    ({ m for(int i=1;i<=n;++i)})

    对数

    ( m{log}_{2}n)

    组合数

    (C_{n}^{m}=inom{n}{m}=frac{n!}{m!(n-m)!})

    排列

    (A_{n}^{m}=frac{n!}{(n-m)!})

    常用符号

    (10\%, <, >, leq, geq, eq, in, subset, Leftrightarrow)

    大公式

    [f(x) = sum_{i = 0}^{n} frac{f^{(i)}(x_0) imes (x - x_0)^i}{i!} ]

    [f(n) = sum_{i = 0}^{n} inom{n}{i} g(i) Rightarrow g(n) = sum_{i = 0}^n (-1)^{n-i}inom{n}{i}f(i) ]

    [f(n) = prod_{i = 0}^{n} g(i) ]

    [varphi(n) = sum_{S subseteq {p_1, p_2, cdots, p_k}}(-1)^{|S|}frac{n}{prod_{p_i in S}p_i} ]

    [egin{aligned}f(n) &= 1 + 2 + cdots + n\ &= frac{n(n+1)}{2}end{aligned} ]

    乘除

    (2 imes 3 div 2)

    颜色

    (color{red}{a}color{green}{a}color{yellow}{a}color{olive}{a}color{blue}{a}color{purple}{a})

    其他

    你太了。

    放代码

    for (int i = 1; i <= n; ++i) {
    	a += 1;
    }
    

    引用

    知识就是力量!

  • 相关阅读:
    deleted
    deleted
    deleted
    deleted
    deleted
    deleted
    deleted
    CF #505 B Weakened Common Divisor(数论)题解
    HDU 6425 Rikka with Badminton(组合问题签到)题解
    ZOJ 2747 Paint the Wall(离散化+暴力)题解
  • 原文地址:https://www.cnblogs.com/yqgAKIOI/p/9784043.html
Copyright © 2011-2022 走看看