Cefalo CodeFiesta 2022 AUST Inter University Programming Contest G Solution



 Problem   Creative Kindergarten    Link:  https://drive.google.com/file/d/1iuwkvSfzfyeIjmh_FN9alTTkCd-RaWgC/view

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t,n;
    cin>>t;
      int ct=0;
    while(t--)
    {
        ct++;

        cin>>n;
        map<int,int>mp;
        mp[2]=1,mp[3]=1,mp[5]=1,mp[7]=1,mp[11]=1,mp[13]=1,mp[17]=1,mp[19]=1;
                int a,f=0;
        for(int i=0;i<n;i++)
        {
            cin>>a;
            if(mp[a]==0) f++;
        }

        if(f>0)  printf("Case %d: No\n",ct);
        else  printf("Case %d: Yes\n",ct);
    }
}








No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.