Cod sursa(job #1952253)
| Utilizator | Data | 4 aprilie 2017 00:07:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include<vector>
using namespace std;
int p,n,k;
vector<int> st;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare()
{
for(int i=1;i<=p;i++)
g<<st[i]<<' ';
g<<'\n';
}
int main()
{
f>>n>>p;k=1;st.resize(p+1);st[k]=0;
while(k)
{
if(st[k]<n)
{
st[k]++;
if(k==p)
afisare();
else {k++;st[k]=st[k-1];}
}
else k--;
}
return 0;
}
