Q1 Simple Array Sum: Input Format
Q1 Simple Array Sum: Input Format
Q1 Simple Array Sum: Input Format
9s=7ck#, [Code_number]
,[Name]
, [Address]
,[contact number]
,[identification card]
, [Sex]
, [Shirt_blue]
[Good]
, [Thirteen]
,[Breast]
, [Waist]
, [Caller's]
, [Waist_fitting]
, [Shirt_wife]
[Shlover_Labbai]
, [Capital]
, [Confidentiality]
, [Shout_pocket]
, [Front_picture]
, [Shirt]
, [Saeed_Pocket]
,[collar]
, [Ben]
, [Cuff]
6
1 2 3 4 10 11
Sample Output
31
Explanation
We print the sum of the array's elements, which is: .
Output Format
Print the number of candles Colleen blows out on a new line.
Sample Input 0
4
3 2 1 3
Sample Output 0
2
Explanation 0
We have one candle of height , one candle of height , and two candles of height . Colleen
only blows out the tallest candles, meaning the candles where . Because there are such
candles, we print on a new line.
Q3
We define super digit of an integer using the following rules:
If has only digit, then its super digit is .
Otherwise, the super digit of is equal to the super digit of the digit-sum of . Here, digit-
sum of a number is defined as the sum of its digits.
= super_digit(29)
= super_digit(2+9)
= super_digit(11)
= super_digit(1+1)
= super_digit(2)
= 2.
You are given two numbers and . You have to calculate the super digit of .
is created when number is concatenated times. That is, if and , then .
Input Format
The first line contains two space separated integers, and .
Constraints
Output Format
Output the super digit of , where is created as described above.
Sample Input 0
148 3
Sample Output 0
3
Explanation 0
Here and , so .
super_digit(P) = super_digit(148148148)
= super_digit(1+4+8+1+4+8+1+4+8)
= super_digit(39)
= super_digit(3+9)
= super_digit(12)
= super_digit(1+2)
= super_digit(3)
= 3.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace class_task
{
class Program
{ static void Main(String[] args)
{
}}}
https://projecteuler.net/show=all
https://www.w3resource.com/csharp-exercises/