DMOJ · dwite08c3p2

Wordcount++

This C++ solution uses string processing for DMOJ dwite08c3p2 Wordcount++. Read the reasoning, inspect the code, or try your own test case below.

dwite08c3p2Implementation & simulationString processingC++25 lines
Solution239of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

The local label is shortened, but official Wordcount++ exactly matches five text lines and counting alphabetic words at least four letters long.

Implementation & simulation

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

word_count.cpp

C++

     
    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        string line;
        for(int t = 0; t < 5; t++){
            getline(cin, line);
            int cnt = 0, cur = 0;
            for(int i = 0; i < line.size(); i++){
                if(isalpha(line[i])){
                    cur++;
                } else {
                    if(cur >= 4) cnt++;
                    cur = 0;
                } 
            }
        
            cout << (cur >= 4 ? cnt + 1 : cnt) << '\n';
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.