677A. Vanya and Fence

Problem Link


<Source Code>

#include<stdio.h>
#include<math.h>
#include<algorithm>

int main()

{
int i,t,n,tem,temp,sum;
scanf(“%d %d”,&n,&t);
int a[n];sum=0;
for(i=0;i<n;i++)
{scanf(“%d”,&a[i]);

}
std::sort(a,a+n);
for(i=0;i<n;i++){
tem=ceil((double)a[i]/(double)t);
tem=(int)tem;

sum+=tem;
}
printf(“%d\n”,sum);
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s