Pagini recente » Cod sursa (job #1428040) | Cod sursa (job #1639861) | Cod sursa (job #2903491) | Cod sursa (job #2852046) | Cod sursa (job #163348)
Cod sursa(job #163348)
#include <fstream.h>
ofstream g("permutari.out");
int sol[10],n;
int cond(int a){
for (int i=0;i<a;i++)
if (sol[i]==sol[a]) return 0;
return 1;
}
void afisare(){
for (int i=1;i<=n;i++)
g<<sol[i]<<" ";
g<<"\n";
}
int main(){
ifstream f("permutari.in");
int k,p;
f>>n;
k=1;
while (k>0){
p=0;
while (!p && sol[k]<=n ){
if (cond(k)) p=1;
else sol[k]++;
}
if (p==0) {sol[--k]++;}
else if (k==n) {afisare();
sol[k]++;}
else if (k<n) {sol[++k]=0;}
}
f.close();
g.close();
}