topcoder lottery game

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
long long FAF(long long n,long long m)
{
long long result=1.0;
for(int i=0;i<m;++i)
result*=n;
return result;
}
long long FAT(long long n,long long m)
{
long long result=1.0;
for(int i=0;i<m;++i)
result*=(n-i);
return result;
}
long long TAT(long long n,long long m)
{
long long same=1;
for(int i=m;i>1;--i)
same*=i;
long long result=FAT(n,m)/same;
return result;
}
long long TAF(long long n,long long m)
{
vector<vector<long long>> table(m,vector<long long>(n));
for(int i=0;i<n;++i)
table[0][i]=1;
for(int i=0;i<m;++i)
table[i][0]=1;
for(int i=1;i<m;++i)
{
for(int j=1;j<n;++j)
{
table[i][j]=table[i-1][j]+table[i][j-1];
}
}
long long result=0.0;
for(int i=0;i<n;++i)
result+=table[m-1][i];
return result;
}
vector<string> sortByOdds(vector<string> rules)
{
if(rules.size()==0)
{
 vector<string> sortRes;
 return sortRes;
} 
multimap<long long,string> mapResult;
for(auto str:rules)
{
size_t pos=str.find(':',0);
string name=str.substr(0,pos);
size_t pos1=str.find(' ',pos+2);
long long n=0.0+atoi(str.substr(pos+2,pos1-pos-2).c_str());
size_t pos2=str.find(' ',pos1+1);
long long m=0.0+atoi(str.substr(pos1+1,pos2-pos1-1).c_str());
size_t pos3=str.find(' ',pos2+1);
string first=str.substr(pos2+1,1);
string second=str.substr(pos3+1,1);
long long result=0.0;
if((first=="F"||first=="f")&&(second=="F"||second=="f"))
result=FAF(n,m);
else if((first=="F"||first=="f")&&(second=="T"||second=="t"))
result=FAT(n,m);
else if((first=="T"||first=="t")&&(second=="F"||second=="f"))
result=TAF(n,m);
else 
result=TAT(n,m);
mapResult.insert(make_pair(result,name));
}
/*const int len=rules.size();
vector<string> sortRes(len,"");*/
multimap<long long,string>::iterator it=mapResult.begin(),cur,next;
vector<string> sortRes;
/*for(it=mapResult.begin();it!=mapResult.end();++it)
{
cout<<it->first<<endl;
sortRes.push_back(it->second);
}*/
int k=-1;
while(it!=mapResult.end())
{
cur=it;
next=++cur;
if(next==mapResult.end())
{
sortRes.push_back(it->second);
break;
}

if(it->first!=next->first)
{
sortRes.push_back(it->second);
++it;
++k;
}
else
{
int len=1;
while(next!=mapResult.end()&&next->first==it->first)
{
++next;
++len;
}
int i=0;

while(i<len)
{
sortRes.push_back(it->second);
++it;
++i;
++k;
}
vector<string>::iterator sFirst=sortRes.begin();
advance(sFirst,k-1);
sort(sFirst,sortRes.end());
}
}
return sortRes;
}
int main()
{
vector<string> rules;
rules.push_back("PICK ANY TWO: 10 2 F F");
rules.push_back("PICK TWO IN ORDER: 10 2 T F");
rules.push_back("PICK TWO DIFFERENT: 10 2 F T");
rules.push_back("PICK TWO LIMITED: 10 2 T T");
cout<<FAF(10,2)<<endl;
cout<<TAF(10,2)<<endl;
cout<<FAT(10,2)<<endl;
cout<<TAT(10,2)<<endl;
//第一个true表示有序，第二个true表示唯一
/*rules.push_back("indigo: 93 8 t f");
rules.push_back("orange: 29 8 f t");
rules.push_back("violet: 76 6 f f");
rules.push_back("blue: 100 8 t t");
rules.push_back("red: 99 8 t t");
rules.push_back("green: 78 6 f t");
rules.push_back("yellow: 75 6 f f");*/
vector<string> result=sortByOdds(rules);
for(auto res:result)
cout<<res<<endl;
return 0;
}