PATA1086

OS: OS X 10.10.5
IDE:Xcode 7.2.1

#include <stdio.h>#include <stdlib.h>#include<time.h>int cmp ( const void *a , const void *b){//a function used in the qsort    return *(int *)b - *(int *)a; //decreasing order.}int main(int argc, const char * argv[]) {    int N,M;    scanf("%d%d",&N,&M);    int MaxSum[N+1][M+1];//MaxSum[i][j] represents the maximal sum of the preceding i numbers, and the sum is <=j    int flag[N+1][M+1];// flag[i][j]==1  represents  Number[i] is number to be added to get MaxSum[i][j], while flag[i][j]==0 not    for (int i=0; i<=N; i++) { //initilaize MaxSum[][] and flag[][]        for (int j=0; j<=M; j++) {            MaxSum[i][j]=0;            flag[i][j]=0;        }    }    int Number[N];    for (int i=1; i<=N; i++) { //read N numbers        scanf("%d",&Number[i]);    }    /*for(int i=1;i<n;i++){ //to test large nunbers of data, assign the Number[i] from 1 to n,     Number[i]=1;//because the Number[i] will be sorted ,so the sequence is not important.     }*/    qsort(&Number[1],N ,sizeof(int),cmp); //sort in the sequence of decreasing    for (int i=1; i<=N; i++) {//loop        for (int j=1; j<=M; j++) {            if (j-Number[i]<0||MaxSum[i-1][j-Number[i]]+Number[i]<MaxSum[i-1][j]) {// Number[i] is not  number to be added to get MaxSum[i][j]                MaxSum[i][j]=MaxSum[i-1][j];            }            else{// Number[i] is number to be added to get MaxSum[i][j]                MaxSum[i][j]=MaxSum[i-1][j-Number[i]]+Number[i]; //calculate MaxSum[i][j]                flag[i][j]=1; //label it to track trail            }        }    }    int Sum=0;//test whether the result is true or not    if (MaxSum[N][M]!=M) { //MaxSum[N][M] < M, that is ,no solution        printf("No Solution");//print    }    else{        int flag2=0;//for the format of outputing        for (int i=N,j=M; j>0; i--) { //because all the number is in decreasing order,so we print the numbers in increasing order,            if (!flag[i][j]) { //flag[i][j] check whether Number[i] is number to be added to get MaxSum[i][j] or not                flag[i][j]=1; //label it.                continue;//next loop            }            if (!flag2++) {                printf("%d",Number[i]);//priint the first number                Sum+=Number[i];            }            else{                printf(" %d",Number[i]);//print the next number                Sum+=Number[i];            }            j-=Number[i];//subtract from sum.        }    }    /*printf("\n");    if (Sum==M) {        printf("The result is true.\n");    }    else{        printf("The result is false.\n");    }*/    return 0;}