captive login

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 15384 Accepted Submission (s): 6892Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He da

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 17732 Accepted Submission (s): 7940Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He dare

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 17653 Accepted Submission (s): 7902Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He dare

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 17256 Accepted Submission (s): 7734Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He dare

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 17379 Accepted Submission (s): 7795Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He da

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 16063 Accepted Submission (s): 7206Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He da

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 19908 Accepted Submission (s): 8865Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He dare

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 17443 Accepted Submission (s): 7816Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He da

Holding Bin-laden captive!Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 16548 Accepted Submission (s): 7436Problem descriptionwe all know this bin-laden is a notorious terrorist, and he have disappeared for a long time. But recently, it's reported that he hides in hang Zhou of china!"Oh, god! How terrible! ” Don ' t is so afraid, guys. Although he hides in a cave of the Hang Zhou, the He dar

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1085 Solution Report: There are three kinds of coins with nominal values: 1, 2, and 5. The numbers of these three coins are num_1, num_2, and num_5. Ask what is the minimum value of the money you cannot gather. DP, open an array like DP [I] [3], then DP [I] [0] indicates that DP [I] [0] is required for making I RMB, and DP [I] [1] is required, DP [I] [2] Five blocks, and then follow the recurrence, there are three ways to obtain I, t

yuan, to find the smallest number of ways to make up.Analysis:Since the mother function has not been studied, the general knowledge is used to solve it.1, when there is no one-dollar coin, it must be 1.2, when a dollar coin and two yuan coins can not form all the numbers between 1-4, then do not consider the five yuan of coins, this time the smallest number is a+2*b+1.3, when the first 2 cases are satisfied, the largest number of a+2*b+5*c within all the numbers will certainly be able to take,

Water, careful consideration can be.The code I write is neither the best nor the most versatile, but my own method.acm.hdu.edu.cn/showproblem.php?pid=10851#include 2#include 3 4 using namespacestd;5 6 intA, B, C;7 8 intGetans () {9 if(!a)return 1;Ten intHigh =2* B +A; One intLen =5*C; A for(inti = high +1; I 10000; i++){ - intL1 = (I-high +4) /5; - intL2 = I/5; the if(L1 Continue; - returni; - } - } + - intMain () { + while(~SCANF ("%d%d

HDU 1085 Holding Bin-Laden Captive! (Primary function) Question address Question:Here is a cnt1 one-dollar coin, cnt2 two-Yuan coin, and cnt3 five-Yuan coin. Analysis:Primary function, formula:(1 + x ^ 2 + x ^ 3 + ...... x ^ cnt1 )? (1 + x ^ 2 + x ^ 4 + x ^ 6 +... x ^ cnt2 )? (1 + x ^ 5 + x ^ 10 + x ^ 15 +... x ^ cnt5)Directly simulate it. Code: /** Author: illuz * File: 1085. cpp * Create Date: 2014-05-25 11:34:37 * Descripton: Generating Funct

]>>num[5]){ if(num[1]==0num[2]==0num[5]==0){ Break; } coutEndl; //print ();memset (NUM,0,sizeof(num)); }}#include #include#defineM 8005intVIS[M];//the number of tokens that can be combined;intMain () {intnum_1,num_2,num_5; while(true) {scanf (" %d%d%d",num_1,num_2,num_5); if(num_1 + num_2 + num_5 = =0) Break; memset (Vis,0,sizeof(VIS)); for(inti =0; I ) Vis[i]=1; for(intj =0; J 2; J + =2) { for(intK =0; K ) {vis[j+ K] =1; } } for(intj =0; J

// Give you a fixed number of three coins with a nominal value of 1, 2, and 5, and find the minimum amount of money that cannot be obtained. // g (x) = (1 + x +... + x ^ num1) (1 + x ^ 2 +... + x ^ 2num2) (1 + x ^ 5 +, + x ^ 5num3), // expand, the number of coefficients not 0 can be combined by coins. # Include HDU 1085 holding bin-Laden captive! (Primary function)

In our lives, automatic login for account is already very common, so use the filter to achieve this function. The main introduction of the user's automatic login and cancellation of automatic login, as well as the implementation of a day automatic login or n-day automatic login