2134.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 2134 on 2005-10-22 at 20:00:21 */ 
#include <cstdio>
#include <cstring>

const int MAX = 128;
int digit[16];

void change(int);

int main()
{
	int n, m;
	int i, j;
	int p, q, r, x, t, total;
	char line[MAX];

	scanf("%d\n", &n);
	for(i = 0; i < n; i++) {
		memset(digit, 0, sizeof(digit));
		for(j = 0; j < 2; j++) {
			gets(line);
			printf(line);
			putchar('\n');
		}
		sscanf(line, "%d", &m);
		t = 0;
		while(t < m) {
			gets(line);
			if(line[0] == '+') {
				sscanf(line, "%*s %d %d %d", &p, &q, &r);
				x = (q - p) / r + 1;
				for(j = 0; j < x; j++, t++) {
					change(p+j*r);
					if(t == m) {
						break;
					}
				}
			} else {
				sscanf(line, "%d", &p);
				change(p);
				t++;
			}
		}
		total = 0;
		for(j = 0; j < 10; j++) {
			printf("Make %d digit %d\n", digit[j], j);
			total += digit[j];
		}
		if(total == 1) {
			printf("In total 1 digit\n");
		} else {
			printf("In total %d digits\n", total);
		}
	}
	
	return 0;
}

void change(int n)
{
	do {
		digit[n%10]++;
		n /= 10;
	} while(n != 0);
}