Codeforces Round #492 (Div. 2)-白红宇

Codeforces Round #492 (Div. 2)

阅读量：4685 次

发布时间：2019-06-09

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

/*从大往小依次除*/#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          #define M#define ll long longusing namespace std;int read() { int nm = 0, f = 1; char c = getchar(); for(; !isdigit(c); c = getchar()) if(c == '-') f = -1; for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0'; return nm * f;}int main() { int n = read(), ans = 0; ans += n / 100; n %= 100; ans += n / 20; n %= 20; ans += n / 10; n %= 10; ans += n / 5; n %= 5; ans += n; cout << ans; return 0;}

/*发现每个路口何时进去是能算出来的   所以O1扫一遍即可 */#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          #define M 100010 #define ll long longusing namespace std;int read() { int nm = 0, f = 1; char c = getchar(); for(; !isdigit(c); c = getchar()) if(c == '-') f = -1; for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0'; return nm * f;}int note[M]; int main() { int n = read(), id, minn = 0x3e3e3e3e; for(int i = 1; i <= n; i++) { note[i] = read(); int op = note[i] - i + 1; int zz = (op + n - 1) / n; if(zz < minn) minn = zz, id = i; } cout << id; return 0;}

/*贪心的写法  每次 选择最靠左的一个不连续的  将右边的贪心移动过来 */#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          #define M#define ll long longusing namespace std;int read() { int nm = 0, f = 1; char c = getchar(); for(; !isdigit(c); c = getchar()) if(c == '-') f = -1; for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0'; return nm * f;}int main() { return 0;}