Cod sursa(job #2408743)
| Utilizator | Data | 18 aprilie 2019 12:02:52 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[20],k,i,j;
int main()
{
fin>>n>>k;
for(i=1;i<=k;i++)
v[i]=i;
do
{
for(i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<"\n";
i=k;
while(i>=1 && v[i]==n-k+i)
i--;
if(i==0)
break;
v[i]++;
for(j=i+1;j<=k;j++)
v[j]=v[j-1]+1;
}while(1);
fin.close();
fout.close();
return 0;
}
