ACM练习
日常练习
牧心.
心之所向,素履以往
展开
-
ACM各题型OJ题目总结 POJ、ZOJ、HDU
本帖题目类型:目录1、递归与分治(27)2、动态规划类问题(189题)3、贪心算法类问题(79)4、回溯算法(36)5、图的搜索(98)6、图论(85)7、数论(117)8、组合数学(99)9:、分支限界算法(14)推荐网站:https://vjudge.net/下面给出各题型的部分例题。注:1.题目来源于ZOJ,POJ和HUD;...原创 2017-08-02 20:47:04 · 42357 阅读 · 0 评论 -
POJ - 3630 Phone List
DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue listed these numbers:Emergency 911 Ali...原创 2020-04-20 21:26:22 · 33400 阅读 · 0 评论 -
SPOJ - TEAM2 A Famous ICPC Team
DescriptionMr. B, Mr. G, Mr. M and their coach Professor S are planning their way to Warsaw for the ACM-ICPC World Finals. Each of the four has a square-shaped suitcase with side length Ai(1 <=...原创 2020-04-22 14:16:22 · 33316 阅读 · 0 评论 -
计蒜客 - T1125 判断字符串是否为回文
Description输入一个字符串,输出该字符串是否回文。回文是指顺读和倒读都一样的字符串。输入格式输入为一行字符串(字符串中没有空白字符,字符串长度不超过100100)。输出格式如果字符串是回文,输出"yes";否则,输出"no"。输出时每行末尾的多余空格,不影响答案正确性样例输入abcdedcba样例输出yes#incl...原创 2020-04-22 14:16:13 · 33541 阅读 · 0 评论 -
UVA - 815 Flooded!
DescriptionInputOutputSample InputSample Output#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int a[1000];int main...原创 2020-04-22 14:16:04 · 33281 阅读 · 0 评论 -
UVA - 725 Division 【暴力枚举】
Description#include <stdio.h>#include <string.h>int vd[10];bool check(int a, int b){ int x; if (a < 10000 || b < 10000) vd[0] = 1; while (a){ ...原创 2020-04-22 14:15:55 · 33388 阅读 · 0 评论 -
UVA - 712 S-Trees
Description#include <iostream>#include <cstdio>#include <cstring>using namespace std;char s[10000], a[10000];int ans[10000];int main() { int n, m, cnt ...原创 2020-04-21 20:39:45 · 33261 阅读 · 0 评论 -
UVA - 679 Dropping Balls 【二叉树的编号】
Description【解析】对于一个结点 k,其左子节点、右子结点的编号分别是 2k 和 2k+1。每个小球都会落在根结点上,因此前两个小球必然是一个在左子树,一个在右子树。一般地,只需看小球编号的奇偶性,就能知道它最终在哪棵子树中。对于那些落在根结点左子树的小球来说,只需知道该小球是第几个落在左子树里的,就可以知道它下一步往左还是往右了。依此类推,直...原创 2020-04-13 00:55:49 · 33097 阅读 · 0 评论 -
UVA - 673 Parentheses Balance 【栈】
Description#include <iostream>#include <cstdio>#include <stack>#include <cstring>using namespace std;int main(){ char str[150]; int n, len, flag; sc...原创 2020-04-21 20:39:34 · 33021 阅读 · 0 评论 -
UVA - 536 Tree Recovery
Description#include <cstdio>#include <cstring>using namespace std;void postorder(int len, char *pr, char *in, char *po){ if(len <= 0) return ; int p, i;...原创 2020-04-21 20:37:43 · 33458 阅读 · 0 评论 -
UVA - 524 Prime Ring Problem
Description#include <cstdio>#include <cmath>using namespace std;int n, t = 0;int a[100] = {0};int vis[50] = {0};//是否被使用过的标志int isp[100] = {0};int is_prime(int x){ int ...原创 2020-04-21 20:37:36 · 33410 阅读 · 0 评论 -
UVA - 514 Rails
Description#include <cstdio>using namespace std;int a[1005] = {0}, b[1005] = {0};int main() { int i, j, k, n; while(scanf("%d", &n) && n) { while(sc...原创 2020-04-21 20:37:29 · 33249 阅读 · 0 评论 -
UVA - 489 Hangman Judge 【模拟】
Description#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main() { char str[100],s[100]; int t; int lenstr, lens; ...原创 2020-04-21 20:37:23 · 33290 阅读 · 0 评论 -
OpenJ_Bailian - 4070 全排列
Description对于数组[1, 2, 3],他们按照从小到大的全排列是1 2 31 3 22 1 32 3 13 1 23 2 1现在给你一个正整数n,n小于8,输出数组[1, 2,…,n]的从小到大的全排列。Input输入有多行,每行一个整数。当输入0时结束输入。Output对于每组输入,输出该组的全排列。每一行是一种可能的排列,...原创 2020-04-21 20:37:17 · 33753 阅读 · 0 评论 -
OpenJ_Bailian - 4013 中位数
Description中位数定义:一组数据按从小到大的顺序依次排列,处在中间位置的一个数或最中间两个数据的平均值(如果这组数的个数为奇数,则中位数为位于中间位置的那个数;如果这组数的个数为偶数,则中位数是位于中间位置的两个数的平均值).给出一组无序整数,求出中位数,如果求最中间两个数的平均数,向下取整即可(不需要使用浮点数)Input该程序包含多组测试数据,每一组测试数据的第一...原创 2020-04-21 20:37:09 · 33369 阅读 · 0 评论 -
OpenJ_Bailian - 3708 1的个数 【进制转换】
Description给定一个十进制整数N,求其对应2进制数中1的个数Input第一个整数表示有N组测试数据,其后N行是对应的测试数据,每行为一个整数。OutputN行,每行输出对应一个输入。Sample Input42100100066Sample Output1362#include <stdio.h>...原创 2020-04-21 20:37:04 · 33431 阅读 · 0 评论 -
POJ - 3696 The Luckiest number 【欧拉函数】
DescriptionChinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky numberL. Now he wants to construct his luckiest number which is the minimum amo...原创 2020-04-13 01:43:26 · 33370 阅读 · 0 评论 -
POJ - 2891 Strange Way to Express Integers 【扩展欧几里得】
DescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:Choosekdifferent positive integersa1...原创 2020-04-13 01:44:10 · 33413 阅读 · 0 评论 -
UVA - 272 TEX Quotes
Description#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ char c; int q=1; while((c=getchar())!=EOF) { ...原创 2020-04-20 21:25:59 · 33478 阅读 · 0 评论 -
UVALive - 2651 ISBN
#include <stdio.h>#include <string.h>char s[20];int main(){ int last; int w; int sum; while (~scanf("%s", s)){ w = 10; sum = 0; ...原创 2020-04-20 21:25:54 · 33351 阅读 · 0 评论 -
Longge's problem POJ - 2480
DescriptionLongge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 < N &l...原创 2020-04-20 21:25:50 · 33528 阅读 · 0 评论 -
POJ - 2406 Power Strings
DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentia...原创 2020-04-20 21:25:45 · 33528 阅读 · 0 评论 -
UVA - 232 Crossword Answers
Description#include <cstdio>#include <cstring>#include<ctype.h>struct As{ int x,y; int Num;}A[400];struct Dn{ int x,y; int Num;}D[400];...原创 2020-04-20 21:25:40 · 33351 阅读 · 0 评论 -
UVA - 227 Puzzle
DescriptionA children’s puzzle that was popular 30 years ago consisted of a 5×5 frame which contained 24 small squares of equal size. A unique letter of the alphabet was printed on each small squar...原创 2020-04-20 21:24:27 · 33390 阅读 · 0 评论 -
HYSBZ - 2208 连通数
DescriptionInput输入数据第一行是图顶点的数量,一个正整数N。 接下来N行,每行N个字符。第i行第j列的1表示顶点i到j有边,0则表示无边。Output输出一行一个整数,表示该图的连通数。Sample Input3 010 001 100Sample Output9Hint对于100%的数据,N不超过2000。#i...原创 2020-04-20 21:24:21 · 33513 阅读 · 0 评论 -
POJ - 2115 C Looooops 【扩展欧几里得】
DescriptionA Compiler Mystery: We are given a C-language style for loop of typefor (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to va...原创 2020-04-20 21:24:14 · 33606 阅读 · 0 评论 -
ZOJ - 2109 FatMouse' Trade 【贪心】【背包】
DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i]...原创 2020-04-20 21:24:09 · 33251 阅读 · 0 评论 -
FZU - 2020 组合
Description给出组合数C(n,m), 表示从n个元素中选出m个元素的方案数。例如C(5,2) = 10, C(4,2) = 6.可是当n,m比较大的时候,C(n,m)很大!于是xiaobo希望你输出 C(n,m) mod p的值!Input输入数据第一行是一个正整数T,表示数据组数 (T <= 100) 接下来是T组数据,每组数据有3个正整数 n, m, p (1...原创 2020-04-19 21:29:39 · 33316 阅读 · 0 评论 -
ZOJ - 1906 Relatives 【欧拉函数】
DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z &g...原创 2020-04-19 21:29:37 · 32986 阅读 · 0 评论 -
HihoCoder - 1704 循环数组
Description给定包含N个整数的数组A1, A2, ... AN,你可以选择任意一个Ai,将Ai旋转到数组第一项,即将数组变成:Ai, Ai+1, Ai+2, ... AN, A1, A2, ..., Ai-1现在小Hi希望旋转之后的数组满足:对于任意K(1 ≤ i ≤ N),前K项的和都是正数。 例如对于A=[3, -5, 2, -2, 3, 0],旋转成[3...原创 2020-04-19 21:29:16 · 32035 阅读 · 0 评论 -
UVA - 1640 The Counting Problem
DescriptionGiven two integers a and b, we write the numbers between a and b, inclusive, in a list. Your task is to calculate the number of occurrences of each digit. For example, if a = 1024 and b ...原创 2020-04-19 21:29:12 · 32273 阅读 · 0 评论 -
UVA - 1589 Xiangqi
DescriptionInputThe input contains no more than 40 test cases. For each test case, the first line contains three integers representing the number of red pieces N (2 ≤ N ≤ 7) and the positio...原创 2020-04-19 21:29:08 · 31992 阅读 · 0 评论 -
UVA - 1587 Box
DescriptionInputInput file contains several test cases. Each of them consists of six lines. Each line describes one pallet and contains two integer numbers w and h (1 ≤ w, h ≤ 10 000) — width...原创 2020-04-19 21:29:04 · 31844 阅读 · 0 评论 -
UVA - 1586 Molar mass 【字符串处理】
DescriptionInputYour program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case is given in...原创 2020-04-19 21:28:56 · 32201 阅读 · 0 评论 -
UVA - 1584 Circular Sequence
DescriptionSome DNA sequences exist in circular forms as in the following figure, which shows a circular sequence “CGAGTCAGCT”, that is, the last symbol “T” in “CGAGTCAGCT” is connected to the firs...原创 2020-04-19 21:28:52 · 32203 阅读 · 0 评论 -
UVA - 1585 Score
DescriptionThere is an objective test result such as “OOXXOXXOOO”. An ‘O’ means a correct answer of a problem and an ‘X’ means a wrong answer. The score of each problem of this test is calculated b...原创 2020-04-19 21:28:47 · 32247 阅读 · 0 评论 -
HRBUST - 1569 比赛排名
Description有n个同学参加了一场比赛,每个同学都有一个确定的名字。并且每个人都一个得分,但可能由于一些犯规导致扣分,所以最终的实际得分为总得分减去犯规扣分。如一个人得分为100,扣分为10,那么实际得分为90。现在需要你来为这n个人确定比赛排名。Input第一行是一个整数t(t<=20),代表t组测试数据,接下来有t组测试数据。对于每组测试数据,第...原创 2020-04-19 21:28:44 · 32378 阅读 · 0 评论 -
UVA - 1374 Power Calculus 【DFS】
DescriptionInputThe input is a sequence of one or more lines each containing a single integer n. n is positive and less than or equal to 1000. The end of the input is indicated by a zero.O...原创 2020-04-18 22:30:09 · 32015 阅读 · 0 评论 -
UVA - 11988 Broken Keyboard (a.k.a. Beiju Text)
DescriptionYou’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key or the “end” key gets automatically p...原创 2020-04-18 21:37:33 · 32219 阅读 · 0 评论 -
HRBUST - 1182 栈
Description给定一个从1开始的连续整数列1、2、3、4......n。将上述数列按顺序入栈,中途栈顶元素可以出栈。再给定一个出栈序列,判断此序列是否合法。例如,将n设为4。即得到数列1、2、3、4。再给定出栈序列1、3、4、2。可以看出,此出栈序列合法。过程如下,先将数列1、2、3、4中的元素1入栈,再将其出栈。然后将元素2、3入栈,将元素3出栈。...原创 2020-04-18 21:37:29 · 32330 阅读 · 0 评论