代码搜索：Power
找到约 10,000 项符合「Power」的源代码
代码结果 10,000
www.eeworm.com/read/224759/14568443
m mypower.m
function y=mypower(x1,x2)
%MYPOWER Protected power function.
% MYPOWER(X1,X2) returns 0 if X1^X2 is NaN or Inf,
% or has imaginary part, otherwise returns X1^X2.
%
% Input arguments:
%
www.eeworm.com/read/224733/14570349
pin freq2.pin
-- Copyright (C) 1991-2006 Altera Corporation
-- Your use of Altera Corporation's design tools, logic functions
-- and other software and tools, and its AMPP partner logic
-- functions, and a
www.eeworm.com/read/224286/14598216
pin guangshanchi.pin
-- Copyright (C) 1991-2005 Altera Corporation
-- Your use of Altera Corporation's design tools, logic functions
-- and other software and tools, and its AMPP partner logic
-- functions,
www.eeworm.com/read/123234/14641840
cpp pnihe.cpp
#include
#include
#include
#include
void main()
{int i,m;
float *a;
coutm;
float x[100],y[100];
float power(int ,float);
float *colpi
www.eeworm.com/read/122316/14702598
c 90.c
# include "stdio.h"
main( )
{
int x, n ;
scanf("%d,%d",&x,&n);
printf("%d**%d=%d\n",x,n,power(x,n));
}
power( int x, int n)
{
int p
www.eeworm.com/read/122316/14702600
c 13.c
# include "stdio.h"
main( )
{
int x, n ;
scanf("%d,%d",&x,&n);
printf("%d**%d=%d\n",x,n,power(x,n));
}
power( int x, int n)
{
int p
www.eeworm.com/read/221812/14719651
h radixsort.h
#include "LinQueue.h"
void RadixSort(DataType a[], int n, int m, int d)
//对对象a[0]--a[n-1]进行关键码为m位d进制整型数值的基数排序
//桶采用链式队列结构
{
int i, j, k, power = 1;
LinQueue *tub = new LinQueue
www.eeworm.com/read/221812/14719658
cpp lradixsort.cpp
void RadixSort2(elemtype x[], int n, int m)
/*对记录x[0]--x[n-1]进行关键字为m位整型值的基数排序*/
/*桶结构为链式存储结构*/
{
int i,j,k,l,Power;
radixnode *p, *q;
radixtype Head[10];
Power=1;
/*进行m次排序*/
www.eeworm.com/read/221812/14719682
cpp radixsort.cpp
#include
#include "datatype.h"
#include "LinQueue.h"
void RadixSort(datatype a[], int n, int m, int d)
//对对象a[0]--a[n-1]进行关键码为m位d进制整型数值的基数排序
//桶采用链式队列结构
{
int i, j, k, l, power