computer voice program

When executing Rational Rose, if this error occurs, check whether the environment variables have the common address. If the environment variables are not directly matched, click OK. The configuration is as follows: D: \ Program Files \ rational \ common; my win7 directly uses the uppercase common path without the following information. Assume that some of them can be changed again according to the following information. The following information is fr

..12] of String;an array for the abbreviated name of the month, which is the string of the MMM identity that is displayed when using FormatDateTimelongmonthnames:array[1..12] of String;An array that is used to fully represent the name of the month, which is the mmmm identity string that is displayed when using FormatDateTimeshortdaynames:array[1..7] of String;An array that is used to indicate the name of the day of the week, which is the DDD identity string that is displayed when using FormatDat

(scanf ("%d", cass); cass;cass--)111 //for (scanf ("%d", cas), cass=1;cass the //while (~scanf ("%s", s))113 while(~SCANF ("%d",N)) the { theaans=0; thex=l=n+1, y=r=0;117 for(i=1; i"%d", A +i);118 for(i=1; i)119 { - if(!a[i])Continue;121 if(ABS (A[I]-I) >1) {Work1 (i); Break;}122 if(a[i]-i==1) X=min (x,i), y=Max (y,i);123 if(a[i]-i==-1) L=min (l,i), r=Max (y,i);124 } the if(iContinue;126 i

Contrast MoeTime limit:2000/1000 MS (java/others) Memory limit:32768/32768 K (java/others)Total submission (s): 0 Accepted Submission (s): 0Problem description has 2N individuals, each with an Moe mi (1They are required to be divided into n pairs, so that the sum of the contrast values is maximal.The meaning of the contrast value is as follows: if x and Y are a pair, they contribute | mx-my| point contrast value. The first line of input is a number T, which indicates the number of test instances

- #defineMAX 0x7f7f7f7f to #definePI 3.14159265358979323 + #defineN 100004 - using namespacestd; thetypedefLong LongLL; * intCas,cass; $ intN,m,lll,ans;Panax Notoginseng LL Aans; - LL E[n],sum[n],l[n],r[n]; the LL A; + CharS[n]; A intMain () the { + #ifndef Online_judge - //freopen ("1.txt", "R", stdin); $ //freopen ("2.txt", "w", stdout); $ #endif - inti,j,k; - LL x, y; the //for (scanf ("%d", cass); cass;cass--) - //for (scanf ("%d", cas), cass=1;cassWuyi //while (~scanf ("%s", s)) th

voidWorkintXintc[]) + { A inti; thec[0]=x/ .; + for(i=1; i .); i++) c[i]=c[0]+1; - for(I= (x .)+1;i .; i++) c[i]=c[0]; $ } $ intMain () - { - #ifndef Online_judge the //freopen ("1.txt", "R", stdin); - //freopen ("2.txt", "w", stdout);Wuyi #endif the inti,j,k; - Wu //for (scanf ("%d", cass); cass;cass--) - //for (scanf ("%d", cas), cass=1;cass About //while (~scanf ("%s", s+1)) $ while(~SCANF ("%d",N)) - { -scanf"%d",m); -aans=0; A Work (n,a); + Work (m,b); t

. Start with EIP pointing at 19 lines, EBP esp in 0 position (01234 on the right is set for convenient analysis) 2.PUSHL%ebp, the EBP value stack 3.movl%esp,%ebp, Assign ESP value to EBP 4.subl $4,%esp, move esp down one grid 5.movl $33, (%ESP), save 33 at the point where ESP refers to 6.call F, call the F function, and the EIP 24 press stack, at which point the EIP points to the F function 7.pushl%ebp, and the EBP value is stacked at this time 8. movl %esp,%ebp,将esp值赋给eb

If a * b% 2016 = = 0If a = 1, and a * b% 2016 = = 0Consider a = 2017.* B = (+ 1) * b% 2016 = = 0 must be establishedSo that means the b,2017 in 1 can be paired with the same.Same: 4033 * b = (+ + 1) * b% 2016 = = 0 must be establishedSo, I can enumerate [1,2016] in [1,2016], I * j% 2016 = = 0 of the logarithm, and then multiply on the corresponding [1,n] in the number of I, instead of the number is also counted, the substitution number is those equivalent number, 1------4033#include #include#inc

There will be a lot of DLLs in the Windows service, the problem may be that the correct steps are not followed in the correct steps: 1, stop Windows Service 2 in the Windows service interface, perform the uninstall of Windows Services Tool 3, replace the newly changed DLL 4, To start the Windows Services tool 5, start the service in the Windows service interfaceIf this still cannot be resolved, it is possible that other DLLs in the Windows service do not correspond to the version number of your

Test instructionsHave n jewels m box Jewel value a box value bEach jewel is placed in a box and costs ABS (A-B)The box can put jewels in infinity.Ask for the minimum costWater problemPre-treatment of each value of jewelry placed in the box O (n)Find the closest left box from left to right L find the closest right box from right to left RTake min#include #include#includestring>#include#include#includeusing namespacestd;Const intn=20005;intn,k,m;intL[n],r[n];intv[Ten*N],s[n];intMain () {inti,j; in

#include #include#include#includeusing namespacestd;Const intmaxn= -;Long Longx,k;Long LongBASEX[MAXN];Long LongBASEK[MAXN];intTOTX,TOTK;intMain () {intT; scanf ("%d",T); while(t--) {scanf ("%lld%lld",x,j); Totx=totk=0; memset (Basex,0,sizeofbasex); memset (Basek,0,sizeofBasek); while(X) {Basex[totx++]=x%2; X=x/2; } while(K) {BASEK[TOTK++]=k%2; K=k/2; } intnow=0; for(intI=0; i) { for(intJ=now;; J + +) { if(basex[j]==0) {Basex

#include #include#include#includestring>#includeusing namespacestd;intT;Chars[ -+Ten];Charr[ -+Ten];mapstring,int>m;structdan{Chars[ -+Ten]; intnum;} d[1000000+Ten];intsum;inttot;BOOLcmpConstDana,Constdanb) { if(A.num==b.num)returnstrcmp (A.S,B.S) 0; returnA.num>B.num;}//Turn lowercasevoidF () { for(intI=0; s[i];i++) if(s[i]>='A's[i]'Z') S[i]=s[i]-'A'+'a';}voidWork () {intlen=strlen (s); Tot=0; for(intI=0; i) { if(s[i]>='a's[i]'Z') r[tot++]=S[i]; Else{R[tot]=' /'; if(strlen

(classmate of H) 10 Right of the H (H right side of the classmate) InputInput has only one set of data. The first line is the number of students N (1Each name is either a no more than 3 English letters, or a question mark.At least one student's name is not a question mark. The next line is the number of queries Q (1OutputFor each of the inquiries. The output is termed. Note "Middle of X and Y" only have when the caller has two recent known students X and Y, and X is

Workaround:1, start-run--regedit.exe, open Registry Editor, delete the following two keys:HKEY_LOCAL_MACHINE\System\CurrentControlSet\Services\WinsockHkey_local_machine\system\currentcontrolset\services\winsock22, find C:\Windows\inf\nettcpip.inf file This file is a TCP/IP protocol file, remember this location, for a while useful;3, Control Panel, network and internet-> Network and Sharing Center, change adapter settings, right-click Local Area Connection, propertiesFirst select tcp/ipv6-> Insta

Original title Link: http://acm.hunnu.edu.cn/online/?action=problemtype=showid=11654courseid=0A large number of comparisons, decisive use of Java, but also pay attention to the details.Note: The comparison can not use equals, if used 0.0 and 0.00 is not equal, a bit like HDU2054, the problem has a detailed explanationhttp://blog.csdn.net/hurmishine/article/details/51382141AC Code:Import Java.math.bigdecimal;import Java.util.scanner;public class Main {public static void main (string[] args) {in

China south seven stars lottery betting website system program rental for sale [mobile phone version + computer version + APP], seven stars for sale You are welcome to consult the Hainan seven-star lottery system. The system can support mobile phone betting in southern Hainan and Zhanjiang seven-star lottery website systems. You can also rent, sell, and other channels, or customize them, you can choose to

Notebook: Surface Pro3 operating system: WIN10 virtual machine tool: VMware Workstation Pro 12.5.0 build-4352439problem Description: insert a USB stick or phone data cable, the system in the virtual machine will die. Because Sophie 3 has only one USB port, I used the Surface Pro4 docking station, and the virtual machine system was placed on the external Samsung SSD.December 6, 2016 troubleshooting:1, I first suspect that the problem is caused by the docking station, so I put the virtual machine

Looking for prime factorsRequires the Smallest-divisor process in the book to find the minimum factor of 199, 1999, 19999.Scheme Code:Main process:Define the process of finding prime numbers4 , greater than the test value, then it must be a prime number can and 2 Divisible, then not prime, the minimum factor is 2 If not, go back to the process Find-div, and then try to divide it with 2+1, loop #lang Racket (define (square x) (*x x)); Definition filter (define (smallest-Div N) (Fin

The function of an ordered pair is to store two values and then provide again as neededPAIR = x {-y {-f {f[x][y]}}}left = p {p[-x{, y {x}}]}right = p {p[-x{y {y}}]}When I read the first time, I did not understand these lines of Ruby code, and I wrote a JavaScriptPAIR = function (x) {return function (Y) {return function (f) {return F (x) (Y)}}}left = function (p) {return P (function (x) {return function (y) {return x}})}right = function (p) {return P (function (x) {return function (y) {return y}}

each Tianma, and the number of I indicates the height of the Pegasus. The n number is separated from each other by a space.The third row has n positive real numbers, each representing the height of each day, and the number of I for the first day. The n number is separated from each other by a space.There is only one row in the output output file Horse.out, and the line has only a positive integer, which is the longest queue length that meets the criteria. According to the height of the horse, i