sigonasr2
/
ProjectEuler
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Completed 30!

Browse Source 
Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
main
sigonasr2 2 years ago
parent a10fcbb56f
commit 0848ea5faf
8 changed files with 309 additions and 27 deletions
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Show Stats Download Patch File Download Diff File
  1. 1
      archives/22/p022_names.txt
  2. BIN
      archives/30/current
  3. 49
      archives/30/src/main.c
  4. 207
      archives/30/src/utils.c
  5. 18
      archives/30/src/utils.h
  6. BIN
      current
  7. 2
      sig
  8. 59
      src/main.c

1
archives/22/p022_names.txt
View File

File diff suppressed because one or more lines are too long

BIN
archives/30/current
View File

Binary file not shown.

49
archives/30/src/main.c
Unescape View File

@ -0,0 +1,49 @@
#include <stdio.h>
#include "utils.h"
#include <math.h>
/*
Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
As 1 = 14 is not a sum it is not included.
The sum of these numbers is 1634 + 8208 + 9474 = 19316.
Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.
https://projecteuler.net/problem=30
*/
int main(int argc,char**argv) {
int counter=0;
int currentDigit=10;
long digitSum=0;
while (counter<10000000) {
int tempNumb=currentDigit;
digitSum=0;
long val=0;
while (tempNumb>0) {
int digit=tempNumb%10;
tempNumb/=10;
val=(long)pow(digit,5);
digitSum+=val;
if (digitSum>currentDigit) {
goto next;
}
}
if (digitSum==currentDigit) {
printf("%d has a digit sum that equals its number!\n",currentDigit);
}
next:
currentDigit++;
counter++;
}
return 0;
}

207
archives/30/src/utils.c
Unescape View File

@ -0,0 +1,207 @@
#include "utils.h"
#include <stdio.h>
#include <stdlib.h>
struct String mult(struct String numb1, struct String numb2) {
struct String n1 = numb1;
struct String n2 = numb2;
byte carryover = 0;
if (numb2.length>numb1.length) {
n1=numb2;
n2=numb1;
}
int addends[n2.length][n1.length+1];
for (int i=0;i<n2.length;i++) {
for (int j=0;j<n1.length+1;j++) {
addends[i][j]=0;
}
}
for (int i=n2.length-1;i>=0;i--) {
carryover=0;
for (int j=n1.length-1;j>=0;j--) {
int mult = (n1.str[j]-'0')*(n2.str[i]-'0')+((carryover!=0)?carryover:0);
//printf(" %d/%d\n",mult,carryover);
carryover=0;
if (mult>=10) {
carryover=mult/10;
mult=mult%10;
}
addends[(n2.length-1)-i][j+1]=mult;
}
if (carryover>0) {
addends[(n2.length-1)-i][0]=carryover;
}
}
//printIntDoubleArr(n2.length,n1.length+1,addends);
struct String sum = {1,"0"};
for (int i=0;i<n2.length;i++) {
char val[n1.length+1+i];
for (int j=0;j<n1.length+1+i;j++) {
val[j]='0';
}
for (int j=0;j<n1.length+1;j++) {
val[j]=addends[i][j]+'0';
}
sum=add((struct String){n1.length+1+i,val},sum);
//printf("\nAA:%s",sum.str);
}
if (sum.str[0]=='0') {
char*newStr=malloc(sum.length);
for (int i=1;i<sum.length+1;i++) {
newStr[i-1]=sum.str[i];
}
free(sum.str);
sum=(struct String){sum.length-1,newStr};
}
//printf("\nA:%s",sum.str);
return sum;
}
struct String add(struct String numb1, struct String numb2){
//printf("%s %s\n",numb1.str,numb2.str);
byte carryover=0;
int digitCount=0;
char*str = malloc(1);
//str[0]='\0';
if (numb1.length>=numb2.length) {
for (int offset=0;offset<numb1.length;offset++) {
str = realloc(str,++digitCount);
//printf("Digit count is now %d\n",digitCount);
if (numb2.length>offset) {
//printf("%c %c\n",numb1.str[numb1.length-offset-1],numb2.str[numb2.length-offset-1]);
int sum=((numb1.str[numb1.length-offset-1]-'0')+(numb2.str[numb2.length-offset-1]-'0'))+((carryover>0)?carryover--:0);
if (sum>=10) {
carryover=1;
sum-=10;
}
str[offset]=sum+'0';
} else {
str[offset]=numb1.str[numb1.length-offset-1]+((carryover>0)?carryover--:0);
}
//str[offset+1]='\0';
}
} else {
for (int offset=0;offset<numb2.length;offset++) {
str = realloc(str,++digitCount);
//printf("Digit count is now %d\n",digitCount);
if (numb1.length>offset) {
//printf("%c %c\n",numb1.str[numb1.length-offset-1],numb2.str[numb2.length-offset-1]);
int sum=((numb1.str[numb1.length-offset-1]-'0')+(numb2.str[numb2.length-offset-1]-'0'))+((carryover>0)?carryover--:0);
if (sum>=10) {
carryover=1;
sum-=10;
}
str[offset]=sum+'0';
} else {
str[offset]=numb2.str[numb2.length-offset-1]+((carryover>0)?carryover--:0);
}
//str[offset+1]='\0';
}
}
if (carryover>0) {
str = realloc(str,++digitCount);
str[digitCount-1]='1';
//str[digitCount]='\0';
}
for (int i=0;i<digitCount/2;i++) {
char c = str[i];
char c2 = str[digitCount-i-1];
str[digitCount-i-1]=c;
str[i]=c2;
}
str = realloc(str,digitCount+1);
str[digitCount]='\0';
struct String newStr = {digitCount,str};
return newStr;
}
void printLongDoubleArr(int a,int b,long doubleArr[a][b]) {
for (int i=0;i<a;i++) {
for (int j=0;j<b;j++) {
printf("%ld\t",doubleArr[i][j]);
}
printf("\n");
}
}
void printIntDoubleArr(int a,int b,int doubleArr[a][b]) {
for (int i=0;i<a;i++) {
for (int j=0;j<b;j++) {
printf("%d\t",doubleArr[i][j]);
}
printf("\n");
}
}
struct String createBigNumber(char*numb) {
int marker=0;
while (numb[marker++]!='\0');
return (struct String){marker-1,numb};
}
int*getFactors(int numb) {
int*factorList=malloc(sizeof(int)*1);
int factorListSize=2;
factorList[0]=1;
factorList[1]=numb;
int max=numb;
for (int i=2;i<max;i++) {
if (numb%i==0) {
factorList=realloc(factorList,sizeof(int)*++factorListSize);
factorList[factorListSize-1]=i;
if (numb/i!=i) {
factorList=realloc(factorList,sizeof(int)*++factorListSize);
factorList[factorListSize-1]=numb/i;
max=numb/i;
}
}
}
factorList=realloc(factorList,sizeof(int)*++factorListSize);
factorList[factorListSize-1]=0;
return factorList;
}
boolean isFactor(int*factorList,int numb) {
int counter=0;
while (factorList[counter]!=0) {
if (numb==factorList[counter]) {
return true;
}
counter++;
}
return false;
}
struct String BigPow(int numb1, int numb2) {
struct String sum = BigNumber(1);
char*newStr = malloc(0);
int strLength=0;
while (numb1>0) {
newStr=realloc(newStr,++strLength);
newStr[strLength-1]=(numb1%10)+'0';
numb1/=10;
}
for (int i=0;i<strLength/2;i++) {
char oldC=newStr[strLength-i-1];
newStr[strLength-i-1]=newStr[i];
newStr[i]=oldC;
}
struct String bigNumb2 = (struct String){strLength,newStr};
for (int i=0;i<numb2;i++) {
sum=mult(sum,bigNumb2);
}
free(newStr);
return sum;
}
boolean equals(struct String str1,struct String str2) {
if (str1.length!=str2.length) {
return false;
}
for (int i=0;i<str1.length;i++) {
if (str1.str[i]!=str2.str[i]) {
return false;
}
}
return true;
}

18
archives/30/src/utils.h
Unescape View File

@ -0,0 +1,18 @@
#define true 1
#define false 0
#define boolean char
#define byte char
struct String{
int length;
char*str;
};
struct String add(struct String numb1, struct String numb2);
struct String mult(struct String numb1, struct String numb2);
struct String BigPow(int numb1,int numb2);
void printLongDoubleArr(int a,int b,long doubleArr[a][b]);
void printIntDoubleArr(int a,int b,int doubleArr[a][b]);
struct String createBigNumber(char*numb);
#define BigNumber(X) createBigNumber(#X)
boolean isFactor(int*factorList,int numb);
int*getFactors(int numb);
boolean equals(struct String str1,struct String str2);

BIN
current
View File

Binary file not shown.

2
sig
Unescape View File

@ -3,7 +3,7 @@ export AUTO_UPDATE=false
source utils/define.sh
define PROJECT_NAME "current"
define CUSTOM_PARAMS ""
define CUSTOM_PARAMS "-lm"
define LANGUAGE "C"
source utils/main.sh

59
src/main.c
Unescape View File

@ -1,42 +1,49 @@
#include <stdio.h>
#include "utils.h"
#include <stdlib.h>
#include <math.h>
/*
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
22=4, 23=8, 24=16, 25=32
32=9, 33=27, 34=81, 35=243
42=16, 43=64, 44=256, 45=1024
52=25, 53=125, 54=625, 55=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
As 1 = 14 is not a sum it is not included.
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
The sum of these numbers is 1634 + 8208 + 9474 = 19316.
https://projecteuler.net/problem=29
Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.
https://projecteuler.net/problem=30
*/
int main(int argc,char**argv) {
struct String*numbs=malloc(sizeof(struct String)*0);
long distinctTermCount=0;
int arrSize=0;
for (int a=2;a<=100;a++) {
for (int b=2;b<=100;b++) {
struct String newNumb=BigPow(a,b);
for (int i=0;i<arrSize;i++) {
if (equals(newNumb,numbs[i])) {
goto skip;
}
int counter=0;
int currentDigit=10;
long digitSum=0;
while (counter<10000000) {
int tempNumb=currentDigit;
digitSum=0;
long val=0;
while (tempNumb>0) {
int digit=tempNumb%10;
tempNumb/=10;
val=(long)pow(digit,5);
digitSum+=val;
if (digitSum>currentDigit) {
goto next;
}
numbs=realloc(numbs,sizeof(struct String)*++arrSize);
numbs[arrSize-1]=newNumb;
//printf("%d^%d: %s\n",a,b,numbs[arrSize-1].str);
distinctTermCount++;
skip: continue;
}
if (digitSum==currentDigit) {
printf("%d has a digit sum that equals its number!\n",currentDigit);
}
next:
currentDigit++;
counter++;
}
printf("\n\nDistinct term count: %ld",distinctTermCount);
return 0;
}
Write Preview
Loading…
Cancel
Save