自己的缺省(sheng)源

write无力吐槽了

 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 #define REP(i, s, n) for(int i = s; i <= n; i ++)
 #define RAP(i, n, s) for(int i = n; i >= s; i --)
 using namespace std;
 inline void read(int &x){
     x = ; int sig = ; char ch = getchar();
     while(!isdigit(ch)) { if(ch == '-') sig = -; ch = getchar(); }
     while(isdigit(ch)) x =  * x + ch - '', ch = getchar();
     x *= sig; return ;
 }
 inline void write(int x){
     if(x == ) { putchar(''); return ; }
     if(x < ) putchar('-'), x = -x;
     int len = , buf[];
     while(x) buf[len ++] = x % , x /= ;
     RAP(i, len - , ) putchar(buf[i] + ''); return ;
 }
 void init(){

     return ;
 }
 void work(){

     return ;
 }
 void print(){

     return ;
 }
 int main(){
     init();
     work();
     print();
     return ;
 }

新版的：

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 using namespace std;
 inline int read(){
     int x=,sig=;char ch=getchar();
     while(!isdigit(ch)){if(ch=='-') sig=-;ch=getchar();}
     while(isdigit(ch)) x=*x+ch-'',ch=getchar();
     return x*=sig;
 }
 inline void write(int x){
     if(x==){putchar('');return;} if(x<) putchar('-'),x=-x;
     int len=,buf[]; while(x) buf[len++]=x%,x/=;
     for(int i=len-;i>=;i--) putchar(buf[i]+'');return;
 }
 void init(){
     return;
 }
 void work(){
     return;
 }
 void print(){
     return;
 }
 int main(){
     init();work();print();return ;
 }

最新版的……

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<cstring>
 #define PAU putchar(' ')
 #define ENT putchar('\n')
 using namespace std;
 inline int read(){
     int x=,sig=;char ch=getchar();
     while(!isdigit(ch)){if(ch=='-')sig=-;ch=getchar();}
     while(isdigit(ch))x=*x+ch-'',ch=getchar();
     return x*=sig;
 }
 inline void write(int x){
     if(x==){putchar('');return;}if(x<)putchar('-'),x=-x;
     int len=,buf[];while(x)buf[len++]=x%,x/=;
     for(int i=len-;i>=;i--)putchar(buf[i]+'');return;
 }
 void init(){
     return;
 }
 void work(){
     return;
 }
 void print(){
     return;
 }
 int main(){init();work();print();return ;}