Integers

uva 10534 Wavio Sequence

题目：Wavio is a sequence of integers. It has some interesting properties. Wavio is of odd length i.e. 
a894383755·2016-05-07 13:00

Leetcode 18. 4Sum

Givenanarray S of n integers,arethereelements a, b, c,and d in S suchthat a + b + c + d =target?
a2415180498·2016-05-07 13:00

Divide Two Integers

Inordertosolvethisproblem,itisgoodtoknowsomebasicsfirst.Suppose,dividendisa1,divisorisa0.   a1=a0*(2^k)+a0*(2^(k-1))+a0*(2^(k-2))+...a0*(2^1)+a0*(2^0)+a2...(a23Tofindthe(8,4),wejustneedtoshift4forklef
github_34333284·2016-05-07 10:00

poj 3468 A Simple Problem with Integers

这道题用到了陈段更新。。。但是速度一直在2300–2500之间徘徊。。不知道如何更快。。以后知道了会及时更新。。#include #include usingnamespacestd; constintmaxn=100010; longlonga[maxn]; structmytree { longlonglazy; longlongme; }tree[maxn*4]; chartest[2];
qq_32995183·2016-05-06 18:00

More Effective C++----(21)通过重载避免隐式类型转换

以下是一段代码，如果没有什么不寻常的原因，实在看不出什么东西：classUPInt{//unlimitedprecision public://integers类 UPInt(); UPInt(intvalue
qianqin_2014·2016-05-06 18:00

Divide Two Integers

DivideTwoIntegersMySubmissionsQuestionEditorialSolutionTotalAccepted:66073TotalSubmissions:421509Difficulty:MediumDividetwointegerswithoutusingmultiplication,divisionandmodoperator.Ifitisoverflow,retu
justdoithai·2016-05-05 23:00

♥ZOJ 3872-Beauty of Array【规律】

BeautyofArrayTimeLimit: 2Seconds     MemoryLimit: 65536KBEdwardhasanarray A with N integers.Hedefinesthebeautyofanarrayasthesummationofalldistinctintegersinthearray.NowEdwardwantstoknowthesummationoft
qq_29600137·2016-05-05 22:00

【POJ 2891】Strange Way to Express Integers（扩展欧几里得）

【POJ2891】StrangeWaytoExpressIntegers（扩展欧几里得）TimeLimit:1000MS MemoryLimit:131072KTotalSubmissions:12934 Accepted:4130DescriptionElinaisreadingabookwrittenbyRujiaLiu,whichintroducesastrangewaytoexpressn
ChallengerRumble·2016-05-05 20:00

菜圈的codewars（五），Find The Parity Outlier

deffind_outlier(integers):odd,even=0,0oddnum,evennum=0,0forxinintegers:if(x%2==0):evennum=xeven=even+
GrayVictoria·2016-05-05 11:24

HDU 1796 How many integers can you find(容斥原理)

HowmanyintegerscanyoufindTimeLimit:12000/5000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6434    AcceptedSubmission(s):1849ProblemDescription  NowyougetanumberN,andaM-in
Dacc123·2016-05-04 15:00

[CareerCup] 18.3 Randomly Generate Integers 随机生成数字

 18.3Writeamethodtorandomlygenerateasetofmintegersfromanarrayofsizen.Eachelementmusthaveequalprobabilityofbeingchosen. 这道题让我们从一个数组中随机取出m个数字，要求每个数字被取出的概率相同，其实这道题用的是之前那道18.2ShuffleCards的方法，同样我们可以用递归和迭代两
Grandyang·2016-05-04 00:00

HDOJ 1796 How many integers can you find (容斥)

题意求n以内有多少个数能整除至少一个给出的数组中的数。思路经典的裸容斥，把所有的因子相乘的情况枚举一下奇数加，偶数减就可以了。这个题有个很坑的地方就是输入里面有0，不过幸好judge出来的RE,还是可以判断出来的。代码#include #include #include #include #include #include #include #include #include #include #
Dreamon3·2016-05-03 20:00

Codeforces 246B-Increase and Decrease【模拟】

B.IncreaseandDecreasetimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputPolycarpushasanarray,consistingof n integers
qq_29600137·2016-05-03 18:00

山东省第一届ACM大学生程序设计竞赛 Greatest Number 二分查找

_^题目描述Sayalikesmath,becauseshethinkmathcanmakehercleverer.Oneday,Kudoinvitedaverysimplegame:Given N integers
zp___waj·2016-05-03 13:00

【LeetCode】LeetCode——第18题：4Sum

MySubmissionsQuestionEditorialSolutionTotalAccepted: 71353 TotalSubmissions: 300185 Difficulty: MediumGivenanarray S of n integers
hujingshuang·2016-05-03 09:00

[leetcode] 227. Basic Calculator II 解题报告

Implementabasiccalculatortoevaluateasimpleexpressionstring.Theexpressionstringcontainsonly non-negative integers
qq508618087·2016-05-02 15:00

zoj--3872--Beauty of Array（思维）

BeautyofArrayTimeLimit: 2Seconds     MemoryLimit: 65536KBEdwardhasanarray A with N integers.Hedefinesthebeautyofanarrayasthesummationofalldistinctintegersinthearray.NowEdwardwantstoknowthesummationo
qq_29963431·2016-05-02 12:00

Leetcode 16. 3Sum Closest

Givenanarray S of n integers,findthreeintegersin S suchthatthesumisclosesttoagivennumber,target.Returnthesumofthethreeintegers.Youmayassumethateachinputwouldhaveexactlyonesolution.Forexample
a2415180498·2016-05-02 11:00

Poj 2891 Strange Way to Express Integers【crt】

StrangeWaytoExpressIntegersTimeLimit: 1000MS MemoryLimit: 131072KTotalSubmissions: 12923 Accepted: 4126DescriptionElinaisreadingabookwrittenbyRujiaLiu,whichintroducesastrangewaytoexpressnon-negativein
liuke19950717·2016-05-01 22:00

ZOJ 3872:Beauty of Array【数列】

BeautyofArrayTimeLimit: 2Seconds     MemoryLimit: 65536KBEdwardhasanarray A with N integers.Hedefinesthebeautyofanarrayasthesummationofalldistinctintegersinthearray.NowEdwardwantstoknowthesummationoft
lin14543·2016-05-01 20:00

Leetcode 15. 3Sum

Givenanarray S of n integers,arethereelements a, b, c in S suchthat a + b + c =0?
a2415180498·2016-05-01 19:00

CodeForces 246B: Increase and Decrease【水】

B.IncreaseandDecreasetimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputPolycarpushasanarray,consistingof n integers
lin14543·2016-04-30 19:00

Number of Ways

DescriptionYou'vegotarray a[1], a[2], ..., a[n],consistingof n integers.Countthenumberofwaystosplitalltheelementsofthearrayintothreecontiguouspartssothatthesumofelementsineachpartisthesame.Moreformall
menxiaoyuan·2016-04-30 15:00

【LeetCode】LeetCode——第16题：3Sum Closest

MySubmissionsQuestionEditorialSolutionTotalAccepted: 76085 TotalSubmissions: 261853 Difficulty: MediumGivenanarray S of n integers
hujingshuang·2016-04-29 21:00

【LeetCode】LeetCode——第15题：3Sum

MySubmissionsQuestionEditorialSolutionTotalAccepted: 115091 TotalSubmissions: 612138 Difficulty: MediumGivenanarray S of n integers
hujingshuang·2016-04-29 20:00

POJ-3468-A Simple Problem with Integers

树状数组，区间更新，区间求和。设原数组为p(),delta(i)表示p数组第i个数及第i个数之和都要加上delta(i)。sum()表示p()的前缀和。num()表示i*delta(i)的前缀和。若对[a,b]区间中的数加上c，则只需delta(a)+=c,delta(b+1)-=c;则a到b的区间之和=sum[b]+segma(delta(i)*(x-i+1)-(sum[a]+segma(del
qq_26122039·2016-04-28 22:00

POJ-3468-A Simple Problem with Integers

线段树区间更新，区间求和#include #include #definemaxn100005 #defineINF1e9 usingnamespacestd; typedeflonglongll; llsum[maxn>1; Build(n>1))*add[n]; sum[n>1)*add[n]; add[n>1; if(rmid) Update(n>1; if(rmid) Query(n<<
qq_26122039·2016-04-28 19:00

解题报告：HDU1695（欧拉+容斥）

32768/32768K(Java/Others)TotalSubmission(s):9088    AcceptedSubmission(s):3366ProblemDescriptionGiven5integers
qq_32570675·2016-04-28 19:00

16. 3Sum Closest

Givenanarray S of n integers,findthreeintegersin S suchthatthesumisclosesttoagivennumber,target.Returnthesumofthethreeintegers.Youmayassumethateachinputwouldhaveexactlyonesolution.Forexample
qq_27991659·2016-04-28 17:00

18. 4Sum

Givenanarray S of n integers,arethereelements a, b, c,and d in S suchthat a + b + c + d =target?
qq_27991659·2016-04-28 15:00

15. 3Sum

Givenanarray S of n integers,arethereelements a, b, c in S suchthat a + b + c =0?
qq_27991659·2016-04-28 10:00

poj3468——A Simple Problem with Integers（线段树，区间更新）

Description给出了一个序列，你需要处理如下两种询问。“Cabc”表示给[a,b]区间中的值全部增加c(-10000≤c≤10000)。“Qab”询问[a,b]区间中所有值的和。Input第一行包含两个整数N,Q。1≤N,Q≤100000.第二行包含n个整数，表示初始的序列A(-1000000000≤Ai≤1000000000)。接下来Q行询问，格式如题目描述。Output对于每一个Q开头
blue_skyrim·2016-04-27 20:00

uva 10603 Fill 搜索

(a, b, and c are positive integers not greater than 200). 
a894383755·2016-04-27 20:00

POJ 3468-A Simple Problem with Integers(区间更新线段树)

ASimpleProblemwithIntegersTimeLimit:5000MS MemoryLimit:131072KTotalSubmissions:88545 Accepted:27517CaseTimeLimit:2000MSDescriptionYouhaveNintegers,A1,A2,...,AN.Youneedtodealwithtwokindsofoperations.On
MIKASA3·2016-04-27 10:00

POJ 3468 A Simple Problem with Integers

题目链接：http://poj.org/problem?id=3468在HDOJ上有一个名字和这道题一模一样的题，在分类上也都是分到了数据结构里，小编我以为是同一道题，粘了自己HDOJ上的代码，怎么样都是WA，后来才发现题不一样=.=。题意：给我们n个整数，然后会有m次操作，如果操作是C，输入三个数a,b,c，表示从a到b之间的数加上c，如果操作是Q，输入两个数a,b，输出从a到b之间的所有值的和
RaAlGhul·2016-04-26 19:00

Divide Two Integers

一天一道LeetCode系列（一）题目Dividetwointegerswithoutusingmultiplication,divisionandmodoperator.Ifitisoverflow,returnMAX_INT.（二）解题这题看起来很简单，一开始想到的方法就是从0开始一次累加除数，一直到比被除数大为止，好无悬念，这样做的结果就是超时了。用移位来实现除法效率就比较高了。具体思路可以
terence1212·2016-04-26 18:00

POJ 2891-Strange Way to Express Integers【中国剩余定理】

StrangeWaytoExpressIntegersTimeLimit: 1000MS MemoryLimit: 131072KTotalSubmissions: 12870 Accepted: 4102DescriptionElinaisreadingabookwrittenbyRujiaLiu,whichintroducesastrangewaytoexpressnon-negativein
qq_29600137·2016-04-26 12:00

POJ 3468 A Simple Problem with Integers

Description给出了一个序列，你需要处理如下两种询问。"Cabc"表示给[a,b]区间中的值全部增加c(-10000≤c≤10000)。"Qab"询问[a,b]区间中所有值的和。Input第一行包含两个整数N,Q。1≤N,Q≤100000.第二行包含n个整数，表示初始的序列A(-1000000000≤Ai≤1000000000)。接下来Q行询问，格式如题目描述。Output对于每一个Q开头
yangkunpengD·2016-04-26 11:00

POJ-3468A Simple Problem with Integers，线段数区间更新查询，代码打了无数次还是会出错~~

ASimpleProblemwithIntegersTimeLimit: 5000MS MemoryLimit: 131072K        CaseTimeLimit: 2000MSDescriptionYouhave N integers
NYIST_TC_LYQ·2016-04-25 21:00

POJ 3468 A Simple Problem with Integers （树状数组）

MemoryLimit: 131072KTotalSubmissions: 88353 Accepted: 27469CaseTimeLimit: 2000MSDescriptionYouhave N integers
a2459956664·2016-04-25 20:00

Basic Calculator II

Implementabasiccalculatortoevaluateasimpleexpressionstring.Theexpressionstringcontainsonly non-negative integers
u010005161·2016-04-25 20:00

HDU 1695 GCD (欧拉函数，容斥原理)

32768/32768K(Java/Others)TotalSubmission(s):9046    AcceptedSubmission(s):3351ProblemDescriptionGiven5integers
Dacc123·2016-04-25 11:00

hdoj 4267 A Simple Problem with Integers 【线段树】

题目链接：hdoj4267ASimpleProblemwithIntegersASimpleProblemwithIntegersTimeLimit:5000/1500MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):5030AcceptedSubmission(s):1586ProblemDescript
chenzhenyu123456·2016-04-24 18:00

leetcode 029 Divide Two Integers

题目Dividetwointegerswithoutusingmultiplication,divisionandmodoperator.Ifitisoverflow,returnMAX_INT.思路：利用移位操作符求解，但是对于移位运算我并不拿手。所以我参考了一个C#的解，用递归解的。在递归之前先要把数据进行处理一下：1.除数为1时，直接返回被除数。2.除数为-1时，有两种情况：(1)若被除数为
jnuyanfa·2016-04-23 22:00

HDU 5339 Untitled

Others)TotalSubmission(s):301    AcceptedSubmission(s):156ProblemDescriptionThereisaninteger a and n integers
u013077144·2016-04-21 19:00

POJ-3468 A Simple Problem with Integers（Splay实现）

TimeLimit:5000MS MemoryLimit:131072KTotalSubmissions:88130 Accepted:27382CaseTimeLimit:2000MSDescriptionYouhaveNintegers,A1,A2,...,AN.Youneedtodealwithtwokindsofoperations.Onetypeofoperationistoaddsom
u014258433·2016-04-21 13:00

POJ 3368 Frequent values RMQ

2000MS MemoryLimit: 65536KTotalSubmissions: 15996 Accepted: 5822DescriptionYouaregivenasequenceof n integers
Houheshuai·2016-04-20 21:00

LeetCode[Array]---- 4Sum

 4SumGivenanarray S of n integers,arethereelements a, b, c,and d in S suchthat a + b + c + d =target?
whiterbear·2016-04-19 11:00

LeetCode[Array]----3Sum Closest

3SumClosest Givenanarray S of n integers,findthreeintegersin S suchthatthesumisclosesttoagivennumber,
whiterbear·2016-04-19 10:00

hdoj-1976-How many integers can you find

Description  NowyougetanumberN,andaM-integersset,youshouldfindouthowmanyintegerswhicharesmallthanN,thattheycandividedexactlybyanyintegersintheset.Forexample,N=12,andM-integersetis{2,3},sothereisanothe
Ypopstar·2016-04-18 21:00
上一页 13 14 15 16 17 18 19 20 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他