Cod sursa(job #166108)
Utilizator | Data | 27 martie 2008 14:13:49 | |
---|---|---|---|
Problema | Combinari | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
int s[9],k=1,n,cont,i,p;
int main()
{
ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>p;
s[k]=0;
while (k>0)
if(s[k]<n)
{ s[k]++; cont=1;
if(cont)
if(k==p)
{ for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<'\n';
}
else { k++; s[k]=s[k-1];}
}
else k--;
f.close();
g.close();
return 0;
}