Submission #3514307


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (rint i = 1; i <= (n); i ++)
#define re0(i, n) for (rint i = 0; i < (int) n; i ++)
#define travel(i, u) for (rint i = head[u]; i; i = e[i].nxt)
#define rint register int
using namespace std;
 
template<typename tp> inline void read(tp &x) {
  x = 0; char c = getchar(); int f = 0;
  for (; c < '0' || c > '9'; f |= c == '-', c = getchar());
  for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar());
  if (f) x = -x;
}
typedef __int128 u;

u sum[2333333], ans[233333];

int main(void) {
  srand(time(NULL));
  long long _K;
  cin >> _K;
  u K = _K;
  u len = 700;
  sum[1] = 1;
  for (int i = 2; i <= len; i ++) {
    sum[i] = 1;
    for (int k = i; k <= i + 6; k ++)
      sum[i] *= k;
    sum[i] /= (u)5040;
    if (sum[i] > K) {
      len = i - 1;
      break;
    }
  }
  // for (int i = 1; i <= len; i ++)
  //   cerr << (unsigned long long) sum[i] << " "; cerr << "\n";
  u pos = len;
  // cerr << (long long) u << "\n";
  while (K) {
    if (sum[pos] > K) {
      -- pos;
      continue;
    }
    // cout << (int) pos << "\n";
    u t = K / sum[pos];
    ans[pos] = t;
    K %= sum[pos];
  }
  for (int i = 1; i <= len; i ++) {
    cout << "FESTIVA";
    re0 (_, ans[i]) cout<<"L";
  }
  cout << "\n";
}

Submission Info

Submission Time
Task G - FESTIVAL
User foreverpiano
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1336 Byte
Status AC
Exec Time 2 ms
Memory 2432 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 56
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 2 ms 2432 KB
001.txt AC 2 ms 2304 KB
002.txt AC 2 ms 2304 KB
003.txt AC 2 ms 2304 KB
004.txt AC 1 ms 2304 KB
005.txt AC 2 ms 2304 KB
006.txt AC 2 ms 2304 KB
007.txt AC 2 ms 2304 KB
008.txt AC 2 ms 2304 KB
009.txt AC 2 ms 2304 KB
010.txt AC 2 ms 2304 KB
011.txt AC 2 ms 2304 KB
012.txt AC 2 ms 2304 KB
013.txt AC 2 ms 2304 KB
014.txt AC 2 ms 2304 KB
015.txt AC 2 ms 2304 KB
016.txt AC 2 ms 2304 KB
017.txt AC 2 ms 2304 KB
018.txt AC 2 ms 2304 KB
019.txt AC 2 ms 2304 KB
020.txt AC 2 ms 2304 KB
021.txt AC 2 ms 2304 KB
022.txt AC 2 ms 2304 KB
023.txt AC 2 ms 2304 KB
024.txt AC 2 ms 2304 KB
025.txt AC 2 ms 2304 KB
026.txt AC 2 ms 2304 KB
027.txt AC 2 ms 2304 KB
028.txt AC 2 ms 2304 KB
029.txt AC 2 ms 2304 KB
030.txt AC 2 ms 2304 KB
031.txt AC 2 ms 2304 KB
032.txt AC 2 ms 2304 KB
033.txt AC 2 ms 2304 KB
034.txt AC 2 ms 2304 KB
035.txt AC 2 ms 2304 KB
036.txt AC 2 ms 2304 KB
037.txt AC 2 ms 2304 KB
038.txt AC 2 ms 2304 KB
039.txt AC 2 ms 2304 KB
040.txt AC 2 ms 2304 KB
041.txt AC 2 ms 2304 KB
042.txt AC 2 ms 2304 KB
043.txt AC 2 ms 2304 KB
044.txt AC 2 ms 2304 KB
045.txt AC 2 ms 2304 KB
046.txt AC 2 ms 2304 KB
047.txt AC 2 ms 2304 KB
048.txt AC 2 ms 2304 KB
049.txt AC 2 ms 2304 KB
050.txt AC 2 ms 2304 KB
051.txt AC 2 ms 2304 KB
052.txt AC 2 ms 2304 KB
053.txt AC 2 ms 2304 KB
example0.txt AC 2 ms 2304 KB
example1.txt AC 2 ms 2304 KB