Submission #1149997
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[x]; K %= Coef[x]; } REP(i, 1, t){ printf("FESTIVA"); REP(j, 1, res[i]) printf("L"); } puts(""); return 0; }
Submission Info
Submission Time | |
---|---|
Task | G - FESTIVAL |
User | syc19999 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1292 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, 050.txt, 051.txt, 052.txt, 053.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 384 KB |
001.txt | AC | 1 ms | 384 KB |
002.txt | AC | 1 ms | 384 KB |
003.txt | AC | 1 ms | 384 KB |
004.txt | AC | 1 ms | 384 KB |
005.txt | AC | 1 ms | 384 KB |
006.txt | AC | 1 ms | 384 KB |
007.txt | AC | 1 ms | 384 KB |
008.txt | AC | 1 ms | 384 KB |
009.txt | AC | 1 ms | 384 KB |
010.txt | AC | 1 ms | 384 KB |
011.txt | AC | 1 ms | 384 KB |
012.txt | AC | 1 ms | 384 KB |
013.txt | AC | 1 ms | 384 KB |
014.txt | AC | 1 ms | 384 KB |
015.txt | AC | 1 ms | 384 KB |
016.txt | AC | 1 ms | 384 KB |
017.txt | AC | 1 ms | 384 KB |
018.txt | AC | 1 ms | 384 KB |
019.txt | AC | 1 ms | 384 KB |
020.txt | AC | 1 ms | 384 KB |
021.txt | AC | 1 ms | 384 KB |
022.txt | AC | 1 ms | 384 KB |
023.txt | AC | 1 ms | 384 KB |
024.txt | AC | 1 ms | 384 KB |
025.txt | AC | 1 ms | 384 KB |
026.txt | AC | 1 ms | 384 KB |
027.txt | AC | 1 ms | 384 KB |
028.txt | AC | 1 ms | 384 KB |
029.txt | AC | 1 ms | 384 KB |
030.txt | AC | 1 ms | 384 KB |
031.txt | AC | 1 ms | 384 KB |
032.txt | AC | 1 ms | 384 KB |
033.txt | AC | 1 ms | 384 KB |
034.txt | AC | 1 ms | 384 KB |
035.txt | AC | 1 ms | 384 KB |
036.txt | AC | 1 ms | 384 KB |
037.txt | AC | 1 ms | 384 KB |
038.txt | AC | 1 ms | 384 KB |
039.txt | AC | 1 ms | 384 KB |
040.txt | AC | 1 ms | 384 KB |
041.txt | AC | 1 ms | 384 KB |
042.txt | AC | 1 ms | 384 KB |
043.txt | AC | 1 ms | 384 KB |
044.txt | AC | 1 ms | 384 KB |
045.txt | AC | 1 ms | 384 KB |
046.txt | AC | 1 ms | 384 KB |
047.txt | AC | 1 ms | 384 KB |
048.txt | AC | 1 ms | 384 KB |
049.txt | AC | 1 ms | 384 KB |
050.txt | AC | 1 ms | 384 KB |
051.txt | AC | 1 ms | 384 KB |
052.txt | AC | 1 ms | 384 KB |
053.txt | AC | 1 ms | 384 KB |
example0.txt | AC | 1 ms | 384 KB |
example1.txt | AC | 1 ms | 384 KB |