Calculate and output the square root of the sum of all prime numbers from 3 to 100 (including 3 and 100)

Calculate and output the square root of the sum of all prime numbers from 3 to 100 (including 3 and 100)

//First, find all prime numbers between 3 and 100 and store them in the array;
//Find the sum of all prime elements of the array, and then square root
#include
#include
Int sushu [98]; / / create a maximum capacity, assuming that all are prime numbers
/*Starting from 2, prime numbers are put into arrays,
Then use the following number to remove all the elements of the array,
Can't be divisible, is a prime
In the final summation, remove 2*/
int findsushu()
{
int num = 1,n=0;
sushu[0] = 2;
for(int i=3;i