-
Notifications
You must be signed in to change notification settings - Fork 0
/
137B_Permutation.cpp
70 lines (56 loc) · 1.28 KB
/
137B_Permutation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
//* 204102844 May/01/2023 11:10UTC+7 Minh4893IT B - Permutation GNU C++17 Accepted 30 ms 300 KB
#include <bits/stdc++.h>
using namespace std;
using sint = signed int;
#define ll long long
#define ull unsigned ll
#define int ll
#define ss stringstream
#define uset unordered_set
#define umap unordered_map
#define LLMAX INT64_MAX
#define in cin
#define out cout
#define input in
#define print out
#define GET(var) getline(cin, var)
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define FORIR(i, a, n) for (int i = a; i < n; i++)
#define FORI(i, n) FORIR(i, 0, n)
#define FORR(a, n) FORIR(i, a, n)
#define FOR(n) FORIR(i, 0, n)
#define EACH(x, a) for (auto &x : a)
#define IF(cond, t, f) (cond ? t : f)
template <class T>
void OFILE(T finp, T fout)
{
freopen(finp, "r", stdin), freopen(fout, "w", stdout);
}
void solve()
{
int n;
cin >> n;
uset<int> nums;
int result = 0;
for (int i = 0; i < n; ++i)
{
int temp;
cin >> temp;
if (nums.find(temp) != nums.end())
++result;
if (temp <= n)
nums.insert(temp);
else
++result;
}
cout << result;
}
sint main()
{
ios_base::sync_with_stdio(false);
cin.tie();
solve();
return 0;
}