c++求t到n之间的素数哪里错了

Question

#include
#include
#include
using namespace std;
int main()
{
int m, n, i, k,t;
cin >> n;
cin >> t;
bool prime ;
for (i = t; i <= n; i = i + 1)
{
prime = true;
k = int(sqrt(i));
for (m = 2; m <= k; m++)
if (i % m == 0)
{
prime = false;
break;
}
if (prime)
{
cout << i << endl;
}

}
return 0;

}