| |
 111
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string ori,fnd,rep;
getline(cin,ori);
getline(cin,fnd);
getline(cin,rep);
int k;
k=ori.find(fnd);
while(k>0){
ori=ori.replace(k,fnd.length(),rep);
k=ori.find(fnd);
}
cout<<ori;
return 0;
}
( 2026/4/7 19:12:13 ) |
| |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
void merge(std::vector<int>& arr, int left, int mid, int right) {
std::vector<int> leftArr(arr.begin() + left, arr.begin() + mid + 1);
std::vector<int> rightArr(arr.begin() + mid + 1, arr.begin() + right + 1);
int i = 0, j = 0, k = left;
while (i < leftArr.size() && j < rightArr.size()) {
if (leftArr[i] <= rightArr[j]) {
arr[k++] = leftArr[i++];
} else {
arr[k++] = rightArr[j++];
}
}
while (i < leftArr.size()) arr[k++] = leftArr[i++];
while (j < rightArr.size()) arr[k++] = rightArr[j++];
}
void mergeSort(std::vector<int>& arr, int left, int right) {
if (left < right) {
int mid = left + (right - left) / 2;
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
merge(arr, left, mid, right);
}
}
int main() {
int n;
std::cin >> n;
std::set<int> uniqueInts;
for (int i = 0; i < n; ++i) {
int num;
std::cin >> num;
uniqueInts.insert(num);
}
std::vector<int> sortedUniqueInts(uniqueInts.begin(), uniqueInts.end());
mergeSort(sortedUniqueInts, 0, sortedUniqueInts.size() - 1);
for (int num : sortedUniqueInts) {
std::cout << num << " ";
}
return 0;
}
( ) |
|
