代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/469371/6974421
cpp 2874425_wa.cpp
#include
#include
int main()
{
int n,f,i,best=0,sum=0;
scanf("%d %d",&n,&f);
int num[1000000];
for(i=0;i
www.eeworm.com/read/469371/6974422
cc 2874485_wa.cc
#include
using namespace std;
int main()
{
int n,f,i,best=0,sum=0;
scanf("%d %d",&n,&f);
int num[n];
for(i=0;i
www.eeworm.com/read/469371/6974424
cc 2874477_wa.cc
#include
using namespace std;
int main()
{
int n,f,i,best=0,sum=0;
scanf("%d %d",&n,&f);
int num[n];
for(i=0;i
www.eeworm.com/read/469371/6974426
cpp 2874424_ce.cpp
#include
#include
int main()
{
int n,f,i,best=0,sum=0;
scanf("%d %d",&n,&f);
int num[n];
for(i=0;i
www.eeworm.com/read/469371/6974428
cc 2874416_wa.cc
#include
using namespace std;
int main()
{
int n,f,i,best=0,sum=0;
scanf("%d %d",&n,&f);
int num[n];
for(i=0;i
www.eeworm.com/read/469371/6974430
cc 2974369_wa.cc
#include
using namespace std;
int num[20];
bool visit[20];
int n,t;
int cmp(const void *a, const void *b)
{
return *(int *)b - *(int *)a;
}
bool find(int left,int k,int value)
{
www.eeworm.com/read/469371/6974431
cc 2974655_wa.cc
#include
using namespace std;
int num[21];
bool visit[21];
int n,t;
int cmp(const void *a, const void *b)
{
return *(int *)b - *(int *)a;
}
bool find(int left,int k,int value,int s
www.eeworm.com/read/469089/6977265
cpp 死锁.cpp
#include
#include
#define N 5
#define M 3
#define TRUE 1
#define FALSE 0
int Max[N][M];
int Allocation[N][M];
int Need[N][M];
int Available[M];
int Request[M];
int
www.eeworm.com/read/469138/6978208
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/469138/6978211
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