Skip to main content

First and Last Digit | FLOW004

Problem

If Give an integer N . Write a program to obtain the sum of the first and last digits of this number.

Input Format

The first line contains an integer T, the total number of test cases. Then follow T lines, each line contains an integer N.

Output Format

For each test case, display the sum of first and last digits of N in a new line.

Constraints

  • 11000
  • 11000000

Sample 1:

Input
Output
3 
1234
124894
242323
5
5
5

Solution:

#include<bits/stdc++.h>

using namespace std;

int main()

{

   int t;

   cin>>t;

   while(t--)

   {

       int n;

       cin>>n;

       int rem = n%10;

       while(n>9)

       {

           n = n/10;

       }

       cout<<n+rem<<endl;

   }

return 0;

}

Comments

Popular posts from this blog

Sum of Digits | FLOW006

  Problem You're given an integer  N . Write a program to calculate the sum of all the digits of  N . Input Format The first line contains an integer  T , the total number of testcases. Then follow  T  lines, each line contains an integer  N . Output Format For each test case, calculate the sum of digits of  N , and display it in a new line. Constraints 1 ≤ � ≤ 1000 1 ≤ T ≤ 1000 1 ≤ � ≤ 1000000 1 ≤ N ≤ 1000000 Sample 1: Input Output 3 12345 31203 2123 15 9 8 Solution: #include <bits/stdc++.h> using namespace std; int main() {     int t;     cin>>t;     while(t--)     {         int n;         cin>>n;         int sum = 0;         while(n!=0)         {             int r = n%10;             sum+= r;           ...

Number Mirror | START01

  Problem Write a program that takes a number  N  as the input, and prints it to the output. Input Format The only line contains a single integer. Output Format Output the answer in a single line. Constraints 0 ≤ � ≤ 1 0 5 0 ≤ N ≤ 1 0 5 Sample 1: Input Output 123 123 Sample 2: Input Output 15 15 Solution: #include <iostream> using namespace std; int main() { // your code goes here int n; cin>>n; cout<<n; return 0; }

Valid Triangles | FLOW013

  Problem Write a program to check whether a triangle is valid or not, when the three angles of the triangle are the inputs. A triangle is valid if the sum of all the three angles is equal to 180 degrees. Input Format The first line contains an integer  T , the total number of testcases. Then  T  lines follow, each line contains three angles  A ,  B  and  C , of the triangle separated by space. Output Format For each test case, display 'YES' if the triangle is valid, and 'NO', if it is not, in a new line. Constraints 1  ≤   T   ≤  1000 1  ≤   A,B,C   ≤  180 Sample 1: Input Output 3 40 40 100 45 45 90 180 1 1 YES YES NO Solution: #include <iostream> using namespace std; int main() { // your code goes here int t; cin>>t; while(t--){     int a,b,c;     cin>>a>>b>>c;     if((a+b+c)==180)         cout<<"YES"; ...