Cod sursa(job #1411200)
| Utilizator | Data | 31 martie 2015 15:34:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fi ("permutari.in");
ofstream fo ("permutari.out");
int i,n,k,a[100],j,ant;
bool dif;
int main()
{
fi>>n>>k;
i=1;
while(i>0)
{
if(i>k)
{
for(j=1; j<=n; j++)
if(a[j]>0)fo<<a[j]<<' ';
fo<<'\n';
i--;
}
else
{
if(a[i]<n)
{
a[i]++;
dif=true;
for(j=1; j<i; j++)
if(a[i]==a[j]) dif=false;
if(dif==true) i++;
}
else
{
a[i]=a[i-1];
i--;
}
}
}
}
