ada programming language tutorial

The title describes the print out of all "daffodils", the so-called "Narcissus number" refers to a three-digit number, the number of its members of the cubic and equal to that of itself. For example: 153 is a narcissus number, because 153=1^3+5^3+3^3. Output:Input no output All narcissus number, from small start. One per line1#include 2 3 intMainintargcChar Const*argv[])4 {5 inti;6 for(i = -; I +; i++)7 {8 intGE = i%Ten;9 intBai = I/ -;Ten intShi = (I/Ten) %

Title Description Enter a line of characters, respectively, the number of letters, numbers, spaces and other characters. Input line character output statistic sample inputaklsjflj123 sadf918u324 asdf91u32oasdf/. '; 123Sample output23 16 2 41#include"stdio.h"2 3 intMainintargcChar Const*argv[])4 {5 Chars[Bayi];6 intI, Char_count =0, Num_count =0, Space_count =0, Other_count =0;7 //scanf ("%s", s);8 gets (s);9 Ten for(i =0; S[i]! =' /'; i++) One { A if(S[i] >='A' S[i]

The title description writes a function, entering a four-digit number, which requires the output of these four numeric characters, but spaces between each of the two digits. If you enter 1990, you should output "1 9 9 0". Enter a four-digit output to increase the space output sample input1990Sample output1#include 2 3 voidFuncintN)4 {5 intGE = nTen;6 intQian = n/ +;7 intBai = (N-qian * +) / -; 8 intShi = (N-qian * +-Bai * -) /Ten; 9 Tenprintf"%d %d%d%d\n", Qian, Bai, Shi, ge); On

1026:c Language Programming Tutorial (third Edition) After class exercise 7.4 The topic describes an array of 9 elements that have already been sorted, and entering a number now requires that it be inserted into the array in the same order as it was originally ordered. Enter the first line, the original sequence. The second line, the number that needs to be inser

software development clearly and intuitively, clarify the specific tasks that need to be completed in each stage, and play a guiding and normative role in the development process. Software Development Methodology Programming style documentation; Have a clear name for the identifier; appropriate procedural notes; The procedural writing style of Liang-ha; The form of indentation; A clear statement s

Apple Swift programming language Introductory Tutorial "Chinese version"Directory1 Introduction2 Getting Started with Swift3 Simple values4 Control Flow5 Functions and closures6 Objects and classes7 Enumerations and structsNext: Apple Swift programming language Introductory

Problem DescriptionWowapps most like to learn English, English class never skip class, but English has not been learned, because the class has been sleeping. Why do you sleep, because he thinks the English word is too long. Now Wowapps has a long, long, long word and wants to compress it. Can you help him?Compression: Replaces consecutive repeating letters with one, see sample for details.InputEnter an n first to indicate the number of words Wowapps give (1Next n lines, each behavior of a string

Problem DescriptionTomorrow will be the English exam, Wowapps is Midnight Oil recite the words. Wowapps found the word difficult to recite, the back one forget. After careful study, Wowapps found that the reason why the word is difficult to recite is because of the appearance of a character, destroying the beauty of the whole word, resulting in poor memory. Wowapps decided to destroy these discordant characters on behalf of the Moon!! (Applause!!) But the exam has entered the countdown, and Wowa

Problem DescriptionEnter an unsigned short integer k[hex.] and P[oct.], the high byte of K as the low byte of the result, and the high byte of p as the result of the high byte to form a new integer.InputK[hex.] and P[oct.]OutputThe operation gets the new integer n.Sample Input0XD9 01117Sample Output200HINTOutput is 16 binary1#include 2 intMain ()3 {4 5 intk,p;6 while(SCANF ("%x%o", k,p)! =EOF)7 {8 intNewint = (p0xff00)| (k0xff00) >>8;9printf"%x\n", newint);Ten }

Problem Descriptionthis day the teacher as a routine to small Hao out a topic: The teacher to small Hao a string, let small Hao will the string in reverse order output. InputThe first line includes a T, which indicates how many sets of test data are:Next T line, each line includes a string (length not exceeding 65535).OutputFor each test data output it's reverse string.Sample Input1oaHoaiX EvoL ISample OutputI Love Xiaohao1#include 2#include string.h>3 intMain ()4 {5 intL,i,n;6 Chara[655

The title description writes two functions, each for two integers greatest common divisor and least common multiple, calls these two functions with the main function, and outputs the result two integers by the keyboard input. Input two-digit output greatest common divisor least common multiple sample input6 15Sample output3 30Hint Sourceint main(){int a,m,n,cun,bei;scanf("%d %d",m,n);a=m*n;if(mwhile(n!=0){cun=m%n;m=n;n=cun;}bei=a/m;printf("%d %d",m,bei);return 0;}1028:c

Problem DescriptionEnter an octal string, convert it to an equivalent decimal string, and output it in the PRINGF%s format.InputFirst, a positive integer t is entered, indicating that there is a T set of test data (1Next T line, one string per line, representing an octal integer (this integer is no more than 20 bits).OutputFor each test data, output the corresponding decimal string. One line per string.Sample Input11732Sample Output986HINTNote: The given octal number may be large, with a long lo