Codeforces Round #772 (Div. 2) 1635B - Avoid Local Maximums Solution



 

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include<iostream>
using namespace std;
int main()
{
    long long int  test,num,sum,k,value;
    cin>>test;
    while(test--)
    {
        cin>>num;
        sum=0;
        for(k=1; k<=num; k++)
        {
            cin>>value;
            sum|=value;
        }
        cout<<sum<<endl;
    }
    return 0;
}

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.