TheAlgorithms-C/project_euler/problem_1/sol1.c

27 lines
673 B
C
Raw Normal View History

2018-10-28 01:02:02 +08:00
/*An Efficient code to print all the sum of all numbers that are multiples of 3 & 5 below N.*/
2017-11-27 16:00:21 +08:00
#include <stdio.h>
2018-10-28 01:02:02 +08:00
int main(){
int t;
2019-06-11 01:18:42 +08:00
printf("Enter number of times you want to try");
2018-10-28 01:02:02 +08:00
scanf("%d",&t);
while(t--)
{
unsigned long long N,p=0,sum=0;
2019-06-11 01:18:42 +08:00
printf("Enter the value of N ");
2018-10-28 01:02:02 +08:00
scanf("%lld",&N); //Take input of N from user
p = (N-1)/3;
sum = ((3*p*(p+1))/2);
p = (N-1)/5;
sum = sum + ((5*p*(p+1))/2);
2017-11-27 16:00:21 +08:00
2018-10-28 01:02:02 +08:00
p = (N-1)/15;
sum = sum - ((15*p*(p+1))/2);
printf("%lld\n", sum); //print the sum of all numbers that are multiples of 3 & 5 below N
}
return 0;
}