Day 25: Running Time and Complexity

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{

    long long int num;
    long int testcases;
    cin >> testcases;
    for (long long int j = 0; j < testcases; j++)
    {
        cin >> num;
        if (num == 1)
        {
            cout << "Not prime" << endl;
        }
        else
        {
            long int count = 0;
            long int t = 2;
            while (sqrt(num) >= t)
            {
                if (num % t == 0)
                {
                    count++;
                }
                t++;
            }

            if (count == 0)
            {
                cout << "Prime" << endl;
            }
            else
            {
                cout << "Not prime" << endl;
            }
        }
    }
    return 0;
}