14,030,240 members

# C / C++ / MFC

 Re: ? sabrina life19-Oct-18 10:43 sabrina life 19-Oct-18 10:43
 Re: ? OriginalGriff19-Oct-18 19:53 OriginalGriff 19-Oct-18 19:53
 Re: ? sabrina life20-Oct-18 8:53 sabrina life 20-Oct-18 8:53
 Re: ? OriginalGriff20-Oct-18 22:12 OriginalGriff 20-Oct-18 22:12
 Re: help CPallini20-Oct-18 9:44 CPallini 20-Oct-18 9:44
 Re: help sabrina life20-Oct-18 9:55 sabrina life 20-Oct-18 9:55
 Re: help CPallini20-Oct-18 10:00 CPallini 20-Oct-18 10:00
 Solve this runt time error code Member 1402130019-Oct-18 1:25 Member 14021300 19-Oct-18 1:25
 You need to find the maximum possible side length of the base of the garden such that the total cost of removing residential plot does not exceed B. Input Format Input 1: It will be string which tells two integers separated by a single comma that represent M and N respectively. Input 2: It will be the integer B, the maximum cost you can afford (i.e., your budget). It is the cost of removing ith plot. Input 3: It will be the integer P, the residential plots found in the list. Input 4: It will be string array where: The first line of the array tells the total number of elements in the array i.e. Each of the next P lines describes a residential plot. The ith of these lines describes the ith plot. Each line consists of 5 integers: Xi1, Yi1, Xi2, Yi2, and Ci separated by single comma. They represent respectively the coordinates of the bottommost, leftmost cell of the plot, the coordinates of the topmost & rightmost cell of the plot, and the cost of removing the plot. The bottommost, leftmost cell on the grid has coordinates (1, 1) and the topmost, rightmost cell has coordinates (M, N). 1 <= Xi1 <= Xi2 <= M, X coordinates of the leftmost and the rightmost cells of the ith residential plot 1 <= Yi1 <= Yi2 <= N, Y coordinates of the bottommost and the topmost cells of the ith residential plot Constraints 1 <= M, N <= 1,000,000 1 <= Ci <= 7,000 0 <= B <= 1,00,000 1<= P <= 1,00,000 Output Format It will be an integer that tells the maximum length of the base of the garden such that the total cost of removing plots does not exceed B. Sample TestCase 1 Input 6,9 42 5 5 4,1,6,3,12 3,6,5,6,9 1,3,3,8,24 3,8,6,9,21 5,1,6,2,20 Output 4 Explanation: two possible locations for the garden base, both having a side of length 4 which is the maximum possible length of the base of the garden. Hence the output will be 4. Sample TestCase 2 Input 6,9 0 5 5 4,1,6,3,12 3,6,5,6,9 1,3,3,8,24 3,8,6,9,21 5,1,6,2,20 Output Code: #include #include using namespace std; typedef long long int ll; typedef long double db; int main() { ll n,m;char ch;ll i,j,k; cin>>n>>ch>>m; ll a[n+1][m+1]; ll cost,plots,ui,r1,r2,c1,c2,plotcost; cin>>cost>>plots>>ui; vector costv; costv.push_back(0LL); ll mp[n+1][m+1]; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { mp[i][j]=0;//<<" "; } //cout<>r1>>ch>>c1>>ch>>r2>>ch>>c2>>ch>>plotcost; costv.push_back(plotcost); ll yu=costv.size()-1; for(i=r1;i<=r2;i++) { for(j=c1;j<=c2;j++) { mp[i][j]=yu; } } } ll len; ll maxlength=0; ll l;ll s=0; //cout< se; for(k=i;k
 Re: Solve this runt time error code Victor Nijegorodov19-Oct-18 2:00 Victor Nijegorodov 19-Oct-18 2:00
 Re: Solve this runt time error code Member 1402130019-Oct-18 2:35 Member 14021300 19-Oct-18 2:35
 Re: Solve this runt time error code Garold Orton19-Oct-18 9:25 Garold Orton 19-Oct-18 9:25
 Re: Solve this runt time error code Victor Nijegorodov19-Oct-18 9:52 Victor Nijegorodov 19-Oct-18 9:52
 Re: Solve this runt time error code Richard MacCutchan19-Oct-18 2:59 Richard MacCutchan 19-Oct-18 2:59
 Re: Solve this runt time error code Member 1402130019-Oct-18 4:33 Member 14021300 19-Oct-18 4:33
 Re: Solve this runt time error code Richard MacCutchan19-Oct-18 5:04 Richard MacCutchan 19-Oct-18 5:04
 Re: Solve this runt time error code CPallini20-Oct-18 9:57 CPallini 20-Oct-18 9:57
 Microsoft Office Object Library john563217-Oct-18 18:32 john5632 17-Oct-18 18:32
 Split paragraph into lines based on width in pixels Steve Thresher17-Oct-18 9:17 Steve Thresher 17-Oct-18 9:17
 Re: Split paragraph into lines based on width in pixels Dave Kreskowiak17-Oct-18 9:38 Dave Kreskowiak 17-Oct-18 9:38
 Re: Split paragraph into lines based on width in pixels Steve Thresher17-Oct-18 10:29 Steve Thresher 17-Oct-18 10:29
 Re: Split paragraph into lines based on width in pixels Dave Kreskowiak17-Oct-18 10:36 Dave Kreskowiak 17-Oct-18 10:36
 Re: Split paragraph into lines based on width in pixels Richard MacCutchan17-Oct-18 10:36 Richard MacCutchan 17-Oct-18 10:36
 Re: Split paragraph into lines based on width in pixels leon de boer17-Oct-18 18:39 leon de boer 17-Oct-18 18:39
 Re: Split paragraph into lines based on width in pixels Richard MacCutchan17-Oct-18 21:28 Richard MacCutchan 17-Oct-18 21:28
 Re: Split paragraph into lines based on width in pixels Joe Woodbury18-Oct-18 13:11 Joe Woodbury 18-Oct-18 13:11
 Last Visit: 22-Apr-19 15:56     Last Update: 22-Apr-19 15:56 Refresh « Prev1...30313233343536373839 Next »