Cod sursa(job #154479)
Utilizator | hulparu adrian hulparuadrian | Data | 11 martie 2008 11:13:20 |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[20],i;
int cck(int i)
{
for(int j=1;j<i;j++)
if (x[j+1]<=x[j]) return 0;
return 1;
}
void afisare()
{
for(int j=1;j<=k;j++)
g<<x[j]<<" ";
g<<"\n";
}
int main()
{
f>>n>>k;
i=1;x[i]=0;
while(i>0)
{
while(x[i]<n)
{
x[i]++;
if (cck(i))
if (i==k) afisare();
else {i++;x[i]=0;}
}
i--;
}
f.close();
g.close();
}