码迷,mamicode.com
首页 >  
搜索关键字:round    ( 15566个结果
Codeforces Round #265 (Div. 2) C. No to Palindromes!
Paul hates palindromes. He assumes that string s is tolerable if each its character is one of the first p letters of the English alphabet and s doesn't contain any palindrome contiguous substring ...
分类:其他好文   时间:2014-09-17 18:47:02    阅读次数:247
Codeforces Round #266 (Div. 2)-C,D
C - Number of Ways 直接暴力从前往后寻找,如果找到1/3sum的位置,那么标记++。找到2/3的位置,总数加上标记数。 #include #include #include #include #include #include #include #include #include #include #pragma comment(linker, "/STACK:1024000...
分类:其他好文   时间:2014-09-17 16:57:02    阅读次数:282
Oracle 随机取某一列的值
select?t.recd_id ??from?(select?recd_id,?ROWNUM?RN?from?RT_TICKETS_BIS_RECD)?t ?where?t.RN?=?(select?round(DBMS_RANDOM.VALUE(1,?count(1))) ?????????????????from?R...
分类:数据库   时间:2014-09-17 15:41:22    阅读次数:322
Codeforces Round #265 (Div. 2) B. Inbox (100500)
Over time, Alexey's mail box got littered with too many letters. Some of them are read, while others are unread. Alexey's mail program can either show a list of all letters or show the content of a s...
分类:其他好文   时间:2014-09-17 15:16:42    阅读次数:248
Codeforces Round #FF (Div. 2) C - DZY Loves Sequences (DP)
DZY has a sequence a, consisting of n integers. We'll call a sequence ai,?ai?+?1,?...,?aj (1?≤?i?≤?j?≤?n) a subsegment of the sequence a. The value (j?-?i?+?1) denotes the length of the subsegmen...
分类:其他好文   时间:2014-09-16 15:57:40    阅读次数:248
Codeforces Round #266 (Div. 2) D. Increase Sequence
Peter has a sequence of integers a1,?a2,?...,?an. Peter wants all numbers in the sequence to equal h. He can perform the operation of "adding one on the segment [l,?r]": add one to all elements of t...
分类:其他好文   时间:2014-09-16 14:18:20    阅读次数:259
Codeforces Round #266 (Div. 2) C. Number of Ways
You've got array a[1],?a[2],?...,?a[n], consisting of n integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part ...
分类:其他好文   时间:2014-09-16 12:45:20    阅读次数:164
Google Round B APAC Test
A:题意密码由n不同的字符和m的长度组成,问你有多少种情况解题思路:可以得到状态转移方程为 dp[i][j] = dp[i-1][j]*j + dp[i-1][j-1]*(n-j+1);解题代码: 1 // File Name: a.cpp 2 // Author: darkdream 3 // C...
分类:其他好文   时间:2014-09-15 17:21:49    阅读次数:189
Codeforces Round #266 (Div. 2) B. Wonder Room
The start of the new academic year brought about the problem of accommodation students into dormitories. One of such dormitories has a a?×?b square meter wonder room. The caretaker wants to accommoda...
分类:其他好文   时间:2014-09-15 11:18:28    阅读次数:148
Codeforces Round #266 (Div. 2) A. Cheap Travel
Ann has recently started commuting by subway. We know that a one ride subway ticket costs a rubles. Besides, Ann found out that she can buy a special ticket for m rides (she can buy it several times...
分类:其他好文   时间:2014-09-15 10:05:28    阅读次数:320
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!