Finding the sum of N multiplications

Method 1 ：

#include<stdio.h>
int main()
{
	int i = 1;
	int j = 1;
	int sum = 0;
	int cj = 0;
	int n = 0;
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
	{
		int cj = 1;               // Every degree of multiplication is from 1 At the beginning , So to initialize 
		for (j = 1; j <= i; j++)
		{
			cj = cj * j;          // Find the multiplication order of each value 
		}
		sum = sum + cj;			  // Add up the of each value 
	}
	printf("%d", sum);

}

Method 2 ：

#include<stdio.h>
int main()
{
	int i  = 0;
	int cj = 1;
	int n = 0;
	int sum = 0;
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
	{
		cj = cj * i;         // seek 1 To n Multiplication of values 
		sum = sum + cj;		 // seek 1 To n Value the sum of each multiplier 
	}
	printf("%d", sum);
	return 0;
}