Getting TLE in PRIME VISITS(solved)

https://ide.codingblocks.com/#/s/13601
#include
using namespace std;
int check_prime(int n){
if(n<2)
return 0;
for(int i=2;i*i<=n;i++){
if(n%i==0)
return 0;
}
return 1;
}
int main() {
long long int c,t,a,b;
cin>>t;
while(t–>0){
cin>>a>>b;
c=0;
for(int i=a;i<=b;i++)
c=c+check_prime(i);
cout<<c<<’\n’;
}
return 0;
}