Skip to content

Instantly share code, notes, and snippets.

@mollyStark
mollyStark / sticks
Last active August 29, 2015 14:02
POJ.1011adv
#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;
@mollyStark
mollyStark / sticks
Last active August 29, 2015 14:02
POJ.1011
#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;
@mollyStark
mollyStark / Reciprocal cycles
Last active August 29, 2015 14:01
Reciprocal cycles
#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])