李昊大佬的CV模板 

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<iomanip>
 5 #include<cmath>
 6 #include<cstring>
 7 #include<string>
 8 #include<algorithm>
 9 #include<time.h>
10 #include<queue>
11 using namespace std;//一堆头文件
12 typedef long long ll;
13 typedef long double ld;
14 typedef pair<int,int> pr;
15 const double pi=acos(-1);
16 #define rep(i,a,n) for(int i=a;i<=n;i++)
17 #define per(i,n,a) for(int i=n;i>=a;i--)//一群for循环
18 #define Rep(i,u) for(int i=head[u];i;i=Next[i])
19 #define clr(a) memset(a,0,sizeof a)
20 #define pb push_back
21 #define mp make_pair
22 #define fi first
23 #define sc second
24 ld eps=1e-9;
25 ll pp=1000000007;
26 ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}//模运算优化
27 ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}//快速幂
28 ll read(){
29     ll ans=0;
30     char last=' ',ch=getchar();
31     while(ch<'0' || ch>'9')last=ch,ch=getchar();
32     while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
33     if(last=='-')ans=-ans;
34     return ans;
35 }//快读
36 //head//防止找不到从哪里开始...

 

posted @ 2019-04-04 18:07  小蒟蒻皮皮鱼  阅读(480)  评论(0)    收藏  举报