代码搜索：quick
找到约 3,674 项符合「quick」的源代码
代码结果 3,674
www.eeworm.com/read/112162/6150501
testoutput1
PCRE version 3.2 12-May-2000
/the quick brown fox/
the quick brown fox
0: the quick brown fox
The quick brown FOX
No match
What do you know about the quick brown fox?
0: the quick brown
www.eeworm.com/read/486654/6524062
cpp 1008.cpp
/* This Code is Submitted by wywcgs for Problem 1008 on 2006-02-09 at 19:10:46 */
#include
#include
const int MAX = 10240;
const int ELE[] = { 2, 4, 5, 8, 10 };
int main(
www.eeworm.com/read/481966/6633360
cpp 1008.cpp
/* This Code is Submitted by wywcgs for Problem 1008 on 2006-02-09 at 19:10:46 */
#include
#include
const int MAX = 10240;
const int ELE[] = { 2, 4, 5, 8, 10 };
int main(
www.eeworm.com/read/152752/12088581
c sort.c
int in[] = {10, 32, -1, 567, 3, 18, 1, -51, 789, 0};
main() {
int i;
sort(in, (sizeof in)/(sizeof in[0]));
for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {
putd(in[i]);
putchar('\n'
www.eeworm.com/read/128030/14318380
cpp sstrchng.cpp
//sstrchng.cpp
//changing parts of string objects
#include
#include
using namespace std;
int main()
{
string s1("Quick! Send for Count Graystone.");
string s2("L
www.eeworm.com/read/122349/14700114
readme
There are four different types of test to run, which are controlled by
the value of the QUICK macro in the makefile.
1) To run a comprehensive test of all algorithms and all datatypes
make test QU
www.eeworm.com/read/219695/14869802
readme
There are four different types of test to run, which are controlled by
the value of the QUICK macro in the makefile.
1) To run a comprehensive test of all algorithms and all datatypes
make test QU
www.eeworm.com/read/169190/5426574
testoutput1
PCRE version 3.9 02-Jan-2002
/the quick brown fox/
the quick brown fox
0: the quick brown fox
The quick brown FOX
No match
What do you know about the quick brown fox?
0: the quick brown
www.eeworm.com/read/166734/5473025
c sort.c
int in[] = {10, 32, -1, 567, 3, 18, 1, -51, 789, 0};
main() {
int i;
sort(in, (sizeof in)/(sizeof in[0]));
for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {
putd(in[i]);
putchar('\n'