vscode缺省源

{
    "#include": {
        "prefix": "#include",
        "body": [
            "//code by xxxalq",
            "#include<bits/stdc++.h>",
            "#define ll long long",
            "using namespace std;",
            "",
            "int read(){",
            "    int x=0,f=1;",
            "    char ch=getchar();",
            "    while(ch<48||ch>57){",
            "        if(ch==45){",
            "            f=-1;",
            "        }",
            "        ch=getchar();",
            "    }",
            "    while(ch>=48&&ch<=57){",
            "        x=(x<<3)+(x<<1)+(ch^48);",
            "        ch=getchar();",
            "    }",
            "    return x*f;",
            "}",
            "",
            "int main(){",
            "",  
            "    return 0;",
            "}",
        ],
    },
    "T tests": {
        "prefix": "codeforces",
        "body": [
            "//code by xxxalq",
            "#include<bits/stdc++.h>",
            "#define int long long",
            "using namespace std;",
            "",
            "int read(){",
            "    int x=0,f=1;",
            "    char ch=getchar();",
            "    while(ch<48||ch>57){",
            "        if(ch==45){",
            "            f=-1;",
            "        }",
            "        ch=getchar();",
            "    }",
            "    while(ch>=48&&ch<=57){",
            "        x=(x<<3)+(x<<1)+(ch^48);",
            "        ch=getchar();",
            "    }",
            "    return x*f;",
            "}",
            "",
            "int T=1,n,ans;",
            "",
            "void solve(){",
            "",
            "    return;",
            "}",
            "",
            "signed main(){",
            "    // ios::sync_with_stdio(0);",
            "    // cin.tie(0);",
            "    T=read();",
            "    while(T--){",
            "        ans=0;",
            "        ",
            "        solve();",
            "    }",
            "    return 0;",
            "}",
        ],
    },
    "int qpow": {
		"prefix": "int qpow",
		"body": [
			"int qpow(int a,int b=mod-2){",
			"    int res=1;",
			"    while(b){",
			"        if(b&1){",
			"            res=res*a%mod;",
			"        }",
			"        a=a*a%mod;",
			"        b>>=1;",
			"    }",
			"    return res;",
			"}",
		],
	},
    "ll qpow": {
		"prefix": "ll qpow",
		"body": [
			"ll qpow(ll a,ll b=mod-2){",
			"    ll res=1;",
			"    while(b){",
			"        if(b&1){",
			"            res=res*a%mod;",
			"        }",
			"        a=a*a%mod;",
			"        b>>=1;",
			"    }",
			"    return res;",
			"}",
		],
	},
    "matrix": {
		"prefix": "struct matrix",
		"body": [
			"struct matrix{",
			"    int n,m;",
			"    ll a[][]={};",
			"    void init(){",
			"        for(int i=1;i<=n;i++){",
			"            a[i][i]=1;",
			"        }",
			"        return;",
			"    }",
			"};",
			"",
			"matrix operator *(const matrix &a,const matrix &b){",
			"    matrix c;",
			"    c.n=a.n,c.m=b.m;",
			"    for(int i=1;i<=a.n;i++){",
			"        for(int j=1;j<=b.m;j++){",
			"            for(int k=1;k<=a.m;k++){",
			"                c.a[i][j]=(c.a[i][j]+a.a[i][k]*b.a[k][j]%mod)%mod;",
			"            }",
			"        }",
			"    }",
			"    return c;",
			"}",
			"",
			"matrix qpow(matrix a,int b){",
			"    matrix res;",
			"    res.n=res.m=a.n;",
			"    res.init();",
			"    while(b){",
			"        if(b&1){",
			"            res=res*a;",
			"        }",
			"        a=a*a;",
			"        b>>=1;",
			"    }",
			"    return res;",
			"}",
		],
	},
    "data": {
		"prefix": "data",
		"body": [
			"//code by xxxalq",
			"#include<bits/stdc++.h>",
			"#define int long long",
			"using namespace std;",
			"",
			"mt19937 rnd(time(0));",
			"",
			"int g(int l,int r){",
			"    return rnd()%(r-l+1)+l;",
			"}",
			"",
			"void solve(){",
			"    ",
			"    return;",
			"}",
			"",
			"signed main(){",
			"",
			"    return 0;",
			"}",
		],
	},
}

2 个赞