#include "stdafx.h"
#include <stdio.h>
#include <ctype.h>
#include <conio.h>
 
int main ()
{
	FILE * f;
int nmax = 0, pos = 0, wpos = 0,n = 0;
char chr = '\0';
 
        printf(">LAB_3(VAR_3)\r\n");
        if(!(f = fopen("test.txt","r+")))
                printf("\tERROR : file not exist or already open\r\n");
        else
        {
                while(!feof(f))
                {
                        fread(&chr,1,1,f);pos = ftell(f);n = 0;
                        while(isalpha(chr) && !feof(f))
                        {
                                fread(&chr,1,1,f);
                                n++;
                        }
                        if(nmax < n)
                        {
                                wpos = pos;
                                nmax = n;
                        }				
                }
                fseek(f,wpos - 1,SEEK_END);
				printf("max: %d", nmax);
				fprintf(f, "\n %d \n", nmax);
				fread(&chr,1,1,f);pos = ftell(f);n = 0;			
                while(isalpha(chr) && !feof(f))
                {
                        fread(&chr,1,1,f);
                        printf("%s",chr);
                }
                printf("\r\n>END OF PROGRAM\r\n");
        }
        scanf("%c",&chr);
		fclose (f);
		getch ();
		return 0;
}

#include "stdafx.h"
#include <stdio.h>
#include <conio.h>
#include <math.h>
#include <iostream.h>
#define pi 3.14
 
int a; 
double f(double x) {
        return a*x-(((pi)/2)-atan(x));
}
int main() {
        int n=0;
        double b,c,d,eps;
		eps=0.0000001;
		b=0;
        cout<<"Given the equation: ax=arcctgx \n";
        cout<<"a="; cin>>a;
        cout<<"endpoint="; cin>>c;
        do {
                d=(b+c)/2;
                if (f(d)*f(b)<=0) c=d;
                else b=d;
 
                n+=1;
 
        }
        while (fabs(b-c)>=eps);
                cout<<"answer: "<<d<<"\n";
                cout<<"number of iterations: "<<n<<"\n";
                getch();
        return 0;
}

#include "stdafx.h"
#include <stdio.h>
#include <iostream.h>
#include <math.h>
#include <memory>
 
int main () {
	int N;
	cout<<"N="; cin>>N;
	 int n, m;
        n=int(2*log(double(N)))+2; 
		FILE * f;
		f = fopen("answer.txt","r+");
        int* arr1 = new int[n];
		int* arr2 = new int[n];
		int* arr = new int[2*n];
        for (int i = 0; i < n; i++)
        arr1[i] = (pow(2,(i+1))); //последовательность 2^k
		for (int k = 0; k < n; k++) 
		arr2[k] = (pow(3,(k))); //последовательность 3^k
		k = i = m = 0;
		do { //цикл упорядочивания двух массивов по возрастанию
           if (arr1[i] < arr2[k] ) 
           arr[m++] = arr1[i++]; //Игорь мудак 
           else 
            if (arr1[i] > arr2[k]) 
            arr[m++] = arr2[k++]; 
                 else { 
					 arr[m++] = arr1[i++];
					 arr[m++] = arr2[k++];
				 }
		} while ( i < n && k < n);
			while ( i < n) 
				arr[m++] = arr1[i++];
			while (k < n) 
				arr[m++] = arr2[k++];
 
        for (m = 0; m < 2*n; m++)
		{
			 if( arr[m] <= N) //сравнение с введенным числом N
			 {
	     cout << arr[m] << " ";
		fprintf(f, " %d ", arr[m]); //запись результата в файл
			 }
		}
 
        delete[] arr;
		delete[] arr1;
		delete[] arr2;
 
        return 0;
}