Answer:
Please find the answer below
Explanation:
// Online C compiler to run C program online
#include <stdio.h>
int main() {
// Write C code here
//printf("Hello world");
int userNum;
int i;
int j;
scanf("%d", &userNum);
/* Your solution goes here */
for(i = 0; i<=userNum; i++){
for(j = 0; j <= i; j++){
printf(" ");
}
printf("%d\n", i);
}
return 0;
}
An overhead projector is required to display content on transparencies. A transparency is a thin sheet of plastic in which light is reflected upon to display content.The light source emits light towards the transparency and then the image is displayed on the wall. Usually, this light source comes from below and lights upward and so the content is depicted above or overhead.
Answer: True
Explanation:
Subset sum problem and Knapsack problem can be solved using dynamic programming.
In case of Knapsack problem there is a set of weights associative with objects and a set of profits associated with each object and a total capacity of knapsack let say C. With the help of dynamic programming we try to include object's weight such that total profit is maximized without fragmenting any weight of objects and without exceeding the capacity of knapsack, it is also called as 0/1 knapsack problem.
Similar to knapsack problem, in subset sum problem there is set of items and a set of weights associated with the items and a capacity let say C, task is to choose the subset of items such that total sum of weights associated with items of subset is maximized without exceeding the total capacity.
On the basis of above statements we can say that subset sum problem is generalization of knapsack problem.
Good question. When one Endorces or "Hires/ payes" someone again for a job/thing they did. I think. :)
