Datasets:
oongaboongahacker
/
allah

Dataset card Data Studio Files Community
1
text
stringlengths
0
82
int profits[n], weights[n];
for(int i=0; i<n; i++)
scanf("%d", &profits[i]);
for(int i=0; i<n; i++)
scanf("%d", &weights[i]);
knapsack(n, m, profits, weights);
return 0;
}
LCS
#include <stdio.h>
#include <string.h>
char S1[20], S2[20];
int i, j, m, n, LCS_table[20][20];
int max(int a, int b) {
return (a>b) ? a: b;
}
void lcsAlgo()
{
printf("Reached\n");
m = strlen(S1);
n = strlen(S2);
for(i = 0; i<=m; i++)
LCS_table[i][0] = 0;
for(i=0; i<=n; i++)
LCS_table[0][i] = 0;
for(i=1; i<=m; i++) {
for(j=1; j<=n; j++) {
if(S1[i-1] == S2[j-1])
LCS_table[i][j] = LCS_table[i-1][j-1] + 1;
else
LCS_table[i][j] = max(LCS_table[i-1][j], LCS_table[i][j-1]);
}
}
int index = LCS_table[m][n];
char LCSAlgo[index+1];
LCSAlgo[index] = '\0';
printf("%d\n", index);
i=m, j=n;
while(i>0 && j>0)
{
if(S1[i-1] == S2[j-1]) {
LCSAlgo[index-1] = S1[i-1];
i--;
j--;
index--;
} else {
//max(LCS_table[i-1][j], LCS_table[i][j-1]);
if(LCS_table[i - 1][j] > LCS_table[i][j - 1])
i--;
else
j--;
}
}
printf("%d\n", index);
printf("The LCS is %s", LCSAlgo);
}
int main()
{
scanf("%[^\n]s", &S1);
scanf("%s", &S2);
lcsAlgo();
}
Matrix Chain
#include <stdio.h>
#include <limits.h>
int MatrixChainMultiplication(int arr[], int n)
{
int minMul[n][n];
for(int i=1; i<n; i++)
minMul[i][i] = 0;
int j, q=0;
for(int L=2; L<n; L++) {
for(int i=1; i<n-L+1; i++) {
j = i+L-1;
minMul[i][j] = INT_MAX;
for(int k=i; k<=j; k++) {
q = minMul[i][k] + minMul[k+1][j] + arr[i-1]*arr[k]*arr[j];
if(q<minMul[i][j])
minMul[i][j]=q;
}
}
}
return minMul[1][n-1];
}
int main()
{
int n;
scanf("%d", &n);
int arrS[n][2];
int arr[n+1];
for(int i=0; i<n; i++) {
scanf("%d %d",&arrS[i][0], &arrS[i][1]);
}
arr[0] = arrS[0][0];
for(int i=1; i<=n; i++)
arr[i] = arrS[i-1][1];
printf("Minimum number of multiplications required for matrix
multiplication is %d\n", MatrixChainMultiplication(arr, n+1));
getchar();
return 0;