Codeforces Round #289 (Div. 2, ACM ICPC Rules) C. Sums of Digits
2015-03-12 19:10
471 查看
贪心,找比前一位大并且各位数字和为a[i]的最小的数。。。
#include <iostream> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cstdio> #include <algorithm> #include <cstring> #include <climits> #include <cstdlib> #include <cmath> #include <time.h> #define maxn 20005 #define maxm 200005 #define eps 1e-7 #define mod 1000000007 #define INF 0x3f3f3f3f #define PI (acos(-1.0)) #define lowbit(x) (x&(-x)) #define mp make_pair #define ls o<<1 #define rs o<<1 | 1 #define lson o<<1, L, mid #define rson o<<1 | 1, mid+1, R #define pii pair<int, int> #pragma comment(linker, "/STACK:16777216") typedef long long LL; typedef unsigned long long ULL; using namespace std; LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;} LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;} //head int a[maxn]; int res[maxn]; int len, n; void read() { scanf("%d", &n); for(int i = 1; i <= n; i++) scanf("%d", &a[i]); } void next(int t) { for(int i = 1; t > 0; i++) { while(res[i] < 9 && t > 0) res[i]++, t--; len = max(len, i); } for(int i = len; i >= 1; i--) printf("%d", res[i]); printf("\n"); } void solve(int t) { if(t > 0) next(t); else { for(int i = 1; i <= len + 1; i++) { if(t > 0) { while(res[i] == 9) t += res[i], res[i] = 0, i++; res[i]++, t--; if(i == len + 1) len++; next(t); break; } if(t <= 0) t += res[i], res[i] = 0; } } } void work() { len = 1; for(int i = 1; i <= n; i++) solve(a[i] - a[i-1]); } int main() { read(); work(); return 0; }
相关文章推荐
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) E. Pretty Song 算贡献+前缀和
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) 部分题解
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) E. Pretty Song
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) D. Restoring Numbers 构造 数学
- Codeforces Round #289 (Div. 2, ACM ICPC Rules) E. Pretty Song
- Codeforces Round #289 (Div. 2, ACM ICPC Rules)C. Sums of Digits
- Codeforces Round #289 C. Sums of Digits(构造)
- Codeforces Round #145 (Div. 1, ACM-ICPC Rules)A
- Codeforces Round #277.5 (Div. 2) C. Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2) C. Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
- Codeforces Round #277.5 (Div. 2)——C贪心—— Given Length and Sum of Digits
- Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
- Codeforces Round #277.5 (Div. 2)C——Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2)-C. Given Length and Sum of Digits...
- Codeforces Round #277.5 (Div. 2)C——Given Length and Sum of Digits...
- Codeforces Round #277.5(Div. 2) C. Given Length and Sum of Digits...【贪心】
- Codeforces Round #310 (Div. 2) B. Case of Fake Numbers 水题
- Codeforces Codeforces Round #432 (Div. 2 D ) Arpa and a list of numbers
- Codeforces Round #418 (Div. 2) 814 C. An impassioned circulation of affection