代码搜索：Power
找到约 10,000 项符合「Power」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7450348
cc 2878414_tle.cc
#include
#include
#include
int n;
int m, k;
int matrix[11][11];
struct node
{
int mat[11][11];
};
int fai(int mm)
{
int i, nn;
nn = mm;
if(mm/2*2=
www.eeworm.com/read/452050/7450351
cc 2878459_tle.cc
#include
#include
#include
int n;
int m, k;
int matrix[11][11];
struct node
{
int mat[11][11];
};
int fai(int mm)
{
int i, nn;
nn = mm;
if(mm/2*2=
www.eeworm.com/read/452050/7450694
cpp 2247183_ac_2309ms_2860k.cpp
# include
int n, m;
typedef struct node
{
int matrix[31][31];
}Mat;
Mat M;
Mat add(Mat a,Mat b)
{
int i, j;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
a.matrix
www.eeworm.com/read/452050/7450695
cpp 2247010_ac_2403ms_2860k.cpp
//设f[n]=A^1+A^2+....A^n;
//当n是偶数,f[n]=f[n/2]+f[n/2]*A^(n/2);
//但n是奇数,f[n]=f[n-1]+A^(n);
# include
int n, m;
long k;
typedef struct node
{
int matrix[31][31];
}Mat;
Mat M;
M
www.eeworm.com/read/452050/7450696
cc 2247185_ac_1513ms_988k.cc
# include
int n, m;
typedef struct node
{
int matrix[31][31];
}Mat;
Mat M;
Mat add(Mat a,Mat b)
{
int i, j;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
a.matrix
www.eeworm.com/read/452050/7450697
c 2247184_ac_2247ms_1612k.c
# include
int n, m;
typedef struct node
{
int matrix[31][31];
}Mat;
Mat M;
Mat add(Mat a,Mat b)
{
int i, j;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
a.matrix
www.eeworm.com/read/452050/7450805
cpp 3067558_ole.cpp
#include
#include
#include
__int64 num[1000];
__int64 cnt[1000];
__int64 power(__int64 p,__int64 n)
{
if (n==1)
{
return p%9901;
}
if (n%2==0)
{
www.eeworm.com/read/452050/7450806
cpp 3067472_wa.cpp
#include
#include
#include
__int64 num[1000];
__int64 cnt[1000];
__int64 power(__int64 p,__int64 n)
{
if (n==1)
{
return p%9901;
}
if (n%2==0)
{
www.eeworm.com/read/452050/7450807
cpp 3067470_wa.cpp
#include
#include
#include
__int64 num[1000];
__int64 cnt[1000];
__int64 power(__int64 p,__int64 n)
{
if (n==1)
{
return p%9901;
}
if (n%2==0)
{
www.eeworm.com/read/452050/7450808
cpp 3067459_wa.cpp
#include
#include
#include
__int64 num[1000];
__int64 cnt[1000];
__int64 power(__int64 p,__int64 n)
{
if (n==1)
{
return p%9901;
}
if (n%2==0)
{