What will be the time complexity of the following nested loopin Big O notation?

Question

Was wondering what is the time complexity of the following code:

int i,j,n,p,s=0;
scanf("%d",&n);
p = pow(3, n);
for(i=0; i<p; i++)
{
    for(j=0; j<n; j++)
    {
        s+=j;
    }
    printf("%d",i);
}

In my opinion, the time complexity will be n*(3^n).
What will it be in Big-O notation, what do you guys think ?

Answer 1

Yes it is O((3^n)*n) .
Outer loop iterates 3^n times, each time, the inner loop does O(n) work.