This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<memory.h> | |
#include<malloc.h> | |
int sort(int *array,int num); | |
int find_candidates(int *candi_len,int max_stick,int sum); | |
int dfs(int len,int num_sticks,int candi_len); | |
int *ifused = NULL; | |
int num = 0; | |
int sum = 0; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<memory.h> | |
#include<malloc.h> | |
int sort(int *array,int num); | |
int find_candidates(int *candi_len,int max_stick,int sum); | |
int dfs(int len,int num_sticks,int candi_len); | |
int *ifused = NULL; | |
int num = 0; | |
int *sticks = NULL; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<sys/types.h> | |
#include<memory.h> | |
int findmax(int a[]) | |
{ | |
int i; | |
for(i=1;i<1000;i++) | |
{ | |
if(a[i]>a[0]) |