Pagini recente » Borderou de evaluare (job #2844578) | Cod sursa (job #2228384) | Cod sursa (job #710559) | Cod sursa (job #3260187) | Cod sursa (job #2776831)
#include<fstream>
using namespace std;
ifstream F("submultimi.in");
ofstream G("submultimi.out");
int n,p,k,i,j,s[17];
int main()
{
F>>n;
for(p=1;p<=n;++p)
for(k=1,s[k]=0;k;) {
for(++s[k],j=i=1;i<k&&j;++i)
if(s[i]==s[k])
j=0;
if(j) {
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;
}