3 849
Підписники
Немає даних24 години
-297 днів
-12730 днів
Архів дописів
3 849
#include<stdio.h>
#define MAX_SIZE 1000
int main(){
int num, i, d ;
int employee[MAX_SIZE];
scanf("%d", &num);
for (i = 0; i < num; i++){
scanf("%d", &employee[i]);
}
scanf("%d", &d);
d %= num;
for (i = 0; i < num; i++){
printf("%d", employee[(i + d) % num]);
}
printf("\n");
return 0;
}
3 849
#include<stdio.h>
#define MAX_SIZE 100
int main(){
int n;
scanf("%d", &n);
int originalArray[MAX_SIZE];
for (int i = 0; i < n; i++){
scanf("%d", &originalArray[i]);
}
int newValue;
scanf("%d", &newValue);
int updatedArray[MAX_SIZE];
updatedArray[0] = newValue;
for (int i = 0; i < n; i++){
updatedArray[i+1] = originalArray[i];
}
printf("Original array: ");
for (int i = 0; i < n; i++){
printf("%d ", originalArray[i]);
}
printf("\nUpdated array:");
for (int i = 0; i <= n; i++){
printf("%d ", updatedArray[i]);
}
return 0;
}
3 849
#include<stdio.h>
int findMajorityCandidate(int arr[], int n){
int candidate = arr[0];
int count = 1;
for (int i = 1; i < n; i++){
if (arr[i] == candidate){
count++;
}else{
count--;
if (count == 0){
candidate = arr[i];
count = 1;
}
}
}
int majorityCount = 0;
for (int i = 0; i < n; i++){
if (arr[i] == candidate){
majorityCount++;
}
}
if (majorityCount > n / 2){
return candidate;
}else{
return -1;
}
}
int main(){
int n;
scanf("%d", &n);
int arr[n];
for (int i =0;i < n; i++){
scanf("%d", &arr[i]);
}
int majorityCandidate = findMajorityCandidate(arr, n);
if (majorityCandidate != -1){
printf("The majority candidate is ID %d\n", majorityCandidate);
}else{
printf("No majority candidate found\n");
}
return 0;
}
3 849
#include <stdio.h>
void rotateRight(int arr[], int n, int k){
int temp[k];
for (int i = 0; i < k; i++){
temp[i] =arr[n - k + i];
}
for (int i = n -1; i >= k; i--){
arr[i] = arr[i - k];
}
for (int i = n - 1; i >= k; i--){
arr[i] = arr[i - k];
}
for (int i = 0; i < k; i++){
arr[i]= temp[i];
}
}
int main(){
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++){
scanf("%d", &arr[i]);
}
int k;
scanf("%d", &k);
printf("Original array:");
for (int i = 0; i < n; i++){
printf(" %d", arr[i]);
}
printf("\n");
rotateRight (arr, n, k );
printf("Updated array:");
for(int i = 0; i < n; i++){
printf(" %d", arr[i]);
}
printf("\n");
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];
}
cout<<"Initial order: ";
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
cout<<endl;
// sorting
for(int i=0; i<n-1; i++){
int min = i;
for(int j=i+1; j<n; j++){
if(arr[j]<arr[min]){
min = j;
}
}
if(min!=i){
string temp = arr[i];
arr[i]=arr[min];
arr[min]=temp;
}
cout<<"After Iteration "<<i+1<<": ";
for (int k = 0; k < n; k++)
{
cout << arr[k] << " ";
}
cout<<endl;
}
cout<<"Sorted order: ";
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
return 0;
}
3 849
#include <iostream>
#include <vector>
void selectionSort(std::vector<int> &arr) {
int n = arr.size();
for (int i = 0; i < n - 1; ++i) {
int minIndex = i;
for (int j = i + 1; j < n; ++j) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
std::swap(arr[i], arr[minIndex]);
}
}
int main() {
int n;
std::cin >> n;
std::vector<int> heights(n);
for (int i = 0; i < n; ++i) {
std::cin >> heights[i];
}
selectionSort(heights);
std::cout << "Sorted array:";
for (int i = n-1; i>-1; --i) {
std::cout << " " << heights[i];
}
std::cout << std::endl;
if (n >= 2) {
std::cout << "The second largest element is " << heights[n - 2] << std::endl;
} else {
std::cout << "There are not enough heights to find the second largest." << std::endl;
}
return 0;
}
3 849
// You are using GCC
// take n element in a array and sort them
#include <iostream>
using namespace std;
int main(){
// take n element in a array and sort them
int n;
cin >> n;
int arr[n];
for(int i=0; i<n; i++){
cin >> arr[i];
}
// sorting using insertion sort
for(int i=1; i<n; i++){
int current = arr[i];
int j = i-1;
while(arr[j]>current && j>=0){
arr[j+1] = arr[j];
j--;
}
arr[j+1] = current;
}
// print the sorted array
for(int i=0; i<n; i++){
cout << arr[i] << " ";
}
return 0;
}
3 849
// You are using GCC
// You are using GCC
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
string names[n];
for(int i=0;i<n;i++)
{
cin>>names[i];
}
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(names[j]>names[j+1])
{
string temp = names[j];
names[j] = names[j+1];
names[j+1] = temp;
}
}
}
for(int i=0;i<n;i++)
{
cout<<names[i]<<" ";
}
return 0;
}
