【数字加减】

Sums of Digits

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
    
int n;
const int maxn = 510;
int a[maxn];
int L;

void f1(int add)
{
	int i=1;
	while(add >= 0)
	{
		if(a[i] == 9) 
		{
			i++;
			L = max(L,i);
		}
		else 
		{
			a[i]++;
			add--;
		}
	}
}

void f2(int add)
{
	int i=1;
	while(add <= 0)
	{
		add += a[i];
		a[i] = 0;
		i ++;
		L = max(L,i);
	}
	while(a[i] == 9)
	{
		add += a[i];
		a[i] = 0;
		i++;
		L = max(L,i);
	}
	a[i]++,add--;
	f1(add);
}

void output()
{
	for(int i=L;i>=1;i--)
	{
		printf("%d",a[i]);
	}
	puts("");
}
int main()
{
    freopen("1.txt","r",stdin);
    scanf("%d",&n);
	int b1,b2;
	b1 = 0;
	L = 1;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&b2);
		b2 = b2 - b1;
		b1 = b2;
		if(b2 > 0) f1(b2);
		else f2(b2);
		output();
	}
    //fclose(stdin);
    //fclose(stdout);
    //system("out.txt")
    return 0;
}