Hello, guys. I wrote the code to a Quadratic Equations Solver and I'd like for you to run the program and read the source code and give me tips on what I can improve, what is good and what is bad, suggestions, etc. . #include <iostream> #include <locale.h> #include <math.h> #include <cmath> #include <complex> #include <windows.h> #include <conio.h> #include <limits> using namespace std; float a = 0; float b = 0; float c = 0;float x1 = 0; float x2 = 0; double Delta = 0; bool repetir = false; int i = 0; int Sim_ou_Nao = 0; void Instrucoes(bool); … |
+0 forum
2
11 | ||

Hey everyone, i need help with this program im doing for a class, now i havent used c++ in a while so thats why im considerably fresh in all this. any at all help would be greatly apprecietated. ALso i can NOT spell to save my life. the problem states this much Write a program to solve the 8-Tiles Puzzle using the best first search algorithm. You need to compare between using the following heuristics to estimate the distance to the goal: h1= 0 (this will be the breadth first search) h2= number of misplaced tiles … |
+0 forum
0
2 | ||

I have been trying to write a program in Pascal (free pascal compiler, Lazarus IDE) that solves an uncompleted entered sudoku. I am moderately new to programming/pascal/lazarus, and so I have no idea how to use the debugging features. I have read through the code several times but I can't see what the problem is. Any help would be greatly appreciated! program sudoku; var input : array[1..9, 1..9] of integer; cell : array[1..9, 1..9, 1..9] of integer; output : array[1..9, 1..9] of integer; cposs : array[1..9, 1..9, 1..9] of integer; cloop, cloop2, rloop, rloop2, bloop, bloop2, loop, loop2, loop3, c, … |
+0 forum
9
13 | ||

hi.. this is part of an assignment.. but any help will be greatly appreciated F(0) = 0 where F(z) is a linear polynomial of order n with complex coefficients F(z) = A(n)Z^n + A(n-1)Z^n-1 + ... + A(1) Z + A(0) = 0 this hasent formatted very well.. it's A(subscript n-1) and then Z to the power n-1. I need to solve the comlplex roots Z(1),Z(2),Z(3)...Z(n) i have already written a complex solver for simple functions eg x^2 = cos(x)-tan(x) and x^x. and i have written a complex quadratic solver. but i am unsure how to implement this function. i … |
+0 forum
4
11 | ||

Hi, I'm currently trying to program a sudoku solver. As a beginner I wrote pseudocode to establish what I'd have to do. One of the first things was to make sure each number in each of the 3 x 3 grids aren't equal to any of the others. Here is my [B]attempt[/B]. I'm pretty sure I've gone the long way around tackling this but it was the only way I was fairly confident I knew how to do, haha. txt1_2 means that it's the second number in the first 3 x 3 grid (from left to right). At the moment, … |
+0 forum
7
10 | ||

hi, i am using DEV-C++ and i have two problems with this code: [CODE]#include<iostream> #include<string> #include<sstream> using namespace std; int main (char argc) { string n1; getline(cin,n1); int len; len = n1.length(); int len1 = -2; int len2 = -1; for(int t = len; t>0; t--) { len1 = len1 + 2; len2 = len2 + 2; cout << "number "<< n1[len1] << endl; cout << "operator "<< n1[len2] << endl; } system("pause"); } [/CODE] i want the output to never end with an operator and whenever i enter a number larger than 9, it ends with an operator. my … |
+0 forum
9
12 | ||

Hi All, I am developing an Excel Add-in using Visual Studio Tools for Office using C#. However, the problem is that i want to use the SOLVER add-in that is available in Excel in my code. I cannot find any way or documentation anywhere for doing the same. However i tried some code [CODE] //namespaces used using VBIDE = Microsoft.Vbe.Interop; using Excel = Microsoft.Office.Interop.Excel; using Office = Microsoft.Office.Core; //path where solver add-in is by-default installed string solverPath = @"c:\program files\microsoft office\OFFICE14\library\SOLVER\SOLVER.XLAM"; //running Solver add-in workbook.Application.Run("SOLVER.Auto_open", Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, Type.Missing, … |
+0 forum
0
1 |

The End.