Cod sursa(job #1411259)
Utilizator | Data | 31 martie 2015 16:15:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int j,i,n,a[100],k,cresc;
bool ok;
int main()
{fi>>n>>k;
i=1;
while (i>0)
{ if (i==k+1){
for (j=1;j<i;j++)
fo<<a[j]<<' ';
fo<<'\n';
i--; }
else
if (a[i]<n){ a[i]++;
i++;
a[i]=a[i-1];}
else {a[i]=0;
i--;}
}
return 0;
}