3309633_wa.cc

北大大牛代码 1240道题的原代码 超级权威

#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;

vector <int> tmp, ans;

int posn(int n)
{
	int y = n % 11;
	int x = n / 11;
	return y < 10 ? 10 * x + y : -1;
}

int main()
{
	int n, r, t;
	int base;

	scanf("%d",&n);
	base = 1;
	ans.clear();
	while (base <= n)
	{
		int tn   = n / base;
		int last = n % base;
		r = posn(tn);
		t = r*base+last/2;
		if (r!=-1&&last%2==0&&t!=n-t)
		{
			ans.push_back(t);
		}

		r = posn(tn - 1);
		t = r*base+(last+base)/2;
		if (r!=-1&&(last+base)%2==0&&t!=n-t)
		{
			ans.push_back(t);
		}
		base *= 10;
	}
	sort(ans.begin(),ans.end());
	if(ans.size()==0)
	{
		puts("0");
		return 0;
	}
	tmp.clear();
	tmp.push_back(ans[0]);
	for(int k = 1; k < ans.size(); k++)
	{
		if(ans[k]==ans[k-1])
			continue;
		tmp.push_back(ans[k]);
	}
	printf("%d\n",tmp.size());
	for(int i = 0; i < tmp.size(); i++)
	{
		printf("%d + ",tmp[i]);
		int l1 = (int)log10(tmp[i])+1;
		int l2 = (int)log10(n-tmp[i])+1;
		l1 = l1-l2-1;
		for(int j = 0; j < l1; j++)
			putchar('0');
		printf("%d",n-tmp[i]);
		printf(" = %d\n",n);
		
	}
	return 0;
}