题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1016 题目大意:有n个数字,编号分别为1-n.要组成一个素数环.素数环就是相邻两个值加起来...ACM的输入输出建议全部使用C风格的.因为C++的相比较慢,即使写了ios...
题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1016 题目大意:有n个数字,编号分别为1-n.要组成一个素数环.素数环就是相邻两个值加起来...ACM的输入输出建议全部使用C风格的.因为C++的相比较慢,即使写了ios...
标签: acm
畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 40187 Accepted Submission(s): 14868 Problem Description 某省自从实行了很多年的...
#include<iostream> #include<string.h> using namespace std; int main() { char a[12][12]; //必须用char型 char b[12][12]; char c[12][12];... long long n,...
题意很纠结。。。说的是1...n这些人登台,每个人有个吊丝值D[i],如果i号人第k个登台,那么他的愤怒值就是(k-1)*D[i]。现在有一个栈,可以先把i前边的人依次次进栈,然后让第i号人登台,然后在选择是栈里的同学登台...
ACM1012
#include <stdio.h> int main() { int i, j, t, n, m, ans; scanf("%d", &t); while(t--) { scanf("%d%d", &n, &m); ans = 0; for(i=0; i<=n; i++) for(j=0;...=n-...
1 推荐题库 ...美国的OI 题库,如果是刚入门的新手,可以尝试先把它刷通,能够学到几乎全部的基础算法极其优化,全部的题解及标程还有题目翻译可以baidu 一个叫NOCOW 的网站。 ...上面有全部的赛区真题,绝大部分都可以...
标签: ACM
人见人爱A^B Problem Description 求A^B的最后三位数表示的整数。 说明:A^B的含义是“A的B次方” Input 输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1,B),如果A=0, ...
#include #include using namespace std; int main() { int n; int m; int temp; int ave; while(cin>>n) { int sum=0; int num=0; cin>>m;
Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4642 Accepted: 2020 Special Judge ...The input contains N natural (i.e....
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root....
Milk Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15697 Accepted Submission(s): 3947 Problem Description ...Ignatius drinks milk eve
这道题说白的就是求最大值的升级版,大家可以使用String.h的strcmp函数 #include <iostream> #include <string.h> #include<string> using namespace std; int main() { int n;...
Pku acm 第1458题 Common Subsequence 代码,有详细的注释,动态规划
有效实现电路的智能化控制,让用电更安全更智能
10个名额限时开放中(申请截止日期12月10日)
Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 36359 Accepted Submission(s): 15863 ...Problem Descriptio
这是一道求两个整数最大公倍数的问题,题目比较简单.... 直接使用穷举法计算,数据不是很大.... #include "iostream" using namespace std; int main(void) { int a1,a2; int i;... ...
Number Sequence Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11447 Accepted Submission(s): 5217 Problem Description ...Given tw
最短距离求解 求解最短距离,使用广度优先搜索和优先队列结合 使用visted数组记录是该层某节点否访问过。由于是保存在优先队列中,只要该层前面的路径有访问该节点,则一定是到达该节点的最短距离。...
find the nth digitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14801 Accepted Submission(s): 4572Problem Description假设:S1 = 1S2 = 12S3...
A == B ? Problem Description Give you two numbers A and B, if A is equal to B, you should print "YES", or print "NO". ...each test case contains two numbers A and B. ...for each cas
Max Num Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10955 Accepted Submission(s): 7036 Problem Description There are some st
http://acm.pku.edu.cn/JudgeOnline/problem?id=2318 POJ 2398 Toy Storage(推荐) http://acm.pku.edu.cn/JudgeOnline/problem?id=2398 一个矩形,有被若干直线分成N个格子,给出一个点的坐标,问你该点位于
Problem Description we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26; Give you a letter x and a number y , you should output the result of y+f(x). ...
数值统计 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40940 Accepted Submission(s): 21083 Problem Description 统计给定的n个数中,负数、零和...
Picture Problem Description Give you the width and height of the rectangle,darw it. ...Input contains a number of test cases.For each case ,there are two numbers n and m (0 ...For
#include<stdio.h> int main() { int a=0,b=0; int m,n; int t; while(scanf("%d%d",&m,&n)!=EOF) { a=0; b=0; if(m>n) { t=m; m=n; n=t; } f...
题目链接 Description Rinne dreads sunlight, so she wants to find a refuge with the weakest sunlight. The place where Rinne stay now can be described as a tree with nn vertices. A tree is an ...