Cod sursa(job #512316)
| Utilizator | Data | 13 decembrie 2010 19:50:46 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int main()
{
int n,k,i,gata=0,p;
ifstream fin("combinari.in");
fin>>n>>k;
int t[k+1];
for(i=1;i<=k;i++)
t[i]=i;
fin.close();
ofstream fout("combinari.out");
while(!gata)
{
for(i=1;i<=k;i++)
fout<<t[i]<<' ';
fout<<"\n";
p=k;
while(t[p]==n-k+p)
p--;
if(p==0) gata=1;
else
{
t[p]++;
for(i=p+1;i<=k;i++)
t[i]=t[i-1]+1;
}
}
fout.close();
return 0;
}
