代码搜索：Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/452050/7449207

cc 2259326_ac_10226ms_828k.cc

#include #include using namespace std; long m, n, no; long num[100001], index[100001]; bool cmp(long i,long j) { return num[i]
·
www.eeworm.com/read/452050/7449273

cc 2981926_tle.cc

#include #include void divide(char tmp[], int n) { int l, i, t, s, mark; char q[10011]; l = strlen(tmp); i = t = 0; mark = 1; while(1&&mark) { while(t
·
www.eeworm.com/read/452050/7449274

cpp 2981920_tle.cpp

#include #include void divide(char tmp[], int n) { int l, i, t, s, mark; char q[10011]; l = strlen(tmp); i = t = 0; mark = 1; while(1&&mark) { while(t
·
www.eeworm.com/read/452050/7449337

cpp 2542120_ac_187ms_1264k.cpp

#include #include #include #include #include using namespace std; #define INF 1000000 char map[101][101]; int n, l, ans; int dis[101][101][
·
www.eeworm.com/read/452050/7449338

cpp 2503823_ac_0ms_140k.cpp

#include #include #include #include char w[13], x[13]; int num; int f(int p) { int i, j, no, t; for(i = p; x[i]!='\0'; i++) { if(x[i]!='?'
·
www.eeworm.com/read/452050/7449416

c 3038674_ac_187ms_2224k.c

#include #include #define max 200005 int n, m, now; int id[max], len, array[max], track[max], pos[max], order[max], num[max]; int find(int t) { int l, r, mid; if(
·
www.eeworm.com/read/452050/7449500

cpp 2803438_wa.cpp

#include #include #include #include int st, ed; short max; struct node { int num; short pos; short mov; short step; }; short mark[1000000][6
·
www.eeworm.com/read/452050/7449501

cpp 2803448_tle.cpp

#include #include #include #include int st, ed; short max; struct node { int num; short pos; short mov; short step; }; short mark[1000000][6
·
www.eeworm.com/read/452050/7449502

cpp 2803419_wa.cpp

#include #include #include #include int st, ed; int max; struct node { int num; int pos; int mov; int step; }; int mark[1000000][6]; node
·
www.eeworm.com/read/452050/7449503

cpp 2803422_mle.cpp

#include #include #include #include int st, ed; int max; struct node { int num; int pos; int mov; int step; }; int mark[1000000][6]; node
·