Cod sursa(job #1541749)
Utilizator | Pogonet Artiom Pogonet | Data | 4 decembrie 2015 15:37:51 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,k,p,i,v[100];
int verif(int k)
{
if (k > 1){
if (v[k]<=v[k-1]) return 0;
}
return 1;
}
void afis()
{
for (int i = 1; i <= p; ++i)
g << v[i] << ' ';
g << '\n';
}
void back ()
{
k = 1; v[k] = 0;
do
{
while (v[k] < n )
{
v[k]++;
if (verif(k))
if (k==p) afis();
else
{
k++; v[k]= 0;}
}
k--;
}while (k > 0);
}
int main ()
{
f >> n >> k;
back();
g.close ();
return 0;
}