V1.16 Win32 July 2012 - Ported to Win32 C++ - Allow multiple instances of libnids to coexist in the same process - Incorporate unofficial patch to track established TCP connections - Migration of calls to secure versions (i.e. strcpy to strcpy_s) - Compiles under Visual Studio 2010 with no warnings at W4 - Linux support well and truly broken, Linux specific code removed
標簽： libnids-Win32
上傳時間： 2016-07-30
上傳用戶：mxgg126
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*運動員*/ { char name[20]; int score; /*分數(shù)*/ int range; /**/ int item; /*項目*/ }ATH; typedef struct schoolstruct /*學校*/ { int count; /*編號*/ int serial; /**/ int menscore; /*男選手分數(shù)*/ int womenscore; /*女選手分數(shù)*/ int totalscore; /*總分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n輸入運動項目序號 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n這個項目已經(jīng)存在請選擇其他的數(shù)字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n項目不存在"); printf("\n請重新輸入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n輸入序號 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超過學校數(shù)目,請重新輸入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n繼續(xù)輸入運動項目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d號學校的結(jié)果成績:",pfirst->serial); printf("\n\n項目的數(shù)目\t學校的名字\t分數(shù)"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 進入下一頁"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n運動會結(jié)果:\n\n學校編號\t男運動員成績\t女運動員成績\t總分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建結(jié)束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已經(jīng)成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 運動會分數(shù)統(tǒng)計\n"); printf("輸入學校數(shù)目 (x>= 5):"); scanf("%d",&nsc); printf("輸入男選手的項目(x<=20):"); scanf("%d",&msp); printf("輸入女選手項目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
標簽： 源代碼
上傳時間： 2016-12-28
上傳用戶：150501
#include <iostream.h> #include <string.h> #include <iomanip.h> #include "Stud.h" Stud::Stud(){} char *Stud::getno() //獲取學號 { return no; } char *Stud::getname() //獲取姓名 { return name; } char *Stud::getsex() //獲取性別 { return sex; } char *Stud::getminzu() //獲取民族 { return minzu; } char *Stud::getaddress() //獲取出生地 { return address; } char *Stud::getbirth() //獲取出生年月 { return birth; } int Stud::gettag() //獲取姓名 { return tag; } void Stud::changeno(char n[]) //設置學號 { strcpy(no,n); } void Stud::changename(char na[]) //設置姓名 { strcpy(name,na); } void Stud::changesex(char s[]) //設置性別 { strcpy(sex,s); } void Stud::changeminzu(char m[]) //設置民族 { strcpy(minzu,m); } void Stud::changeaddress(char a[]) //設置出生地 { strcpy(address,a); } void Stud::changebirth(char b[]) //設置出生年月 { strcpy(birth,b); } void Stud::addstudent(char *rn,char *rna) //增加學生 { strcpy(no,rn); strcpy(name,rna); } void Stud::addstudent(char *rn,char *rna,char *rs,char *rm,char *ra,char *rb) //增加學生 { tag=0; strcpy(no,rn); strcpy(name,rna); strcpy(sex,rs); strcpy(minzu,rm); strcpy(address,ra); strcpy(birth,rb); } void Stud::delstud() //設置刪除標記 { tag=1; } void Stud::disp() //輸出學生信息 { cout<<setw(15)<<no<<setw(10)<<name<<setw(10)<<sex<<setw(10)<<minzu<<setw(10)<<address<<setw(10)<<birth<<endl; } void Stud::display() //輸出學生信息 { cout<<setw(15)<<no<<setw(10)<<name; }
標簽： 學生
上傳時間： 2016-12-29
上傳用戶：767483511
RealView Developer Suite v2.2 破解 (2009-12-11) 使用RealView Developer Suite v2.2，傳說中的RVDS 2.2，破解也有問題，經(jīng)過我琢磨。 破解步驟修改如下： 1）用generate產(chǎn)生license file （注意自己的系統(tǒng)時間 最好是真實的當前時間，如果時間比較舊的話，產(chǎn)生的license file 將不能注冊。license file 和系統(tǒng)時間、網(wǎng)卡物理地址、硬盤的序列號有關） 2）安裝軟件 3）license Wizard 選 Install Wizard ... 選擇license file 目錄 4）應用補丁注入工具Patch.exe給下邊列出的文件注入校驗和。文件目錄見下邊。 從這個論壇下載說明少了4個文件路徑，導致的結(jié)果就是無法啟動調(diào)試部分。 關于 no license check out 以上作完了就加載一個*.axf文件實驗吧，看看還有沒有no license check out ，這時你在看軟件注冊信息 Enjoy ;-) Install, apply our patch then generate license file with the keygen. ------------- the files need to be patched: %Install Path%\IDEs\CodeWarrior\CodeWarrior\5.6.1\1592\win_32-pentium\bin\Plugins\License\oemlicense.dll %Install Path%\IDEs\CodeWarrior\RVPlugins\1.0\86\win_32-pentium\oemlicense\oemlicense.dll %Install Path%\RDI\armsd\1.3.1\66\win_32-pentium\armsd.exe %Install Path%\RDI\AXD\1.3.1\98\win_32-pentium\axd.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\armasm.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\armcc.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\armcpp.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\armlink.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\fromelf.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\tcc.exe %Install Path%\RVCT\Programs\2.2\349\win_32-pentium\tcpp.exe %Install Path%\RVD\Core\1.8\734\win_32-pentium\bin\tvs.exe %Install Path%\RVD\Core\1.8\734\win_32-pentium\bin\xry100.dll
上傳時間： 2017-01-18
上傳用戶：zbxinu
Lithium–sulfur batteries are a promising energy-storage technology due to their relatively low cost and high theoretical energy density. However, one of their major technical problems is the shuttling of soluble polysulfides between electrodes, resulting in rapid capacity fading. Here, we present a metal–organic framework (MOF)-based battery separator to mitigate the shuttling problem. We show that the MOF-based separator acts as an ionic sieve in lithium–sulfur batteries, which selectively sieves Li+ ions while e ciently suppressing undesired polysulfides migrating to the anode side. When a sulfur-containing mesoporous carbon material (approximately 70 wt% sulfur content) is used as a cathode composite without elaborate synthesis or surface modification, a lithium–sulfur battery with a MOF-based separator exhibits a low capacity decay rate (0.019% per cycle over 1,500 cycles). Moreover, there is almost no capacity fading after the initial 100 cycles. Our approach demonstrates the potential for MOF-based materials as separators for energy-storage applications.
上傳時間： 2017-11-23
上傳用戶：653357637
網(wǎng)絡爬蟲 網(wǎng)絡爬蟲在CPP中爬行鏈接到你想要的深度。控制臺應用程序 Ubuntu 14.04 LTS上編譯的程序 用g+編譯器編譯 相依性 卷曲 Boost圖書館 用于編譯的命令 G+爬蟲.cpp-lcurl-lost_regex-o爬蟲 輸入 URL：您想要抓取示例“dirghbuch.com”的URL 鏈接數(shù)：要從爬行中提取的每頁鏈接數(shù) 深度：我們想爬多深，在哪里深度可以定義為樹的深度。 輸出量 crawler.txt 限制 鏈接數(shù)最多可達100。 Does not work for website which has blocked curl crawling for example google.com yahoo.com 由于缺乏并行性，所以速度很慢。 沒有完整URL的鏈接被追加到用戶在大容量中插入的URLwww.xyz.com有/conatct-us的網(wǎng)址將是www.xyz.com/contact-us 唯一的單詞也包含html標記。 可能的改進，但尚未落實 限制共享變量的使用 改進使其易于并行化 比卷曲更有效的爬行方式
標簽： 網(wǎng)絡爬蟲 編程
上傳時間： 2018-06-20
上傳用戶：1370893801
C#遠控源代碼 * TCP network stream (IPv4 & IPv6 support) * Fast network serialization (NetSerializer) * Compressed (QuickLZ) & Encrypted (AES-128) communication * Multi-Threaded * UPnP Support * No-Ip.com Support * Visit Website (hidden & visible) * Show Messagebox * Task Manager * File Manager * Startup Manager * Remote Desktop * Remote Webcam * Remote Shell * Download & Execute * Upload & Execute * System Information * Computer Commands (Restart, Shutdown, Standby) * Keylogger (Unicode Support) * Reverse Proxy (SOCKS5) * Password Recovery (Common Browsers and FTP Clients) * Registry Editor
標簽： QuasarRAT
上傳時間： 2019-04-21
上傳用戶：netangels
1. 日語假名及其發(fā)音一覽 平 片 羅 平 片 羅 平 片 羅 平 片 羅 平 片 羅 假 假 馬 假 假 馬 假 假 馬 假 假 馬 假 假 馬 音 音 音 音 音 ______________________________________________________________________________ あ ア a い イ i う ウ u え エ e お オ o か カ ka き キ ki く ク ku け ケ ke こ コ ko さ サ sa し シ si/shi す ス su せ セ se そ ソ so た タ ta ち チ chi つ ツ tsu て テ te と ト to な ナ na に ニ ni ぬ ヌ nu ね ネ ne の ノ no は ハ ha ひ ヒ hi ふ フ fu へ ヘ he ほ ホ ho ま マ ma み ミ mi む ム mu め メ me も モ mo や ヤ ya ゆ ユ yu よ ヨ yo ら ラ ra り リ ri る ル ru れ レ re ろ ロ ro わ ワ wa を ヲ o/wo ん ン n が ガ ga ぎ ギ gi ぐ グ gu げ ゲ ge ご ゴ go ざ ザ za じ ジ zi/ji ず ズ zu ぜ ゼ ze ぞ ゾ zo だ ダ da ぢ ヂ ji/di づ ヅ zu/du で デ de ど ド do ば バ ba び ビ bi ぶ ブ bu べ ベ be ぼ ボ bo ぱ パ pa ぴ ピ pi ぷ プ pu ぺ ペ pe ぽ ポ po きゃ キャ kya きゅ キュ kyu きょ キョ kyo しゃ シャ sya しゅ シュ syu しょ ショ syo ちゃ チャ cya ちゅ チュ cyu ちょ チョ cyo にゃ ニャ nya にゅ ニュ nyu にょ ニョ nyo ひゃ ヒャ hya ひゅ ヒュ hyu ひょ ヒョ hyo みゃ ミャ mya みゅ ミュ myu みょ ミョ myo りゃ リャ rya りゅ リュ ryu りょ リョ ryo ぎゃ ギャ gya ぎゅ ギュ gyu ぎょ ギョ gyo じゃ ジャ zya/ja じゅ ジュ yu/ju じょ ジョzyo/jo びゃ ビャ bya びゅ ビュ byu びょ ビョ byo ぴゃ ピャ pya ぴゅ ピュ pyu ぴょ ピョ pyo
標簽： 日語
上傳時間： 2019-07-19
上傳用戶：sxc1997
abed-meraim IEEE SIGNAL PROCESSING LETTERS, VOL. 7, NO. 3, MARCH 2000
標簽： orthonormal algorithm Fast PAST
上傳時間： 2020-04-29
上傳用戶：LacrimosaMozart
In the hit CBS crime show Person of Interest, which debuted in 2011, the two heroes—one a former Central Intelligence Agency agent and the other a billionaire technology genius—work together using the ubiquitous surveillance system in New York City to try to stop violent crime. It’s referred to by some as a science fiction cop show. But the use of advanced technology for crime analysis in almost every major police department in the United States may surpass what’s depicted on TV crime dramas such as Person of Interest. Real-time crime cen- ters (RTCCs) are a vital aspect of intelligent policing. Crime analysis is no longer the stuff of science fiction. It’s real.
標簽： Intelligence Analysis Crime
上傳時間： 2020-05-25
上傳用戶：shancjb
