Submission #1149991

---

Source Code Expand

#include <iostream>  
#include <cstdio>  
#include <fstream>  
#include <algorithm>  
#include <cmath>  
#include <deque>  
#include <vector>  
#include <queue>  
#include <string>  
#include <cstring>  
#include <map>  
#include <stack>  
#include <set>
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
#define FOR(i, x, y) for(int i = (int)x; i <  (int)y; i ++)
#define PER(i, x, y) for(int i = (int)x; i >= (int)y; i --)
using namespace std;
typedef long long LL;
typedef long double db;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
const	int N = 100005;
const	int P = 1e9 + 7;
const	int inf = 1e9;
const	LL Inf = 1e15;

LL C[1005][15], Coef[1005], res[1005], K;

int main(){
	cin >> K;
	REP(i, 0, 1000){
		C[i][0] = 1;
		for(int j = 1; j <= i && j <= 7; j ++){
			C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
		}
	}
	REP(i, 1, 600) Coef[i] = C[i + 6][7];
	
	int x = 1;
	while(x <= 600 && K >= Coef[x]){
		K -= Coef[x];
		x ++;
	}
	int t = 0;
	for(t = (--x); x; x --){
		res[x] = 1 + K / Coef[t];
		K %= Coef[x];
	}
	REP(i, 1, t){
		printf("FESTIVA");
		REP(j, 1, res[i]) printf("L");
	}

	puts("");
	return 0;
}

Submission Info

Judge Result