first 100 prime numbers with sqrt

//First 100 prime numbers using sqrt function

#include <iostream>
#include <cmath>

using namespace std;

int main() {
    bool IsPrime;
    int root;
    cout<<"2\n";
    for(int i=3;i<100;i+=2){
        IsPrime=true;
        root = ceil(sqrt(i));
        for(int j=3;j<=root;j++){
            if(!(i%j)){
                IsPrime=false;
                break;
            }
        }
        if(IsPrime){
            cout<<i<<"\n";
        }
    }
    return 0;
}