LCM for all number incomplete

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
    int remind,divisor,divident,i,j,n,temp,multip=1;
    printf("How many number you want to write : ");
    scanf("%d",&n);
    int A[n];
    int B[n];
    printf("Input your values\n");
    for(i=0; i<n; i++)
    {
        scanf("%d",&A[i]);
        B[i]=A[i];
    }

    for(i=0; i<n; i++)
    {
        for(j=i+1; j<n; j++)
        {
            if(A[i]>A[j])
            {
                temp=A[i];
                A[i]=A[j];
                A[j]=temp;
            }
        }
    }

    for(i=0; i<n-1; i++)
    {
        remind=1;
        divisor=A[i];
        //printf("%d  ",divisor);
        divident=A[i+1];
        //printf("%d\n",divident);

        while(remind!=0)
        {
            remind=divident%divisor;
            divident=divisor;
            divisor=remind;
        }
        A[i+1]=divident;
    }

    printf("\nGCD = %d\n",divident);

    for(i=0; i<n; i++)
    {
        multip=multip*B[i];
    }
    printf("LCM = %d\n\n",multip/divident);




    return 0;
}