Submission

Score: 100

User: kiattisaksanburee

Problemset: Sigma Croissant

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-26 17:21:20

#include <iostream>

using namespace std;

long factorial(int n) {
  if (n == 0) return 1;
  return n*factorial(n-1);
}

int main() {
  int n; cin >> n;
  long sum = 0;
  for (int i = 1; i < n+1; ++i) {
    sum+=factorial(i);
  }
 
  cout << sum;

  return 0;
}