**this is a program used for : - given (n=6) it finds smallest divisor(i.e - 2) and then adds to it(i.e - 6+2 = 8) thus n=8 .This process is repeated for k times… output should be final value of n…The codechef ide throws SIGTSTP error.Please help me resolve this issue. Also, what can I do in future to avoid such incidents ?**

int main()

{

int t;

std::cin >> t;

for (int i=0 ; i< t; ++i)

{

int n ,k;

std::cin >> n >> k;

for (int i=0 ; i<k;++i)

{

for (int i=2 ; i<=n ;++i)

{

if (n%i == 0)

{

n = n+i;

}

```
}
std::cout << n << '\n';
}
}
return 0;
```

}