結果
問題 | No.294 SuperFizzBuzz |
ユーザー |
![]() |
提出日時 | 2015-10-23 23:53:03 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 3 ms / 5,000 ms |
コード長 | 3,088 bytes |
コンパイル時間 | 807 ms |
コンパイル使用メモリ | 93,372 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-13 04:04:34 |
合計ジャッジ時間 | 1,401 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
#include <iostream>#include <iomanip>#include <sstream>#include <vector>#include <string>#include <set>#include <unordered_set>#include <map>#include <unordered_map>#include <stack>#include <queue>#include <deque>#include <algorithm>#include <functional>#include <iterator>#include <limits>#include <numeric>#include <utility>#include <cmath>#include <cassert>#include <cstdio>using namespace std; using namespace placeholders;using LL = long long;using ULL = unsigned long long;using VI = vector< int >;using VVI = vector< vector< int > >;using VS = vector< string >;using SS = stringstream;using PII = pair< int, int >;using VPII = vector< pair< int, int > >;template < typename T = int > using VT = vector< T >;template < typename T = int > using VVT = vector< vector< T > >;template < typename T = int > using LIM = numeric_limits< T >;template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i) << v[i]; } return s; }template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };#define REP2( i, n ) REP3( i, 0, n )#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )#define GET_REP( a, b, c, F, ... ) F#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )#define FOR( e, c ) for ( auto &e : c )#define ALL( c ) begin( c ), end( c )#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()#define SZ( v ) ( (int)( v ).size() )#define PB push_back#define EM emplace#define EB emplace_back#define BI back_inserter#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )#define MP make_pair#define fst first#define snd second#define DUMP( x ) cerr << #x << " = " << ( x ) << endlLL check( const string &S ){const int L = SZ( S );static LL dp[ 64 ][ 16 ][ 2 ][ 2 ];// dp[ 桁数 ][ mod 15 ][ A 未満か ][ leading zero ]fill( AALL( dp, LL ), 0 );dp[0][0][0][0] = 1;REP( i, L ){const int D = S[i] - '0';REP( j, 15 ){REP( k, 2 ){REP( l, 2 ){for ( int d : { 0, 3, 5 } ){if ( ( !k && D < d ) || ( l && d == 0 ) ){continue;}const int nj = ( j * 10 + d ) % 15;const int nk = k || d < D;const int nl = l || d;dp[ i + 1 ][ nj ][ nk ][ nl ] += dp[i][j][k][l];}}}}}return dp[L][0][0][1] + dp[L][0][1][1];}int main(){cin.tie( 0 );ios::sync_with_stdio( false );LL N;cin >> N;string res( 30, '5' );for ( ; N <= check( res.substr( 1 ) ); res.erase( 0, 1 ) );FOR( c, res ){c = '3';if ( check( res ) < N ){c = '5';}}cout << res << endl;return 0;}