2017年01月_NineFailure

原创 poj2528 离散线段树

DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has

2017-01-28 18:41:47 227

原创 poj3744 概率

DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy’s base. After overcoming a series difficulties, YYF is now at the start of enemy’s famous “min

2017-01-27 00:24:03 322

原创 HDU4035 递推求期望

Problem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms is connected by one and only one path. Initially

2017-01-21 16:51:30 391

原创 HDU4405 水概率

#include <stdio.h> #include <string.h> #include <algorithm> #include<iostream> #include <cstring> double dp[500000]; int qw[500000]; using namespace std; int main() { int n, m; while (cin >> n

2017-01-17 21:14:09 336

原创 poj2096 概率dp入门____期望

DescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bu

2017-01-16 23:09:20 423

原创 Codeforces Round #324 (Div. 2)D

D. Dima and Lisa time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Dima loves representing an odd number as the sum of multiple primes, and L

2017-01-15 11:36:36 300

原创 Codeforces Round #323 (Div. 2)D lis

D. Once Again… time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given an array of positive integers a1, a2, …, an × T of length n ×

2017-01-14 17:52:26 459

原创 Codeforces Round #323 (Div. 2)C

The GCD table G of size n × n for an array of positive integers a of length n is defined by formulaLet us remind you that the greatest common divisor (GCD) of two positive integers x and y is the great

2017-01-14 15:15:35 257

原创 HDU4352 lis+状压+数位dp

dp

2017-01-14 00:46:37 328

原创 Codeforces Round #321 (Div. 2) D

When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There were n dishes. Kefa knows that he needs exactly m dishes. But at that, he doesn’t want to order t

2017-01-12 15:26:12 309

NineFailure的博客