cartoon network check

Topic Links:https://uva.onlinejudge.org/index.php?option=com_onlinejudgeItemid=8page=show_problemproblem= 4075Test instructionsThere are n nodes, beginning with a separate node, and now with I operation and e operation, I u v means U's father node is set to, distance is |u-v|. % 1000,e operation asks u to root distanceCode:#include #include #include #include #include #include #include using namespace STD;inteax1000010];intd[1000010];intFdintx) {if(fa[x]! =-1) {intRot = FD (fa[x]); D[X] + = d[

#提取IP地址和子网掩码 [[email protected]~]#ifconfigeth0|grep 'inet Addr'|awk-F'[ :]+' '{print $4 "/" $8}'192.168.16.110/255.255.255.0[[Email protected]~]# #查外网IP地址 [[email protected]~]# curl-s Ipecho.net/plain;Echo114.93.99.39#查外网ip地址是什么宽带114.93.99.39IP:114.93.99.39from: Shanghai Telecom [[email protected]~]##输出IP地址是绿色的, the subnet mask is red.[Email protected] wyb]#CatQ.SH #!/bin/baship=192.168.16.1netmask=255.255.255.0Green () {Echo-E"\033[32m$1\033[0m"}red () {Echo-E"\033[31m$1\033[0m"}CatEOF IP: ' Gr

, then you and V belong to a set } Else if(Pre[v] FA) Lowu=min (Lowu, pre[v]); } returnLowu;}intLcaintUintv) { intR =find (U); intL =Find (v); if(r = =l)returnret; if(Pre[u] >Pre[v]) Swap (U, v); while(Pre[u] Pre[v]) { if(Union (pa[v], v)) RET--; V=Pa[v]; } while(U! = V)//v after the previous while either U or the nearest public ancestor of U and v { if(Union (U, Pa[u]) ret--; U=Pa[u]; } returnret;}voidinit () {mem (Pre,0); Mem (PA,0); for(intI=0; ii

Copy Code code as follows: public class Commonutil { public static Boolean Hassdcard () { String status = Environment.getexternalstoragestate ();Return Status.equals (environment.media_mounted);} /*** Get maximum memory** @return*/public static long Getmaxmemory () { Return Runtime.getruntime (). MaxMemory ()/1024;} /*** Check the network** @param context* @return*/public static Boolean Che