Pagini recente » Cod sursa (job #954335) | Cod sursa (job #2641735) | Cod sursa (job #1989283) | Cod sursa (job #1391969) | Cod sursa (job #2118358)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
int n;
int a[3][maxn];
int v[maxn][2];
int ss = 0, exp;
int main() {
freopen("biperm.in", "r", stdin);
freopen("biperm.out", "w", stdout);
cin >> n;
exp = n;
for(int aa = 1;aa <= 2;aa++)
for(int i = 1;i <= n;i++)
cin >> a[aa][i], v[a[aa][i]][++ss] = i;
for(int i = 1;i <= n;i++) {
for(int j = 1;j <= 2;j++) {
}
}
return 0;
}