Cod sursa(job #1794944)
Utilizator | Data | 1 noiembrie 2016 20:52:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[20],n,m,k;
int main()
{
f>>n>>m;
k=1;
while(k>0)
{
if(v[k]<n)
{
++v[k];
if(k==m)
{
for(int i=1;i<=m;++i)
{
g<<v[i]<<' ';
}
g<<"\n";
}
else
{
++k;
v[k]=v[k-1];
}
}
else --k;
}
return 0;
}