Integers

Codeforces Round #277.5 (Div. 2)

codeforces.com/contest/489 A：SwapSort In this problem your goal is to sort an array consisting of n integers
·2015-11-11 14:50

【HDU1402】【FNT版】A * B Problem Plus

    Input Each line will contain two integers A and B. Process to end of file.
·2015-11-11 14:00

【HDU1402】【FFT】A * B Problem Plus

Input Each line will contain two integers A and B. Process to end of file.
·2015-11-11 14:57

hdu 1018 Big Number (数学题)

Problem Description Inmany applications very large integers numbers are required.
·2015-11-11 14:45

ACM hdu 1019 Least Common Multiple

Problem Description The least common multiple (LCM) of a set of positive integers is the smallest
·2015-11-11 14:43

ACM HDU Primes(素数判断)

Problem Description Writea program to read in a list of integers and determine whether or not eachnumber
·2015-11-11 14:31

LeetCode_3 sum closet

Given an array S of n integers, find three integers in S such that the sum is closest to a given number
·2015-11-11 14:28

toj 2807 Number Sort

Memory Limit: 65536K Total Runs: 469    Accepted Runs: 160 Given you N positive integers
·2015-11-11 13:32

zoj 1797 Least Common Multiple

nbsp;    Memory Limit: 32768 KB The least common multiple (LCM) of a set of positive integers
·2015-11-11 13:19

Single Number II

Given an array of integers, every element appears three times except for one.
·2015-11-11 13:34

Single Number

Given an array of integers, every element appears twice except for one.
·2015-11-11 13:33

Longest Consecutive Sequence

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
·2015-11-11 13:28

Subsets II

Given a collection of integers that might contain duplicates, S, return all possible subsets.
·2015-11-11 13:02

Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.
·2015-11-11 13:56

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

A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total
·2015-11-11 13:52

POJ 3468 A Simple Problem with Integers(详细题解) 线段树

这是个线段树题目，做之前必须要有些线段树基础才行不然你是很难理解的。 此题的难点就是在于你加的数要怎么加，加入你一直加到叶子节点的话，复杂度势必会很高的 具体思路 在增加时，如果要加的区间正好覆盖一个节点，则增加其节点的Inc值，不再往下走，否则要更新Sum(加上本次增量),再将增量往下传。 这样更新的复杂度就是O(log(n))在查询时，如果待查区间不是正好覆盖一个节点，就将节点的Inc
·2015-11-11 13:41

Codeforces Round #137 (Div. 2)

Shooshuns and Sequence One day shooshuns found a sequence of  n integers, written on a blackboard
·2015-11-11 13:59

Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array
·2015-11-11 13:00

Divide Two Integers

Divide two integers without using multiplication, division and mod operator.
·2015-11-11 13:59

C - A Simple Problem with Integers POJ 3468（线段树+延迟标记）

C - A Simple Problem with Integers Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d &
·2015-11-11 12:52

线段树(成段更新) POJ 3468 A Simple Problem with Integers

  题目传送门 1 /* 2 线段树-成段更新：裸题，成段增减，区间求和 3 注意：开long long:) 4 */ 5 #include <cstdio> 6 #include <iostream> 7 #include <algorithm> 8 #include <cstring> 9 #include
·2015-11-11 12:25

[LeetCode OJ] Single Number之二 ——Given an array of integers, every element appears THREE times except

  1 class Solution { 2 public: 3 int singleNumber(int A[], int n) { 4 int bits = sizeof(int)*8; 5 int result=0; 6 for(int i=1; i<=bits; i++) 7
·2015-11-11 12:04

Strange Way to Express Integers （一般模线性方程组）

Time Limit: 1000MS   Memory Limit: 131072K Total Submissions: 8476   Accepted: 2554 Description   Elina is reading a book written by Rujia Liu, which int
·2015-11-11 12:49

csu1002 A+B(III)

Each line consists of a pair of integers a and b（1=< a,b <=1016）, separated by a space.
·2015-11-11 12:22

Leetcode: Largest Number

Given a list of non negative integers, arrange them such that they form the largest number.
·2015-11-11 12:21

Leetcode: Two Sum II

Given an array of integers that is already sorted in ascending order, find two numbers such that they
·2015-11-11 12:18

Leetcode: Fraction to Recurring Decimal

Given two integers representing the numerator and denominator of a fraction, return the fraction in string
·2015-11-11 12:18

Twitter OA prepare: Rational Sum

number is any number that can be expressed in the form of a fraction p/q , where p & q are two integers
·2015-11-11 12:09

Twitter OA prepare: Flipping a bit

You can perform AT MOST one move on the array: choose any two integers [L, R], and flip all the elements
·2015-11-11 12:06

Leetcode: Longest Consecutive Sequence && Summary: Iterator用法以及ConcurrentModificationException错误说明

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
·2015-11-11 12:58

Leetcode: Sort Colors

Here, we will use the integers
·2015-11-11 12:53

Leetcode: Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value.
·2015-11-11 12:36

Leetcode: Single Number II

Given an array of integers, every element appears three times except for one.
·2015-11-11 12:31

Leetcode: Single Number

Given an array of integers, every element appears twice except for one. Find that single one.
·2015-11-11 12:28

Leetcode: Combinations

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
·2015-11-11 12:19

Leetcode: Subsets

Given a set of distinct integers, S, return all possible subsets.
·2015-11-11 12:19

Leetcode: Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.
·2015-11-11 12:17

[Leetcode][Python]42: Trapping Rain Water

gmail.com'42: Trapping Rain Waterhttps://oj.leetcode.com/problems/trapping-rain-water/Given n non-negative integers
·2015-11-11 12:56

POJ3468 - A Simple Problem with Integers

题目大意 给定N个整数，A1,A2,A3…An。可以对这些数进行一下两种操作： 1、"C a b c" 对区间[a,b]内的所有数都加上c 2、"Q a b"询问区间[a,b]的和 题解 一般树状数组都是实现单点修改和区间求和或者单点查询和区间加减的功能，而此题是要求实现区间查询，区间加减的功能，我们依然能够用树状数组来处理，具体怎么处理请参看wyl
·2015-11-11 12:33

poj 3468 A Simple Problem with Integers 区间更新与询问 Splay简单应用

Splay 的属性　　 1 struct Splay{ 2 int rt, cnt; 3 int ch[N][2], pre[N], sz[N]; 4 LL sum[N], add[N], val[N]; 5 }   Splay 的操作主要集中在  　　1. Rotate( x, d )    旋转分为 左旋(d=
·2015-11-11 11:33

[leetcode.com]算法题目 - Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array
·2015-11-11 11:07

Leetcode Two Sum

#title : Two Sum #Given an array of integers, find two numbers such #that they add up to a specific
·2015-11-11 11:42

Largest Rectangle in Histogram

Given n non-negative integers representing the histogram's bar height where the width of each
·2015-11-11 11:37

Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value.
·2015-11-11 11:35

Combinations

Given two integers n and k, return all possible combinations of k numbers out
·2015-11-11 11:29

Divide Two Integers

Divide two integers without using multiplication, division and mod operator.
·2015-11-11 11:26

HDU-1002 A + B Problem II

Given two integers A and B, your job is to calculate the Sum of A + B.
·2015-11-11 10:21

Trapping Rain Water

Question: Given n non-negative integers representing an elevation map where the width of each
·2015-11-11 10:09

4Sum

Question: Given an array S of n integers, are there elements a, b, 
·2015-11-11 10:05

Largest Number

Given a list of non negative integers, arrange them such that they form the largest number.
·2015-11-11 10:03
上一页 27 28 29 30 31 32 33 34 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他