Time limit exceeded

please post your solution (CODE)..It depends on your algorithm..

Here’s my solution.
I’m also having the same problem.[Time limit exceeded]
#include
using namespace std;
int divisor( int n)
{
int j=0,i;
for(i=1;i<n;i++)
{
if(n%i==0)
{
j=i+j;
}
}
return j;
}
int main()
{
int i,j,n,x=0,t;
cin>>t;
for(t;x<t;x++)
{
cin>>i;
j=divisor(i);
cout<<j<<endl;
}
return 0;

Did you notice how big this number can be?

This is my code for prime generator (Time Limit exceeded)
#include
using namespace std;
int main()
{int t;
cin>>t;
long long int a[t],b[t];
for(int i=0;i<t;i++)
cin>>a[i]>>b[i];
for(int i=0;i<t;i++)
{
for(int j=a[i];j<=b[i];j++)
{
int c=0;
for(int k=2;k<j;k++)
{
if(j%k!=0)
c++;
}
if(c==j-2)
cout<<j<<endl;
}
cout<<endl;
}
return 0;

}