Cutting Rod (Dynamic Programming)

#include<stdio.h>
int n, p[11], s[10], r[100], cut[2], x=0;

int Coin(){
    int i, j, q;
    r[0]=0;
    for(j=1; j<=n; j++){
        q=-99;
        for(i=1; i<=j; i++){
            q=Max(q, i, j);
        }
        r[j]=q;
    }

    return q;
}

int Max(a, i, j){
    if(a>(p[i]+r[j-i])){
        return a;
    }
    else{
        x=i;
        return (p[i]+r[j-i]);
    }
}


void main(void){
    int i, q;
    printf("Enter length: ");
    scanf("%d", &n);
    for(i=0; i<=n; i++){
        s[i]=i;
        if(i==0){
            p[0]=0;
        }
        else{
        printf("Enter price of %d: ", s[i]);
        scanf("%d", &p[i]);
        }
    }
    q = Coin();

    printf("Maximum Value: %d\n", q);
    if(x==0 || x==n){
        printf("No Cut\n");
    }
    else{
        printf("Cut: %d & %d\n", x, n-x);
    }
}