灯的排列问题题解

#include<iostream>
using namespace std;

int n;

int main()
{
ios::sync_with_stdio(false);
while(cin>>n)

{
char c;

int x,m=0;
while(cin>>c&&c!='Q')

{
cin>>x;
n-=x+1; ++m;
}
int ans=1;
for(int i=2;i<=m+1;++i)
ans*=(n+i);
cout<<ans<<endl;
}

return 0;

}