Counting words in a text input even if it is not well formed – Computer Sir Ki Class


Lost your password?

Don't have an account ?
Register (It's FREE) ×


Solved Problem #CPP#2717 siteicon   siteicon   siteicon  

Problem Statement - Counting words in a text input even if it is not well formed

Write a program to count number of words even when there might be extra spaces between words and extra punctuation marks. Any alphabets or numbers written contiguously will be counted as words. For. e.g. “21st Century” are two words and “21    st         century systems ?” are four words. ? is not counted as word while 21 is counted as a word.


TC++ #2717


  Related (?) :

Run Output

Input a sentence (Max. 100 chars): 21st Century : A Century of Services.
No. of words in given sentences = 6

#include <iostream>
#include <ctype.h>
using namespace std;
int main()
char str[101];
cout<<“Input a sentence (Max. 100 chars): ” ;
int wc=0,j;
for(int i=0;str[i]!=”;++i)
if(j==0) { wc++; j=1;}
cout <<“No. of words in given sentences = “<<wc<<endl;
return 0;



  • This is a novel technique of words counting which you may not find in books. Please try this input with different kinds of sentences with numbers, punctuators, words with included numbers etc.
  • This technique is better than even professional word processing tools as it can ignore punctuation marks even when they have spaces in between words and punctuation marks.
  • This program also explains a novel looping technique where you can keep the loop count stay for some time until a particular condition is met. Such techniques are are useful when data is streaming from file or from any other streaming device.

Common Errors

  • The loop will not run well if the j flag is not reset before starting the internal loop.


sunmitra| Created: 17-Jan-2018 | Updated: 3-Mar-2018|

Introductory Sessions Beginning to Program Tokens Keyword and Identifiers Data Types Variables and Constants Operators Simple User Input Building Expressions and Formulas Simple Real World Problems Simple If and If Else Multiple-Nested-Ladder of If Else Switch case selection Simple Loops Tricks in Loops - break continue scope Loop Applications - Handling numerals Series printing loops Nested Loops Pattern printing loops Number Varieties and Crunches String Handling (Null Terminated) Strings - string class type Functions (Built-in) Functions - user defined Functions Reference Passing/Returning Arrays Concepts and 1-D Arrays Array Data Management Two dimensional arrays and Matrices Structures Basics Structures passing/returning Display Using IO Manipulation Display Using C Formatting Tricks User Defined Data Types Enumerated Types Preprocessor Directives And Macros Exception Handling Programming Paradigms and OOPs Advantages Abstraction and Encapsulation Polymorphism Inheritance Function Overloading Concepts Function Overloading Varieties Function Overloading Special Cases Defining Classes Creating and Using Class Objects Class Members Accessibility Class Function Types Inline Functions Constant Functions Nesting of Functions Class Members Scope Resolution Static Members in a Class Array of Objects Constructor Concepts Default Constructor Parameterized Constructor Copy Constructor Constructor Overloading Destructors Inheritance Fundamentals Public Derivations Private and Protected Derivations Multiple Inheritance Mult-Level Inheritance Class Nesting Data File Concepts Handling Text Files Handling Binary Files Pointer Concepts Pointer and Arrays Pointers and Functions Object Pointers This Pointer Linked Lists Stacks Queues