Number of middle symbols

[NS1997]

Hi there. I have a problem. I don't know how to count the number of the middle letters of the words in the sequence. I have to do it from a file and numbers counts as a word and any punctuation as a space. I have now only program which prints me a sequence, can someone help?

#include <iostream>
#include <cmath>
#include <iomanip>
#include <fstream>
#include <string>
using namespace std;
const char FileName[] = "bandymas.txt";
int main ()
{
    string line;
    ifstream Myfile (FileName);
    int c;

    if (Myfile.is_open())
    {
        while( getline (seka, line))
        {
            cout<<line<<endl;
            c++;
        }
    }
    seka.close();

    return 0;
}

[2kaud]

When posting code, please use code tags. Go Advanced, select the formatted code and click '#'.

As posted, there is a problem with the code. What is seka? Also you are using c without first initialising it - not a good idea!

If there is more than 1 word per line, then getline() will obtain all of the words per line. You'll then need to parse this line into words. As punctuation counts as a space then using stream extraction won't work so you will need to examine the line read to obtain the words. Once you have the word then its easy to obtain the required number. I suggest you define a string that contains the characters to be treated as a space and use .find_first_of() to obtain the position of the next space. Then using .substr() the required word can be extracted. This is repeated until no more spaces in the line are found.

See http://www.cplusplus.com/reference/string/string/ for info about the string class functions.