3 849
Suscriptores
Sin datos24 horas
-297 días
-12730 días
Archivo de publicaciones
3 849
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n;
vector<int> array1(n);
for(int i=0;i<n;i++){
cin>>array1[i];
}
cin>>m;
vector<int>array2(m);
for(int i=0;i<m;i++){
cin>>array2[i];
}
int totalItems=n+m;
cout<<totalItems<<endl;
}
3 849
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_SIZE=100;
double findMedian(int merged[],int size){
if(size%2==0){
return (merged[size/2-1]+merged[size/2])/2.0;
} else{
return merged[size/2];
}
}
int main(){
int n1,n2;
int arr1[MAX_SIZE],arr2[MAX_SIZE];
cin>>n1>>n2;
for(int i=0;i<n1;i++){
cin>>arr1[i];
}
for(int i=0;i<n2;i++){
cin>>arr2[i];
}
int merged[MAX_SIZE];
int size=n1+n2;
for(int i=0;i<n1;i++){
merged[i]=arr1[i];
}
for(int i=0;i<n2;i++){
merged[n1+i]=arr2[i];
}
sort(merged,merged+size);
double median=findMedian(merged, size);
cout<<median<<endl;
}
3 849
// You are using GCC
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n>50){
cout<<"Invalid array size";
return 1;
}
int arr[50];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int modifiedArr[50];
for(int i=0;i<n;i++){
if(i==0){
modifiedArr[i]=arr[i]*arr[i+1];
}
else if(i==n-1)
{
modifiedArr[i]=arr[i]*arr[i-1];
}
else{
modifiedArr[i]=arr[i-1]*arr[i+1];
}
}
for(int i=0;i<n;i++){
cout<<modifiedArr[i]<<" ";
}
}
3 849
#include<iostream>
using namespace std;
int main(){
int n,pos,value;
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]<<" ";
}
cin>>pos;
if(pos-1>n){
cout<<"\nInvalid position!";
return 1;
}
cin>>value;
for(int i=n-1;i>=pos-1;i--){
arr[i+1]=arr[i];}
arr[pos-1]=value;
n++;
cout<<"\nUpdated array: ";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
}
3 849
#include<iostream>
#include<vector>
using namespace std;
void removeOutOfStockProducts(vector<int>& productIDs){
vector<int>updatedProductIDs;
for (int id : productIDs){
if(id!=0){
updatedProductIDs.push_back(id);
}
}
productIDs=updatedProductIDs;
}
int main()
{
int n;
cin>>n;
vector<int>productIDs(n);
for(int i=0;i<n;i++){
cin>>productIDs[i];
}
cout<<"Removing out-of-stock products";
removeOutOfStockProducts(productIDs);
cout<<"\nUpdated array of product IDs: ";
for(int id: productIDs){
cout<<id<<" ";
}
cout<<endl;
}
3 849
#include<iostream>
#include<climits>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];}
int smallest=INT_MAX;
int secondSmallest=INT_MAX;
for(int i=0;i<n;i++){
if(arr[i]<smallest){
secondSmallest=smallest;
smallest=arr[i];
}
else if
(arr[i]<secondSmallest && arr[i]!=smallest){
secondSmallest=arr[i];
}
}
cout<<"Second Smallest Element: "<<secondSmallest;
}
3 849
#include<stdio.h>
int main()
{
int n, m;
scanf("%d", &n);
int mathScores[n];
for (int i = 0; i < n; i++){
scanf("%d", &mathScores[i]);
}
scanf("%d", &m);
int scienceScores[m];
for (int i = 0; i < m; i++){
scanf("%d", &scienceScores[i]);
}
int maxScore = mathScores[0];
for (int i = 1; i < n; i++){
if (mathScores[i] > maxScore){
maxScore = mathScores[i];
}
}
for (int i = 0; i < m; i++){
if (scienceScores[i] > maxScore){
maxScore = scienceScores[i];
}
}
for (int i = 0; i < m; i++){
if (scienceScores[i] > maxScore){
maxScore = scienceScores[i];
}
}
printf("%d\n", maxScore);
return 0;
}
3 849
#include<stdio.h>
int main()
{
int n1, n2;
scanf("%d", &n1);
int arr1[n1];
for (int i = 0; i < n1; i++)
scanf("%d", &arr1[i]);
scanf("%d", &n2);
int arr2[n2];
for (int i = 0; i < n2; i++)
scanf("%d", &arr2[i]);
int maxLength = (n1 > n2) ? n1 : n2;
for (int i = 0; i < maxLength; i++)
{
int num1 = (i < n1) ? arr1[i]: 0;
int num2 = (i < n2) ? arr2[i]: 0;
printf("%d ", num1+ num2);
}
return 0;
}
3 849
#include<stdio.h>
void mergeAndPrint(int arr1[], int n, int arr2[], int m){
int merged[n + m];
int i = 0, j = 0, k = 0;
while(i < n && j < m){
if (arr1[i] < arr2[j])
merged[k++] = arr1[i++];
else if (arr1[i] > arr2[j])
merged[k++] = arr2[j++];
else {
merged[k++] = arr1[i++];
j++;
}
}
while (i < n)
merged[k++] = arr1[i++];
while (j < m)
merged[k++] = arr2[j++];
for (i = 0; i < n; i++)
printf("%d ", merged[i]);
printf("\n");
for (i = n; i < n + m; i++)
printf("%d ", merged[i]);
}
int main(){
int n, m;
scanf("%d", &n);
int arr1[n];
for (int i = 0; i < n; i++)
scanf("%d", &arr1[i]);
scanf("%d", &m);
int arr2[m];
for (int i = 0; i < m; i++)
scanf("%d", &arr2[i]);
mergeAndPrint(arr1, n, arr2, m);
return 0;
}
