Pagini recente » Borderou de evaluare (job #365290) | Borderou de evaluare (job #2722249) | Statistici Andrei (dazx) | Borderou de evaluare (job #445641) | Cod sursa (job #489938)
Cod sursa(job #489938)
#include <iostream.h>
#include <fstream.h>
int x[100], n, k, i;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
int cont (int k){
int i;
for (i=1;i<k;i++)
if (x[i] == x[k])
return 0;
return 1;
}
void tipar () {
int i;
for (i=1;i<=n;i++)
g<<x[i]<<" ";
g<<"\n";
}
int main () {
f>>n;
k = 1; x[1] = 0;
while (k)
if (x[k] < n){
x[k]++;
if (cont (k))
if (k == n)
tipar ();
else{
k++;
x[k] = 0;
}
}
else
k--;
f.close ();
g.close ();
return 0;
}