代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7449912
c 3115177_ac_0ms_160k.c
#include
#include
int main()
{
int n, m, i, t, tn, fail;
int cnt[100], num[100], l;
while(scanf("%d%d",&n,&m)==2)
{
if(m==0)
{
printf("0 does not divide %d!
www.eeworm.com/read/452050/7449971
c 2396121_wa.c
#include
#include
int a[1000003], b[1000000];
int no;
int check(int num)
{
int i;
for(i = 5; i < num/4; i+=4)
if(num%i==0&&(num/i)%4==1)
return 1;
return 0;
}
www.eeworm.com/read/452050/7449972
c 2396457_ac_640ms_15876k.c
#include
#include
__int64 a[1000003], b[1000000];
int no;
__int64 c[1000003];
int check(int num)
{
int i;
for(i = 5; i < num/4; i+=4)
if(num%i==0&&(num/i)%4==1)
www.eeworm.com/read/452050/7449993
cpp 3061488_ac_0ms_156k.cpp
#include
#include
#include
char nn[257][10];
void solve(char num[])
{
int i;
for(i = strlen(num)-1; i >= 0; i--)
{
if(num[i]>' ')
{
num[i+1]
www.eeworm.com/read/452050/7449994
cpp 3060293_ac_0ms_156k.cpp
#include
#include
#include
char nn[257][10];
void solve(char num[])
{
int i;
for(i = strlen(num)-1; i >= 0; i--)
{
if(num[i]>' ')
{
num[i+1]
www.eeworm.com/read/452050/7449998
cpp 3191965_ac_0ms_268k.cpp
#include
#include
#include
#include
#include
#include
using namespace std;
int dp[1001][13];
int sum, n, num[13], Sum[13];
www.eeworm.com/read/452050/7449999
cpp 3191893_wa.cpp
#include
#include
#include
#include
#include
#include
using namespace std;
int dp[1001][13];
int sum, n, num[13], Sum[13];
www.eeworm.com/read/452050/7450000
cpp 3191861_wa.cpp
#include
#include
#include
#include
#include
using namespace std;
int dp[1001][13];
int sum, n, num[13], Sum[13];
bool cmp(int a,int
www.eeworm.com/read/452050/7450004
cpp 3094924_ole.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450008
cc 3094953_tle.cc
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{