ANTICHAT — форум по информационной безопасности, OSINT и технологиям

#include <stdio.h>
#include <conio.h>
#define N 6

void main(void)
{
	float arr[N];
	int i, min;

	for (i = 0; i < N; i++)
	{
		printf("enter %d element: ", i);
		scanf("%f", &arr[i]);
	}
	min = 0;
	for (i = 0; i < (N - 1); i++)
		if(arr[i+1] < arr[i]) min = i+1;
	printf("min number: %d", min);
	getch();
	return;
}

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <conio.h>
using namespace std;


int cmp(const void *a, const void *b) {
    return *(int*)a - *(int*)b;
}
int main() {
   int n, i;
   int a[6]={2,-1,-7,3,5,6};
   for(i = 0 ; i < 6; i++)
   {
   }
   qsort(a, 6, sizeof(int), cmp );
   for(i = 0 ; i < 6; i++)
   {
       cout << " " << a[i];
   }
   getch();
   return 0;
}

[
#include <stdio.h>

int main()
{
   int sum=0, i=0, j=0;
   int MyArray[10]={ 12, -3, 23, 12, 6, 2, 34, -12, 3, 9};
   int Num[2]={0,0}; 

   for(;i<10;i++)
    {
        if(MyArray[i]<0)
         {
           Num[j]=i;
           j++;
         }
    }

  for(j=Num[0]+1;j<Num[1];j++)
   {
        sum+=MyArray[j];
        printf("%d\n",MyArray[j]);
   }

        printf("%d",sum);

   return 0;
}

#include <algorithm>
size_t GetIndexOfMinElement(const double* a, size_t n)
{
	const double* min_elem = std::min_element(&a[0], &a[n]);
	return min_elem - &a[0];
}

#include <algorithm>
#include <functional>
#include <numeric>

double GetSummFromFirstToSecondNeg(const double* a, size_t n)
{
	const double* first_neg = std::find_if(&a[0], &a[n], 
		std::bind2nd(std::less<double>(), 0));

	if(first_neg != &a[n]){
		const double* second_neg = std::find_if(++first_neg, &a[n], 
			std::bind2nd(std::less<double>(), 0.0));
		return std::accumulate(first_neg, second_neg, 0.0);
	}
	return 0.0;
}

#include <vector>
struct Choser : std::unary_function<double, bool>{
	bool operator()(double a){
		return a < -1.0 || a > 1.0;
	}
};

void SpecialSort(double* a, size_t n)
{
	std::vector<double> c;
	std::remove_copy_if(&a[0],&a[n],std::back_inserter(c),Choser());
	std::copy(&a[0], &a[n - c.size()], std::back_inserter(c));
	std::copy(c.begin(),c.end(),&a[0]);
}