E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
LLN
RPL协议介绍
低功耗及有损网络(
LLN
)是一类内部链接和路由器都受限的网络,该网络下的路由器的处理器功能、内存及系统功耗(电池供电)都可能受到较大的限制,而里面的网络连接也具有高丢包率、低数据传输率及不稳定的特性。
·
2015-11-11 11:30
介绍
coderforce 545D Queue
include #include #include usingnamespacestd; #defineLLlonglong constLLmaxm=1e5+10; LLa[maxm]; intmain() {
LLn
zyx520ytt
·
2015-11-10 15:00
周赛一 1008 组合数学?DP?水题?
Input多组用例,每组输入两个整数n,m(1typedeflonglongll;intmain(){
lln
,m,ans;intres=1;while(~scanf("%lld%lld",&n,&m))
BIT_ACM
·
2015-11-01 13:34
周赛一 1001 uu的智商测验
Input第一行输入一个数n第二行输入n个数a1,a2…an(0typedeflonglongll;
lln
,sum,a;intmain(){scanf(
BIT_ACM
·
2015-11-01 13:24
Codeforces Round #328 (Div. 2) B. The Monster and the Squirrel
answer=(n-2)*(n-2);#include #include #include usingnamespacestd; #defineLLlonglong intmain() {
LLn
; while
zyx520ytt
·
2015-11-01 12:00
一些数论函数
1.计算a^bmodn//计算a^bmodn llmodexp(lla,llb,
lln
) { llret=1; lltmp=a; while(b){ //基数存在 if(b&1)ret=ret
纸牌
·
2015-10-30 19:00
POJ1811-Prime Test-素数测试+Pollard rho因数分解
题意:给你一个数n(n #include #include typedef__int64LL; intT;
LLn
,s; LLfactor[110000]; LLmods(LLx,LLy,
LLn
){ x
viphong
·
2015-10-27 08:00
hdu 4627 The Unsolvable Problem(暴力)
a:gcd(b,a%b);} lllcm(lla,llb){returna/gcd(a,b)*b;} llsolve(llx,
lln
){ lld
u011328934
·
2015-10-26 21:00
hdu 4611 Balls Rearrangement(规律)
a-b:b-a; } llsolve(
lln
){ llret=0,p=0,a=A,b=B,v;
u011328934
·
2015-10-26 21:00
51nod 1013 3的幂的和(等比数列求和_快速幂+逆元)
include #include #include usingnamespacestd; constintmod=1000000007; typedeflonglongll; llmod_pow(llx,
lln
h1021456873
·
2015-10-25 10:00
JS无法捕获滚动条上的mouse up事件的猜想
原文地址:http://www.cnblogs.com/
lln
7777/archive/2012/03/21/2409404.html 比如一个网页的聊天室,滚动条会随着内容的增加自动往下滚动。
·
2015-10-23 08:20
滚动条
51nod 1284 2 3 5 7的倍数(容斥原理)
Input输入1个数N(1 #include #include usingnamespacestd; typedeflonglongll; intmain() {
lln
,t; cin>>n; t=
h1021456873
·
2015-10-22 00:00
网易2016校招笔试编程+3轮面试
include #include #include #include #include #include #definelllonglong usingnamespacestd; llans; lli;
lln
u010951938
·
2015-10-19 15:00
coderforce 588B Duff in Love
#include #include #include usingnamespacestd; #defineLLlonglong intmain() {
LLn
; while(scanf("%lld",&
zyx520ytt
·
2015-10-16 21:00
51nod 1008 N的阶乘 mod P
(N #include #include #include usingnamespacestd; typedeflonglongll; intmain() {
lln
,mod,ans; ans=1;
h1021456873
·
2015-10-16 18:00
coderforce 588A Duff and Meat(简单的贪心)
include #include usingnamespacestd; #defineLLlonglong constLLmaxm=1e5+10; LLa[maxm],p[maxm]; intmain() {
LLn
zyx520ytt
·
2015-10-16 09:00
codeforces586C Gennady the Dentist(模拟)
include typedeflonglongll; llv[100100],p[100100],d[100100]; llans[100100],an; boolvis[100100]; main(){
lln
sinat_30126425
·
2015-10-13 22:00
51nod 1046 A^B Mod C (快速幂)
(1 #include #include usingnamespacestd; typedeflonglongll; llmod_pow(llx,
lln
,llmod) { llres=1; while
h1021456873
·
2015-10-12 16:00
hdu4768Flyer 二分
include #include usingnamespacestd; constintmaxn=2e4+10; typedefunsignedintll; lla[maxn],b[maxn],c[maxn];
lln
cq_pf
·
2015-10-07 18:00
二分
aa
#include #include #include #include #definemaxn100005 #definelllonglong usingnamespacestd;
lln
ACforever
·
2015-10-04 12:00
POJ 2800 Joseph's Problem(数论)
Description求Input两个整数n和k(1 #include #include usingnamespacestd; typedeflonglongll; llsolve(
lln
,llk) {
V5ZSQ
·
2015-10-04 11:00
bzoj2442: [Usaco2011 Open]修剪草坪(单调队列优化dp)
#include#includeusingnamespacestd;typedeflonglongll;
lln
,k;lla[100500],sum[100500];lldp[100500];llque[
KatnissJ
·
2015-09-30 19:17
组合数取余模板
#include #include #include usingnamespacestd; typedeflonglongll; llmod_pow(llx,
lln
,llp){ llres
殇雪
·
2015-09-25 16:00
BZOJ 1801 [Ahoi2009]chess 中国象棋 递推
(n,m #include #include #include #defineN110 #definemod9999973 usingnamespacestd; typedeflonglongll;
lln
wzq_QwQ
·
2015-09-22 19:00
dp
中国
2009
HDU 5461 2015沈阳网络赛水题 Largest Point
include #include #include usingnamespacestd; #defineLLlonglong constLLmaxm=1e7; LLm1[maxm]; LLm2[maxm];
LLn
zyx520ytt
·
2015-09-20 22:00
BZOJ 1122 [POI2008]账本BBB 神题
代码:#include #include #include #include #defineN1000100 usingnamespacestd; typedeflonglongll;
lln
,p,q,
wzq_QwQ
·
2015-09-17 20:00
代码
namespace
poi
操作
typedef
Amon君的数论模板
llfac[MAX];//因子llp[109];lllucas[109];
lln
,m,k;llmodpow(lla,llb,llmod)//a^b%mod{ llret=1; while(b) {
wang57389675
·
2015-09-16 20:00
HDU 5439 Aggregated Counting
include usingnamespacestd; #defineprt(k)cerr0;n>>=1,a=(a+a)%mod)if(n&1)r=(r+a)%mod; returnr; } llpmod(lla,
lln
u011788531
·
2015-09-14 17:00
HDU 5446 Unknown Treasure
usingnamespacestd; #definepbpush_back #defineprt(k)cerr0;n>>=1,a=(a+a)%m)if(n&1)r=(r+a)%m; returnr; } llpmod(lla,
lln
u011788531
·
2015-09-13 20:00
HDOJ 4473 Exam 暴力枚举
include #include #include #include #include #include usingnamespacestd; typedefunsignedlonglongintLL;
LLn
u012797220
·
2015-09-02 13:00
11440 - Help Tomisu(计数问题)
usingnamespacestd; typedeflonglongll; constintmod=100000007; constintmaxn=10000000+5; intT,kase=0,vis[maxn]={0};
lln
weizhuwyzc000
·
2015-09-02 09:00
数论
uva
ACM-ICPC
11971 - Polygon(连续概率)
细节参见代码:#include usingnamespacestd; typedeflonglongll; constintmaxn=10000; intT,kase=0;
lln
,k; llgcd(lla
weizhuwyzc000
·
2015-09-02 09:00
uva
ACM-ICPC
连续概率
【数论】[Uva12169]Disgruntled Judge
代码:#include #defineMAXN1000 #defineMOD10001 typedeflonglongLL;
LLn
,x[MAXN+10]
outer_form
·
2015-08-30 16:00
C++
数论
uva
非背包
#include#include#include#defineLLlonglongusingnamespacestd;structnode{ LL s,p,w;}q[10];intmain(){
LLn
Grit_ICPC
·
2015-08-28 21:00
dp
UVALive 6953 Digi Comp II
include #include #include #include #include usingnamespacestd; typedeflonglongLL; constintmaxn=500015;
LLn
jtjy568805874
·
2015-08-26 21:00
POJ 1837 Balance(01背包问题)
分别表示钩子个数和钩码个数(2 #include #include usingnamespacestd; #definemaxn21 #definemaxv15000 typedeflonglongll;
lln
V5ZSQ
·
2015-08-26 16:00
HDU 4407 Sum (莫比乌斯反演)
defineFOR(i,n)for(longlong(i)=1;(i)1){ XP[Xn]=maxp[x]; while(x%XP[Xn]==0)x/=XP[Xn]; Xn++; } } LLG(LLk,
LLn
u012891242
·
2015-08-25 23:00
矩阵二分幂求Fib(非结构体版)
矩阵二分幂求fib模板(0 #include #include #definelllonglong #definemod1000000007 usingnamespacestd; llsolve(
lln
qq_26564523
·
2015-08-22 18:00
【POJ 1942】 Paths on a Grid
代码如下:#include #include usingnamespacestd; #definelllonglong intmain() {
lln
,m,ans,i,t; while(~
ChallengerRumble
·
2015-08-19 16:00
HDU 2462 The Luckiest number
usingnamespacestd; #defineprt(k)cerr>=1,a=(a+a)%mod)if(b&1) { ret=(ret+a)%mod; } returnret; } llpmod(lla,
lln
u011788531
·
2015-08-17 22:00
算法
gcd
Codeforces Round #108 (Div. 2)
这是不可取的,最初的TLE代码如下:#include #include #include usingnamespacestd; typedeflonglongll; vector>v; intmain() {
lln
jzwong
·
2015-08-17 10:00
UVA10288 Coupons
题意:n个物品(兑换券),每次从中选择一个(不取出),求期望多少次可以取遍所有的物品n #include #include usingnamespacestd; #defineLLlonglong
LLn
u011542204
·
2015-08-16 21:00
Hdu 2492 树状数组 Ping pong
2#include 3#include 4#defineMAXN100005 5#defineM20005 6typedef__int64LL; 7usingnamespacestd; 8
LLn
fancy_boy
·
2015-08-05 15:00
hdu5344MZL's xor
#include #include #include usingnamespacestd; typedef__int64ll; intmain() {
lln
,m,l,z; intt; scanf("%
cq_pf
·
2015-08-04 19:00
模积和
*(mmodj))其中1 #include #include usingnamespacestd; typedeflonglongLL; constLLP=19940417,ny=3323403;
LLn
lzxzxx
·
2015-08-04 15:00
CodeForces 287B Pipeline(二分)
#include #defineLLlonglong usingnamespacestd; intmain() {
LLn
,k; cin>>n>>k; LLtmp=k*(k-1)/2+1; if(n=
acraz
·
2015-08-02 18:00
【数论】poj1811Prime Test
(a):(-(a))) usingnamespacestd;
LLn
,factor[10050],tot; LLmul(LLa,LLpos,LLp) { LLans=0; a%=p,pos%=p; while
cqbztsy
·
2015-08-01 21:00
数论
Miller-Rab
poj1811
Pollard-rh
UVA10325--- The Lottery (容斥)
#include #include usingnamespacestd; typedeflonglongLL; LLget[18]; LLgcd(LLm,
LLn
) { if(n==0) returnm;
qingshui23
·
2015-08-01 17:00
求一个整数的所有因子
#include#include#include#includeusingnamespacestd;typedeflonglongll;constintMax_N=100000;intmain(){
lln
varinic
·
2015-07-29 00:00
hdu3448Bag Problem 暴力枚举
include #include #include #include usingnamespacestd; constintmaxn=110; typedefintll; llans=0; lla[maxn];
lln
cq_pf
·
2015-07-27 19:00
暴力
上一页
15
16
17
18
19
20
21
22
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他