- Upvotes Received
- 3
- Posts with Upvotes
- 2
- Upvoting Members
- 2
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
I am trying an exercise in a book and can't find my problem. I want an invoice class with a seperate implementation file and a file to use it. Below are the three files. [code] // invoice class //Invoice.h #include <string> using namespace std; class Invoice { public: Invoice(string,string, int, … |
|
I want to read he source file of the .exe I am writing. For example if I am running test.exe I want to read test.c Also if the name of the file changes it still had to open it. what i have tried is: [code] FILE *fp=fopen(*.c,"r") [/code] Can someone … |
|
I am trying to write a program that reads a string and shortens it if the letters are in a row. For instance abcdghigjhkhdf becomes a-dg-igkhkhdf. I want that it erases the ;etters it erases but it is not working. HEre is my code: [code] #include <stdio.h> #define MAXSTRING 100 … |
|
I am trying to write a program that accepts a dollar rate and hte accepts a list of amounts adn converts tehm to Shekels and prints in a list with the sums. HEre si my code: It is giving em lots of errors and I am having no luck. I … |
|
I have two strings s1 and s2. I have to check what is the largest occurence of letters in s2 that are in s1. For example: s1="xyz" s2="abxyryxzycx" it would then return 4 since "yxzy" is the largest substring with all the letters in s1. It has to be recursive. … |
|
I am trying to figure out how many ways you can go if you only take one or two steps. For example. If the number is 4 there are 5 ways you can move going one or two steps. I have to do it with recursion. I have the following … |
|
I have a program that asks for a knights coordinates and prints out all possible moves. That works. What doesn't work is if it is not a legal place for the knight (i.e. off the board) it prints an error but also prints coordinates for -1,-2. not sure why. Any … |