Cod sursa(job #1947539)
| Utilizator | Data | 31 martie 2017 00:34:25 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include<vector>
using namespace std;
vector<int> st;
int n,k;
ifstream f("permutari.in");
ofstream g("permutari.out");
int valid(int niv)
{
for(int i=1;i<niv;i++)
if(st[i]==st[niv]) return 0;
return 1;
}
void afisare()
{
for(int i=1;i<=n;i++) g<<st[i]<<' ';
g<<'\n';
}
int main()
{
f>>n;k=1;st.resize(n+1);
while(k)
if(st[k]<n)
{
st[k]++;
if(valid(k))
if(k==n) afisare();
else {k++;st[k]=0;}
}
else k--;
return 0;
}
