代码搜索:Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
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)
{
www.eeworm.com/read/452050/7450811
cpp 3067631_ac_655ms_160k.cpp
#include
#include
#include
__int64 num[1000];
__int64 cnt[1000];
__int64 mod;
__int64 power(__int64 p,__int64 n)
{
if (n==1)
{
return p%mod;
}
if
www.eeworm.com/read/452050/7450812
cpp 3067471_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/7450813
cpp 3067570_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/7450814
cpp 3067473_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/7450850
java 2780817_wa.java
import java.util.*;
public class Main {
static int num;
static int map[][] = new int [34*34][34*34];
static int b[] = new int [34*34];
static int link[] = new int [34*34];
public static
www.eeworm.com/read/452050/7450851
java 2780813_wa.java
import java.util.*;
public class Main {
static int num;
static int map[][] = new int [34*34][34*34];
static int b[] = new int [34*34];
static int link[] = new int [34*34];
public static
www.eeworm.com/read/452050/7450852
java 2780827_ac_4665ms_8100k.java
import java.util.*;
public class Main {
static int num;
static int map[][] = new int [34*34][34*34];
static int b[] = new int [34*34];
static int link[] = new int [34*34];
public static
www.eeworm.com/read/452050/7450939
cpp 2487159_ac_0ms_124k.cpp
#include
#include
struct node
{
int s, v;
}edge[100];
bool cmp(struct node a,struct node b)
{
return a.v