Codeforces 1196A A. Three Piles of Candies Solution

Solve in C++:


#include<bits/stdc++.h>
using namespace std;
int main()
{
  long long int t,i,a,b,c;
  cin>>t;
  for(i=1;i<=t;i++)
  {
      cin>>a>>b>>c;
      cout<<(a+b+c)/2<<endl;
  }
}

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.