Cod sursa(job #1342156)
Utilizator | Data | 13 februarie 2015 16:20:03 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int k=1,v[20],i,m,n;
bool caut;
bool ok(int k)
{
for (i=k-1; i>=1; --i)
if (v[k]==v[i])
return 0;
return 1;
}
int main()
{
f>>n;
v[1]=0;
while (k)
{
caut=0;
while (!caut && v[k]<n)
{
v[k]++;
if (ok(k)) caut=1;
}
if (caut==0) k--;
else
if (k<=n)
{
for (i=1; i<=k; ++i) g<<v[i]<<" ";
g<<'\n';
if (k<n)
k++, v[k]=v[k-1];
}
}
return 0;
}