Divide and Conquer is a programming technique which makes the program more efficient to write. And this technique work on the concept of recursion to solve a problem step by step. Generally this technique work in three parts:- Divide:- Divide the problem into some subproblem. Conquer:- Conquer the subproblem by calling recursively until subproblem solved. Combine:- (Optional Step) Combine the subproblem solution. So, that we will get the final problem Solution. When the subproblems are large enough to solve recursively, we call the recursive case. Once the subproblem becomes small enough that we no longer recursive, we say that the recursion "bottom out" and that we have gotten down to the base case. Application of Divide and Conquer Quick Sort Strassen's algorithm for matrix multiplication Merge Sort Counting inversions Binary Search Finding Min and ...
You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list
L of all available items. From this list you would like to buy two items that add up to the entire value of the credit. The solution you provide will consist of the two integers indicating the positions of the items in your list.
Input
The first line of input gives the number of cases, N. N test cases follow. For each test case there will be:
- One line containing the value C, the amount of credit you have at the store.
- One line containing the value I, the number of items in the store.
- One line containing a space separated list of I integers. Each integer P indicates the price of an item in the store.
- Each test case will have exactly one solution.
int main()
{
int n,c,it,p[1000];
scanf("%d\n",&n);
for(int i=1;i<=n;i++)
{
scanf("%d\n",&c);
scanf("%d\n",&it);
for(int j=0;j<it;j++)
{
scanf("%d\n",&p[j]);
}
for(int k=0;k<it-1;k++)
{
for(int h=k+1;h<it;h++)
{
if(c==(p[k]+p[h]))
{
printf("Case #%d: %d %d\n",i,k+1,h+1);
}
else
{}
}
}
}
return 0;
}
Comments
Post a Comment