PKU OJ 1002 487-3279 487-3279 Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialin…

时间限制:1 秒 内存限制:32 兆 特殊判题:否 提交:18410 解决:4753 题目描述: Grading hundreds of thousands of Graduate Entrance Exams is a hard work. It is even harder to design a process to make the results as fair as possible. One way is to assign each exam problem to 3 indep…

题目连接: http://www.lightoj.com/volume_showproblem.php?problem=1002 题目描述: 有n个城市,从0到n-1开始编号,n个城市之间有m条边,中心城市为t,问每个城市到中心城市的最小路径的花费,路径花费大小的定义为:一条路上花费最大的边的值. 解题思路: Dijkstra的变形,用Dijkstra求出来的单源路径可以保证每条边都是最优的,所以最短路上的最长边就是所求. #include <algorithm> #include <i…

题目描述: 给定两个正整数a.b(0 < a,b < =10000),求出a+b的和 输入描述: 多组输入,每组输入为一行,里面有2个数a,b(0 < a,b < =10000) 输出描述: 对于每一组输入,输出一个值为该组a+b的和 样例输入:1 22 3 样例输出:35 解答 #include<stdio.h> int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF){ if(a&g…

这个估计是里面第二简单的了,因为第一简单的是求a+b 哈哈,一submit就ac了 题目如下: Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to…

ExponentiationTime Limit: 500MS                      Memory Limit: 10000KTotal Submissions: 155886        Accepted: 37967 Description Problems involving the computation of exact values of very large magnitude and precision are common. For example, th…

#include <stdio.h> #include <string.h> int main(void) { int q,j,h,k,l; int d; ],s2[];//题目要求位数不大于1000 scanf("%d",&h); ;l<=h;l++){ ]={}, a[]={},b[]={};//这样可以令数组内全部元素为0 scanf("%s %s",&s1,&s2); int cd1,cd2,cd3,cd…

#include<iostream> #include<queue> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; ][]; int main(){ int P,T,G1,G2,G3,GJ; while(cin>>P>>T>>G1>>G2>>…

#include <iostream> #include <algorithm> using namespace std; int nCases; ], n[]; ], b[]; int main() { scanf("%d", &nCases); ; i <= nCases; ++i) { memset(m, , sizeof(m)); memset(n, , sizeof(n)); getchar(); scanf("%s %s&qu…

http://bailian.openjudge.cn/tm2018/G/ #include <iostream> #include <vector> #include <string> using namespace std; const int N = 2001; bool flag = false; //父亲节点 int Father[N]; // 要想与根节点之间的关系如何表示?可以用0表示与根节点同性别, //用1表示与根节点是不同性别,可以用%2,来判断两只…