1536A - Omkar and Bad Story - CodeForces Solution

brute force constructive algorithms *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    x = int(input())
    y = list(map(int, input().split()))
    miny = min(y)
    maxy = max(y)
    f = 0
    for i in y:
        if i < 0:
            f+=1
            break
    if f:
        print("NO")
    else:
        print("YES")
        print("101")
        print(*[i for i in range(0, 101)])

C++ Code: 

#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main()
{
    lol t;
    cin >> t;
    while (t--)
    {
        lol n;
        cin >> n;
        lol a[n];
        bool f = true;
        for (lol i = 0; i < n; i++)
        {
            cin >> a[i];
            if (a[i] < 0)
                f = false;
        }
        if (f)
        {
            cout << "YES\n";
            cout << 101 << '\n';
            for (lol i = 0; i < 101; i++)
            {
                cout << i << " ";
            }
        }
        else
            cout << "NO\n";
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits