Exercise 6-2 using functions to sum special A-string sequences

exercises 6-2 Using functions to find special a A string of numbers and (20 branch )

Given that neither is more than 9 The positive integer a and n, Ask to write a function to find a+aa+aaa++⋯+aa⋯a（n individual a） The sum of the .

Function interface definition ：

int fn( int a, int n );
int SumA( int a, int n );

The function fn What has to be returned is n individual a The numbers that make up ;SumA Return the requested and .

Sample referee test procedure ：

#include <stdio.h>

int fn( int a, int n );
int SumA( int a, int n );
    
int main()
{
    int a, n;

    scanf("%d %d", &a, &n);
    printf("fn(%d, %d) = %d\n", a, n, fn(a,n));        
    printf("s = %d\n", SumA(a,n));    
    
    return 0;
}

/*  Your code will be embedded here  */

sample input ：

2 3

sample output ：

fn(2, 3) = 222
s = 246

int fn( int a, int n ){
    int i,r=a;
    for(i=0;i<n-1;i++){
        a=(a*10)+r;
    }
    return a;
}
int SumA( int a, int n ){
    int i,sum=0;
    for(i=1;i<=n;i++){
        sum+=fn(a,i);
    }
    return sum;
}