Reply to thread

Message: <blockquote data-quote="madurax86" data-source="post: 8246507" data-attributes="member: 1293">YAY! I finally did it! This doesn't repeat the partitions, it uses a bit of mathematics theory for this. But hey, it gets the job done!.Read this,<a href="http://mathworld.wolfram.com/Partition.html" target="_blank">http://mathworld.wolfram.com/Partition.html</a>My algorithm uses the equation given in that page(1.x1+2.x2+3.x3 .....n.xn=n) to find the partitions, the program finds roots of that equation, that's all![code]#include <stdio.h>#include <stdlib.h>typedef unsigned int uint;typedef struct anode{    uint num;    uint level;    struct anode *parent;}node;uint n=0;node* alloc(){    node *new = malloc(sizeof(node));    new->num = 0;    new->level = 0;    new->parent = NULL;    return new;}void backtrace(node *a){    uint i;    static uint count=0;    count++;    printf("%d. ",count);    while (a->parent!=NULL){        for (i=0;i<a->num;i++)            printf("%d ", a->level);        a = a->parent;    }    printf("\n");}void sum(uint total, uint level, node *owner){    uint i;    uint tmp = 0;    node *this;    if ( level > n ) return;    for (i=0;i<=n;i++){            tmp = total + level*i;        this = alloc();        this->parent = owner;        this->num = i;        this->level = level;        if (tmp >= n){            if (tmp == n) backtrace(this);            return;        }else{            sum(tmp, level+1, this);        }    }}int main(){    node *root = alloc();    printf("Enter a number : ");    scanf("%d",&n);        sum(0, 1, root);    return 0;}[/code]</blockquote>

Verification: Awruddata maasa keeyada?

Top Bottom

Search

Latest ads

Reply to thread