jjaw2013-CSDN博客

原创 [数论] POJ 3126 Prime Path

Prime Path

2014-07-14 16:24:02 608

原创 POJ 3041 Asteroids

此题为个人PK赛的B题，POJ传送门：

2014-04-29 14:49:58 821

原创 Google Code Jam 2014 Qualification Round 2014 A B D

Problem A. Magic TrickProblemRecently you went to a magic show. You were very impressed by one of the tricks, so you decided to try to figure out the secret behind it!The magician starts b

2014-04-13 15:19:30 1056

原创 CodingTrip - 携程编程大赛（预赛第二场）1001剪刀石头布&1003 位图像素的颜色

解题报告：对于每次

2014-04-11 21:29:24 1679 1

原创 [博弈]POJ 2234 Matches Game

传送门：Matches GameMatches GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8009 Accepted: 4607DescriptionHere is a simple game. In this game, t

2014-02-23 14:47:35 795

原创 [博弈]HDU 2509 Be the Winner

传送门：Be the WinnerBe the WinnerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1679 Accepted Submission(s): 902Problem Descr

2014-02-23 14:33:57 684

原创 [博弈]HDU 1907 John

传送门：JohnJohnTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2443 Accepted Submission(s): 1322Problem DescriptionLittle

2014-02-22 22:06:21 634

原创 [博弈]HDU 2176 取(m堆)石子游戏

传送门：取(m堆)石子游戏取(m堆)石子游戏Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1309 Accepted Submission(s): 781Problem Description

2014-02-22 21:47:52 594

原创 [博弈]HDU 1850 Being a Good Boy in Spring Festival

传送门：Being a Good Boy in Spring FestivalBeing a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3648 Acce

2014-02-22 21:38:30 724

原创 [博弈]HDU 2149 Public Sale

传送门：Public SalePublic SaleTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3254 Accepted Submission(s): 2012Problem Descript

2014-02-21 13:38:21 636

原创 [博弈]HDU 1527 取石子游戏

传送门：取石子游戏取石子游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3059 Accepted Submission(s): 1522Problem Description有两堆石子

2014-02-21 13:13:20 808

原创 Codeforces Round #231 (Div. 2)B. Very Beautiful Number

B. Very Beautiful Numbertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTeacher thinks that we make a lot o

2014-02-21 02:08:12 788

原创 Codeforces Round #231 (Div. 2)A. Counting Sticks

A. Counting Stickstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen new students come to the Specialized

2014-02-21 02:04:19 639

原创 Codeforces Round #230 (Div. 2)B. Three matrices

B. Three matricestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputChubby Yang is studying linear equations r

2014-02-19 23:01:49 639

原创 Codeforces Round #230 (Div. 2)A. Nineteen

A. Nineteentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice likes word "nineteen" very much. She has a

2014-02-19 22:58:07 788

原创 Rockethon 2014 B. Word Folding

B. Word Foldingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou will receive 5 points for solving this p

2014-02-17 12:01:43 824

原创 Rockethon 2014 A. Genetic Engineering

A. Genetic Engineeringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou will receive 3 points for solving

2014-02-17 11:59:28 690

原创 [博弈]HDU 1846 Brave Game

传送门：Brave GameBrave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5308 Accepted Submission(s): 3529Problem Descriptio

2014-02-16 13:32:58 682

原创 [树状数组]POJ 1195 Mobile phones

传送门：Mobile phonesMobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 13627 Accepted: 6316DescriptionSuppose that the fourth generation

2014-02-15 20:16:22 624

原创 [树状数组]POJ 2299 Ultra-QuickSort

传送门：Ultra-QuickSortUltra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 37112 Accepted: 13350DescriptionIn this problem, you have to a

2014-02-15 19:15:43 584

原创 [树状数组]POJ 2352 Stars

传送门：StarsStarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29248 Accepted: 12790DescriptionAstronomers often examine star maps where stars ar

2014-02-15 00:03:27 559

原创 [并查集]HDU 1829/POJ 2492/HOJ 2319 A Bug's Life

传送门：A Bug's LifeA Bug's LifeTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6961 Accepted Submission(s): 2267Problem Descr

2014-02-12 20:43:56 868

原创 [并查集]HOJ 2745 Indirect Know

传送门：Indirect KnowIndirect KnowMy Tags (Edit) Source : xiaoE Time limit : 3 sec Memory limit : 64 MSubmitted : 299, Accept

2014-02-12 19:43:17 673

原创 [并查集]HOJ 2676 Relation

传送门：RelationRelationMy Tags (Edit) Source : lilu0355 Time limit : 1 sec Memory limit : 64 MSubmitted : 793, Accepted : 27

2014-02-12 17:22:30 707

原创 [并查集]POJ 1611 The Suspects

传送门：The SuspectsThe SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 19859 Accepted: 9644DescriptionSevere acute respiratory syndrome (SA

2014-02-12 15:56:18 667

原创 [并查集]POJ 2524 Ubiquitous Religions

传送门：Ubiquitous ReligionsUbiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 21783 Accepted: 10681DescriptionThere are so many di

2014-02-12 15:24:21 665

原创 Codeforces Round #229 (Div. 2)B. Inna, Dima and Song

B. Inna, Dima and Songtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna is a great piano player and Dima

2014-02-12 12:07:15 876

原创 Codeforces Round #229 (Div. 2)A. Inna and Alarm Clock

A. Inna and Alarm Clocktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna loves sleeping very much, so sh

2014-02-12 12:00:15 867

原创 map详解

map详解一、clear(),empty(),size().insert(),begin(),end() clear() 清空迭代器 begin() 返回指向第一个元素额迭代器 end() 返回指向末尾元素的迭代器 empty() 如果为空，返回 true size() 返回元素的数量 insert(pair val) 插入 pair 类型元素，对 map 返

2014-02-11 14:09:32 997

原创 list详解

List详解一、pop_back(),pop_front(),push_back(val),push_front(val),back(),front(),clear(),empty(),size()pop_back() 删除链表的最后一个元素 pop_front() 删除链表的第一个元素 push_back(val) 将 val 连接到链表的最后 push_front

2014-02-10 22:23:52 766

原创 vector详解

Vector详解一、基本用法(pop_back( ),push_back(value))基本使用方法：pop_back() 删除vector的最后一个元素push_back(value) 将value放到vector的最后#include#includeusing namespace std;int main(){ vector myvector; for

2014-02-10 20:00:41 889

原创 [叉乘]USCOJ 1016 多边形面积

传送门：多边形面积1016: 多边形面积Description给出一个多边形的顶点坐标，请计算出这个多边形的面积 (不一定是凸多边形) 。Input　　　输入的第一行为一个正整数t ( t第一行为一个正整数n ( 3Output　　　每组数据输出一行，为一个保留一位小数的实数，即当前多边形的面积。

2014-02-10 15:47:30 1320

原创 [数论]HDU 1452 Happy 2004 素因子分解+快速幂模+乘法逆元

传送门：Happy 2004Happy 2004Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 882 Accepted Submission(s): 620Problem Description

2014-02-10 14:19:02 883

原创 [数论] HOJ 2947 Calculation 2 欧拉函数

传送门：Calculation 2Calculation 2My Tags (Edit) Source : GTmac Time limit : 1 sec Memory limit : 64 MSubmitted : 221, Accept

2014-02-10 13:19:26 698

原创 [数论] POJ 3090/HOJ 2416 Visible Lattice Points 欧拉函数

传送门:Visible Lattice PointsVisible Lattice PointsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5126 Accepted: 2978DescriptionA lattice point

2014-02-10 13:03:22 690

原创 [数论] HOJ 1953 Relatives 欧拉函数

传送门：RelativesRelativesMy Tags (Edit) Source : Waterloo ACM Programming Contest June 1, 2002 Time limit : 1 sec Memory limit : 32 M

2014-02-10 12:50:29 692

原创 HOJ 2022 Mersenne Composite Numbers

Mersenne Composite NumbersMy Tags (Edit) Source : ACM ICPC Pacific Northwest 2004 Time limit : 1 sec Memory limit : 32 MSubmi

2014-02-09 22:51:18 717

原创 [数论] HOJ 2561 MaoLaoDa Number 筛素数

传送门：MaoLaoDa NumberMaoLaoDa NumberMy Tags (Edit) Source : MaoLaoDa Time limit : 5 sec Memory limit : 64 MSubmitted : 711,

2014-02-09 21:20:11 793

原创 [数论] HOJ 1528/ZOJ 1823 Factoring Large Numbers

传送门：Factoring Large NumbersFactoring Large NumbersTime Limit: 2 Seconds Memory Limit: 65536 KBOne of the central idea behind much cryptography is that factoring large numbers is compu

2014-02-09 20:33:40 885 1