Cod sursa(job #1008359)
Utilizator | Data | 10 octombrie 2013 21:38:41 | |
---|---|---|---|
Problema | Combinari | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[100]; int n,k;
void calculate(int niv,int i)
{
st[niv]=i;
if(niv==k){for(i=1;i<=k;i++)g<<st[i]<<" ";g<<endl;}
else
{
for(i=st[niv]+1;i<=n;i++)
calculate(niv+1,i);
}
}
int main()
{
f>>n>>k;
st[1]=1;
for(int i=1;i<=n/2;i++)calculate(1,i);
return 0;
}