Code Vita Round 1(2016)

Min product array?

 #include <stdio.h>
#include<stdlib.h>
int main()
{
int maxDiff = 0, minimumSum = 0,product,A[10],B[10],k,n,diff,temp,i;
scanf("%d",&n);
scanf("%d",&k);
for(i=0;i<n;i++)
scanf("%d",&A[i]);
for(i=0;i<n;i++)
scanf("%d",&B[i]);
for(i=0;i<n;i++)
{
product = A[i] * B[i];
if ( product < 0 && B[i] < 0 )
temp = (A[i] +  2  * k ) * B[i];
else if( product < 0 && A[i] < 0)
temp = (A[i] - 2 * k) * B[i];
else if( product > 0 && A[i] < 0)
temp = (A[i] + 2 * k) * B[i];
else if (product > 0 && A[i] > 0)
temp = (A[i] - 2 * k)  * B[i];
diff =  abs(product - temp);
if( diff > maxDiff )
maxDiff = diff;
minimumSum = minimumSum + product;
}

minimumSum = minimumSum - maxDiff;
printf("%d",minimumSum);
return 0;
}

Consecutive prime sum?

 #include<stdio.h>
#include<math.h>
int main()
{
        int n,c,i,j,sum=0,f=-1,k,l;
        scanf("%d",&n);
        for(i=1;i<n;i++)
        {
            c=0;
            for(j=1;j<i;j++)
            {
                if(i%j==0)
                  c++;
            }
            if(c==1)
            {
               k=0;
               sum=sum+i;
               printf(" %d ",sum);
               for(l=1;l<sum;l++)
               {
                   if(sum%l==0)
                     k++;
               }
               if(sum<=n)
               {
                   if(k==1)
                     f++;
                    
               
               }
            
                else
                 break;
                
              //  printf("  %d  ",sum);
            }
        }
        printf("\n%d",f);
       
       
        return 0;
} 

Logic pyramid?

#include<stdio.h>
#include<math.h>
int main()
{
       int n,i,m,j,k;
       scanf("%d",&n);k=2;
       for(i=1;i<=n;i++)
       {
           j=i;
           while(j>0)
           {
             m=(2*(k*k))-k;
             printf("%.5d ",m);
             j--;
           }
           printf("\n");
       }
return 0;
}