thoughtspark的博客

#include #include using namespace std; const int mx=10000+5; int n,ans[mx],vis[mx]; void dfs(int len) {  int i;    if(len>n)  {   for(i=1;i   {    cout    if(i==n)    cout    else

FFF at Valentine Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1065    Accepted Submission(s): 510 Problem Description At Valen

Oil Deposits Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 33493    Accepted Submission(s): 19462 Problem Description The GeoSu