SRM448(500待填)

250pt:

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
using namespace std ;
#define For(i , n) for(int i = 0 ; i < (n) ; ++i)
#define SZ(x)  (int)((x).size())
typedef long long lint ;
const int maxint = -1u>>2 ;
const double eps = 1e-6 ; 

double ret = 0.0;
int card[15];
map <int,int> mp;

void dfs(int mark , int dep , double rate ) {
    if (mark > 20) {
        ret += dep* rate;
        return;
    }
    int tot = 0;
    for ( int i = 1 ; i <= 13 ; i++) tot += card[i];
    for ( int i = 1 ; i <= 13 ; i++) {
        if ( card[i] ) {
            card[i]--;
            dfs( mark + mp[i] , dep + 1 , rate*(card[i]+1)/tot);
            card[i]++;
        }
    }
}
class TheBlackJackDivOne
{
public:
double expected(vector <string> cards)
{
    for (int i = 1 ; i <= 13 ; i++) card[i] = 4;
    for (int i = 1 ; i <= 13 ; i++) 
        if ( i == 1 ) mp[i] = 11; 
        else if ( i == 11 || i == 12 || i == 13 ) mp[i] = 10;
        else mp[i] = i;
    
    int mark = 0;
    for (int i = 0 ; i < (int)(cards.size()) ; i++) {
        int tmp;
        if ( cards[i][0] != 'A' && cards[i][0] != 'J' && cards[i][0] != 'K' && cards[i][0] != 'Q' && cards[i][0] != 'T')
            tmp = (int) (cards[i][0] - '0') ;
        else if (cards[i][0] == 'A') tmp = 1;
        else if (cards[i][0] == 'T') tmp = 10;
        else if (cards[i][0] == 'J') tmp = 11;
        else if (cards[i][0] == 'Q') tmp = 12;
        else if (cards[i][0] == 'K') tmp = 13;
        card[tmp]--;
        mark += mp[tmp];
    }
    
    ret = 0.0;
    dfs( mark , 0 , 1 );
    
    
return double(ret) ;
}



};


// Powered by FileEdit
// Powered by TZTester 1.01 [25-Feb-2003]
// Powered by CodeProcessor