Click here to Skip to main content
13,593,048 members

C / C++ / MFC

 
PinnedHOW TO ANSWER A QUESTION Pin
Chris Maunder12-Jul-09 22:37
adminChris Maunder12-Jul-09 22:37 
PinnedHOW TO ASK A QUESTION Pin
Chris Maunder12-Feb-09 17:19
adminChris Maunder12-Feb-09 17:19 
QuestionTCP/IP Socket connectivity issue in Internet Pin
manoharbalu19-Jun-18 1:44
membermanoharbalu19-Jun-18 1:44 
AnswerRe: TCP/IP Socket connectivity issue in Internet Pin
Jochen Arndt19-Jun-18 2:52
mvpJochen Arndt19-Jun-18 2:52 
GeneralRe: TCP/IP Socket connectivity issue in Internet Pin
manoharbalu19-Jun-18 3:44
membermanoharbalu19-Jun-18 3:44 
GeneralRe: TCP/IP Socket connectivity issue in Internet Pin
Jochen Arndt19-Jun-18 4:33
mvpJochen Arndt19-Jun-18 4:33 
Questioninstalled apps Pin
john563217-Jun-18 20:22
memberjohn563217-Jun-18 20:22 
AnswerRe: installed apps Pin
Victor Nijegorodov17-Jun-18 20:45
memberVictor Nijegorodov17-Jun-18 20:45 
GeneralRe: installed apps Pin
john563217-Jun-18 20:53
memberjohn563217-Jun-18 20:53 
AnswerRe: installed apps Pin
Thaddeus Jones17-Jun-18 21:33
professionalThaddeus Jones17-Jun-18 21:33 
GeneralRe: installed apps Pin
john563217-Jun-18 22:58
memberjohn563217-Jun-18 22:58 
AnswerRe: installed apps Pin
Thaddeus Jones17-Jun-18 23:04
professionalThaddeus Jones17-Jun-18 23:04 
QuestionChange Tabs in Ribbon Control dynamically - C++ Pin
Gopi Nath14-Jun-18 2:13
memberGopi Nath14-Jun-18 2:13 
AnswerRe: Change Tabs in Ribbon Control dynamically - C++ Pin
Thaddeus Jones17-Jun-18 23:37
professionalThaddeus Jones17-Jun-18 23:37 
GeneralRe: Change Tabs in Ribbon Control dynamically - C++ Pin
Gopi Nath18-Jun-18 1:25
memberGopi Nath18-Jun-18 1:25 
AnswerRe: Change Tabs in Ribbon Control dynamically - C++ Pin
Thaddeus Jones18-Jun-18 1:28
professionalThaddeus Jones18-Jun-18 1:28 
GeneralRe: Change Tabs in Ribbon Control dynamically - C++ Pin
Gopi Nath18-Jun-18 1:42
memberGopi Nath18-Jun-18 1:42 
GeneralRe: Change Tabs in Ribbon Control dynamically - C++ Pin
Richard Andrew x6445mins ago
professionalRichard Andrew x6445mins ago 
Questioncreate_task with asynchronous unwrapping PPL Pin
Daniel Ramnath12-Jun-18 8:58
memberDaniel Ramnath12-Jun-18 8:58 
GeneralRe: create_task with asynchronous unwrapping PPL Pin
Richard MacCutchan12-Jun-18 9:03
protectorRichard MacCutchan12-Jun-18 9:03 
Questioncreate_task function in PPL Pin
Daniel Ramnath11-Jun-18 7:29
memberDaniel Ramnath11-Jun-18 7:29 
QuestionRe: create_task function in PPL Pin
David Crow11-Jun-18 9:54
memberDavid Crow11-Jun-18 9:54 
AnswerRe: create_task function in PPL Pin
Daniel Ramnath11-Jun-18 20:36
memberDaniel Ramnath11-Jun-18 20:36 
AnswerRe: create_task function in PPL Pin
Daniel Ramnath11-Jun-18 20:30
memberDaniel Ramnath11-Jun-18 20:30 
QuestionDynamic programming fill 3D array Pin
pro grimi10-Jun-18 23:12
memberpro grimi10-Jun-18 23:12 
Hello, I'm trying to solve the 3 subset sum problem witch dynamic programming using a 3D array but I don't really now which rules to use to fill the array, can someone please help me to figure out the rules.
Example (I need 3 subsets such that they have same sum)
Input: {2,2,1,1}
A = {2}
B = {2}
C = {1,1}
Return: true
How I understand it: With 3D array I'm searching if I can find 2 Subsets with sum = TotalSum/3 each. But how to fill the array, which rules should I use Confused | :confused:

int subSetsFound(int n, int set[], int sum1, int sum2) {
//n is n-1 (sum1 and sum2 are TotalSum/3)
	//cuboid[n][i][j] tells whether first set can have sum i and second - sum j in set = n
	int cuboid[sum1+1][sum2+1][n+1];

	// initialize top row/depth as true
	for (int i = 0; i <= n; i++) {
		cuboid[0][0][i] = 1;
	}

    // initialize two leftmost columns (one in depth), except cuboid[0][0][0] and cuboid[0][1][0], as 0 (false)
    for (int i = 1; i <= sum1; i++) {
    	cuboid[i][0][0] = 0;
    	cuboid[0][i][0] = 0;
    }
//not sure if I should do this
    for (int i = 0; i <= sum1; i++) {
    	for (int j = 1; j <= sum2; j++) {
    		cuboid[0][j][i] = 0;
    	}
    }

    for (int i = 1; i <= sum1; i++) {
		for (int j = 0; j <= sum2; j++) {
			for (int k = 1; k <= n; k++) {
				cuboid[i][j][k] = cuboid[i][j][k-1];
         		if (i - set[k-1] >= 0)
          			cuboid[i][j][k] = cuboid[i][j][k] || cuboid[ j-set[k-1] ] [j] [k-1];
      
				/* This is for 2-sub-set problem
				if (i-S[j-1]) >= 0
	            P(i, j) ← P(i, j-1) или P(i-S[j-1], j-1)
                P(i, j) ← P(i, j-1)
				*/
			}

		}
	}

    return cuboid[sum1][sum2][n];//first set have sum = sum1 and second sum = sum2, so there are two subsets such that the sum is equal

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.


Advertise | Privacy | Cookies | Terms of Service
Web04-2016 | 2.8.180618.1 | Last Updated 20 Jun 2018
Copyright © CodeProject, 1999-2018
All Rights Reserved.
Layout: fixed | fluid