Pagini recente » Cod sursa (job #2320943) | Cod sursa (job #1282263) | Cod sursa (job #837528) | Cod sursa (job #2246009) | Cod sursa (job #818845)
Cod sursa(job #818845)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <string>
#include <cstring>
#include <deque>
#include <stack>
#include <bitset>
#include <list>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp(a,b) make_pair (a, b)
#define ll long long
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
using namespace std;
vector <int> v;
int main ()
{
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int N;
fin >> N;
fin.close ();
for (int i = 1; i <= N; i++)
v.pb (i);
do
{
for (int i = 0; i < N; i++)
fout << v[i] << " ";
fout << "\n";
} while (next_permutation (v.begin (), v.end ()));
fout.close ();
return 0;
}