csu utilities

1321: Cx and girlstime limit: 1 sec memory limit: 128 MB Submit: 432 solved: 124 [Submit] [Status] [web board] Description CX is to rush to class. In order not to be late, it is necessary to arrive at the classroom in the shortest path. At the same time, CX hopes to see more students on the way, the better. Now, the map is abstracted into an undirected graph. CX starts from, and the classroom is at, telling the number of school girls at each point and the length of each edge. Find the maximum

Windows7 Optimization Master has a number of utilities, WINDOWS7 optimization Master offers a lot of utilities, small and practical is often worth a use, such as Windows7 optimization master provided by the system one-click Restore, you can backup Windows one-click, one-click Restore Windows System, Memory Collation master, you can automatically release and defragment memory, enable your system to run faste

Munin installation and configuration can refer to the first article:[Linux Utilities] Installation and configuration of Linux monitoring tools Munin http://www.cnblogs.com/rond/p/3757804.htmlThe result of Munin is shown in HTML. So the result is very simple, just need to deploy a Web server. But if you need to look at the results, you need to configure them.This post is divided into 2 sections:1. Web server display monitoring results (nginx);2. Dynam

Utilities (c + +)--single case (Singleton) One of the core issues in the implementation of the simple version of the single class is that the new heap objects will not be released , which can create a risk of memory leaks . Class Singleton {public : //instance pointer static singleton* instance () { if (!_instance) is obtained by class name _instance = new Singleton; return _instance; } ~singleton ()

The function of this command-line program is to solve the C code under Linux, quickly create templates for. h and. c files, in order to standardize the code. The main purpose of implementing this program is that I want to familiarize myself with the writing of the command-line program and how to customize the man manual for the commands I write. This custom command is create, and the following is the implementation process: //create.c /**********************************************************

Article Introduction: 11 Utilities/Resources for better CSS3 development. A cascading style sheet is a style language that describes the expression semantics or the appearance and formatting of a document written in a markup language that can also be HTML or can be used in an XML document. CSS3 is divided into several separate files to become modules, each module also has different extension capabilities, in addition, different modules ha

MySQL Utilities provides a range of MySQL server and database management tools. Full support for MySQL5.1 and above versions, also compatible with MySQL5.0 versions, although some features are not supported. MySQL4.0 version is not supported.In the following sections, you will describe administrative tasks such as requirements, objectives, execution methods, specific scenarios, and descriptions, as well as specific permissions that are required.The fo

. This option can be used to verify that the correct transaction has been skipped.--VERBOSE,-V: Set the amount of information to display. Use this option multiple times to increase the amount of information. For example, = -v verbose, -vv = more verbose, -vvv = Debug. Verbose mode.5. mysqlbinlogpurge Tools. Used to clear the binary log.Clear all unused binary log files from the primary server, specifying the slave server to check:Mysqlbinlogpurge --master=root:[email protected]:3310 --slaves=ro

integers n, m, K (1 n, mK N rows, each with M characters, describing the game map. Which '. ' Represents a cell without a mine, ' * ' indicates a cell with a mine (if the mine is cleared, the lattice becomes a mine-free cell). Data ensure that the total number of mines does not exceed 200, (1, 1) and (N, M) The Manhattan distance of any one mine is greater than K.OutputFor each set of test data, one line is used to output an integer that indicates at least how many gold coins are needed to clea

CSU 1160 (hexadecimal problem), csu1160 hexadecimal ProblemCSU 1160Time Limit:1000 MSMemory Limit:131072KB64bit IO Format:% Lld % llu Description Converts a decimal integer to a hexadecimal value. The format starts with 0x and ranges from 10 to 10 ~ 15 uppercase letters ~ F. Input Each row has an integer x, 0 Output The eight-digit hexadecimal integer corresponding to the output of each row, including the leading 0. Sample Input 01023 Sample Output

CSU 1529 Equator DP Queue optimization DP Equator Time Limit:5000 MS Memory Limit:131072KB 64bit IO Format:% Lld % llu Submit Status Description Input Output Sample Input 3 3 1 2 3 8 4 5 -1 -1 1 -1 -1 5 2 -1 -1 Sample Output 6 14 0 /*************************************** * ******** Author: CKbossCreated Time: Tuesday, March 17, 2015 File Name: CSU1529.cpp *************************************** * *********/

through any insecure building C in the Network (where C is different from A and B).Inputthe input consists of a single test case. The first line contains three integers n, m, p where 1≤n≤1000 are the number of buildings, 0≤m≤100000 is the number of possible direct connections between a pair of buildings, and 0≤p≤n is the number of insecure buildings. The buildings is numbered from 1 to N. The second line contains p distinct integers between 1 and n (inclusive), which is the numbers of insecure

; *a=a*a%MoD; $n>>=1;Panax Notoginseng } - returnans; the } + A ll C (ll n,ll m) the { + return(F[n]*qpow (f[m],mod-2)%mod) *qpow (f[n-m],mod-2)%MoD; - } $ $ ll Calc () - { - return(a[1][1]*a[2][2]%mod-a[1][2]*a[2][1]%MOD+MOD)%MoD; the } - Wuyi intMain () the { - //freopen ("In.txt", "R", stdin); Wu init (); - while(~SCANF ("%d%d%d",a,b,c)) About { $ if((A+C) 1|| (a+b) 1|| (B+C) 1) {puts ("0");Continue;} -ll ans=0; - for(intI=0; i//enumerates the n

Impressions: Depth First has a deeper understanding, just beginning to write the idea of a little confusion, do not know how to write recursion, export also made a mistake, over and over the process of deep understanding.#include #include#includeusing namespacestd;inta[ +],b[ +],c[ +][ +],n,sum,tp=0, tp2=0;voidBFsintTpintl);intMain () {memset (A,0, +); //memset (b,-1,21); while(SCANF ("%d", n)! =EOF) { for(intI=0; i) for(intj=0; j) scanf ("%d",C[i][j]); BFS (0,1); printf ("%d\n", su

Test instructions: Give you 10W numbers, each number is a large number, the range is 1 to 10^30, and then ask you how many ways, each time you choose two number, two number and 2 powerThe following: 10 of 30 times is about 2 100 times, so first pre-processing 2 102 times, then each input a large number, enumeration 2 power to reduce it, and then go to map to find how many solutions, in fact, is a very simple idea, but I have been writing fried, mainly large number of templates is too poor, will

Test instructions: X attacks, Garrosh have y blood, z three blood slave master, and then the slave owner every one of the non-fatal damage will be regenerated a Slave Lord, on the field up to 7 slave owners, ask you the last to kill Garrosh the probability of how much?Problem: DP recursion, the key is how to design the state, the beginning did not think well, was the gold medal ye Hu a sentence with crooked to the shape of pressure, in fact, the state does not need any four-way pressure, in fact

;}BOOLImapintXintY) {if(x>=0x0AMP;AMP;Yreturn 1;return 0;}Const intn= -;intdir[4][2] = {0,-1,1,0,0,1, -1,0};intMp[n][n];CharS[n];intVis[n][n];intVis2[n*n]; vectorint>G[n*n];intDfsintUintP) {intX=getx (U);intY=gety (U); vis[x][y]++;intM=g[u].size (); for(intI=0; iintV=g[u][i];intXx=getx (v);intYy=gety (v);if(V!=p!vis[xx][yy]) DFS (V,U); }return 0;}intDFS1 (intUintP) {//printf ("%d\n", u); if(Vis2[u]) {return 1; } vis2[u]=1;intM=g[u].size (); for(intI=0; iintV=g[u][i];if(v!=p)if(DFS1 (V,u))retu

,mod;ll N;structmatrix{intA[MAXN][MAXN]; Matrix () {memset (A,0,sizeof(a));} Matrixoperator* (ConstMatrix p) {Matrix res; for(intI=0; i) { for(intj=0; j) { for(intk=0; k) {Res.a[i][j]+ = (a[i][k]*p.a[k][j]%MoD); } Res.a[i][j]%=MoD; } } returnRes; }}ans,Base; Matrix Quick_pow (MatrixBase, ll N) {Matrix res; for(intI=0; i) {Res.a[i][i]=1; } while(n) {if(n1) res=res*Base; Base=Base*Base; N>>=1; } returnRes;}voidInit_matrix () {

http://acm.csu.edu.cn/OnlineJudge/showsource.php?id=97234#include 　　CSU 1530:gold Rush (greedy)

strings of length 2*n, a, B, and then given a 2*n long string c,c string consisting of n strings in A, B, to determine whether a given two string can form C.Analysis:By test instructions, we can list 9 scenarios: Judging if a string in C is compliant with test instructions.Because one of the letters in A, B is up to N to form C, (when a string of a B is greater than n, it can only be taken out of N) in order to satisfy the conditions that make up the C string. A[i] A[i]