代码搜索：盒维数
找到约 10,000 项符合「盒维数」的源代码
代码结果 10,000
www.eeworm.com/read/327496/3455287
c 阿姆斯特朗数.c
#include
main()
{
int i,t,k,a[3];
printf("There are following Armstrong number smaller than 1000: \n");
for(i=152;i=10;t++)
{
a[t]=(i%k)/(k/1
www.eeworm.com/read/474440/6809437
c 阿姆斯特朗数.c
#include
main()
{
int i,t,k,a[3];
printf("There are following Armstrong number smaller than 1000: \n");
for(i=152;i=10;t++)
{
a[t]=(i%k)/(k/1
www.eeworm.com/read/394038/8250758
ppt 特殊的数.ppt
www.eeworm.com/read/270091/11048885
cpp 删数问题.cpp
#include
using namespace std;
const int Limit_Size = 100;
char num[ Limit_Size ];
int k, n;
void init( )
{
cin >> num >> k;
n = strlen( num );
}
void del(
www.eeworm.com/read/411858/11224044
dsn 摸数转换.dsn
www.eeworm.com/read/411858/11224066
pwi 摸数转换.pwi
www.eeworm.com/read/248263/12587221
txt 十数和.txt
10 rem calculate add of ten integers
20 input X
30 let n = n + 1
40 let t = t + X
50 if n == 10 goto 70
60 goto 20
70 print t , N
80 end
www.eeworm.com/read/248263/12587229
txt 两数相加.txt
10 rem determine and print the sum of two integers
15 REM
20 rem input the two integers
30 input a
40 input B
45 rem
50 rem add integers and store result in c
60 let c = a + b
65 rem
70 rem p
www.eeworm.com/read/334029/12647032
cpp 数独算法.cpp
#include
#include
#include
enum{SIZE=81};
unsigned int Data[SIZE]={//未解棋盘数据
0 , 9 , 0 , 0 , 6 , 0 , 5 , 4 , 8 ,
4 , 0 , 3 , 0 , 8 , 0 , 9 , 0 , 0 ,
8 , 6
www.eeworm.com/read/300587/13904084
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