Submission #1005451
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define all(c) c.begin(),c.end() #define pb push_back #define fs first #define sc second #define show(x) cout << #x << " = " << x << endl #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) using namespace std; template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";} template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;} typedef long long ll; ll K; int main(){ cin>>K; const int N=8; int X=300; ll a[N]={},vs[N]; rep(i,N) a[i]=1; vs[0]=1; rep(i,N-1){ a[i+1]+=X*a[i]; rep(j,N-2-i) a[i+2+j]+=a[i+1+j]; vs[i+1]=a[N-1]; } // rep(i,N) show(vs[i]); int num[N]={}; for(int i=N-1;i>=0;i--){ ll q=K/vs[i]; num[i]=q; K%=vs[i]; } string ans; string FES="FESTIVA"; rep(i,N){ if(i==0) ans+=FES; else ans+=string(X,FES[i-1])+FES.substr(i); ans+=string(num[i],'L'); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | G - FESTIVAL |
User | sigma425 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1129 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 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 | 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 | 256 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 | 256 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 | 2 ms | 256 KB |