aboutsummaryrefslogtreecommitdiffstats
path: root/main1.c
blob: 164a8ed95b8fd78fdc2758fd8761b63dcf99e979 (plain)
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
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <math.h>

#define GEN_MAX 1000000000

static int tenpow(int pow) {
	int base = 10;
	int ret = 1;
	while (pow) {
		if (pow & 0b1)
			ret *= base;
		base *= base;
		pow >>= 1;
	}
	return ret;
}

static char get_at_pos(unsigned int n, int pos) {
	n /= tenpow(pos);
	return n % 10;
}

int main(int argc, char *argv[]) {
	srand(time(NULL));
	int arr[10] = {0};
	unsigned int gen;

	int iters, pos;
	if (argc == 3) {
		iters = atoi(argv[1]);
		pos = atoi(argv[2]);
		if (!iters || !pos) goto fail;
	} else {
		fputs("Iterations: ", stdout);
		if (!scanf("%i", &iters)) goto fail;
		fputs("Position (10^N): ", stdout);
		if (!scanf("%i", &pos)) goto fail;
	}

	for (int _ = 0; _ < iters; ++_) {
		gen = rand() % GEN_MAX;
#ifdef PRINT_GENERATED
		printf("%i\n", gen);
#endif
		++arr[get_at_pos(gen, pos)];
	}
	
	printf("count of numbers at position %i:\n", pos);
	for (int i = 0; i < 10; ++i) 
		printf("\t%i: %i\n", i, arr[i]);

	return EXIT_SUCCESS;
fail:
	fputs("Input a valid number\n", stderr);
	return EXIT_FAILURE;
}