public static class Regxcheck {//Regular verification mobile phone number (Unicom, telecom, mobile phone number), does not include the landline number, as a member login (regular verification) WinForm
Based on several purposes1, battery is not good, mobile phone parts intact.2. Long-time navigation required3. No SIM card requiredTurn the obsolete phone into a portable navigation machine.Basic ideas:Disassemble the battery, obtain the circuit protection Board, reduce the voltage to 4.2v, the current 1 A, plus the capacitor to regulate the role of the switch, can do the battery (external) and external power supply synchronous use, external power is compatible with 18650 and on-board power, cons
The code is as follows:Copy code // Verify the mobile phone number$ Match = '/^ (13 [0-9]) | (15 [^ 4, \ d]) | (18 [0, 5-9]) [0-9] {8} $ /';// Verify the landline$ Match = '/^ (0 [0-9] {2, 3 }-)? ([2-9] [0-9] {6, 7}) + (-[0-9] {1, 4 })? $ /';// Verify the ID card number of 15 or 18 digits$ Match = '/(^ d {15} $) | (^ d {17} (d | X | x) $ )/';// Email verification$ Match = '/^ w + ([-+.] w +) * @ w + ([-.] w + )*. w + ([-
1, about the JavaScript form verification, if the use of bidirectional binding front-end JS frame, it will be much easier. But bloggers still suggest that you do not leave the source JS itself. Because the source of JS is the kingly way.Attention:A, error message in the code may not be found in the code, "error. jpg" IMAGE, make ab, the validation of the judgment has been completed, only need to be based on their own validation rules to form validation, replace their regular expression.C, the bl
Today, suddenly reminded of the Spring festival holiday back, has not called home, just for the second generation ID card must play a thing. I want to call, but I've run out of 20 minutes on my cell phone. If you want to play long-distance is more expensive, reluctant to spend money ah, poor Ah!
Thought for a moment, decided to call on the Internet, so I think of the original use of Skype, the feeling of good results. Turn Skype on, buy 30 minutes of cost, only need to spend 5 yuan yo. This 30-
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 10149
Accepted: 4275
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
Descriptionyou is given the pots, having the volume of A and B liters respectively. The following operations can be Performed:fill (i) FILL the pot I (1≤i≤2) fromThe tap;drop (i) empty the pot I to the drain; Pour (i,j) pour fromPot I to pot J; After ThisOperation either the pot J isFull (and there is some water leftinchThe pot i), or the pot I isempty (and all its contents has been moved to the pot J). Write a program to find the shortest possible se
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 9963
Accepted: 4179
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,j
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 12198
Accepted: 5147
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 11705
Accepted: 4956
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
Pots
Time limit:1000 ms
Memory limit:65536 K
Total submissions:9963
Accepted:4179
Special Judge
Description You are given two pots, having the volumeAAndBLiters respectively. The following operations can be saved med:
Fill (I) fill the potI(1 ≤I≤ 2) from the tap;
Drop (I) Empty the potITo the drain;
Pour (I, j)
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 10255
Accepted: 4333
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
Description
You are are given two pots, having the volume of A and B liters respectively. The following operations can be Performed:fill (i) FILL the pot I (1≤i≤2) from the tap; DROP (i) empty the pot I to the drain; Pour (i,j) pour from pot I to pot J; After this operation either the pot J are full (and there may to some water left in the pot I), or the pot I is empty (and All its contents have been moved to the pot J).
Write a program to find the s
POJ 3414 Pots, poj3414pots
Pots
Description
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed med:
1. FILL (I) fill the pot I (1 ≤ I ≤ 2) from the tap;
2. DROP (I) empty the pot I to the drain;
3. POUR (I, j) pour from pot I to pot j; after this operation either the pot j is full (and there may be
Pots
Time Limit: 1000 ms memory limit: 65536 k any questions? Click Here ^_^
You are given two pots, having the volume of A and B liters respectively. the following operations can be saved med: Fill (I) Fill the pot I (1 ≤ I ≤ 2) from the tap; drop (I) Empty the pot I to the drain; pour (I, j) pour from pot I to pot J; after this operation either the pot J is full (and there may be some water left in th
Description
You are given two pots, having the volumeAAndBLiters respectively. The following operations can be saved med:
Fill (I) fill the potI(1 ≤I≤ 2) from the tap;
Drop (I) Empty the potITo the drain;
Pour (I, j) pour from potITo potJ; After this operation either the potJIs full (and there may be some water left in the potI), Or the potIIs empty (and all its contents have been moved to the potJ).
Write a program to find the shortest possible
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 10071
Accepted: 4237
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 11703
Accepted: 4955
Special Judge
DescriptionYou are given the pots of the volume of A and B liters respectively. The following operations can be performed:
Fill (i) Fill the pot i (1≤ i ≤ 2) from the tap;
DROP (i) empty the pot I to the drain;
Pour (i,
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.