LightOJ-Solutions/1035-Intelligent-Factorial-Factorization.cpp at master · hackerkid/LightOJ-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
#include <vector>
#include <string.h>
#include <stdio.h>
using namespace std;
vector <int> primes;

int sieve()
{

	int a[102];
	memset(a, 0, sizeof(a));

	for (int i = 2; i <= 100; i++) {

		if(a[i] == 0) {
			primes.push_back(i);
			for (int j = 2 * i; j <= 100; j = j + i) {
				a[j] = 1;
			}
		}

	}


}


int main()
{

	int t;
	int n;
	int a[105];
	int ans[105];
	int Cases;

	sieve();

	scanf("%d", &Cases);

	for (int cases = 1; cases <= Cases; cases++) {
		scanf("%d", &n);
		memset(ans, 0, sizeof(ans));
		for (int i = 1; i <= n; i++) {
			a[i] = i;
		}

		for (int j = 0; primes[j] <= n and j < primes.size(); j++) {
			t = primes[j];
			for (int i = t; i <= n; i = i + t) {
				while(a[i] % t == 0) {
					a[i] = a[i] / t;
					ans[t]++;
				}

			}

		}
		printf("Case %d: %d = ", cases, n);
		for (int i = 0; primes[i] <= n and i < primes.size(); i++) {
			printf("%d (%d)",primes[i], ans[primes[i]]);
			if(i != primes.size() - 1 and primes[i+1] <= n) {
				printf(" * ");
			}
		}

		printf("\n");


	}


}