https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=355 题目:每行25个字符,左开始为X,右边也是X,中间为空格B:当所有行的左右X相互向内移动,直到有一行左右X相遇:这时所有行中间一共还有多少空格B. 思路:中间空格最少的行一定最先相遇,即X最多的行最先相遇:当X最多行相遇时,每行减少的空格数相同,则用X最…

Sample Input (character "B" for ease of reading. The actual input file will use the ASCII-space character, not"B"). 4 XXXXBBBBBBBBBBBBBBBBXXXXX XXXBBBBBBBBBBBBBBBXXXXXXX XXXXXBBBBBBBBBBBBBBBBXXXX XXBBBBBBBBBBBBBBBBBXXXXXX 2 XXXXXXXXXXX…

uva414 - Machined Surfaces /* 水题,值得一提的是,getline使用时注意不能让它多吃回车键,处理方法可以用getchar. */ #include <iostream> #include <cstdio> #include <algorithm> using namespace std; int main() { int n; while (cin >> n, n) { getchar(); //第一个回车键会被getline…

Language : C++ 4.8.2 #include<stdio.h> #include<string.h> int main(void) { int n; int sum; // 记录每一组数据里面所有空格的个数 int count; // 记录单行的个数 int length; int min_space; ]; ) { min_space = ; sum = ; scanf("%d\n", &n); // 注意这里scanf里面的'\n',它…

AOAPC I: Beginning Algorithm Contests (Rujia Liu) Volume 0. Getting Started 10055 - Hashmat the Brave Warrior 153793   27.33% 33385   85.74% 10071 - Back to High School Physics 76581   50.07% 28855   93.71% 10300 - Ecological Premium 26621   66.39% 1…

题目 Volume 0. Getting Started 开始10055 - Hashmat the Brave Warrior 10071 - Back to High School Physics 10300 - Ecological Premium 458 - The Decoder 494 - Kindergarten Counting Game 414 - Machined Surfaces 490 - Rotating Sentences 445 - Marvelous Mazes…

acm之pku题目分类 对ACM有兴趣的同学们可以看看 DP:  1011   NTA                 简单题  1013   Great Equipment     简单题  1024   Calendar Game       简单题  1027   Human Gene Functions   简单题  1037   Gridland            简单题  1052   Algernon s Noxious Emissions 简单题  1409   Commun…

各种杂题,水题,模拟,包括简单数论. 1001 A+B 1002 A+B+C 1009 Fat Cat 1010 The Angle 1011 Unix ls 1012 Decoding Task 1019 Grandpa's Other Estate 1034 Simple Arithmetics 1036 Complete the sequence! 1043 Maya Calendar 1054 Game Prediction 1057 Mileage Bank 1067 Rails 10…

以下是poj百道水题,新手可以考虑从这里刷起 搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight Moves1101 Gamblers1204 Additive equations 1221 Risk1230 Legendary Pokemon1249 Pushing Boxes 1364 Machine Schedule1368 BOAT1406 Jungle Roads1411 Annive…

说明:关于Uva的题目,可以在vjudge上做的,不用到Uva(那个极其慢的)网站去做. 最小瓶颈路:找u到v的一条路径满足最大边权值尽量小 先求最小生成树,然后u到v的路径在树上是唯一的,答案就是这条路径. Uva 534 Frogger Time Limit: 3000MS 64bit IO Format: %lld & %llu Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly h…