3 849
Subscribers
No data24 hours
-297 days
-12730 days
Posts Archive
3 849
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
int nl, n2;
std::vector<int> arr, arr2, merged_array;
// Input
std::cin >> nl >> n2;
arr.resize(nl);
arr2.resize(n2);
for (int i = 0; i < nl; ++i) {
std::cin >> arr[i];
}
for (int i = 0; i < n2; ++i) {
std::cin >> arr2[i];
}
// Merge the arrays and sort them
merged_array.insert(merged_array.end(), arr.begin(), arr.end());
merged_array.insert(merged_array.end(), arr2.begin(), arr2.end());
std::sort(merged_array.begin(), merged_array.end());
// Find the median
int n = merged_array.size();
double median;
if (n % 2 == 0) {
int mid = n / 2;
median = (merged_array[mid - 1] + merged_array[mid]) / 2.0;
} else {
int mid = n / 2;
median = merged_array[mid];
}
// Output
std::cout << median << std::endl;
return 0;
}
3 849
#include<iostream>
using namespace std;
int max(int n1,int n2){
if(n1>n2){
return n1;
}
else{
return n2;
}
};
int min(int n1, int n2){
if(n1<n2){
return n1;
}
else{
return n2;
}
}
int main(){
int n,n2;
cin>>n;
int arr[n];
for(int i=0; i<n; i++){
cin>>arr[i];
}
cin>>n2;
int arr2[n2];
for(int i=0; i<n2; i++){
cin>>arr2[i];
}
int arr3[max(n,n2)];
for(int i=0; i<min(n,n2);i++){
arr3[i]=arr[i]+arr2[i];
}
for(int i=min(n,n2);i<max(n,n2);i++){
if(n==max(n,n2)){
arr3[i]=arr[i];
}
else{
arr3[i]=arr2[i];
}
}
for(int i=max(n,n2)-1; i>-1;i--){
cout<<arr3[i]<<" ";
}
return 0;
}
3 849
#include <iostream>
#include <algorithm>
const int MAX_SIZE = 100;
int main() {
int size1, size2;
int stock[MAX_SIZE], cart[MAX_SIZE], merged[MAX_SIZE * 2];
// Input for the first array
std::cin >> size1;
for (int i = 0; i < size1; ++i) {
std::cin >> stock[i];
}
// Input for the second array
std::cin >> size2;
for (int i = 0; i < size2; ++i) {
std::cin >> cart[i];
}
// Merge the arrays
int index1 = 0, index2 = 0, mergedIndex = 0;
while (index1 < size1 && index2 < size2) {
if (stock[index1] < cart[index2]) {
merged[mergedIndex++] = stock[index1++];
} else if (stock[index1] > cart[index2]) {
merged[mergedIndex++] = cart[index2++];
} else {
merged[mergedIndex++] = stock[index1++];
index2++;
}
}
// Add any remaining elements from stock array
while (index1 < size1) {
merged[mergedIndex++] = stock[index1++];
}
// Add any remaining elements from cart array
while (index2 < size2) {
merged[mergedIndex++] = cart[index2++];
}
// Output the merged array
for (int i = 0; i < mergedIndex; ++i) {
std::cout << merged[i] << " ";
}
std::cout << std::endl;
return 0;
}
3 849
#include <iostream>
#include <vector>
int main() {
int numArrays;
std::vector<std::vector<int>> arrays;
// Input
std::cin >> numArrays;
arrays.resize(numArrays);
for (int i = 0; i < numArrays; ++i) {
int arraySize;
std::cin >> arraySize;
arrays[i].resize(arraySize);
for (int j = 0; j < arraySize; ++j) {
std::cin >> arrays[i][j];
}
}
// Merge the arrays while maintaining the order
std::vector<int> merged;
for (const auto &array : arrays) {
merged.insert(merged.end(), array.begin(), array.end());
}
std::cout<<"Merged array: ";
// Output
for (int i = 0; i < merged.size(); ++i) {
std::cout << merged[i];
if (i < merged.size() - 1) {
std::cout << " ";
}
}
std::cout << std::endl;
return 0;
}
3 849
#include <iostream>
#include <vector>
#include <cmath>
int main() {
int n;
std::cin >> n;
std::vector<int> prices(n);
std::vector<int> thresholds(n);
for (int i = 0; i < n; i++) {
std::cin >> prices[i];
}
for (int i = 0; i < n; i++) {
std::cin >> thresholds[i];
}
int count = 0;
for (int i = 0; i < n - 1; i++) {
if (std::abs(prices[i + 1] - prices[i]) >= thresholds[i]) {
count++;
}
}
std::cout << count << std::endl;
return 0;
}
3 849
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for (int i=0; i<n; i++)
{
cin>>arr[i];
}
cout<<"Original array: ";
for (int i=0; i<n; i++)
{
cout<<arr[i]<<" ";
}
int pos;
cin>>pos;
if(pos>n)
{
cout<<"\nInvalid position!";
}
else{
for (int i=pos-1; i<n-1; i++)
{
arr[i]=arr[i+1];
}
cout<<"\nUpdated array: ";
for (int i=0; i<n-1; i++)
{
cout<<arr[i]<<" ";
}
}
return 0;
}
3 849
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int n2;
cin>>n2;
int b[n2];
for(int i=0;i<n2;i++)
{
cin>>b[i];
}
int count=0;
cout<<"Common Elements: ";
for(int i=0; i<n; i++)
{
for(int j=0; j<n2; j++)
{
if(a[i]==b[j])
{
cout<<a[i]<<" ";
count++;
}
}
}
if(count==0){
cout<<"None";
}
return 0;
}
3 849
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
string arr[n];
for(int i=0; i<n;i++){
cin>>arr[i];
}
char c;
cin>>c;
cout<<"Number of strings starting with the letter "<<c<<" : ";
int count=0;
for(int i=0; i<n; i++){
if(c==arr[i][0]){
count++;
}
}
cout<<count;
return 0;
}
3 849
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
cout<<"Element "<<" "<<"Frequency"<<endl;
for (int i = 0; i < n; i++)
{
int count = 1;
for (int j = i+1; j < n; j++)
{
if (arr[i] == arr[j])
{
count++;
for (int k = j; k < n; k++)
{
arr[k] = arr[k + 1];
}
n--;
j--;
}
}
cout<<arr[i]<<" "<<count<<endl;
}
return 0;
}
