Skip to main content

solution-FASHION - Fashion Shows on spoj

solution-FASHION - Fashion Shows

#include<stdio.h>
int main()
{int m[1001],w[1001],i,j,temp,t,n;
scanf("%d",&t);
while(t--)
{ int sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&w[i]);
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
if(m[i]>m[j])
{
temp=m[i];
m[i]=m[j];
m[j]=temp;
}
}
for(i=0;i<n-1;i++)
{
for(j=i;j<n;j++)
if(w[i]>w[j])
{
temp=w[i];
w[i]=w[j];
w[j]=temp;
}
}
for(i=0;i<n;i++)
{ sum=sum+m[i]*w[i];
}
printf("%d\n",sum);
}
}

Comments

Popular posts from this blog

solution of TRICOUNT - Counting Triangles on spoj

  TRICOUNT - Counting Triangles solution- #include<stdio.h> int main() {     int t;     scanf("%d",&t);     while(t--)     {         long long unsigned num,sum;         scanf("%llu",&num);         if(num%2==0)         sum=(num*(num+2)*((2*num)+1))/8;         else         sum=((num*(num+2)*((2*num)+1))-1)/8;         printf("%llu\n",sum);     }     return 0; }

solution of PRIME1 - Prime Generator on spoj

PRIME1 - Prime Generator solution- #include<stdio.h> #include<math.h> int main() {int t; long long int l,h,i,flag; scanf("%d",&t); while(t--) { scanf("%lld%lld",&l,&h); while(l<=h) { flag=0; for(i=2;i<=sqrt(l);i++) { if(l%i==0) { flag=1;     break; } } if(flag==0) { if(l!=1) printf("%lld\n",l); } l++; } printf("\n"); } return 0; }