DMOJ · ccc98s1

CCC 1998 S1 Censor

This C++ solution uses string processing for CCC 1998 S1 Censor. Read the reasoning, inspect the code, or try your own test case below.

ccc98s1CCC 1998 S1Implementation & simulationString processingC++36 lines
Solution041of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Censor says to replace every four-letter word in N lines with four asterisks; the code matches the input and output exactly.

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

S_1_Censor.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int INF = 0x3f3f3f3f; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        cin.ignore();
        for (int t = 0; t < n; t++) {
            string s; getline(cin, s);
            vector<string> v;
            string a = "";
            for (int j = 0; j < s.size(); j++) {
                char c = s[j];
                if (c == ' ') {
                    v.push_back(a);
                    a = "";
                } else {
                    a += c;
                }
            }
            v.push_back(a);
            for (int i = 0; i < v.size(); i++) {
                string ss = v[i];
                if (ss.size() == 4) {
                    for(int j = 0; j < 4; j++) {
                        cout << "*";
                    }
                } else {
                    for (char c : ss) cout << c;
                }
                cout << (i == v.size() - 1 ? "\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.