emm,每次打太麻烦,直接复制就好啦!

#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue> #include<algorithm> #include<cstring> using namespace std; #define duke(i,a,n) for(int i = a;i <= n;i++) #define lv(i,a,n) for(int i = a;i >= n;i--) #define clean(a) memset(a,0,sizeof(a)) const int INF = 1 << 30; typedef long long ll; typedef double db; template <class T> void read(T &x) { char c; bool op = 0; while(c = getchar(), c < '0' || c > '9') if(c == '-') op = 1; x = c - '0'; while(c = getchar(), c >= '0' && c <= '9') x = x * 10 + c - '0'; if(op) x = -x; } template <class T> void write(T x) { if(x < 0) putchar('-'), x = -x; if(x >= 10) write(x / 10); putchar('0' + x % 10); }

 

相关文章:

  • 2022-12-23
  • 2022-01-10
  • 2022-02-10
  • 2022-02-09
  • 2022-02-07
  • 2021-10-29
  • 2021-11-30
猜你喜欢
  • 2022-12-23
  • 2021-09-20
  • 2021-11-25
  • 2022-12-23
  • 2021-12-07
  • 2021-09-16
  • 2022-12-23
相关资源
相似解决方案