码迷,mamicode.com
首页 >  
搜索关键字:roman to integer    ( 15811个结果
STL--F - Sequence(n*m->求最小的前m个和)
F - Sequence Time Limit:6000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description Given m sequences, each contains n non-negative integer. Now we ma...
分类:其他好文   时间:2014-08-05 00:51:18    阅读次数:284
xtu summer individual 4 C - Dancing Lessons
Dancing LessonsTime Limit: 5000msMemory Limit: 262144KBThis problem will be judged onCodeForces. Original ID:45C64-bit integer IO format:%I64d Java cl...
分类:其他好文   时间:2014-08-04 21:01:07    阅读次数:294
POJ 2886 Who Gets the Most Candies? (线段树)
Description N children are sitting in a circle to play a game. The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it in his/her hand. The ...
分类:其他好文   时间:2014-08-04 17:57:27    阅读次数:284
poj 2886 线段树的更新+反素数
Who Gets the Most Candies?Time Limit: 5000 MS Memory Limit: 0 KB64-bit integer IO format: %I64d , %I64u Java class name: Main[Submit] [Status] [Discus...
分类:其他好文   时间:2014-08-04 17:13:47    阅读次数:307
First Missing Positive leetcode java
题目:Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm....
分类:编程语言   时间:2014-08-04 13:34:47    阅读次数:373
Gray Code leetcode java
题目:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total ....
分类:编程语言   时间:2014-08-04 04:10:46    阅读次数:309
Palindrome Number leetcode java
题目:Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes....
分类:编程语言   时间:2014-08-04 04:09:56    阅读次数:339
SQLite创建数据库失败
1.现象:.创建不出来数据库, 解决:测试用的项目包明以db结尾了,重新创建项目改成dbtest就没事了。 2.现象;创建出来数据库,但是数据库中没有表项 解决:db.execSQL("create table " + TABLE_NEWS_NAME + " ( " + TABLE_NEWS_ID + " integer primary key autoincrement, " + TABL...
分类:数据库   时间:2014-08-03 18:05:05    阅读次数:252
POJ2442——Squence(二叉堆+动态规划 | 滚动数组)
本文出自:http://blog.csdn.net/svitter 题意分析: Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear ...
分类:其他好文   时间:2014-08-03 12:54:15    阅读次数:912
BNUOJ 2345 Muddy Fields
Muddy FieldsTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:222664-bit integer IO format:%lld Java class name:Ma...
分类:其他好文   时间:2014-08-03 12:43:05    阅读次数:281
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!