Cod sursa(job #1323579)
| Utilizator | Data | 21 ianuarie 2015 11:50:08 | |
|---|---|---|---|
| Problema | Trapez | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n;
string S[30];
int F[30],l;
void back(int k)
{
int i,j,t;
if(k==n)
{
for(i=1;i<=n;i++)
g<<S[i]<<" ";
g<<endl;
}
else
for(i=97;i<=122;i++)
{
S[k+1]=char(i);
t=1;
//if (F[i]==1)
// t=0;
// if(t==1)
// {
// ++F[i];
back(k+1);
// --F[i];
}
}
int main()
{
f>>n;
back(0);
f.close();
g.close();
return 0;
}
