BestCoder Round #50 (div.1) 1001 Distribution money (HDU OJ 5364)-白红宇

BestCoder Round #50 (div.1) 1001 Distribution money (HDU OJ 5364)

阅读量：7040 次

发布时间：2019-06-28

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

题目：

题意：bestcoder上面有中文题目

1 #include 
     
       2 #include 
      
        3 #include 
       
          4 #include 
        
          5 #include 
         
           6 #include 
          
            7 #include 
           
             8 #include 
            
              9 #include 
             
              10 #include 
              
               11 #define F first12 #define S second13 typedef long long ll;14 using namespace std;15 const double PI = 3.14159265;16 const double E = 2.718281828459;17 const double EPS=1e-8;18 const int M = 1e5+5;19 const int MOD = 1e9+7;20 const int INF = 0x3f3f3f3f;21 22 int n;23 int a[M];24 int main() {25 #ifdef ONLINE_JUDGE26 #else27 freopen( "in.txt", "r", stdin );28 #endif29 while( ~scanf("%d", &n ) ) {30 memset( a, 0, sizeof(a) );31 for( int i=0; i
               
                 n-a[i] ) {40 if( first ) {41 ok = false;42 first = false;43 printf("%d", i );44 }45 else {46 printf(" %d", i );47 }48 }49 }50 if( ok )51 printf("-1");52 printf("\n");53 }54 return 0;55 }