You are on page 1of 3

// Program SRVM.cpp : Defines the entry point for the console application.

//

#include "stdafx.h"
#define _USE_MATH_DEFINES
#include<iostream>
#include<fstream>
#include<math.h>
using std::ofstream;
using namespace std;

double Rt[11] = { 15 ,15.5, 16, 16.5, 17, 17.5, 18, 18.5 ,19, 19.5, 20 }, it[11];
double vh=20 * 0.2, nm = 800, Wm;
double Stas[18], buffer,minim,Ired,z2,z4;

ifstream f("Stas.txt");
ofstream O("fisier_proiect.txt");

void initializare()
{

for ( int i = 0; i < 18 ; i++)


{
f >> buffer;
Stas[i] = buffer * 100;

}
O << "z2 " << "z4 " << "i12 " << "i34 " << "z1=z3"<<"\n";
}

/*void cautare_ir(double a)
{

for (int i = 0; i < n; i++) {


v1[i].value = a / Stas[i];
}
for (int i = 0; i < n; i++) {

for (int k = 0; k < n; k++) {


minim = 9999;
for (int j =0; j < n; j++) {
aux[k][j] = Stas[i] * Stas[j];
if (aux[k][j] > v1[i].value)
{
aux_min =abs( aux[k][j] - v1[i].value);
minim = fmin(aux_min, minim);
if (aux[k][j] > v1[i].value)
{
v1[i].nr1 = k;
v1[i].nr2 = j;
}
}
else
{
aux_min = v1[i].value - aux[k][j];
minim = fmin(aux_min, minim);
if (aux_min = minim)
{
v1[i].nr1 = k;
v1[i].nr2 = j;
}
}
}
}
O<< "V[" << v1[i].value << "] " << Stas[v1[i].nr1] << " " <<
Stas[v1[i].nr2] << "\n";
}
}
*/
int main()
{

initializare();

//O.open("fisier_proiect.txt");
Wm = nm * M_PI/30;
int contor = -1;
for (int i = 0; i < 18; i++) {

Rt[i] = Wm / (vh / Rt[i]); // este It


minim = 9999;

for (int j = 0; j < 18; j++) {


if (abs(Rt[i] - Stas[j]) < minim) {
minim = abs(Rt[i] - Stas[j]);
}
}
contor++;
if ((minim - Rt[i]) / minim < 0.03) {
it[i] = Rt[i];
}

}
//it contine doar it bune

//partea 2
for ( int z = 19; z <= 21; z++) {
for (int i = 0; i <= contor; i++) {
for (int j = 2; j <= 3; j++) {
Ired = round(it[i] / j); //j este icurea (2 sau 3)
for (int k = 1; k <= Ired; k++) {
for (int m = Ired; m >= 1; m--) {
if (k*m == Ired) {
z2 = z * k;
z4 = z * m;
O << z2 << " "<<z4<<" " <<k<<" " <<m<<"
"<<z<<"\n";

}
}
}
}
}
}
cout << "Gata";
f.close();
O.close();

system("pause");

return 0;
}

You might also like