c
Exam
Programming
Arrays
The task is to find the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, one array element of the first array can either be increased or decreased by 2.
Read Solution (Total 2)
-
- #include
#include
#include
int main()
{
printf("%d%ld",sizeof("Hcl technologies"),strlen("HCL Technologies"));
return 0;}
output=1716 - 6 years agoHelpfull: Yes(1) No(3)
- import java.util.*;
public class codevita {
public static void main(String []args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt(),i,j,k,r,min=0,min1=0,sum,sum1;
System.out.print("t");
k=sc.nextInt();
System.out.println();
int []a=new int[n];
int []b=new int[n];
for( i=0;i - 4 years agoHelpfull: Yes(0) No(1)
c Other Question