MarkdownTest

Posted 2020-11-10 sun123zxy

前言

打算用Markdown写博客了

爆肝了一晚上让博客的css兼容了markdown编辑器

自己调代码高亮的感觉真好:p

这篇博客就当测试用吧

测试

A

B

C

D

E

F

---

Strong

lol

IDontKnow

TripleMul

(sum _1 ^n 1 = n)

[ gcd(a,b) = gcd(b,a \% b) ]

blog

• Eggs
• Tomatos

1. Add eggs
2. Add tomatos
3. Fried them
4. Here comes a Flandre

• 1-1
  • 2-1
  • 2-2

Name	Position
ZUN	TrumpetGod
Hakurei Reimu	Urban Management
Kirisame Marisa	Thief

Q: What‘s your favorite instrument?Trumpet except.

Zun: ...Horn.

But actually Hakurei Reimu and Kirisame Marisa are close friends.

int main(){return 0;}//one line code

//multi line code
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int lowbit(int val){
    return val&(-val);
}
struct BIT{
    int size;
    int data[500005];
    int tree[500005];
    void init(int mysize){
        size=mysize;
        for(int i=0;i<=mysize;i++){
            tree[i]=0;data[i]=0;
        }
    }
    void change(int id,int val){
        data[id]+=val;
        for(int i=id;i<=size;i+=lowbit(i)){
            tree[i]+=val;
        }
    }
    int getsum(int id){
        if(id==0){
            return 0;
        }
        int ans=0;
        for(int i=id;i>=1;i-=lowbit(i)){
            ans+=tree[i];
        }
        return ans;
    }
    int ask(int l,int r){
        return getsum(r)-getsum(l-1);
    }
}bit;
int main(){
    int a[10]={0,10,9,2,5,9,6};
    bit.init(10);
    for(int i=1;i<=6;i++){
        bit.change(i,a[i]);
    }
    int b[10];
    b[1]=bit.ask(1,2);
    b[2]=bit.ask(4,5);
    b[3]=bit.ask(4,6);
    b[4]=bit.ask(3,4);
    int offset=0;
    for(int i=1;i<=4;i++){
        offset+=b[i]+1;
    }
    offset++;
    for(int i=1;i<=4;i++){
        cout<<char(b[i]+offset);
    }
    for(int i=2;i<=3;i++){
        cout<<char(b[i]+offset);
    }
    return 0;
}

cnblogs do not support flow