phishing exercise

Exercise 1-13 Write a program that prints a histogram of the word length in the input.1#include 2 3 /*count digits, white space, others*/4 5 intMainintargcChar Const*argv[])6 {7 intC, I, J, Nwhite, nother;8 intndigit[Ten];9 TenNwhite = nother =0; One for(i =0; I Ten; ++i) { ANdigit[i] =0; - } - the while((c = GetChar ())! =EOF) { - if(c >='0' C '9') { -++ndigit[c-'0']; -}Else if(c = =' '|| c = ='\ n'|| c = ='\ t') { +++N

Exercise 7.7: Use these new functions to rewrite the transaction handlers in the 7.1.2 practice sessionSales.data.h#ifndefsales_data_h#definesales_data_h#include main.cpp#include "Sales_data.h" Intmain (INTNBSP;ARGC,CONSTNBSP;CHARNBSP;**ARGV) { sales_datatotal;if (Read (std::cin,total)) { Sales_datatrans; while (Read (Std::cin,trans)) { if (TOTAL.ISBN () ==TRANS.ISBN ()) { total=add (Total,trans); }else { nbsP;print (std::cout,total) This article i

Exercise 2:Enter a number from the keyboard to determine whether the number is primePrime number: Numbers that can be divisible only by 1 and themselvesThe original answer is:public class Testscanner {public static void Main (string[] args) {Scanner scan = new Scanner (system.in);System.out.println ("Please enter an integer:");int i = Scan.nextint ();for (int j = 2; J if (i% j = 0) {System.out.print (i + "not prime number");Return;//didn't know to use

Question B: Exercise 6-5 array element reverse time limit: 1 Sec memory limit: MBFlowers: 183 Resolution: 171Flowers Wreath [TK Bank] Title DescriptionStores the values in an integer array of length 10 in reverse order.For example: The original order is 1,2,3,4,5,6,7,8,9,0, the request is changed to 0,9,8,7,6,5,4,3,2,1InputEnter 10 integers separated by a space from the keyboard.The output outputs these 10 numbers in reverse order, one row fo

1. Comprehensive exercise: Draw one side of the flag, put the code with the run Publish blog to hand in the homework.The code is as follows:1 ImportTurtle2 3 defMygoto (x, y):4 turtle.up ()5 Turtle.goto (x, y)6 Turtle.down ()7 8 defDrow (x):9 Turtle.begin_fill ()Ten forIinchRange (5): One Turtle.forward (x) ATurtle.right (144) - Turtle.end_fill () - theTurtle.setup (600,400, 0,0) -Turtle.color ("Yellow") -Turtle.bgcolor ("Red") -Turtle.fillcolor

Tree structure Exercise--sequential traversal of ordered binary tree Time limit:1000ms Memory limit:65536k Topic description in the tree structure, there is a special two-fork tree called the sort binary tree, the intuitive understanding is--(1). Each node contains a key value (2). The key value of any node's Zuozi (if present) is less than the key value of that node (3). The key value of the right subtree (if present) of any one node

Exercise 3-6Enter cardinality B (2#include Summary: N>0 can be used as a condition for judgingExercise 3-7Enter cardinality B (2#include Algorithmic competition Getting Started classic exercise 3-5 3-6 binary conversion

2407:c language exercise integer conversion to string time limit:1 Sec Memory limit:128 MBsubmit:917 solved:416[Submit] [Status] [Web Board] DescriptionConverts an integer n to a string using recursion. For example, enter 483 and the string "483" should be output. The number of bits of n is indeterminate and can be an integer of any number of digits.InputNOutputThe corresponding stringSample Input483Sample Output4 8 3HINTThe main function is

This is the table used in the exercise:--1.select DNO from Dept where dname= ' mathematics Department 'Select Sno,sname from student where dno= (select DNO from dept where dname= ' Mathematics Department ');--2. Number of students who have elective coursesSELECT DISTINCT Sno from SC;--3. The number of students enrolled in the No. No. 01 course and results, the results of the search by grade in ascending order, the same results by the number of descend

Test Tool and test tool in "C/C ++ integrated exercise for engineers"Preface Date:When I stepped into central China, my postgraduate studies were about to take a year away, and my feet suddenly flew away. In the coming year, Alexander will be the task of work. The stupid bird must fly first, and the opportunity is always reserved for those who are prepared. Therefore, as a rookie programmer in the IT field, from now, start the learning overlord mode a

Exercise 2.1Exercise 2.2Interest rate float principal float payment doubleExercise 2.3/* Operations involving unsigned numbers */#include Exercise 2.5/* octal probe */#include Exercise 2.8Exercise 2.10Exercise 2.11Indicates whether the following statement is defined or declared (1) extern int ix=1024;//definition (2) int iy;//definition (3) extern int iz;//De

0. Origins"Learn Python the hard" Exercise 46 requires four Python package pip, distribute, Nose, Virtualenv, (original book author Special reminder: do not just D Onwload these packages and install them by hand. Instead See how other people recommend you install these packages and use them for your particular system.) to complete the exercise. 0.1 Learning GoalsStudy This example: 1) figure out what needs

Tags: red arrange mysq Isa create Ural date direct IKE --Multi-table connection --write a query to query employee name, department name, work place SelectEname,dname,loc fromemp,deptwhereEmp.deptno=Dept.deptno--Exercise 1 --1, write a query, display all employee name, department number, department name SelectEname,dept.deptno,dname fromemp,deptwhereEmp.deptno=Dept.deptno--2, write a query, show all work in Chicago and bonuses are not empty employees -

Requirement: replace DIV1 with DIV3: * method 3 in DIV: replace node * cloneNode (boolean) with a cloned copy to copy references to objects at the document level. * Boolean: Indicates whether to clone a subnode. The default value is false. * The specific process is to copy DIV3 and replace DIV1 with the copy. Javascript_9_DOM _ node exercise DOM _ node exercise DOM _ node

1. Define the application callback module. 2. Define the application resource description file. The resource description file name must be the same as the application name and be suffixed. app, such as bank. the app then places the resource description file in the path that erlang can search for. 3. start applicationapplication: start (bank ). compared with Exercise 1, appl 1. Define the application callback module. 2. Define the application resource

C programming language Exercise 1-16, c Programming 1-16 Exercise 1-16Modify the main program of the program that prints the longest text line to print the length of the input line of any length and print as much text as possible. The Code is as follows: # Include Personal Understanding: The main purpose of the exercise is to understand the '\ 0' after the valid

Java Tour (24)--i/o stream, character stream, filewriter,ioexception, file continuation, FileReader, small exercise The Java tour is also written more than 20, we finally reached the I/O today. If you beginner, do not understand the IO stream, you can look at slowly after the trip, but you work for a while you will find that the flow of the use of the scene and the technical point is very tough, we are bound to grasp this knowledge point, if

++;}for (i=1;iSystem.out.println (i+ "for Loop");}Do While loop [execute first, then judge---output 5 times]int j = 1;do{SYSTEM.OUT.PRINTLN ("I want to learn Java");j + +;}while (j Does while calculates an even number within 50 andint sum1 = 0;int num = 2;do{SUM1 + = num;num = num + 2;}while (NUMSystem.out.println ("The sum of even numbers within 50:" +SUM1);[Exercise: Additive Expressions]for (int a1=1,b1=5;a1System.out.println (a1+ "+" +b1+ "=" + (A

The SQL consolidation exercise used several knowledge points a few days ago. When I checked the crossapply operator in the help document of SQLServer2005, I found that I used a lot of knowledge, which is a classic example. Write it down here to consolidate the knowledge points of the past few days. Create a table 1 employee table (Employees): CREATETABLEEmplo The SQL consolidation exercise used a few knowle

This exercise includes a one-dimensional array (with a character array) related knowledge, it is recommended to learn one-dimensional array after doing the following exercises, if you can independently complete the following exercise 80%, prove that you have a relatively skilled grasp of the relevant grammar, you can go to the function and the pointer part, if not successfully completed, please refer to the