代码搜索：Num

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

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

c 1854476_ce.c

#include #include #include using namespace std; const int M=130; struct node { char ch; int num; }a[15]; bool less(struct node a,struct node b) { return
·
www.eeworm.com/read/452050/7451770

cpp 3802842_ac_1469ms_7956k.cpp

#include #include #pragma comment(linker, "/STACK:16777216") int m, k; struct node { int num[100][100]; }b, a; node multi(node a, node b) { int i, j, l; node t
·
www.eeworm.com/read/452050/7451789

java 3541615_ac_438ms_4968k.java

import java.util.*; import java.io.*; public class Main { private Scanner in = new Scanner(System.in); public static void main(String [] args) { new Main().run(); } private void run
·
www.eeworm.com/read/452050/7451791

c 2040262_re.c

# include # include # include int B, L; int D, M; int maxlen; int flag[1000]; int mark[27]; char alph[27] = "ZYXWVUTSRQPONMLKJIHGFEDCBA"; int output[27]; st
·
www.eeworm.com/read/452050/7451792

c 2040266_wa.c

# include # include # include int B, L; int D, M; int maxlen; int flag[10000]; int mark[27]; char alph[27] = "ZYXWVUTSRQPONMLKJIHGFEDCBA"; int output[27]; s
·
www.eeworm.com/read/452050/7451793

c 2040302_tle.c

# include # include # include int B, L; int D, M; int maxlen; int flag[1000]; int mark[27]; char alph[27] = "ZYXWVUTSRQPONMLKJIHGFEDCBA"; int output[27]; st
·
www.eeworm.com/read/452050/7451794

c 2017840_tle.c

# include # include # include int B, L; int D, M; int mark[27]; char alph[27] = "ZYXWVUTSRQPONMLKJIHGFEDCBA"; int output[27]; struct node { char phase[11];
·
www.eeworm.com/read/452050/7451903

cc 3772613_tle.cc

#include #include #include #include #define INF 2100000000 using namespace std; struct node { int c, w, f; }net[410][410]; struct Node { int
·
www.eeworm.com/read/452050/7451905

cpp 3772615_tle.cpp

#include #include #include #include #define INF 2100000000 using namespace std; struct node { int c, w, f; }net[410][410]; struct Node { int
·
www.eeworm.com/read/452050/7451907

cc 3198002_re.cc

#include #include using namespace std; int num[101][2001]; int ans[100000], cnt; int m, n, t; int power(int a,int b) { if(b==1) return a; return a*power(a,b-1
·