kyoma的博客

Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30099 Accepted: 15044DescriptionDue to recent rains, water has pooled in various places i

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48535    Accepted Submission(s): 18026Problem Description某省自从实行了很多年的畅通工程计划后

1097:Yuchang and Zixiang ‘s mazeTime Limit: 2 Sec  Memory Limit: 128 MBSubmit: 937  Solved: 166[Submit][Status][Web Board]DescriptionOne day ,  Yuchang and Zixiang go out of school to

递增数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 921    Accepted Submission(s): 196Problem Description若一个正整数A，相邻位总是满足低位大于等于高位，

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28704 Accepted: 11898 Special JudgeDescriptionGiven a positive integer n, write a

FliptileTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8632 Accepted: 3230DescriptionFarmer John knows that an intellectually satisfied cow is a happ

Shredding CompanyTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 679    Accepted Submission(s): 222Problem DescriptionYou have j

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 116519    Accepted Submission(s): 31594Problem DescriptionThe

N皇后问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21710    Accepted Submission(s): 9709Problem Description在N*N的方格棋盘放置了N个皇后，使得

逃离迷宫Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25424    Accepted Submission(s): 6204Problem Description　　给定一个m × n (m行, n列)

阿三们的oj呢，第一次印度的题。托这个服，根本查不到题解呢^q^。D题想了一半没有继续下去，太可惜了。。。。有意思的阿三oj的题号居然不是数字，而是字母组成的，o mo shi ro iA - Grid （spoj id：SERGRID）You are on an nxm grid where each square on the grid has a digi

C. Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a

A - Airport Bus時間制限 : 2sec / メモリ制限 : 256MB配点 : 300 点問題文高橋空港には，毎日飛行機で N 人の乗客が到着します． i 番目の乗客は時刻 Ti に到着します．高橋空港に到着する乗客は全員バスで市内へ移動します．どのバスも定員は C 人であり，C 人以下の乗客を乗せることができます． 飛行機の乗客は，飛

详细内容翻阅紫书p148～p155#include #include #include #include #include #include #include using namespace std;int d,I;const int maxn = 1048586;int main(){ int i,t,k; scanf("%

交题地址难度按照顺序递增J - Judging Moose 队友敲的#include #include using namespace std;int main(){ int l, r; while(~scanf("%d %d", &l, &r)){ if(l == r && l != 0){ printf("Even ");

专题链接A:Eight经典的八数码问题，这题直接bfs是不行的，时限不够，主要是在每个状态判重的时候使用map，在这里的复杂度可以通过康托展开来达到查重O（1），那么！什么是康托展开呢？！ 我觉得这个博客写的很好，总之康托展开用来看当前状态中在全排列中是第几个，可以把问题的全部状态不用map来表示 这题hdu是多组样例输入，poj则单组。 本来网上写做这题要有八境界，把代码写八遍

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48534    Accepted Submission(s): 18025Problem Description某省自从实行了很多年的畅通工程计划后

问题 A: Unhappy sion时间限制: 1 Sec  内存限制: 128 MB提交: 335  解决: 153[提交][状态][讨论版]题目描述After 2rd ccpc,UNCLE RAN give sion a task,sion have to set 10 questions for this contest.But as a acm fan,

RescueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27252    Accepted Submission(s): 9662Problem DescriptionAngel was caught b

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27238 Accepted: 10679DescriptionYou are trapped in a 3D dungeon and need to find the qui

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 77295 Accepted: 24435DescriptionFarmer John has been informed of the location of a fugit

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36938 Accepted: 18203Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编

DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11450 Accepted Submission(s): 4614Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyo

JugsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4923 Accepted: 2883 Special JudgeDescriptionIn the movie "Die Hard 3", Bruce Willis and Samuel

/* ━━━━━┒ ┓┏┓┏┓┃μ'sic foever!! ┛┗┛┗┛┃＼○／ ┓┏┓┏┓┃ / ┛┗┛┗┛┃ノ) ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┛┗┛┗┛┃ ┓┏┓┏┓┃ ┃┃┃┃┃┃ ┻┻┻┻┻┻ */#include #include #include #include #include #include

Ancient GoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1660    Accepted Submission(s): 528Problem DescriptionYu Zhou likes to

Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5657 Accepted: 3175DescriptionYou have just been put in charge of developing a new sh

D. Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has an exam period which will continue for

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41219 Accepted: 17896DescriptionFlip game is played on a rectangular 4x4 field with two-sided

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24732 Accepted: 9535 Special JudgeDescriptionThe game “The Pilo

比赛地址A - AKIBAxjb写#include <iostream>#include <cstring>#include <cstdio>#include <cmath>#include <vector>#include <map>#include <algorithm>#include <queue>using namespace std;char in[100];int