Cod sursa(job #1313905)
| Utilizator | Data | 11 ianuarie 2015 12:02:08 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[9],n,p;
int verific(int k)
{
int i=0;
for(i=1;i<k;i++)
if(x[i]>=x[k])
return 0;
return 1;
}
void bkt(int k)
{
int i=0;
if(k==p+1)
{
{for(i=1;i<=p;i++)
g<<x[i]<<" ";
g<<"\n";
}
}
else
{
x[k]=0;
while(x[k]<n)
{
x[k]++;
if(verific(k)==1)
bkt(k+1);
}
}
}
int main()
{
f>>n>>p;
bkt(1);
return 0;
}
