Pagini recente » Rating Leontin (leontin) | preONI 2005 runda #2 - solutii | Cod sursa (job #3245417) | Cod sursa (job #3039340) | Cod sursa (job #332911)
Cod sursa(job #332911)
#include<algorithm>
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main()
{
int n,myint[9];
ifstream f("permutari.in");
ofstream g("permutari.out");
f>>n;
f.close();
for (int i=1;i<=n;i++)
myint[i]=i;
do
{
for (int i=1;i<=n;i++)
g<<myint[i]<<" ";
g<<endl;
}
while (next_permutation(myint, myint+n));
g.close();
return 0;
}