题目链接:http://bailian.openjudge.cn/practice/1007 #include<stdio.h> #include<algorithm> using namespace std; typedef struct number{ char s[51]; int num; }; int n,len; number myn[101]; bool cmp( number a, number b ) { return a.num < b.num; } in…
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…
这个估计是里面第二简单的了,因为第一简单的是求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…
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,来判断两只…
