Peter
BAN USER#include<map>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cctype>
#include<queue>
using namespace std;
int cnt=0,parr[6];
void dfs(int crs,int dep);
int main()
{
dfs(0,1);
cout<<cnt;
}
void dfs(int crs,int dep)
{
for(int i=1;i<=2;i++)
{
int ncrs=crs;
if(i==1){ncrs+=1;parr[dep]=i; }else {ncrs+=2;parr[dep]=i;}
if(ncrs==5)
{
cnt++;int sm=0;
for(int j=1;j<=5;j++)
{
sm+=parr[j];
if(sm<=5)
cout<<parr[j]<<" ";
else
cout<<"0 ";
}
cout<<endl;
return;
}
else if(ncrs>5)return;
else
{
dfs(ncrs,dep+1);
}
}
}
/*
Output :
1 1 1 1 1
1 1 1 2 0
1 1 2 1 0
1 2 1 1 0
1 2 2 0 0
2 1 1 1 0
2 1 2 0 0
2 2 1 0 0
8
*/
Wrong output for : "################################*#"
- Peter August 05, 2014