Help me in solving CS2023_STK problem

help
,
1

My issue

My code

#include <iostream>
using namespace std;

int main() {
    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;
        int om[n];
        int addy[n];
        int omstreak = 0, addystreak = 0;

        for (int i = 0; i < n; i++) {
            cin >> om[i];
        }

        for (int i = 0; i < n; i++) {
            cin >> addy[i];
        }

        for (int i = 0; i < n; i++) {
            if (om[i] > 0) {
                omstreak++;
            } else {
                omstreak = 0;
            }

            if (addy[i] > 0) {
                addystreak++;
            } else {
                addystreak = 0;
            }
        }

        if (omstreak > addystreak) {
            cout << "Om\n";
        } else if (omstreak < addystreak) {
            cout << "Addy\n";
        } else {
            cout << "Draw\n";
        }
    }

    return 0;
}

Problem Link: CS2023_STK Problem - CodeChef

2

@parabraviraj14
u have to track the length of max consecutive nonzero numbers as well

3

I got it bro Thnaks though