UVa 13108:Juanma and the Drinking Fountains

Problem Link

CircleCuttingCircumference_1000


Problem based on Circle division by chords

Formula & Details:


 

Solution

#include <stdio.h>

 

int main()
{
long long int t,n,s;
scanf(“%lld”,&t);
while(t–)
{
s=0;

scanf(“%lld”,&n);
s=(n*n*n*n-6*n*n*n+23*n*n-18*n+24)/24;
printf(“%lld\n”,s);
}
return 0;
}

*Pic+formula

 

credit: mathworld.wolfram.com

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