代码搜索:Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/388569/8600017
c 1094.c
#include
#define MAX 1000
int main()
{
int n,ca=0,cb,num,ans[MAX]={0};
while(scanf("%d",&n)==1)
{
for(cb=0;cb
www.eeworm.com/read/388569/8600037
cpp 1406 完数.cpp
/*
1406 完数
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
15 MS 344 KB 874 B
GUN C++
*/
#include
#include
using namespace std;
const int Max=100
www.eeworm.com/read/388569/8600041
cpp 1106 排序.cpp
/*
1106 排序
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 5120 K
GUN C++
*/
#include
#include
#include
using namespace std;
const int SMAX=100
www.eeworm.com/read/388569/8600096
cpp 1394 minimum inversion number.cpp
#include
using namespace std;
int num[5001];
int imin,n;
int main()
{
int i,j,t;
while( scanf("%d",&n)!=EOF )//输入的数字范围 0 ~ n-1
{
for(i=0;i
www.eeworm.com/read/388569/8600154
cpp 1216 assistance required.cpp
#include
using namespace std;
int luck[3100],len;
bool num[17501];
void cal()
{
int i,j,k,t;
luck[len++]=2;
for(j=1;j
www.eeworm.com/read/388569/8600161
cpp 1303 doubles.cpp
/*
1303 Doubles
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
GUN C++
*/
#include
using namespace std;
const int len=15;
int num[len],now;
bool Find(in
www.eeworm.com/read/388569/8600183
cpp 1280 前m大的数.cpp
#include
#include
using namespace std;
int num[3001];
int pplus[10001];
int main()
{
int i,j,n,m,max,t;
while( scanf("%d %d",&n,&m)!=EOF )
{
memset(pplus,0,sizeof
www.eeworm.com/read/388569/8600256
cpp 1412 {a} + {b}.cpp
/*
1412 {A} + {B}
Time Limit : 5000 ms Memory Limit : 32768 K Output Limit : 256 K
GUN C++
*/
#include
using namespace std;
const int nmMax=20000;
int num[nmMax]={0},temp[nm
www.eeworm.com/read/388569/8600290
c 1003n.c
/*
1003 Max Sum
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 1024 K
GUN C
input 4 -6 -8 0 -3
output 0 3 3
*/
#include
#include
#define T 20
#define N
www.eeworm.com/read/388569/8600334
c 2027.c
/*
2027 统计元音
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
GUN C
*/
#include
#include
char str[101];
int num[5];
int main( )
{
int n;
int i,len;