测试

测试中文 Chinese。

H1

H2

H3

H4

H5
H6

粗体 Bold

斜体 Italic

  • a
  • b
  • c
  1. a
  2. b
  3. c

eiπ+1=0e^{\mathrm{i}\pi}+1=0

ans=114514=1919810\begin{aligned} ans&=114514\\ &=1919810 \end{aligned}

ωn±1=cos(2πn)±sin(2πn)i(2,8)\omega_n^{\pm 1}=\cos\left(\cfrac{2\pi}{n}\right)\pm\sin\left(\cfrac{2\pi}{n}\right)\text{i}\tag{2,8}

F(x)=Fl(x2)+xFr(x2)(3)F(x)=F_l\left(x^2\right)+xF_r\left(x^2\right)\tag{3}

F(ωnk)=Fl(ωn/2k)+ωnkFr(ωn/2k)F(ωnn/2+k)=Fl(ωn/2k)ωnkFr(ωn/2k)(4,5)\begin{aligned} F\left(\omega_n^k\right)&=F_l\left(\omega_{n/2}^k\right)+\omega_n^k F_r\left(\omega_{n/2}^k\right) \\ F\left(\omega_n^{n/2+k}\right)&=F_l\left(\omega_{n/2}^k\right)-\omega_n^k F_r\left(\omega_{n/2}^k\right) \end{aligned}\tag{4,5}

Yj=F(ωnj)=k=0n1(ωnj)k×F[k](6)Y_j=F\left(\omega_n^j\right)=\sum_{k=0}^{n-1}\left(\omega_n^j\right)^k\times F[k]\tag{6}

F[i]=1nj=0n1(ωni)j×Yj(7)F[i]=\cfrac{1}{n}\sum_{j=0}^{n-1}\left(\omega_n^{-i}\right)^j\times Y_j\tag{7}


1
2
3
4
5
6
7
#include <iostream>

int main()
{
printf("Hello World");
return 0;
}

code

sout

洛谷

himalaya.jpg

点击查看神秘数字 114514
  • [x] 114514
  • [ ] 1919810

[!NOTE]
Useful information that users should know, even when skimming content.

[!TIP]
Helpful advice for doing things better or more easily.

[!IMPORTANT]
Key information users need to know to achieve their goal.

[!WARNING]
Urgent info that needs immediate user attention to avoid problems.

[!CAUTION]
Advises about risks or negative outcomes of certain actions.

There is a comment below.

There is a comment above.

Here is a simple flow chart:

1
2
3
4
5
graph TD;
A-->B;
A-->C;
B-->D;
C-->D;