1
0
Fork 0

small cleanup's

This commit is contained in:
Henrik Hautakoski 2011-01-24 16:49:52 +01:00
parent 83dfee0e24
commit c50d94ec81
3 changed files with 16 additions and 16 deletions

28
p2.c
View file

@ -10,22 +10,22 @@
#include <stdio.h> #include <stdio.h>
int main() { int main() {
int a = 1, b = 1, r = 0;
for(;;) {
int c = a + b;
a = b;
b = c;
if (~c & 1) int a = 1, b = 1, r = 0;
r += c;
for(;;) {
int c = a + b;
a = b;
b = c;
if (~c & 1)
r += c;
if (c >= 4000000) if (c >= 4000000)
break; break;
} }
printf("%i\n", r);
return 0; printf("%i\n", r);
return 0;
} }

2
p25.c
View file

@ -15,7 +15,7 @@
#define LOG10PHI 0.20898764024997876221 /* log10((1+sqrt(5))/2) */ #define LOG10PHI 0.20898764024997876221 /* log10((1+sqrt(5))/2) */
#define MAGIC 0.65051499783199062676 /* |(log10(5) / 2) - 1| */ #define MAGIC 0.65051499783199062676 /* |(log10(5) / 2) - 1| */
#define fibolen(n) ((int) ceil(((n) - MAGIC) / LOG10PHI)) #define fibolen(n) ((unsigned int) ceil(((n) - MAGIC) / LOG10PHI))
int main() { int main() {

2
p3.c
View file

@ -30,7 +30,7 @@ int main() {
bint i, r = 0, n = 600851475143; bint i, r = 0, n = 600851475143;
for(i=2; i <= n ; i++) { for(i=2; i <= n; i++) {
if((r = gcd(n, i)) == 1) if((r = gcd(n, i)) == 1)
continue; continue;