Solution of 'Tom Riddle's Diary' (Codeforces)

 Hey everyone! Here's my solution of the question- Tom Riddle's Diary from Codeforces. If you guys have any suggestion do comment. T.Y. and Happy coding.

question link: https://codeforces.com/contest/855/problem/A

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    vector<string>v;
    int n;
    cin>>n;
    string a[n];
    for(int i=0;i<n;i++){
        string p;
        cin>>p;
        v.push_back(p);
        int h=count(v.begin(), v.end(),p);
        if(h==1) a[i]="NO";
        else a[i]="YES";
    }
    for(int j=0;j<n;j++) cout<<a[j]<<'\n';
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Solution of 'The Two Dishes' (Codechef)

Hey everyone! Here's my solution to the problem- 'The Two Dishes' from Codechef Starters 11. If you have any suggestions, feel free to comment :) Happy Coding! Question link: https://www.codechef.com/START11C/problems/MAX_DIFF #include   <bits/stdc++.h> #define   int  long long int using   namespace   std ; int32_t   main () {      int   t ;      cin >> t ;      while ( t --){          int   n , s , M = 0 ;          cin >> n >> s ;          for ( int   t1 = 0 ; t1 <= n ; t1 ++){              if ( s - t1 <= n && s - t1 >= 0 && abs ( 2 * t1 - s )> M ){                  M = abs ( 2 * t1 - s );}         }          cout << M << ' \n ' ;     }      return   0 ; }
Read more

Solution to the problem 'Red Light, Green Light' from Codechef

Question Link:  https://www.codechef.com/INFI21C/problems/DOLL #include <bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second #define pii pair < int,int > using namespace std ; int32_t main () {     ios_base :: sync_with_stdio ( false );     cin . tie ( NULL );     cout . tie ( NULL );     int t ;     cin >> t ;     while ( t --){         int n , k , ans = 0 ;         cin >> n >> k ;         for ( int i = 0 ; i < n ; i ++){             int x ;             cin >> x ;             if ( x > k ) ans ++;         }         cout << ans << ' \n ' ;     }     return 0 ; }
Read more