Codeforces · 2208A

Bingo Candies

This C++ solution uses simulation for Codeforces 2208A Bingo Candies. Read the reasoning, inspect the code, or try your own test case below.

2208AData structuresSimulationC++35 lines
Solution031of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Bingo Candies matches the color-frequency feasibility test implemented by the code.

Data structures

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

A_Bingo_Candies.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);
        int t; cin >> t;
        while (t--) {
            int n; cin >> n;
            int mx = 0;
            int add = 2;
            for (int i = 0; i < n - 1; i++) {
                mx += add;
                add += 2;
            }
            //or just use mx = n * (n - 1)
            unordered_map<int, int> cnt;
            bool good = 1;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    int x; cin >> x;
                    cnt[x]++;
                    if (cnt[x] > mx) {
                        good = 0;
                    }
                }
            }
            if (good) cout << "YES" << '\n';
            else cout << "NO" << '\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.