3 849
Підписники
Немає даних24 години
-297 днів
-12730 днів
Архів дописів
3 849
#include<iostream>
#include<algorithm>
using namespace std;
int countOccurrences(int arr[],int size,int target){
int first=lower_bound(arr,arr+size,target)-arr;
int last =upper_bound(arr,arr+size,target)-arr;
return last-first;
}
int main(){
int N;
cin>>N;
int *arr=new int[N];
for(int i=0;i<N;i++){
cin>>arr[i];
}
int target;
cin>>target;
int occurrences=countOccurrences(arr,N,target);
cout<<occurrences;
delete[] arr;
}
3 849
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool compareEnvelopes(const vector<int>& a,const vector<int>& b){
if(a[0]==b[0]){
return a[1]>b[1];
}
return a[0]<b[0];
}
int maxEnvelopes(vector<vector<int>>& envelopes){
int n=envelopes.size();
sort(envelopes.begin(),envelopes.end(),compareEnvelopes);
vector<int> dp(n, 1);
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(envelopes[i][1]>envelopes[j][1]){
dp[i]=max(dp[i],dp[j]+1);
}
}
}
return *max_element(dp.begin(),dp.end());
}
int main(){
int n;
cin>>n;
vector<vector<int>>envelopes(n,vector<int>(2));
for(int i=0;i<n;i++){
cin>>envelopes[i][0]>>envelopes[i][1];
}
int result=maxEnvelopes(envelopes);
cout<<result<<endl;
}
3 849
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool compareEnvelopes(const vector<int>& a,const vector<int>& b){
if(a[0]==b[0]){
return a[1]>b[1];
}
return a[0]<b[0];
}
int maxEnvelopes(vector<vector<int>>& envelopes){
int n=envelopes.size();
sort(envelopes.begin(),envelopes.end(),compareEnvelopes);
vector<int> dp(n, 1);
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(envelopes[i][1]>envelopes[j][1]){
dp[i]=max(dp[i],dp[j]+1);
}
}
}
return *max_element(dp.begin(),dp.end());
}
int main(){
int n;
cin>>n;
vector<vector<int>>envelopes(n,vector<int>(2));
for(int i=0;i<n;i++){
cin>>envelopes[i][0]>>envelopes[i][1];
}
int result=maxEnvelopes(envelopes);
cout<<result<<endl;
}
3 849
#include<iostream>
using namespace std;
int findPeakElement(int arr[],int size){
int left =0;
int right=size-1;
while(left<right){
int mid=left+(right-left)/2;
if(arr[mid]<arr[mid+1]){
left=mid+1;
}else{
right=mid;
}
}
return arr[left];
}
int main(){
int n;
cin>>n;
int *mountainArray=new int[n];
for(int i=0;i<n;i++){
cin>>mountainArray[i];
}
int peak=findPeakElement(mountainArray,n);
cout<<peak;
delete[] mountainArray;
}
3 849
#include<iostream>
using namespace std;
bool linearSearch(int arr[],int size,int target){
for(int i=0;i<size;i++){
if(arr[i]==target){
return true;
}
}
return false;
}
int main(){
int n;
cin>>n;
int *inventory=new int[n];
for(int i=0;i<n;i++){
cin>>inventory[i];
}
int target;
cin>>target;
if(linearSearch(inventory,n,target)){
cout<<"The target value "<<target<<" is present in the array."<<endl;
}else{
cout<<"The target value "<<target<<" is not present in the array."<<endl;
}
delete[] inventory;
}
3 849
#include<iostream>
using namespace std;
int main()
{
int m,n;
cin>>m>>n;
int arr[10][10];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
cin>>arr[i][j];
}
}
int target;
cin>>target;
bool found=false;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(arr[i][j]==target){
cout<<"["<<i<<"]"<<"["<<j<<"]"<<endl;
found=true;
}
}
}
if(!found){
cout<<"Element"<<target<<"not found."<<endl;
}
}
3 849
#include<iostream>
#include<string>
using namespace std;
int main(){
int size1;
cin>>size1;
string arr1[size1];
for(int i=0;i<size1;i++){
cin>>arr1[i];
}
int size2;
cin>>size2;
string arr2[size2];
for(int i=0;i<size2;i++){
cin>>arr2[i];
}
string mergedArr[size1*size2];
int count=0;
for(int i=0;i<size1;i++){
for(int j=0;j<size2;j++){
string combination=arr1[i]+arr2[j];
bool isUnique=true;
for(int k=0;k<count;k++){
if(mergedArr[k]==combination){
isUnique=false;
break;
}
}
if(isUnique){
mergedArr[count]=combination;
count++;
}
}
}
for(int i=0;i<count;i++){
cout<<mergedArr[i]<<" ";
}
cout<<endl;
}
3 849
#include<iostream>
#include<vector>
#include<set>
using namespace std;
const int MAX_SIZE=100;
int main(){
int size1,size2;
cin>>size1;
vector<int>stock(size1);
for(int i=0;i<size1;i++){
cin>>stock[i];
}
cin>>size2;
vector<int> cart(size2);
for(int i=0;i<size2;i++){
cin>>cart[i];
}
set<int>uniqueProductIDs;
for(int i=0;i<size1;i++){
uniqueProductIDs.insert(stock[i]);
}
for(int i=0;i<size2;i++){
uniqueProductIDs.insert(cart[i]);
}
for(int id: uniqueProductIDs){
cout<<id<<" ";
}
cout<<endl;
}
