Submission #1026887


Source Code Expand

#define DEB
#include<bits/stdc++.h>
#define REP(i,m) for(int i=0;i<(m);++i)
#define REPN(i,m,in) for(int i=(in);i<(m);++i)
#define ALL(t) (t).begin(),(t).end()
#define CLR(a) memset((a),0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

using namespace std;


#ifdef DEB
#define dump(x)  cerr << #x << " = " << (x) << endl
#define prl cerr<<"called:"<< __LINE__<<endl
#define dumpR(x) cerr<<"\x1b[31m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpY(x) cerr<<"\x1b[33m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
#define dumpG(x) cerr<<"\x1b[32m"<<#x<<" = " <<(x)<<"\x1b[39m"<<endl
template<class T> void debug(T a,T b){ for(;a!=b;++a) cerr<<*a<<' ';cerr<<endl;}
#else
#define dump(x) ;
#define dumpR(x) ;
#define dumpY(x) ;
#define dumpG(x) ;
#define prl ;
template<class T> void debug(T a,T b){ ;}
#endif

template<class T> void chmin(T& a,const T& b) { if(a>b) a=b; }
template<class T> void chmax(T& a,const T& b) { if(a<b) a=b; }

typedef long long int lint;
typedef pair<int,int> pi;

namespace std{
  template<class S,class T>
  ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.fr<<','<<a.sc<<')';
    return out;
  }
}

//const int INF=5e8;
lint f(lint a){
  lint res=1;
  a+=7;
  REP(i,7) res*=a-i,res/=i+1;
  return res;
}

int ar[1000];
int main(){
  lint K;cin>>K;

  for(int i=600;i>=0;--i){
    if(i>=590) dump(K),dump(f(i));
    ar[i]=K/f(i);
    K-=ar[i]*f(i);
  }
  string res;
  REP(i,601){
    res+="FESTIVA";
    res+=string(ar[i],'L');
  }
  cout<<res<<endl;
  return 0;
}



Submission Info

Submission Time
Task G - FESTIVAL
User hogloid
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1623 Byte
Status AC
Exec Time 3 ms
Memory 384 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 3 ms 256 KB
001.txt AC 3 ms 256 KB
002.txt AC 3 ms 256 KB
003.txt AC 3 ms 256 KB
004.txt AC 3 ms 384 KB
005.txt AC 3 ms 256 KB
006.txt AC 3 ms 256 KB
007.txt AC 3 ms 256 KB
008.txt AC 3 ms 256 KB
009.txt AC 3 ms 256 KB
010.txt AC 3 ms 256 KB
011.txt AC 3 ms 256 KB
012.txt AC 3 ms 256 KB
013.txt AC 3 ms 256 KB
014.txt AC 3 ms 256 KB
015.txt AC 3 ms 256 KB
016.txt AC 3 ms 256 KB
017.txt AC 3 ms 256 KB
018.txt AC 3 ms 256 KB
019.txt AC 3 ms 256 KB
020.txt AC 3 ms 256 KB
021.txt AC 3 ms 256 KB
022.txt AC 3 ms 256 KB
023.txt AC 3 ms 256 KB
024.txt AC 3 ms 384 KB
025.txt AC 3 ms 256 KB
026.txt AC 3 ms 256 KB
027.txt AC 3 ms 256 KB
028.txt AC 3 ms 256 KB
029.txt AC 3 ms 256 KB
030.txt AC 3 ms 256 KB
031.txt AC 3 ms 256 KB
032.txt AC 3 ms 256 KB
033.txt AC 3 ms 256 KB
034.txt AC 3 ms 256 KB
035.txt AC 3 ms 256 KB
036.txt AC 3 ms 256 KB
037.txt AC 3 ms 256 KB
038.txt AC 3 ms 256 KB
039.txt AC 3 ms 256 KB
040.txt AC 3 ms 256 KB
041.txt AC 3 ms 256 KB
042.txt AC 3 ms 256 KB
043.txt AC 3 ms 256 KB
044.txt AC 3 ms 256 KB
045.txt AC 3 ms 256 KB
046.txt AC 3 ms 256 KB
047.txt AC 3 ms 256 KB
048.txt AC 3 ms 256 KB
049.txt AC 3 ms 256 KB
050.txt AC 3 ms 256 KB
051.txt AC 3 ms 256 KB
052.txt AC 3 ms 256 KB
053.txt AC 3 ms 256 KB
example0.txt AC 3 ms 256 KB
example1.txt AC 3 ms 256 KB