代码搜索：Num

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

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

c 2056169_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p, *q; q = &map[0][0]; scanf("%d%d",&w,&h); while (w || h) {
·
www.eeworm.com/read/452050/7450426

c 2055655_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p; scanf("%d%d",&w,&h); while (w || h) { for (i=0;i
·
www.eeworm.com/read/452050/7450428

c 2055769_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p; scanf("%d%d",&w,&h); while (w || h) { for (i=0;i
·
www.eeworm.com/read/452050/7450429

c 2055642_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p; scanf("%d%d",&w,&h); while (w || h) { for (i=0;i
·
www.eeworm.com/read/452050/7450430

c 2056094_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p; scanf("%d%d",&w,&h); while (w || h) { memset(map,'\0',size
·
www.eeworm.com/read/452050/7450431

c 2055718_wa.c

#include #include int w,h; char map[21][21],*dui[400]; int main() { int i,m,n,num; char *p; scanf("%d%d",&w,&h); while (w || h) { for (i=0;i
·
www.eeworm.com/read/452050/7450782

cc 3367989_ac_125ms_348k.cc

#include #include using namespace std; int n, d, k; int num[1001][16]; int mark[16]; int ans; void solve() { int tmp (0); for (int i = 0; i < n; i++) { i
·
www.eeworm.com/read/452050/7450797

cpp 3128852_ac_125ms_692k.cpp

#include __int64 inf = 1000000000000000000; __int64 num[100000]; int n; __int64 min(__int64 a,__int64 b) { return a < b ? a : b; } int main() { int i, i2, i3, i5, i7; __i
·
www.eeworm.com/read/452050/7450805

cpp 3067558_ole.cpp

#include #include #include __int64 num[1000]; __int64 cnt[1000]; __int64 power(__int64 p,__int64 n) { if (n==1) { return p%9901; } if (n%2==0) {
·
www.eeworm.com/read/452050/7450806

cpp 3067472_wa.cpp

#include #include #include __int64 num[1000]; __int64 cnt[1000]; __int64 power(__int64 p,__int64 n) { if (n==1) { return p%9901; } if (n%2==0) {
·