Completed 29 and fixed some library functions
Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
This commit is contained in:
parent
f2d1e25c3d
commit
a10fcbb56f
BIN
archives/29/current
Executable file
BIN
archives/29/current
Executable file
Binary file not shown.
42
archives/29/src/main.c
Normal file
42
archives/29/src/main.c
Normal file
@ -0,0 +1,42 @@
|
||||
#include <stdio.h>
|
||||
#include "utils.h"
|
||||
#include <stdlib.h>
|
||||
|
||||
/*
|
||||
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
|
||||
|
||||
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:
|
||||
|
||||
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
|
||||
|
||||
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
|
||||
|
||||
https://projecteuler.net/problem=29
|
||||
*/
|
||||
|
||||
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;
|
||||
}
|
||||
}
|
||||
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;
|
||||
}
|
||||
}
|
||||
printf("\n\nDistinct term count: %ld",distinctTermCount);
|
||||
return 0;
|
||||
}
|
||||
207
archives/29/src/utils.c
Normal file
207
archives/29/src/utils.c
Normal 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/29/src/utils.h
Normal file
18
archives/29/src/utils.h
Normal 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);
|
||||
20
src/main.c
20
src/main.c
@ -15,18 +15,28 @@
|
||||
|
||||
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
|
||||
|
||||
https://projecteuler.net/problem=
|
||||
https://projecteuler.net/problem=29
|
||||
*/
|
||||
|
||||
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<=5;a++) {
|
||||
for (int b=2;b<=20;b++) {
|
||||
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;
|
||||
}
|
||||
}
|
||||
numbs=realloc(numbs,sizeof(struct String)*++arrSize);
|
||||
numbs[arrSize-1]=BigPow(a,b);
|
||||
printf("\n%s\n",numbs[arrSize-1].str);
|
||||
numbs[arrSize-1]=newNumb;
|
||||
//printf("%d^%d: %s\n",a,b,numbs[arrSize-1].str);
|
||||
distinctTermCount++;
|
||||
skip: continue;
|
||||
}
|
||||
}
|
||||
printf("\n\nDistinct term count: %ld",distinctTermCount);
|
||||
return 0;
|
||||
}
|
||||
21
src/utils.c
21
src/utils.c
@ -43,7 +43,7 @@ struct String mult(struct String numb1, struct String numb2) {
|
||||
val[j]=addends[i][j]+'0';
|
||||
}
|
||||
sum=add((struct String){n1.length+1+i,val},sum);
|
||||
printf("\nAA:%s",sum.str);
|
||||
//printf("\nAA:%s",sum.str);
|
||||
}
|
||||
if (sum.str[0]=='0') {
|
||||
char*newStr=malloc(sum.length);
|
||||
@ -53,7 +53,7 @@ struct String mult(struct String numb1, struct String numb2) {
|
||||
free(sum.str);
|
||||
sum=(struct String){sum.length-1,newStr};
|
||||
}
|
||||
printf("\nA:%s",sum.str);
|
||||
//printf("\nA:%s",sum.str);
|
||||
return sum;
|
||||
}
|
||||
|
||||
@ -181,10 +181,27 @@ struct String BigPow(int numb1, int numb2) {
|
||||
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;
|
||||
}
|
||||
@ -14,4 +14,5 @@ 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);
|
||||
int*getFactors(int numb);
|
||||
boolean equals(struct String str1,struct String str2);
|
||||
Loading…
x
Reference in New Issue
Block a user