Cod sursa(job #409052)
Utilizator | Data | 3 martie 2010 13:38:07 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int s[100],k,i,n,ok;
int main()
{
f>>n;
while(k>=0)
{
if(s[k]<n)
{
s[k]++;
ok=1;
for(i=0;i<k;i++)
if(s[i]==s[k])ok=0;
if(ok)
{
for(i=0;i<=k;i++)
g<<s[i]<<' ';
g<<'\n';
k++;
s[k]=s[k-1];
}
}
else k--;
}
return 0;
}