摘要:
Girls and Boys Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13762 Accepted Submission(s): 64 阅读全文
摘要:
YJJ's Salesman Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1258 Accepted Submission(s): 445 P 阅读全文
摘要:
Problem Description The Power Cube is used as a stash of Exotic Power. There are n cities numbered 1,2,…,n where allowed to trade it. The trading pric 阅读全文
摘要:
#include const int inf=0x3f3f3f3f; const int maxn=1e5+5; struct edge{ int u,v;//两个点 int w; //权值 Edge(int _u = 0, int _v = 0, int _w = 0): u(_u), v(_v), w(_w) {} }; int dis[maxn];//松... 阅读全文
摘要:
Find the result of the following code: long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j = i; j <= n; j++ 阅读全文
摘要:
Longge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem c 阅读全文