潇潇雨未歇 题解分享 · 2025/3/7
set的插入与遍历 - 题解
``` #include<bits/stdc++.h> // 包含标准库头文件 using namespace std; // 使用标准命名空间 int main(){ set<int>se; int n,t; cin>>n; for(int i=0;i<n;i++){ cin>>t; se.insert(t); } for(auto j : se){ cout<<j<<' '; } return 0; } ```
查看全文
0 0 0 5
晚舟 题解分享 · 2025/2/2
set的插入与遍历 - 题解
``` #include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; set<int> s; for (int i = 0; i < n; i++) { int x; cin >> x; s.insert(x); } for (const auto &ele : s) { cout << ele << " "; } return 0; } ```
查看全文
0 0 0 3
CQS 题解分享 · 2025/3/3
set的插入与遍历 - 题解
``` #include <iostream> #include <set> using namespace std; int main(){ int n; set<int> s; cin >> n; for (int i = 0; i < n; i++) { int num; cin >> num; s.insert(num); } for (const auto& elem : s) { cout << elem << " "; } cout << endl; return 0; } ```
查看全文
0 0 0 1
stamina 题解分享 · 2024/4/5
set的插入与遍历 - 题解
include include include using namespace std; const int N = 1e6+9; int n,x; vector v; int main() { cin>>n; for(int i=0;i >x; v.push_back(x); } ``` sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); for(int i=0;i<v.size();i++) cout<<v[i]<<" "; cout<<endl; return 0; ``` }
查看全文
0 0 0 3
LoneStarFallsIntoAdream 题解分享 · 2024/4/7
set的插入与遍历 - 题解
``` #pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; set<int> s; int main(){ ios_base::sync_with_stdio(false); int n,t; scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&t); s.insert(t); } stringstream ss; for(auto it=s.begin();it!=s.end();it++){ ss<<*it<<" "; } cout<<ss.str(); /* for(auto it=s.begin();it!=s.end();it++){ printf("%d ",*it); } */ return 0; } ```
查看全文
0 0 0 2