Datasets:
oongaboongahacker
/
allah

Dataset card Data Studio Files Community
1
text
stringlengths
0
82
}
Assembly line scheduling
Code:
#include <stdio.h>
#include <stdlib.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
int fun(int a*2+*4+, int t*2+*4+, int cl, int cs, int x1, int x2, int n);
int main() ,
int n = 4; // number of stations
int a*2+*4+ = , , 4, 5, 3, 2 -, , 2, 10, 1, 4 - -;
int t*2+*4+ = , , 0, 7, 4, 5 -, , 0, 9, 2, 8 - -;
int e1 = 10;
int e2 = 12;
int x1 = 18;
int x2 = 7;
// entry from 1st line
int x = fun(a, t, 0, 0, x1, x2, n) + e1 + a*0+*0+;
// entry from 2nd line
int y = fun(a, t, 1, 0, x1, x2, n) + e2 + a*1+*0+;
printf("%d\n", min(x, y));
return 0;
-
int fun(int a*2+*4+, int t*2+*4+, int cl, int cs, int x1, int x2, int n) ,
// base case
if (cs == n - 1) ,
if (cl == 0) , // exiting from (current) line =0
return x1;
- else , // exiting from line 2
return x2;
-
-
// continue on same line
int same = fun(a, t, cl, cs + 1, x1, x2, n) + a*cl+*cs + 1+;
// continue on different line
int diff = fun(a, t, !cl, cs + 1, x1, x2, n) + a*!cl+*cs + 1+ + t*cl+*cs + 1+;
return min(same, diff);
-
Max Sub Array Sum
#include <stdio.h>
#include <limits.h>
int *maxSubArraySum(int nums[], int start, int end, int *max_sum, int
*subarray_start, int *subarray_end)
{
if(start == end) {
*max_sum = nums[start];
*subarray_start = start;
*subarray_end = start;
return &nums[start];
}
int mid= (start+end)/2;
int left_subarray = maxSubArraySum(nums, start, mid, &max_sum,
&subarray_start, &subarray_end);
int right_subarray = maxSubArraySum(nums, mid+1, end, &max_sum,
&subarray_start, &subarray_end);
int left_sum=INT_MIN;
int curr_sum = 0;
int cross_start = mid;
for(int i=mid; i>=start; i--) {
curr_sum += nums[i];
if(curr_sum >= left_sum) {
left_sum = curr_sum;
cross_start = i;
}
}
int right_sum=INT_MIN;
curr_sum=0;
int cross_end = mid+1;
for(int i=mid+1; i<end; i++) {
curr_sum+=nums[i];
if(curr_sum>= right_sum) {
right_sum = curr_sum;
cross_end = i;
}
}
}
int main()
{
int n;
scanf("%d", &n);
int nums[n];
for(int i=0; i<n; i++)
scanf("%d ", &nums[i]);
int max_sum, subarray_start, subarray_end;
int *max_subarray =
maxSubArraySum(nums, 0, n-1, &max_sum, &subarray_start,
&subarray_end);
printf("The sub array [");
for(int i=subarray_start; i<=subarray_end; i++) {
if(i==subarray_end)
printf("%d", nums[i]);
else
printf("%d ", nums[i]);
}
printf("] has the largest sum %d", max_sum);
return 0;
}
KARATSUBA ALGORITHM
#include <stdio.h>
#include <string.h>