代码搜索：ZJU

找到约 171 项符合「ZJU」的源代码

代码结果 171
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/139501/13153216

jpg zju.jpg

·
www.eeworm.com/read/282031/9123393

cpp zju1003.cpp

#include #include using namespace std; const int MAX = 100; bool UsedBalloon[MAX+1]; //first run CanFactor(1,b) bool CanFactor(int i, int b) { if (b == 1)
·
www.eeworm.com/read/281473/9154203

cpp zju1160.cpp

//: ZJU1160.CPP /* Biorhythms http://acm.zju.edu.cn/show_problem.php?pid=1160 -------------------------------------------------------------------------------- Time limit: 10 Seconds Memory limit
·
www.eeworm.com/read/406240/11446560

cpp zju1949.cpp

#include #include int a[100][100]; int findrow(int a[][100],int n) { int sum=0; int wrong=0,wrow; int i,j; for(i=1;i
·
www.eeworm.com/read/406240/11446567

cpp zju1021.cpp

#include int main() { int a[51]={0}; int output[51]={0}; int n; int i,j; char symbol; int num=0; scanf("%d",&n); while(n!=0) { fflush(stdin); scanf("%c",&symbol);
·
www.eeworm.com/read/406240/11446568

cpp zju1049.cpp

#include #include #define pai 3.1415926 int main() { int n; int i; float a,b; float area; int year; scanf("%d",&n); for(i=1;i
·
www.eeworm.com/read/406240/11446569

cpp zju1205.cpp

·
www.eeworm.com/read/406240/11446570

cpp zju1115.cpp

#include int root=0; void diroot(int n) { int i=0,j; long int k=n; long int sum=0; int a[20]={0}; while(k>=10) { a[i]=k%10; k=(k-a[i])/10; i++; } a[i]=k; for(j
·
www.eeworm.com/read/406240/11446571

cpp zju1067.cpp

#include int color[16][3]; int pow(int n,int m) { int i,k=1; for(i=1;i
·
www.eeworm.com/read/339551/12225999

cpp zju_2419.cpp

/* 凸包( Convex Hull ) 凸包是对平面是上的某个点集而言的，凸包是一个最小凸多边形，满足点集 中的所有点都在该凸多边形内（或在该多边形的边上）。 通常，我们采用Graham扫描法来求点集的凸包。首先，排序选出点集中最左下 角点（先取y坐标最小的点，若有多个再在其中取x坐标最小的点），设该点为p0； 然后，将其余的按以p0为中心的极角坐标逆时针排序，多于相同极角的点只保留 ...
·