AOJ 0525 - Osenbei-白红宇

AOJ 0525 - Osenbei

阅读量：4576 次

发布时间：2019-06-08

本文共 1247 字，大约阅读时间需要 4 分钟。

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=50785

翻译：http://blog.csdn.net/acm_10000h/article/details/40988419

1 #include 
     
       2 #include 
      
        3 #include 
       
         4 #include 
        
          5 #include 
         
           6 #include 
          
            7 #include 
           
             8 #include 
            
              9 #include 
             
              10 #include 
              
               11 #include 
               
                12 #include 
                
                 13 #include 
                 
                  14 #include 
                  15 #include 
                   
                    16 17 #define CL(arr, val) memset(arr, val, sizeof(arr))18 19 #define ll long long20 #define inf 0x7f7f7f7f21 #define lc l,m,rt<<122 #define rc m + 1,r,rt<<1|123 #define pi acos(-1.0)24 25 #define L(x) (x) << 126 #define R(x) (x) << 1 | 127 #define MID(l, r) (l + r) >> 128 #define Min(x, y) (x) < (y) ? (x) : (y)29 #define Max(x, y) (x) < (y) ? (y) : (x)30 #define E(x) (1 << (x))31 #define iabs(x) (x) < 0 ? -(x) : (x)32 #define OUT(x) printf("%I64d\n", x)33 #define lowbit(x) (x)&(-x)34 #define Read() freopen("a.txt", "r", stdin)35 #define Write() freopen("b.txt", "w", stdout);36 #define maxn 100000000037 #define N 101038 using namespace std;39 int a[15][10010];40 bool vis[15];41 int n,m,ans;42 43 void dfs(int k)44 {45 if(k==n)46 {47 int top=0;48 for(int j=0;j