DMOJ · ludipq
This C++ solution uses simulation for DMOJ ludipq Guess the Sequence. Read the reasoning, inspect the code, or try your own test case below.
Solve first
Read the official problem and plan your algorithm. Reveal the explanation and code when you are ready to compare.
Approach
Guess the Sequence has no input and accepts fifteen guesses in the documented value range; the code prints exactly fifteen guesses.
Problem and code
Written by benbenyaojifen. Try the problem first, then compare your approach with the code.
#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);
vector<int> s = {1,3,3,2,2,1,3,3,3,1,2,3,1,1,1};
for (int i = 0; i < 15; i++) {
cout << s[i] << endl;
}
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.
Test this problem
Paste your code, run a test case, compare the output, or trace selected values.
Python records executed lines and locals automatically. For selected values in any language, add // @trace i, total on its own valid line; Python uses # @trace i, total.
No run yet.
No diagnostics yet.
Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.