Cod sursa(job #2118358)
| Utilizator | Data | 30 ianuarie 2018 16:10:11 | |
|---|---|---|---|
| Problema | A+B | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#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;
}
