rdf bag

WinPcap grasping the bag principleWinPcap is a group capture library derived from the Berkeley Group Capture Library, which is The Windows operating platform implements interception filtering for the underlying package. WinPcap is an architecture of the BPF model and the LIBPCAP function library under the Windows Platform for Network packet capture and network state analysis, which is composed of a core packet filter driver, an underlying dynamic conn

Sometimes when you want to look at the development of the app to see the HTTP request and response is what, this need to grab the packet, this can get some unknown API, such as can also do some "bad" ...Tools Required: Fiddler2 Grab Bag (click to download) Android Phone One PC First, how to use Fiddler2After the download is complete, the installation process is not mapped.If you set the Fiddler agent:　　　　Click OK, here the agent is s

Made a small tool, integrated Google translation, but the translation of Chinese characters changed, TK value is also changing, for the Chinese character with the original TK will not, engaged a night, did not find the TK algorithm.Later found that the wrong TK can also translate, do not know why, first make use of it.JS code: Google Translate TK algorithm js code, call ZL ("kanji"), you can return to the available TK.varWL =function (a) {returnfunction () {returnA}}, XL=function (A, b) { for(va

;}DoublePolygonarea (pt* p,intN) {//Polygon Area Doubles=0; for(intI=1; i1; i++) S+ = Cross (p[i]-p[0],p[i+1]-p[0]); returns/2;}Const intN =2500+Ten; Pt P[n],ch[n];intN;intMain () {intT; scanf ("%d",T); while(t--) {scanf ("%d",N); intPc=0;Doubles1=0; Doublex,y,w,h,j; for(intI=0; i) {scanf ("%LF%LF%LF%LF%LF",x,y,w,h,K); Doubleang=-Torad (j); Pt o (x, y); P[PC++]= o + rotate (VEC (-w/2,-h/2), ANG); P[PC++]= o + rotate (VEC (w/2,-h/2), ANG); P[PC++]= o + rotate (VEC (-w/2, h/2), AN

Start Fiddler, open the Tools > Fiddler options in the menu bar, and Open the Fiddler Options dialog box.In the Fiddler Options dialog box, switch to the Connections tab, and then tick the check box after allow romote computers to connectTurn off settings and then open settings,If the service does not open properly, you can try to use a different port, the location of the port modification,A fiddler with a process ID of 6996 is listening on port 8888, indicating that the agent is already working

Up the network Settings dialog, and tick "show advanced Options". In the input box after "Agent", select "Manual", enter the IP address of the computer after "proxy server hostname", enter 8888 in the input box after "Proxy Server port", then click "Save" button. Then launch the browser in the Android device, visit Baidu's home page, in Fiddler can see the completed request and response data. 7How, is not very simple, if feel useful, please click to vote, Small series will continue

able to see the request is now listed in the list, similar to: The keyboard moves up and down, enter to view details, press the Tab key to toggle the top navigation bar, as shown, Tips: Input z can be emptied list, input f and re-enter ~u xxx can filter out the URL for xxx request, more matching rules input ? view Request interceptionThe above shows a general operation, and here is another powerful feature of mitmproxy that intercepts the modification of request and response.In

': ' text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8 ', nBSP; ' Accept-language ': ' zh-cn,zh;q=0.8,en-us;q=0.5,en;q=0.3 ', ' Accept-encoding ': ' gzip,deflate ', ' Referer ': ' Http://192.168.171.144:8080/Shop/admin/user/user_login.html ', ' Connection ': ' keep-alive ', ' upgrade-insecure-requests ': ' 1 ' }req=urllib2. Request (url,postdata,headers) response=urllib2.urlopen (req) the_page=response.read () printthe_page printresponse.codeprintlen (the_page) #函数调用 First login

Dfs+ PruningSome of the more powerful pruning, first of the value of the input order, if the minimum exceeds the limit, the direct output of 0, if the value of the largest limn add up no more than the limit, it also directly output the answer, the rest is the regular DFS.#include #include#include#includeusing namespacestd;Const intmaxn= -;intLimN;Long LongLIMV;intN;Long LongV[MAXN];Long Longans;voidDfsintNowintTotLong Longsum) { if(Sum>ans) ans=sum; if(now==n)return; if(tot+1GT;LIMN)return; i

bone is not wrong! Longchamp Briefcase is a great compassion for Longchamp lambskin. The water moon looked at him silently, and asked, with an expression of purpose? She would like to have a teacher from the sky, but she never believed that the sky will drop pies, even if the real fall will probably hit the dead!Water Moon soul and half squinting, gently pull the corners of the mouth, sound cool, can? Longchamp lambskin say, yes? The sound is somewhat elevated, with an uneasy anger, a fingertip

Airmon-ng Start Wlan0Airodump-ng-c 1--bssid xx:xx:xx:xx:xx-w mobi mon0-CThe parameter is to select the target channel. If the channel is targeted at an AP, do not add the name of the --bssid -w handshake package. Gets a handshake package that is generated in the current directory mobi-01.cap . You don't have to close the shell, but you open another shell. -the 0 parameter is the initiating Deauth attack. 10 is the number of times can be adjusted -A is the first shell in BSSID. The follo

;0)return 1; if(Mult (a,b,p[0])==0dis (b,p[0])-dis (a,p[0]) >eps)return 1; return 0;}intGraham () {inttop =2; Sort (P+1, p+n,cmp); stack[0] = p[0]; stack[1] = p[1]; stack[2] = p[2]; for(intI=3; i) { while(top>=1mult (p[i],stack[top],stack[top-1]) >=0) top--; stack[++top]=P[i]; } returntop;}intMain () {n=0; while(SCANF ("%d%d", p[n].x,p[n].y)! =EOF) {N++; //if (n==10) break; } //for (int i=0;i intk=0; for(intI=0; i) { if(p[i].yi; } Swap (p[0],p[k]); Doublesum=0

.--------------------------------------------------------------------------------------------------------Let's look at one more exampleJS Codefunction Outerfun (){var a = 0;alert (a);}var a=4;Outerfun ();alert (a);The result is 0,4. Because the VAR keyword is used inside a function to maintain the scope of a within outfun ().Then look at the following code:JS Codefunction Outerfun (){No VarA = 0;alert (a);}var a=4;Outerfun ();alert (a);The result is 0, 0 is really strange, why?A scope chain is a

+1]; CNT=0; for(intj=0; j){ if(line.a.x = = p[j].x line.a.y = = p[j].y)Continue;///Remove itself if(line.b.x = = p[j].x line.b.y = = p[j].y)Continue; if(Cross (line.a,line.b,p[j]) = =0) {CNT++; Break; } } if(cnt==0)return false; } return true;}intMain () {inttcase; scanf ("%d",tcase); while(tcase--) {scanf ("%d",N); for(intI=0; i) {scanf ("%d%d",p[i].x,p[i].y); } if(n6) {printf ("no\n");Continue; } BOOLAns =Graham (); if(ANS) printf ("ye

; return 0;}intGraham () {inttop=2;///stack top at 2, because the first two points of the convex hull are not changedSort (p+1, p+n,cmp); stack[0]=p[0];///pressure p0p1p2 into the stack sstack[1]=p[1]; stack[2]=p[2]; for(intI=3; i){ while(top>=1mult (p[i],stack[top],stack[top-1]) >=0){///with a better choice .top--; } stack[++top]=P[i]; } returntop;}intMain () {inttcase; scanf ("%d",tcase); while(tcase--) {scanf ("%d%d",n,m); for(intI=0; i) {scanf ("%LF%LF",p[i].x,p[i].y); }

DownloadGo to the official website to downloadHttp://www.telerik.com/fiddlerConfigure Fiddler1. Open Fiddler, tools-> Fiddler Options, HTTPS, select "Decrypt HTTPS Traffic",2, open Fiddler, tools-> Fiddler Options--Connections, select "Allow remote computers to connect" is allowed other machines to send Http/https request to Fiddler up.(Remember to restart Fiddler when you are finished configuring).Android Device Configuration1, open the Android Device "settings", "Wi-Fi", find the Connected net

(A-B) * (Ab));} /** Find convex hull, Graham algorithm * point number 0~n-1* return convex hull result Stack[0~top-1] is the number of the convex hull*/Const intMAXN =1010; Point LIST[MAXN];intStack[maxn],top;//Polar Order relative to list[0]BOOL_cmp (Point p1,point p2) {DoubleTMP = (p1-list[0]) ^ (p2-list[0]); if(SGN (TMP) >0) return true; Else if(SGN (tmp) = =0 sgn (Dist (p1,list[0])-Dist (p2,list[0])) 0) return true; Else return false;}voidGraham (intN) {Point p0; in

if not set Axisx.setmaxlabelchars (int count) This sentence, The x-axis is automatically adapted to the best possible number of data to display. 2.2 If set axisx.setmaxlabelchars (int count) This sentence, 33 data point test, 2.2.1 if Axisx.setmaxlabelchars (10); The inside of the 10 is greater than v.right= 7,7, the first x-axis display 7 data, and then scale the number of x-axis is guaranteed to be greater than 7 lessthan 2.2.2 if less than v.right= 7; Anyw

, i = (dir?1: (S-1)); Dir? (I 1: -1)) - if(MaxSize | |!zero (xmult (Temp[i-1], Temp[i], temp[(i +1)%S] ))) theconvex[n++] =Temp[i]; the Delete[]temp; the returnN;94 } the the intMain () the {98 intN; About DoubleD; - while(Cin >> N >>d)101 {102Memset (P,0,sizeof(P));103memset (Convex,0,sizeof(convex));104 DoubleDist =0.0; the for(inti =0; I )106 {107CIN >> p[i].x >>p[i].y;108 }109 //cout the intsize = Graham (n,

The "test instructions" gives the n points a convex packet."Analysis" to find convex template, here pay attention to the situation of n==2, did not notice WA a back!"AC Code"#include HDU 1392 Surround the Trees (convex bag)