Project Euler - 113, C++ (gcc)

Language: Layout:

#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;
typedef vector<int>		vi;
typedef vector<ll>		vll;
typedef vector<pii>		vpii;
typedef vector<pll>		vpll;
typedef vector<vi>		vvi;
typedef vector<vll>		vvl;
const int N = 3e5;
vi g[N];
int a[N];
ll dp[103][11];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int NN = 100;
	int i,n,k,j;
	//dp[*][9] = 1
	for(int len = 1; len <= NN; len++){
		for(i = 9; i ; i--){
			dp[len][i] = 0;
			if (i == 9){
				dp[len][i] = 1;
				continue;
			}
			if (len == 1){
				dp[1][i] = 1 + dp[1][i+1];
				continue;
			}
			int x = 0;
			for(; x < len; x++)
				dp[len][i] += dp[len-x][i+1];
			dp[len][i]++;
			// cout<<len<<" "<<i<<" "<<dp[len][i]<<endl;
		}
	}
	ll ans = 0;
	for(int len = 1; len <= NN; len++)
		ans += dp[len][1];
	ans *= 2;
	ans -= 9*NN;
	for(int len = 1; len < NN; len++)
		ans += dp[len][1]*(NN-len);
	
	// cout<<dp[2][7]<<endl;
	cout<<ans<<endl;
	return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1.32 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 8 Mb, absolute service time: 1,46 sec