DMOJ · valentines19j3

Valentine's Day '19 J3 - Love!

This C++ solution uses string processing for DMOJ valentines19j3 Valentine's Day '19 J3 - Love!. Read the reasoning, inspect the code, or try your own test case below.

valentines19j3MathString processingC++20 lines
Solution133of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Love task counts subsequences spelling love; the four-state count matches.

Math

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

J_3_Love.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        string s; cin >> s;
        ll l = 0, lo = 0, lov = 0, love = 0;
        for (int i = 0; i < s.size(); i++) {
            char c = s[i];
            if (c == 'l') l++;
            if (c == 'o') lo += l;
            if (c == 'v') lov += lo;
            if (c == 'e') love += lov;
        }
        cout << love << '\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.