TLE on Test Case 2
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int mul = 1;
string s;
cin>>n>>s;
int k = s.size();
if(n%k==0){
int in = n;
int temp = k;
while(1){
mul = mul*in;
in = in - k;
if(in==k){
mul*=in;
break;
}
}
}
else{
int in = n;
while(1){
mul = mul*in;
in = in - k;
if(in==(n%k)){
mul*=in;
break;
}
}
}
cout<<mul<<endl;
return 0;
}
What is test case 2?