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; /*分数*/ int range; /**/ int item; /*项目*/ }ATH; typedef struct schoolstruct /*学校*/ { int count; /*编号*/ int serial; /**/ int menscore; /*男选手分数*/ int womenscore; /*女选手分数*/ 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这个项目已经存在请选择其他的数字\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超过学校数目,请重新输入"); 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继续输入运动项目(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号学校的结果成绩:",pfirst->serial); printf("\n\n项目的数目\t学校的名字\t分数"); 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运动会结果:\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按任意建结束"); 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("文件已经成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 运动会分数统计\n"); printf("输入学校数目 (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，破解也有问题，经过我琢磨。 破解步骤修改如下： 1）用generate产生license file （注意自己的系统时间 最好是真实的当前时间，如果时间比较旧的话，产生的license file 将不能注册。license file 和系统时间、网卡物理地址、硬盘的序列号有关） 2）安装软件 3）license Wizard 选 Install Wizard ... 选择license file 目录 4）应用补丁注入工具Patch.exe给下边列出的文件注入校验和。文件目录见下边。 从这个论坛下载说明少了4个文件路径，导致的结果就是无法启动调试部分。 关于 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
网络爬虫 网络爬虫在CPP中爬行链接到你想要的深度。控制台应用程序 Ubuntu 14.04 LTS上编译的程序 用g+编译器编译 相依性 卷曲 Boost图书馆 用于编译的命令 G+爬虫.cpp-lcurl-lost_regex-o爬虫 输入 URL：您想要抓取示例“dirghbuch.com”的URL 链接数：要从爬行中提取的每页链接数 深度：我们想爬多深，在哪里深度可以定义为树的深度。 输出量 crawler.txt 限制 链接数最多可达100。 Does not work for website which has blocked curl crawling for example google.com yahoo.com 由于缺乏并行性，所以速度很慢。 没有完整URL的链接被追加到用户在大容量中插入的URLwww.xyz.com有/conatct-us的网址将是www.xyz.com/contact-us 唯一的单词也包含html标记。 可能的改进，但尚未落实 限制共享变量的使用 改进使其易于并行化 比卷曲更有效的爬行方式
上传时间： 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. 日语假名及其发音一览 平 片 罗 平 片 罗 平 片 罗 平 片 罗 平 片 罗 假 假 马 假 假 马 假 假 马 假 假 马 假 假 马 音 音 音 音 音 ______________________________________________________________________________ あ ア 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
