Integers

基本数据类型

但是计算机可以同时操作处理由多个字节组成复杂数据类型，比如长整数(long integers)和小数（decimals）。以
·2015-11-11 02:43

LeetCode——Single Number（找出数组中只出现一次的数）

问题： Given an array of integers, every element appears twice except for one.
·2015-11-11 02:28

Leetcode#29 Divide Two Integers

原题地址   不用除运算和模运算的除法就退化成最基本的减法 如果除数是1，被除数超大，这做减法还不得累死，所以，用位运算加快速度。 对于被除数和除数都是正数的情况，除法流程为：用位运算生成小于等于当前被除数一半的数字，然后一口气减掉，如此循环往复，直到被除数小于除数。 对于其他被除数和除数当中有负数的情况，为了简便处理可以先将他们求绝对值转化成正数，最后算出结果后再添加符号。
·2015-11-11 02:16

POJ 3468 A Simple Problem with Integers //线段树的成段更新

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

Search for a Range ——LeetCode

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

Contains Duplicate II ——LeetCode

Given an array of integers and an integer k, find out whether there there are two distinct indices
·2015-11-11 01:56

Combinations ——LeetCode

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

Minimum Size Subarray Sum —— LeetCode

Given an array of n positive integers and a positive integer s, find the minimal length
·2015-11-11 01:47

Divide Two Integers —— LeetCode

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

Subsets —— LeetCode

Given a set of distinct integers, nums, return all possible subsets.
·2015-11-11 01:43

Jump Game —— LeetCode

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

Subsets II ——LeetCode

Given a collection of integers that might contain duplicates, nums, return all possible subsets.
·2015-11-11 01:40

Remove Linked List Elements——LeetCode

Remove all elements from a linked list of integers that have value val.
·2015-11-11 01:37

Largest Number——LeetCode

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

4Sum——LeetCode

Given an array S of n integers, are there elements a, b, c, and 
·2015-11-11 01:19

Search a 2D Matrix ——LeetCode

This matrix has the following properties:   Integers in each row are sorted from left to right
·2015-11-11 01:17

3Sum Closest——LeetCode

Given an array S of n integers, find three integers in S such that the
·2015-11-11 01:12

3Sum——LeetCode

Given an array S of n integers, are there elements a, b, c in
·2015-11-11 01:09

Single Number II

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

joj1006

MEMORY Limit Run Times AC Times JUDGE 3s 8192K 5967 1984 Standard Given a base, and two positive integers
·2015-11-11 01:18

PKU 3468 A Simple Problem with Integers

区间修改，询问，带有 lazy tag。 # include <stdio.h> # define ls ((r) << 1) # define rs ((r) << 1 | 1) # define mid (((x)+(y))>>1) # define MAXN 100005 typedef long long int L
·2015-11-11 01:29

Lintcode: Search a 2D matrix II

This matrix has the following properties: * Integers in each row are sorted from left
·2015-11-11 01:21

Lintcode: Product of Array Exclude Itself

Given an integers array A.
·2015-11-11 01:18

Lintcode: Partition Array

Given an array "nums" of integers and an int "k", Partition the array (i.e move the
·2015-11-11 01:18

Lintcode: Previous Permuation

Given a list of integers, which denote a permutation.
·2015-11-11 01:17

Lintcode: Minimum Adjustment Cost

1 Given an integer array, adjust each integers so that the difference of every adjcent integers are not
·2015-11-11 01:16

Lintcode: Median

Given a unsorted array with integers, find the median of it.
·2015-11-11 01:11

Lintcode: Maximum Subarray III

Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum
·2015-11-11 01:10

Lintcode: Maximum Subarray II

Given an array of integers, find two non-overlapping subarrays which have the largest sum.
·2015-11-11 01:08

Lintcode: Maximum Subarray Difference

Given an array with integers.
·2015-11-11 01:07

Lintcode: Majority Number II

Given an array of integers, the majority number is the number that occurs more than 1/3 of the size of
·2015-11-11 01:06

Leetcode: Subsets II

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

Leetcode: Divide Two Integers

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

Leetcode: Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n
·2015-11-11 01:45

Leetcode: Search a 2D Matrix

This matrix has the following properties: 2 3 Integers in each row are sorted from left to right
·2015-11-11 01:35

Leetcode: Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute
·2015-11-11 01:34

Leetcode: Count and Say

The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221
·2015-11-11 01:33

【ZOJ】2836 Number Puzzle

题意：同【HDU】1796 How many integers can you find。
·2015-11-11 01:04

【HDU】1796 How many integers can you find

题意：给出n和m个元素的集合，求小于n且是集合中任意元素的倍数的数有多少个(m<=10)。 最基础的容斥了，懒得DFS，直接枚举二进制暴力完事。 1 #include<cstdio> 2 #include<algorithm> 3 typedef long long LL; 4 #define MAXN 110 5 using namespac
·2015-11-11 01:03

【SGU 128】Snake

All coordinates (xi,yi) are integers in a range from -10000 up
·2015-11-11 01:34

POJ 2891 Strange Way to Express Integers ★ (扩展欧几里德解同余式组)

题目链接： http://poj.org/problem?id=2891 题目大意： 很好的一道题，解同余式组： x = r1 (mod m1) x = r2 (mod m2) …… x = rp (mod mp)   思路： 因为m1, m2, m3, …… , mp不一定两两互素，所以不能直接用中国剩余定理. 不过，我们可以借用中国剩余定理的思想来解决这道题. 我们一个方程一个方程
·2015-11-11 01:20

POJ 2891 Strange Way to Express Integers ★ (扩展欧几里德解同余式组)

题目链接： http://poj.org/problem?id=2891 题目大意： 很好的一道题，解同余式组： x = r1 (mod m1) x = r2 (mod m2) …… x = rp (mod mp)   思路： 因为m1, m2, m3, …… , mp不一定两两互素，所以不能直接用中国剩余定理. 不过，我们可以借用中国剩余定理的思想来解决这道题. 我们一个方程一个方程
·2015-11-11 01:19

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

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1796 题目大意：给定一个N和一个有M个数的集合S，求出小于N的数中有多少能被集合S中的数整除. 思路：基本的容斥原理。设Xi为小于N的数中能整除集合中i个数的个数，则Xans = X1 - X2 + X3 - X4 + …… 需要注意的就是在求能整除多个数的个数的时候， 应该用N除以它们的最小公倍
·2015-11-11 01:07

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

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1796 题目大意：给定一个N和一个有M个数的集合S，求出小于N的数中有多少能被集合S中的数整除. 思路：基本的容斥原理。设Xi为小于N的数中能整除集合中i个数的个数，则Xans = X1 - X2 + X3 - X4 + …… 需要注意的就是在求能整除多个数的个数的时候， 应该用N除以它们的最小公倍
·2015-11-11 01:05

POJ 2299 Ultra-QuickSort(线段树入门)

The algorithm processes a sequence of n distinct integers by
·2015-11-11 00:12

POJ3648 A Simple Problem with Integers(线段树之成段更新。入门题)

A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 53169 Accepted
·2015-11-11 00:00

poj 1050 To the Max(最大子矩阵之和，基础DP题)

Submissions: 38573Accepted: 20350 Description Given a two-dimensional array of positive and negative integers
·2015-11-11 00:59

17110 Divisible（basic）

17110 Divisible 时间限制:1000MS  内存限制:65535K 题型: 编程题   语言: 无限制 Description Given n + m integers
·2015-11-11 00:58

数论——Lucas定理模板

Formulation For non-negative integers m and n and a prime p, the following&
·2015-11-11 00:42

sdut oj 1510 Contest02-4 Spiral

点这里^_^ 题目描述 Given an odd number n, we can arrange integers from 1 to n*n in the shape of a spiral.
·2015-11-11 00:55
上一页 29 30 31 32 33 34 35 36 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他