Description Given a positive integer n, find two non-negative integers a, b such that a2 + b2 = n. Input The first line contains the number of test cases T (1 <= T <= 1000). For each test case, there is only one line with an integer n (1 <= n <…
Genealogical tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7285 Accepted: 4704 Special Judge Description The system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. T…
这里提供了洛谷某些题的$special\ judge$,供需要的oier拿过去对拍. 1.P3825 #include "testlib.h" using namespace std; int n,d; ]; int m; ]; int pi,pj,hi,hj; char opt; char opt1,opt2; int main(int argc ,char* argv[]) { registerTestlibCmd(argc,argv); n=inf.readInt(); d=in…
Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 14021 Accepted: 5484 Special Judge Description Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the c…
2019-11-07 09:25:45 C.树之呼吸-叁之型-树上两点路径长度 Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 7 (4 users) Total Accepted: 2 (2 users) Special Judge: No Description 给一棵 n 个结点的树,结点编号从 1 到 n,并指定 m 号结点为根: 给出 q 个询问,每次询问从编号为 x 的结点到编号为 y 的结点的路径长度. Input 输…
1017 - Exact cover Time Limit: 15s Memory Limit: 128MB Special Judge Submissions: 5851 Solved: 3092 DESCRIPTION There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selection of rows such that every column has a 1 in e…
Marriage is Stable Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1047 Accepted Submission(s): 563Special Judge Problem Description Albert, Brad, Chuck are happy bachelors who are in love wi…
Breaking Biscuits 时间限制: 1 Sec 内存限制: 128 MB Special Judge提交: 70 解决: 26[提交] [状态] [讨论版] [命题人:admin] 题目描述 This year, Walter’s workplace resolved to try something radically different: they’re going to change the weekly order of biscuits for the break r…
题目地址:http://poj.org/problem?id=1419 Graph Coloring Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4468 Accepted: 2042 Special Judge Description You are to write a program that tries to find an optimal coloring for a given graph. Col…
Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6651 Accepted: 2910 Special Judge Description The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000…
网络 Time Limit: 1000 MS Memory Limit: 65535 K Total Submit: 103(32 users) Total Accepted: 54(31 users) Rating: Special Judge: No Description 一个电话公司建立了一个新的电话网,他们用1——N的整数标记了一些地方,每个地方有唯一的编号,网络中的每条电缆双向连接了两个地方,从每个地方可以通过电缆连接到任意其他的地方,因为它们之间不一定要有直接相连的电缆,可…
Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 14103 Accepted: 5528 Special Judge Description Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the c…
Highways description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a number of highways connecting som…
比如将如图中的HUSTOJ进行修改: 在Linux上修改,通过关键字搜索,会获取如下两个重要文件,找到都有的文字进行修改即可: grep -rn "HUSTOJ" * cd /home/judge/src/web vim include/db_info.inc.php 修改标题 vim template/bs3/js.php 修改底部…
B.树之呼吸-贰之型-dfs序 Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 42 (16 users) Total Accepted: 22 (15 users) Special Judge: No Description 给一棵 n 个结点的树,结点编号从 1 到 n,并指定 m 号结点为根: 请你输出这棵树长度为 2*n 的 dfs 序: 注意:在深度优先遍历面对多条分支时,请按结点编号从小到大依次遍历. Input 输入第…
Watchcow Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 9974 Accepted: 4307 Special Judge Description Bessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoer…
