轉載請標明出處，原文地址：http://blog.csdn.net/hackbuteer1/article/details/39253767
#include<iostream>
#include<cstdio>
using namespace std;

void solve(char *str , int n , int len)
{
	int i , j , k , quotient , remainder;
	quotient = len / n;                //原字串被分解的個數
	remainder = len - n * quotient;    //剩餘的字串的個數

	for(i = 0 ; i < len ; i += n)
	{
		if(len - i < n)
		{
			 k = n - len + i;
			 for(j = i ; j < len ; ++j)
				 printf("%c" , str[j]);
			 for(j = 0 ; j < k ; ++j)
				 putchar('0');
		}
		else
		{
			for(j = i ; j < i + n ; ++j)
				printf("%c" , str[j]);
		}
		putchar(' ');
	}
	printf("\n");
}

int main(void)
{
	int i , m , n , len;
	char str[1000];

	while(scanf("%d %d", &m , &n) != EOF)
	{
		for(i = 0 ; i < m ; ++i)
		{
			scanf("%s" , str);
			len = strlen(str);
			solve(str , n , len);
		}
	}
	return 0;
}
 

轉載請標明出處，原文地址：http://blog.csdn.net/hackbuteer1/article/details/39253767
#include<iostream>
#include<cstdio>
using namespace std;

void solve(char *str , int len)
{
	int i;

	for(i = 0 ; i < len ; )
	{
		switch(str[i])
		{
		case 'y':
			putchar('1');
			i += 2;
			break;
		case 'e':
			putchar('2');
			i += 2;
			break;
		case 's':
			if(str[i + 1] == 'a')
			{
				putchar('3');
				i += 3;
			}
			else
			{
				putchar('4');
				i += 2;
			}
			break;
		case 'w':
			putchar('5');
			i += 2;
			break;
		case 'l':
			putchar('6');
			i += 3;
			break;
		case 'q':
			putchar('7');
			i += 2;
			break;
		case 'b':
			putchar('8');
			i += 2;
			break;
		case 'j':
			putchar('9');
			i += 3;
			break;
		}
	}
	printf("\n");
}

int main(void)
{
	int len;
	char str[1000];

	while(scanf("%s" , str) != EOF)
	{
		len = strlen(str);
		solve(str , len);
	}
	return 0;
}
 

轉載請標明出處，原文地址：http://blog.csdn.net/hackbuteer1/article/details/39253767
#include<iostream>
#include<cstdio>
#include<memory>
using namespace std;

void solve(char *str , int len)
{
	int i , hash[256];
	memset(hash , 0 , sizeof(hash));

	for(i = 0 ; i < len ; ++i)
	{
		if(0 == hash[str[i]])
			hash[str[i]] = 1;
	}
	for(i = 0 ; i < 256 ; ++i)
	{
		if(0 != hash[i])
			putchar(i);
	}
	printf("\n");
}

int main(void)
{
	int len;
	char str[1000];

	while(scanf("%s" , str) != EOF)
	{
		len = strlen(str);
		solve(str , len);
	}
	return 0;
}

轉載請標明出處，原文地址：http://blog.csdn.net/hackbuteer1/article/details/39253767
#include<iostream>
#include<cstdio>
using namespace std;

int ops[21];
const char sym[3] = {'+' , '-' , ' '};
int result , num;

void dfs(int layer, int currentResult, int lastOp, int lastSum)
{
	lastSum *= (layer > 9) ? 100 : 10;
	lastSum += layer;
	if(layer == 9)
	{
		currentResult += (lastOp) ? (-1 * lastSum) : lastSum;
		if(currentResult == result)
		{
			++num;
			printf("1");
			for(int i = 2 ; i <= 9 ; ++i)
			{
				if(sym[ops[i-1]] != ' ')
					printf(" %c ", sym[ops[i-1]]);
				printf("%d", i);
			}
			printf(" = %d\n" , result);
		}
		return;
	}
	ops[layer] = 2;
	dfs(layer + 1 , currentResult , lastOp , lastSum);   //Continue
	currentResult += (lastOp)? (-1 * lastSum) : lastSum;
	ops[layer] = 0;
	dfs(layer + 1 , currentResult , 0 , 0);  //Plus
	ops[layer] = 1;
	dfs(layer + 1 , currentResult , 1 , 0);  //Minus
}

int main(void)
{
	while(scanf("%d", &result) != EOF)
	{
		num = 0;
		dfs(1 , 0 , 0 , 0);
		printf("%d\n" , num);
	}
	return 0;
}