代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7450022
cpp 3094938_tle.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/7450071
java 3206465_tle.java
import java.util.*;
import java.math.*;
public class Main
{
int n, k;
int [] num;
String [] str;
String [] al;
BigInteger tot;
public static void main(String [] args)
{
new Mai
www.eeworm.com/read/452050/7450072
java 3206585_tle.java
import java.util.*;
import java.math.*;
public class Main
{
int n, k;
int [] num;
String [] str;
String [] al;
public static void main(String [] args)
{
new Main().run();
}
www.eeworm.com/read/452050/7450073
cc 3206826_ac_172ms_4768k.cc
#include
#include
#include
int n, k;
int num[100001];
char *str[100001], al[100001][26];
void add(int a[],int b[], int c[])
{
int carry;
carry = 0;
f
www.eeworm.com/read/452050/7450074
java 3206232_mle.java
import java.util.*;
import java.math.*;
public class Main
{
int n, k;
int [] num;
String [] str;
String [] al;
BigInteger tot;
BigInteger [] pro;
public static void main(String []
www.eeworm.com/read/452050/7450075
java 3206633_tle.java
import java.util.*;
import java.io.*;
public class Main
{
int n, k;
int [] num;
String [] str;
String [] al;
public static void main(String [] args) throws IOException
{
new Main
www.eeworm.com/read/452050/7450111
c 1950371_ac_0ms_80k.c
# include
int main()
{
int i, n, j, k, num;
int bincode[3001], next[3001];
scanf("%d",&n);
num = 0;
for(i = 0; i < n; i++)
{
scanf("%d",&bincode[i]);
if(!bincode[i])
www.eeworm.com/read/452050/7450237
c 2241695_ac_531ms_5900k.c
# include
# include
# include
char ch, tmp[1000001], str[1000001];
long next[1000001], num[28], sum[28];
void input()
{
int t;
long i, j, no, tt;
s
www.eeworm.com/read/452050/7450238
cc 2241422_ac_296ms_5916k.cc
# include
# include
# include
char ch, tmp[1000001], str[1000001];
long next[1000001], num[28], sum[28];
void input()
{
int t;
long i, j, no, tt;
s
www.eeworm.com/read/452050/7450241
cpp 2846959_wa.cpp
#include
#include
#include
int a[181];
int n;
int mark[181];
int main()
{
int i, t, num, tot, ans, inf;
int ta, tmp1, tmp2, tmp3;
while(scanf("%d",&n