pseudo code tool

Public intsolvecareless () {Try{perceive (); Accuracy (); Punishment (); Focusingattention (); Check (); } Catch(Exception ex) {stringstrmsg=alerterrormsg (); Throw NewException (Strmsg+ex. Message+"Sorry, unknown error! "); } finally{Check (); }} voidperceive () {Carelessness is a mistake}voidaccuracy () {Accurate First}voidpunishment () {penalty}voidfocusingattention () {Focus}voidCheck () {must be checked}stringalerterrormsg (); { stringstrmsg=@"you are wrong!

; + } - //printf ("%d\n", k); + } A at ll Pow (ll X, ll y) -{//Fast Power seeking x^y -LL num =1; - while(y) - { - if(Y%2) innum = (num * x)%MoD; -x = (x * x)%MoD; toY/=2; + } - returnnum; the } * ll solve (ll X, ll y) $ {Panax Notoginseng LL num; -num = (Pow (x, y)-1); thenum = (num * POW (x1, mod-2)) %MoD; + return(num + MoD)%MoD; A } the + intMain () - { $LL t, N, m, L =0; $ IsPrime (); -scanf ("%lld", t); - while(T--) the { -scanf ("%lld

#include Random number Generation program code (pseudo-random

Insert Sort1insertion-SORT (A)2 forj←2To Length (A)3 DoKey←a[j]4? Insert A[j] into the sorted sequence a[1.. J-1]5i←j-16 whileI>0and a[i]>Key7 Doa[i+1]←a[i]8i←i-19a[i+1]←keyMerge sort1 MERGE (a,p,q,r)2n1←q-p+13n2←r-Q4Create Arrays L[1.. n1+1] and r[1.. n2+1]5 fori←1to N16 Dol[i]←a[p+i-1]7 forj←1To N28 Dor[j]←a[q+J]9l[n1+1]←∞Tenr[n2+1]←∞ Onei←1 Aj←1 - forK←p to R - Do ifl[i]R[j] the Then A[k]←l[i] -i←i+1 - ElseA[k]←r[j] -j←j+1 + -merge-SORT (

Make 1-5000 an array firstBubble Sort Method$arr =array (1,2,3,4,5,6,7,8,9.....5000);$total =count ($arr);for ($i =0; $i for ($j =0; $j If ($arr [$j]> $arr [$j +1]) {$tmp = $arr [$i];$arr [$j]= $arr [$j +1];$arr [$j +1]= $tmp;}}}Quick Sort Method$arr =array (1,2,3,4,5,6,8,9,......... 5000);$total =count ($arr);Function Quick ($arr) {$left =array ();$right =array ();If ($total Return $arr;}for ($i =1; $i If ($arr [0]> $arr [$i]) {$left []= $arr [$i];}else{$right []= $arr [$i];}}$left =quick ($lef

elements is the outermost parentheses within the number of comma-separatedGlistdepth: If the table is empty or the table's type is list but the table's sublist is empty, return1, if Tag=0,return0.Otherwise it is the general table, each take the tail, traverse once +1, Max DEP for Max, return max+1Glistempty: If the table does not exist or the table is a list type but sublist is empty,GetHead: If it is empty table, no table header, otherwise, request tablespace, copy tag, if atom, copy atom valu

The s set stores the vertex of the Minimum Spanning Tree. Lowcost [J]: minimum weight of J-> S set Closest [J]: adjacent vertex of J in s set T set: the shortest path for storing data. Struct Enode { Int weight; // Edge Weight Int U, V; // The associated 2 points }; Implementation points: 1. Find the minimum value in lowcost (J-> minimum weight of s set) 2. Select (J, closest [J]) [(v-S)-> the shortest edge of S] to join the set T 3. Add J to the set S. Modify lowcost an

, selection and loopingProgramming programs include order, selection and loopingif (make sure the weather is cold first after bathing days hot instead day after day until death)You can program it;if (Sick | | Cannot act | | Unexpected emergency, can skip the same day)You can develop to the designer;Three • program = algorithm + structureIf (Developer design algorithm, describe structure)program training;If (you are familiar with a language)The lower-level libraries of any language are similar,

Import.java. Avenue to Jane. *;Import.java. Yugong Yishan. *;public class Yugongyishan{={Project Organizer, team manager, programmer, technical Analyst};Communication method: Gather room and seek it;Project Objective: Biliping insurance, referring to the south of the HanyinTechnical solution: Knock on the stone to the soil, transported in the tail of the Bohai SeaTechnical personnel: Descendants of the San FuProject Manager: The Foolish publicif (Foolish Gong =die)Descendants to complete the tas

cold first after bathing days hot instead day after day until death)You can program it;if (Sick | | Cannot act | | Unexpected emergency, can skip the same day)You can develop to the designer;Three • program = algorithm + structureIf (Developer design algorithm, describe structure)program training;If (you are familiar with a language)The lower-level libraries of any language are similar, and the APIs are dependent on the operating system. A Yes, B basic also hasYou can master and start program

looping. No matter what kind of project, even a large project such as Yugong Yishan, when the project needs, and then determine the entire project workflow,It contains the necessary order, branching, and looping structures, all of which can be implemented by simple programming. The order, branching, and looping structures are the essence of the whole programming.Import.java. Boulevard to Jane *;Import.java. Yugong Yishan *;public class Yugongyishan//Defines a class named Yugongyishan{public sta

How to write your own pseudo-code program in PHP. Rt.. Just like some forums. Make your own rules, such as {URL}: On behalf of the link address {title}: for the title, there are some better examples or samples for reference. Thank you, everyone. ------Solution-------------------- The ones you're talking about are templates, regular replacements. ------Solution-------------------- You don't call it pse

Import.java. Avenue to Jane. *;Import.java. Yugong Yishan. *;public class Yugongyishan{={project organizer, Team manager, programmer, Technical analyst};Means of communication: gathering room and seeking itProject Objective: Biliping insurance, referring to the south of the HanyinTechnical Solution: knock on the stone to the soil, transported in the tail of the Bohai SeaTechnical personnel: descendants of the San FuProject Manager: the Foolish PublicIf (foolish Gong =die)Descendants to complete

/* Writing a program is actually a methodology. Help us see the world from another angle and see the nature of things.As early as 2000 years ago in the fable, the foolish public and the wise old man's question and answer has embodied the entire project realization procedure. */public class Move Mountain {string people;public static void Main (string[] args)while (mountain not flat){Digging mountains;if (I die)i = my son;}Yamadaira}/* For you can not learn to write the program problem * *Public c

/* Writing a program is actually a methodology. Help us see the world from another angle and see the nature of things.As early as 2000 years ago in the fable, the foolish public and the wise old man's question and answer has embodied the entire project realization procedure. */public class Move Mountain {string people;public static void Main (string[] args)while (mountain not flat){Digging mountains;if (I die)i = my son;}Yamadaira}/* For you can not learn to write the program problem * *Public c

/*"Though I die, there are sons, and sons and grandchildren, and grandchildren, and Sons and sons, and grandchildren, and children and descendants, and the infinite." And the mountain does not increase, why do not be unfair? “The "Yugong Yishan" of the —————— "Lezitan"*/The fine meaning of public class programmingpublic static void Main (String args[]) {int foolish male = 60;int mountain = 999999;Descendants of int = 0;if (Foolish {Foolish public + +;Descendants + +;Mountain--;}else {while (moun

1 Yugong Yishanpublic class yishan{public static void Main (String[]args) {while (mountain still){Buckle stone Ken Soil, Ji Hod transported in the tail of the Bohai Sea;If (a fool's death descendants exist)The Foolish male = the foolish male son;//There is a son of Fu Yan, son and born Sun, Sun and sonelse if (a foolish man dies no offspring)//Consider a situation without descendantsBreak}if (Yamadaira)System.out.println ("The mountain has been flat, referring to the south of Henan, up to Hany

public class Dadaozhijiandiyiduan{I. Yugong YishanQuestion: How to finish the mountainYugong Yishan is a projectIf (a Foolish man dies){There is a child to save Yan;while (mountain uneven){Son and Sun, Sun and son;Son to move Mountains;}}ElseYugong YishanTwo. Will the problem of writing programsProgramming programs include order, branching and loopingGet upwhile (Not dead){if (Sick | | Cannot act | | Unexpected emergency situation)Skip the day;Elseif (day cold){Wear clothes;Toiletries}Else{Toile

public class Dadaozhijiandiyizhang{I. Yugong YishanQuestion: How to finish the mountainYugong Yishan is a projectIf (a Foolish man dies){There is a child to save Yan;while (mountain uneven){Son and Sun, Sun and son;Son to move Mountains;}}ElseYugong YishanTwo. Will the problem of writing programsProgramming programs include order, branching and loopingGet upwhile (Not dead){if (Sick | | Cannot act | | Unexpected emergency situation)Skip the day;Elseif (day cold){Wear clothes;Toiletries}Else{Toil

Yu-Gong, in this famous person, condensed the project organizers, team managers, programmers, technical analysts and many other roles of excellent quality.The origin of the original demand "to punish the north of the plug, access to the move"The basic way of project communication "gathering room and seeking it"Project objectives "Biliping risk, referring to the south of the south, up to Hanyin"Technical solution "Knock on the Stone, Ji Hod in the tail of the Bohai Sea"Three technical staff and a