e2hang/Data-Structure
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Algorithm

Browse Source
This commit is contained in:
e2hang
2025-08-30 21:59:50 +08:00
parent 9077007670
commit daeec35f97
13 changed files with 453 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
Algorithm/Maths/P1102 A-B数对/P1102 A-B 数对 set不过.cpp Normal file
View File

@@ -0,0 +1,19 @@
#include <set>
#include <iostream>
using namespace std;
int main(){
multiset<int> s;
int n, m;
cin >> n >> m;
int tmp;
for(int i = 0; i < n; i++){
cin >> tmp;
s.emplace(tmp);
}
int js = 0;
for(auto it = s.begin(); it != s.end(); it++){
js += s.count(*it - m);
}
cout << js << endl;
return 0;
}

26
Algorithm/Maths/P1102 A-B数对/P1102 A-B 数对 unordered_map.cpp Normal file
View File

@@ -0,0 +1,26 @@
#include <unordered_map>
#include <vector>
#include <iostream>
//<2F><> hash + map <20><>ԭ<EFBFBD><D4AD><EFBFBD>Dz<EFBFBD>ϣ<EFBFBD><CFA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD> O(n^2)
using namespace std;
int main(){
unordered_map<long long, int> s;
vector<long long> arr;
long long n, m;
cin >> n >> m;
long long tmp;
for(int i = 0; i < n; i++){
cin >> tmp;
arr.push_back(tmp);
s[tmp]++;
}
long long need;
long long js = 0;
for(int i = 0; i < n; i++){
need = arr[i] - m;
if(s.count(need)) js += s[need];//s[need]<5D><>ֵ<EFBFBD><D6B5> pair.seconds
//s.emplace(make_pair(arr[i], 1));//<2F><><EFBFBD>У<EFBFBD><D0A3><EFBFBD><EFBFBD><EFBFBD>arr[i]<5D><><EFBFBD>ڣ<EFBFBD><DAA3><EFBFBD>ֱ<EFBFBD>ӷ<EFBFBD><D3B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
}
cout << js << endl;
return 0;
}

BIN
Algorithm/Maths/P1102 A-B数对/P1102 A-B 数对 unordered_map.exe Normal file
View File

Binary file not shown.

19
Algorithm/Maths/P1102 A-B数对/P1102 A-B 数对 unordered_set不过 有重复.cpp Normal file
View File

@@ -0,0 +1,19 @@
#include <unordered_set>
#include <iostream>
using namespace std;
int main(){
unordered_multiset<int> s;
int n, m;
cin >> n >> m;
int tmp;
for(int i = 0; i < n; i++){
cin >> tmp;
s.emplace(tmp);
}
int js = 0;
for(auto it = s.begin(); it != s.end(); it++){
js += s.count(*it - m);
}
cout << js << endl;
return 0;
}