代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/458498/7295333
cpp longgestundecreaselist.cpp
#include
using namespace std;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,i,n,*a,j,k,max;
int *num;
cin>>t;
i=0;
www.eeworm.com/read/458438/7296595
c longint .c
#include
#include
typedef struct Node{
int data ; /* 数据域 */
struct Node *prior; /* 前驱 */
struct Node *next ; /* 后继 */
}LNode, *LinkList;
v
www.eeworm.com/read/458298/7299543
txt 计数器.txt
// 1 2 3 + =
// 4 5 6 - ce
// 7 8 9 * on/off
// +/- 0 . /
//按键： 0 1 2 3 4 5 6 7 8 9
//对应值： 0
www.eeworm.com/read/457951/7315110
cpp 119 greedy gift.cpp
#include
#include
using namespace std;
int main()
{
int n;
string s1[15],s2[15],s3[15];
bool chk=false;
while(cin>>n)
{
if(chk) cout
www.eeworm.com/read/457948/7315116
cpp 382 perfection.cpp
#include
#include
using namespace std;
int main()
{
int num,test=1;
while(cin>>num)
{
if(test==1)
cout
www.eeworm.com/read/457946/7315150
cpp 412 pi.cpp
#include
#include
#include
using namespace std;
int gcd(int a,int b)
{
int x,z;
if(b==0)
return a;
x=a%b;
z=gcd(b,x);
return z;
}
i
www.eeworm.com/read/457902/7315609
c intconv.c
/* intconv.c -- some mismatched integer conversions */
#include
#define PAGES 336
#define WORDS 65618
int main(void)
{
short num = PAGES;
short mnum = -PAGES;
printf("n
www.eeworm.com/read/457902/7315782
c summing.c
/* summing.c -- sums integers entered interactively */
#include
int main(void)
{
long num;
long sum = 0L; /* initialize sum to zero */
int status;
printf("Ple
www.eeworm.com/read/457804/7317646
txt 分数.txt
struct frac{
int num,den;
};
double fabs(double x){
return x>0?x:-x;
}
int gcd(int a,int b){
int t;
if (a
www.eeworm.com/read/457804/7317649
txt 置换(polya).txt
//求置换的循环节,polya原理
//perm[0..n-1]为0..n-1的一个置换(排列)
//返回置换最小周期,num返回循环节个数
#define MAXN 1000
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int polya(int* perm,int n,int& num){
int i,j,p,v[M