Skip to content

Commit 235e3df

Browse files
eagletmteagletmt
committed
add problem1[0-9].c
1 parent 32c2548 commit 235e3df

10 files changed

+517
-0
lines changed

‎10-19/problem10.c

+31
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
#include <stdlib.h>
8+
9+
int main(void)
10+
{
11+
char *sieve;
12+
unsigned i, j;
13+
size_t n = 2000000;
14+
unsigned long long sum = 0ULL;
15+
16+
sieve = calloc(n, sizeof *sieve);
17+
for (i = 2; i < n; i++) {
18+
if (!sieve[i]) {
19+
sum += i;
20+
for (j = i*2; j < n; j += i) {
21+
sieve[j] = 1;
22+
}
23+
}
24+
}
25+
free(sieve);
26+
27+
printf("%llu\n", sum);
28+
29+
return 0;
30+
}
31+

‎10-19/problem11.c

+57
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
8+
#define N 20
9+
10+
static __inline unsigned max(unsigned a, unsigned b);
11+
12+
int main(void)
13+
{
14+
unsigned grid[20][20] = {
15+
{8,2,22,97,38,15,0,40,0,75,4,5,7,78,52,12,50,77,91,8},
16+
{49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,4,56,62,0},
17+
{81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,3,49,13,36,65},
18+
{52,70,95,23,4,60,11,42,69,24,68,56,1,32,56,71,37,2,36,91},
19+
{22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80},
20+
{24,47,32,60,99,3,45,2,44,75,33,53,78,36,84,20,35,17,12,50},
21+
{32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70},
22+
{67,26,20,68,2,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21},
23+
{24,55,58,5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72},
24+
{21,36,23,9,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95},
25+
{78,17,53,28,22,75,31,67,15,94,3,80,4,62,16,14,9,53,56,92},
26+
{16,39,5,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57},
27+
{86,56,0,48,35,71,89,7,5,44,44,37,44,60,21,58,51,54,17,58},
28+
{19,80,81,68,5,94,47,69,28,73,92,13,86,52,17,77,4,89,55,40},
29+
{4,52,8,83,97,35,99,16,7,97,57,32,16,26,26,79,33,27,98,66},
30+
{88,36,68,87,57,62,20,72,3,46,33,67,46,55,12,32,63,93,53,69},
31+
{4,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36},
32+
{20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,4,36,16},
33+
{20,73,35,29,78,31,90,1,74,31,49,71,48,86,81,16,23,57,5,54},
34+
{1,70,54,71,83,51,54,69,16,92,33,48,61,43,52,1,89,19,67,48},
35+
};
36+
unsigned m = 0;
37+
unsigned i, j;
38+
39+
for (i = 0; i < N-3; i++) {
40+
for (j = 0; j < N-3; j++) {
41+
unsigned h = grid[i][j] * grid[i][j+1] * grid[i][j+2] * grid[i][j+3];
42+
unsigned v = grid[j][i] * grid[j+1][i] * grid[j+2][i] * grid[j+3][i];
43+
unsigned d1 = grid[i][j] * grid[i+1][j+1] * grid[i+2][j+2] * grid[i+3][j+3];
44+
unsigned d2 = grid[i][N-j-1] * grid[i+1][N-j-2] * grid[i+2][N-j-3] * grid[i+3][N-j-4];
45+
m = max(m, max(h, max(v, max(d1, d2))));
46+
}
47+
}
48+
printf("%u\n", m);
49+
50+
return 0;
51+
}
52+
53+
unsigned max(unsigned a, unsigned b)
54+
{
55+
return a > b ? a : b;
56+
}
57+

‎10-19/problem12.c

+36
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
8+
static unsigned divisor_count(unsigned long n);
9+
10+
int main(void)
11+
{
12+
unsigned long i = 1, n = 1;
13+
14+
while (divisor_count(n) < 500) {
15+
n += ++i;
16+
}
17+
printf("%lu\n", n);
18+
return 0;
19+
}
20+
21+
unsigned divisor_count(unsigned long n)
22+
{
23+
unsigned ret = 1;
24+
unsigned long i;
25+
26+
for (i = 2; i <= n; i++) {
27+
unsigned c = 0;
28+
while (n % i == 0) {
29+
c++;
30+
n /= i;
31+
}
32+
ret *= c+1;
33+
}
34+
return ret;
35+
}
36+

‎10-19/problem13.c

+138
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,138 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
#include <stdlib.h>
8+
#include <gmp.h>
9+
10+
#define N 100
11+
12+
int main(void)
13+
{
14+
char digits[][N] = {
15+
"37107287533902102798797998220837590246510135740250",
16+
"46376937677490009712648124896970078050417018260538",
17+
"74324986199524741059474233309513058123726617309629",
18+
"91942213363574161572522430563301811072406154908250",
19+
"23067588207539346171171980310421047513778063246676",
20+
"89261670696623633820136378418383684178734361726757",
21+
"28112879812849979408065481931592621691275889832738",
22+
"44274228917432520321923589422876796487670272189318",
23+
"47451445736001306439091167216856844588711603153276",
24+
"70386486105843025439939619828917593665686757934951",
25+
"62176457141856560629502157223196586755079324193331",
26+
"64906352462741904929101432445813822663347944758178",
27+
"92575867718337217661963751590579239728245598838407",
28+
"58203565325359399008402633568948830189458628227828",
29+
"80181199384826282014278194139940567587151170094390",
30+
"35398664372827112653829987240784473053190104293586",
31+
"86515506006295864861532075273371959191420517255829",
32+
"71693888707715466499115593487603532921714970056938",
33+
"54370070576826684624621495650076471787294438377604",
34+
"53282654108756828443191190634694037855217779295145",
35+
"36123272525000296071075082563815656710885258350721",
36+
"45876576172410976447339110607218265236877223636045",
37+
"17423706905851860660448207621209813287860733969412",
38+
"81142660418086830619328460811191061556940512689692",
39+
"51934325451728388641918047049293215058642563049483",
40+
"62467221648435076201727918039944693004732956340691",
41+
"15732444386908125794514089057706229429197107928209",
42+
"55037687525678773091862540744969844508330393682126",
43+
"18336384825330154686196124348767681297534375946515",
44+
"80386287592878490201521685554828717201219257766954",
45+
"78182833757993103614740356856449095527097864797581",
46+
"16726320100436897842553539920931837441497806860984",
47+
"48403098129077791799088218795327364475675590848030",
48+
"87086987551392711854517078544161852424320693150332",
49+
"59959406895756536782107074926966537676326235447210",
50+
"69793950679652694742597709739166693763042633987085",
51+
"41052684708299085211399427365734116182760315001271",
52+
"65378607361501080857009149939512557028198746004375",
53+
"35829035317434717326932123578154982629742552737307",
54+
"94953759765105305946966067683156574377167401875275",
55+
"88902802571733229619176668713819931811048770190271",
56+
"25267680276078003013678680992525463401061632866526",
57+
"36270218540497705585629946580636237993140746255962",
58+
"24074486908231174977792365466257246923322810917141",
59+
"91430288197103288597806669760892938638285025333403",
60+
"34413065578016127815921815005561868836468420090470",
61+
"23053081172816430487623791969842487255036638784583",
62+
"11487696932154902810424020138335124462181441773470",
63+
"63783299490636259666498587618221225225512486764533",
64+
"67720186971698544312419572409913959008952310058822",
65+
"95548255300263520781532296796249481641953868218774",
66+
"76085327132285723110424803456124867697064507995236",
67+
"37774242535411291684276865538926205024910326572967",
68+
"23701913275725675285653248258265463092207058596522",
69+
"29798860272258331913126375147341994889534765745501",
70+
"18495701454879288984856827726077713721403798879715",
71+
"38298203783031473527721580348144513491373226651381",
72+
"34829543829199918180278916522431027392251122869539",
73+
"40957953066405232632538044100059654939159879593635",
74+
"29746152185502371307642255121183693803580388584903",
75+
"41698116222072977186158236678424689157993532961922",
76+
"62467957194401269043877107275048102390895523597457",
77+
"23189706772547915061505504953922979530901129967519",
78+
"86188088225875314529584099251203829009407770775672",
79+
"11306739708304724483816533873502340845647058077308",
80+
"82959174767140363198008187129011875491310547126581",
81+
"97623331044818386269515456334926366572897563400500",
82+
"42846280183517070527831839425882145521227251250327",
83+
"55121603546981200581762165212827652751691296897789",
84+
"32238195734329339946437501907836945765883352399886",
85+
"75506164965184775180738168837861091527357929701337",
86+
"62177842752192623401942399639168044983993173312731",
87+
"32924185707147349566916674687634660915035914677504",
88+
"99518671430235219628894890102423325116913619626622",
89+
"73267460800591547471830798392868535206946944540724",
90+
"76841822524674417161514036427982273348055556214818",
91+
"97142617910342598647204516893989422179826088076852",
92+
"87783646182799346313767754307809363333018982642090",
93+
"10848802521674670883215120185883543223812876952786",
94+
"71329612474782464538636993009049310363619763878039",
95+
"62184073572399794223406235393808339651327408011116",
96+
"66627891981488087797941876876144230030984490851411",
97+
"60661826293682836764744779239180335110989069790714",
98+
"85786944089552990653640447425576083659976645795096",
99+
"66024396409905389607120198219976047599490197230297",
100+
"64913982680032973156037120041377903785566085089252",
101+
"16730939319872750275468906903707539413042652315011",
102+
"94809377245048795150954100921645863754710598436791",
103+
"78639167021187492431995700641917969777599028300699",
104+
"15368713711936614952811305876380278410754449733078",
105+
"40789923115535562561142322423255033685442488917353",
106+
"44889911501440648020369068063960672322193204149535",
107+
"41503128880339536053299340368006977710650566631954",
108+
"81234880673210146739058568557934581403627822703280",
109+
"82616570773948327592232845941706525094512325230608",
110+
"22918802058777319719839450180888072429661980811197",
111+
"77158542502016545090413245809786882778948721859617",
112+
"72107838435069186155435662884062257473692284509516",
113+
"20849603980134001723930671666823555245252804609722",
114+
"53503534226472524250874054075591789781264330331690",
115+
};
116+
117+
int i;
118+
char *str;
119+
mpz_t sum, t;
120+
121+
mpz_init_set_ui(sum, 0);
122+
mpz_init(t);
123+
for (i = 0; i < N; i++) {
124+
mpz_set_str(t, digits[i], 10);
125+
mpz_add(sum, sum, t);
126+
}
127+
128+
str = mpz_get_str(NULL, 10, sum);
129+
str[10] = 0;
130+
puts(str);
131+
132+
free(str);
133+
mpz_clear(sum);
134+
mpz_clear(t);
135+
136+
return 0;
137+
}
138+

‎10-19/problem14.c

+34
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
8+
static unsigned collatz_count(unsigned n);
9+
10+
int main(void)
11+
{
12+
unsigned i, max_c = 0, max_i = 0;
13+
14+
for (i = 1; i < 1000000; i++) {
15+
unsigned c = collatz_count(i);
16+
if (c > max_c) {
17+
max_c = c;
18+
max_i = i;
19+
}
20+
}
21+
printf("%u\n", max_i);
22+
return 0;
23+
}
24+
25+
unsigned collatz_count(unsigned n)
26+
{
27+
unsigned c = 0;
28+
while (n > 1) {
29+
n = n%2==0 ? n/2 : 3*n+1;
30+
c++;
31+
}
32+
return c+1;
33+
}
34+

‎10-19/problem15.c

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
#include <gmp.h>
8+
9+
int main(void)
10+
{
11+
mpz_t n, m;
12+
13+
/* calculate 40C20 as 40! / (20! * 20!) */
14+
mpz_init(n); mpz_init(m);
15+
mpz_fac_ui(n, 40); mpz_fac_ui(m, 20);
16+
mpz_mul(m, m, m);
17+
mpz_divexact(n, n, m);
18+
19+
mpz_out_str(stdout, 10, n);
20+
putchar('\n');
21+
22+
mpz_clear(n);
23+
mpz_clear(m);
24+
25+
return 0;
26+
}
27+

‎10-19/problem16.c

+32
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
/*
2+
* Copyright (c) 2009, eagletmt
3+
* Released under the MIT License <http://opensource.org/licenses/mit-license.php>
4+
*/
5+
6+
#include <stdio.h>
7+
#include <stdlib.h>
8+
#include <gmp.h>
9+
10+
int main(void)
11+
{
12+
mpz_t n;
13+
char *str;
14+
size_t len, i;
15+
unsigned sum = 0;
16+
17+
mpz_init(n);
18+
mpz_ui_pow_ui(n, 2, 1000);
19+
20+
str = mpz_get_str(NULL, 10, n);
21+
len = mpz_sizeinbase(n, 10);
22+
for (i = 0; i < len; i++) {
23+
sum += str[i]-'0';
24+
}
25+
printf("%u\n", sum);
26+
27+
free(str);
28+
mpz_clear(n);
29+
30+
return 0;
31+
}
32+

0 commit comments

Comments
 (0)