最近經常有人問我爲什麽一打開IE開網站就報錯關閉
本人在重裝系統前也經常IE崩潰 DEP報錯
後來電腦就開始崩潰中馬勒= =
今天不小心看到的下篇報道。。。。
好吧 我應該打補丁的。。。。。。
感覺我在學校就很悲劇的說。。。。
昨天電腦完美黨掉
Ghost還原也開機不能
可能是Ghost文件也被改了= =
硬盤全格式化重新分區
重灌系統。。。。。。
晚上聼朋友說有人上我MHF號。。。
好吧 我承認早上肯定中馬了
但是我真的沒下和諧物阿= =ll
在學校電腦黨了不是一次兩次了
難道是大型局域網惹的禍〉？？？
——————————————————————————–
Time Limit: 1 Second Memory Limit: 32768 KB
——————————————————————————–
Cryptography deals with methods of secret communication that transform a message (the plaintext) into a disguised form (the ciphertext) so that no one seeing the ciphertext will be able to figure out the plaintext except the intended recipient. Transforming the plaintext to the ciphertext is encryption; transforming the ciphertext to the plaintext is decryption. Twisting is a simple encryption method that requires that the sender and recipient both agree on a secret key k, which is a positive integer.
The twisting method uses four arrays: plaintext and ciphertext are arrays of characters, and plaincode and ciphercode are arrays of integers. All arrays are of length n, where n is the length of the message to be encrypted. Arrays are origin zero, so the elements are numbered from 0 to n – 1. For this problem all messages will contain only lowercase letters, the period, and the underscore (representing a space).
——————————————————————————–
Time Limit: 1 Second Memory Limit: 32768 KB Special Judge
——————————————————————————–
In the movie “Die Hard 3”, Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly 4 gallons. This problem generalizes that puzzle.
You have two jugs, A and B, and an infinite supply of water. There are three types of actions that you can use: (1) you can fill a jug, (2) you can empty a jug, and (3) you can pour from one jug to the other. Pouring from one jug to the other stops when the first jug is empty or the second jug is full, whichever comes first. For example, if A has 5 gallons and B has 6 gallons and a capacity of 8, then pouring from A to B leaves B full and 3 gallons in A.
A problem is given by a triple (Ca,Cb,N), where Ca and Cb are the capacities of the jugs A and B, respectively, and N is the goal. A solution is a sequence of steps that leaves exactly N gallons in jug B. The possible steps are
fill A
fill B
empty A
empty B
pour A B
pour B A
success