Pagini recente » Borderou de evaluare (job #1036) | Cod sursa (job #664249) | Atasamentele paginii Clasament concurs | Cod sursa (job #555966) | Cod sursa (job #1182277)
/*
Keep It Simple!
*/
#include<fstream>
using namespace std;
int v[20],N;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
void Back(int k)
{
for(int i=v[k-1]+1;i<=N;i++)
{
v[k] = i;
for(int j=1;j<=k;j++)
g << v[j] << " ";
g << "\n";
if( k < N )
Back(k+1);
}
}
int main()
{
f >> N;
Back(1);
f.close();
g.close();
return 0;
}