Question

Project Euler #5: Smallest multiple H HackerRank This problem is a programming version ofProblem 5 from projecteuler.net 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible(divisible with no remainder) by all of the numbers from 1 to N? Input Format First line contains T that denotes the number of test cases. This is followed by T lines, each containing an integer, N Constraints 1T10 1 N 40

Use c language

Answer 1

//i have tested this code and it passed all 5 test cases

//do comment if any problem arises

//do thumbs up if it helps

#include <stdio.h>

int main()

{

//t is number of test cases

int t;

//scan number of test cases

scanf("%d", &t);

//iterate over all test cases

for (int i = 0; i < t; i++)

{

//number is given number for ith test case

long long int number;

//scan number for ith test case

scanf("%lld", &number);

//ans is the answer for minimum number that can be divisible by all numbers from 1 through given number

long long int ans = 1;

//this flag will set to false once we get the answer

long long int flag = 1;

//while flag is true

while (flag)

{

//set flag to false

flag = 0;

//iterate through all numbers from 1 to given number

for (long long int i = 1; i <= number; i++)

{

//if remainder when deviding answer by i is not 0

if (ans % i != 0)

flag = 1; //set flag to 1

}

//increement answer

ans++;

}

//print answer

printf("%lld\n", ans - 1);

}

}