1642B - Power Walking - CodeForces Solution

greedy *900

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    a=int(input())
    l=list(map(int,input().split(' ')))
    b=len(set(l))
    for j in range(a):
        if j<b:
            print(b,end=" ")
        else:
            print(b+1,end=" ")
            b+=1

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int a, b, c, i, j, k, m, n, o, l, r, f = 0, cnt = 0, sum = 0, total = 0, mn = INT_MAX, mx = INT_MIN, sz, len, temp, pos, tc, x, y, z, arr[300010];
    vector<long long int> vrr;
    string s;

    cin>>tc;
    while(tc--)
    {
        cin>>n;
        set<int>st;
        for( i = 1; i <= n; i++ )
        {
            cin>>arr[i];
            st.insert(arr[i]);
        }
        a = st.size();

        for( i = 1; i<= n; i++ )
        {
            if( i <= a )
            {
                cout<< a << " ";
            }
            else cout<< i << " ";
        }

        cout<< endl;
    }



}


Comments

Submit
0 Comments
More Questions

528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable