Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

右移的小技巧，我是菜……

Posted by lqp18_31 at 2009-08-17 14:19:59 on Problem 3071 and last updated at 2009-08-17 14:21:54

              for( int i=1 ; i<=N ; i++){
                   for( int j=0 ; j<(1<<N) ; j++){
                        for( int k=0 ; k<(1<<N) ; k++)
                        if( (no[ j ]^1)==no[ k ] )
                          f[ i ][ j ]+=f[ i-1 ][ k ]*p[ j ][ k ];
                        f[ i ][ j ]*=f[ i-1 ][ j ];
                   }
                   for( int j=0 ; j<(1<<N) ; j++) no[ j ]>>=1;  // here
              }

Followed by:

Re:右移的小技巧，我是菜…… (453) 108439162 2010-07-26 09:12:17

Post your reply here:

Home Page Go Back To top