Cod sursa(job #606084)
| Utilizator | Data | 3 august 2011 12:54:36 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream.h>
int n,p,k=1,s[50],i;
int valid(int s[50],int k)
{for(i=1;i<k;i++)
if(s[i]==s[k])
return 0;
return 1;}
int main()
{ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>p,s[k]=0;
while(k>0)
{s[k]++;
if(valid(s,k))
if(s[k]<=n)
if(k==p)
{for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<"\n";}
else
k++,s[k]=s[k-1];
else
k--;}
return 0;}
