Gxjun

摘要： 吉哥系列故事——临时工计划Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2684Accepted Submission(s): 1033Problem Description 俗话说一分钱难倒英雄汉，高中几年下来，吉哥已经深深明白了这个道理，因此，新年开始存储一年的个人资金已经成了习惯，不过自从大学之后他不好意思再向大人要压岁钱了，只能把唯一的希望放到自己身上。可是由于时间段的特殊性和自己能力的因素，只能找到些零零碎碎的工作，吉哥想知道怎么. 阅读全文

摘要： The Frog's GamesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3263Accepted Submission(s): 1596Problem DescriptionThe annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Tr 阅读全文

摘要： The kth great numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6020Accepted Submission(s): 2436Problem DescriptionXiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao 阅读全文

摘要： Error: could not open `C:\Program Files\Java\jre6\lib\i386\jvm.cfg')jdkerror前些日子装了个jdk7试了试，后来做项目需要换成jdk6，安装完jdk6，设置完环境变量后出现问题。运行java -version出现Error: could not open `C:\Program Files\Java\jre7\lib\i586\jvm.cfg')，运行javac -version则是正常的javac 1.6.0_32。google之发现解决办法是删除c:\windows\system32\java，c:\ 阅读全文

摘要： 小明系列故事——买年货Time Limit: 5000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2146Accepted Submission(s): 953Problem Description 春节将至，小明要去超市购置年货，于是小明去了自己经常去的都尚超市。 刚到超市，小明就发现超市门口聚集一堆人。用白云女士的话说就是：“那家伙，那场面，真是人山人海，锣鼓喧天，鞭炮齐呤，红旗招展。那可真是相当的壮观啊！”。好奇的小明走过去，奋力挤过人群，发现超市门口贴了一张通.. 阅读全文

摘要： import javax.swing.JOptionPane;public class gong { public static void main(String [] args){ JOptionPane.showMessageDialog(null, "你是一只小王八！");} } 阅读全文

摘要： 【网络综合 - 校园招聘试题】一、选择题：15 分 共 10 题1. 在排序方法中，关键码比较次数与记录地初始排列无关的是：A. Shell 排序 B. 归并排序 C. 直接插入排序 D. 选择排序选择 A2. 以下多线程对 int 型变量x的操作，哪几个需要进行同步：A. x=y; B. x++; C. ++x; D. x=1;选择 B, C3. 代码void func(){static int val;…}中，变量 val 的内存地址位于：A. 已初始化数据段 B.未初始化数据段 C.堆 D.栈选择 A4. 同一进程下的线程可以共享以下：A. stack B. data section C 阅读全文

摘要： EXCEL排序Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12595Accepted Submission(s): 4955Problem DescriptionExcel可以对一组纪录按任意指定列排序。现请你编写程序实现类似功能。Input测试输入包含若干测试用例。每个测试用例的第1行包含两个整数 N ( 2 #include 3 #include 4 const int maxn=100010; 5 struct student 6 阅读全文

摘要： The trouble of XiaoqianTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1076Accepted Submission(s): 355Problem DescriptionIn the country of ALPC , Xiaoqian is a very famous mathematician. She is immersed in calculate, and she want to use the minimum 阅读全文

摘要： 跳舞毯Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2925Accepted Submission(s): 1385Problem Description由于长期缺乏运动，小黑发现自己的身材臃肿了许多，于是他想健身，更准确地说是减肥。小黑买来一块圆形的毯子，把它们分成三等分，分别标上A,B,C，称之为“跳舞毯”，他的运动方式是每次都从A开始跳，每次都可以任意跳到其他块，但最后必须跳回A，且不能原地跳.为达到减肥效果，小黑每天都会坚持跳n次，有 阅读全文

摘要： 1 J2me开发网 http://www.j2medev.com/bbs/index.asp2 J2me社区 http://www.j2meforums.com/forum/3 csdn http://www.csdn.net/4 Vc知识库 http://www.vckbase.com/5 codeproject http://www.codeproject.com/6 程序员联合开发网 http://www.pudn.com/7 看雪学院 http://www.pediy.com/8 蓝色理想 http://www.blueidea.com/9 博客园 http://ww... 阅读全文

摘要： 进行java开发，首先要安装jdk，安装了jdk后还要进行环境变量配置：1、下载jdk（http://java.sun.com/javase/downloads/index.jsp），我下载的版本是：jdk-6u14-windows-i586.exe2、安装jdk-6u14-windows-i586.exe3、配置环境变量：右击“我的电脑”-->"高级"-->"环境变量"1）在系统变量里新建JAVA_HOME变量，变量值为：C:\Program Files\Java\jdk1.6.0_14（根据自己的安装路径填写）2）新建classpath变 阅读全文

摘要： FATETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6553Accepted Submission(s): 3016Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐 阅读全文

摘要： CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5936Accepted Submission(s): 2458Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He dec 阅读全文

摘要： RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9563Accepted Submission(s): 3575Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because the 阅读全文

摘要： 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12605Accepted Submission(s): 5315Problem Description急！灾区的食物依然短缺！为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你一共有资金n元，而市场有m种大米，每种大米都是袋装产品，其价格不等，并且只能整袋购买。请问：你用有限的资金最多能采购多少公斤粮食呢？后记：人生 阅读全文

摘要： Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9768Accepted Submission(s): 4911Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文

摘要： 1 /*@coder Gxjun*/ 2 #include 3 #include 4 #include 5 #define maxn 100 6 int map[maxn][maxn] ; 7 void creat_magic(int n,int x,int y ,int sn) //奇阶幻方构造 8 { 9 int i,j,k; 10 i=0; 11 j=n/2; 12 for(k=n;k*/ 63 t=map[i][j]; 64 map[i][j]=map[i+n/2][... 阅读全文

摘要： 1 /*coder @Gxjun*/ 2 #include 3 #include 4 #include 5 #define maxn 10000 6 char rx[16]; /*既然是实数，那么就精确到16位吧*/ 7 int ans[maxn],nx[17],tem[maxn],cc[maxn]; 8 int main( void ) 9 {10 int n,i,po=0,j,cnt,k;11 printf("输入n x的值\n");12 while(~scanf("%d%s",&n,rx))13 {14 int pos=strlen(... 阅读全文

摘要： The Euler functionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3284Accepted Submission(s): 1350Problem DescriptionThe Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smalle 阅读全文

摘要： 畅通工程续Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23374Accepted Submission(s): 8239Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题目包含多 阅读全文

摘要： HDU TodayTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12147Accepted Submission(s): 2851Problem Description经过锦囊相助，海东集团终于度过了危机，从此，HDU的发展就一直顺风顺水，到了2050年，集团已经相当规模了，据说进入了钱江肉丝经济开发区500强。这时候，XHD夫妇也退居了二线，并在风景秀美的诸暨市浬浦镇陶姚村买了个房子，开始安度晚年了。这样住了一段时间，徐总对当地的交通还是 阅读全文

摘要： 一个人的旅行Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16300Accepted Submission(s): 5589Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看 阅读全文

摘要： 输入包括多组数据。每组数据第一行是两个整数N、M（N 2 #include 3 const int inf=0x3f3f3f3f ; 4 int path[101]; 5 int sta[101][101],lowcost[101]; 6 void Dijkstra( int cost[][101], int n ) 7 { 8 int i,j,min; 9 int vis[101]={1};10 for(i=0; i#include#include#include#includeusing namespace std;const int inf=0x3f3f3f3f;... 阅读全文

摘要： 1 /* 双向循环链表c++版 */ 2 /* Gxjun coder */ 3 #include 4 #define type int // 5 using namespace std; 6 7 typedef struct Node 8 { 9 type inf; // 10 struct Node* pre ; // 11 struct Node* next ; // 12 }node ; 13 14 /*创建，插入，删除，打印*/ 15 16 void c... 阅读全文

摘要： Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7997Accepted Submission(s): 2267Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but m 阅读全文

摘要： Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3968Accepted Submission(s): 2888Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

摘要： 常用的方法是使用 CMD =》net view 命令..... 阅读全文

摘要： #include#includeusing namespace std;int main( ){ try { throw "嗨 ！ 我引发了一个异常！"; cout<<"正常执行 1"<<endl; } catch(const char* s) { cout<<s<<endl; cout<<"异常类型 ： int"<<endl; } catch(int i) { cout<<i<<endl; cout<<"异常类型： 阅读全文

摘要： 还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22101Accepted Submission(s): 9871Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用 阅读全文

摘要： 畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13865Accepted Submission(s): 5732Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第 阅读全文

摘要： 继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11473Accepted Submission(s): 5026Problem Des... 阅读全文

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

摘要： DFSTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4422Accepted Submission(s): 2728Problem DescriptionA DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer.For example ,consider the positive inte 阅读全文

摘要： The SuspectsTime Limit: 1000MSMemory Limit: 20000KTotal Submissions: 19754Accepted: 9576DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to se 阅读全文

摘要： 幸运三角形时间限制：1000ms | 内存限制：65535KB难度：3描述 话说有这么一个图形，只有两种符号组成（‘+’或者‘-’），图形的最上层有n个符号，往下个数依次减一，形成倒置的金字塔形状，除第一层外（第一层为所有可能情况），每层形状都由上层决定，相邻的符号相同，则下层的符号为‘+’，反之，为‘-’;如下图所示（n = 3 时的两种情况)： 如果图中的两种符号个数相同，那这个三角形就是幸运三角形，如上图中的图（2）.输入有多组测试数据（少于20组）。每行含一个整数n（0 2 int str[20]={0}; 3 bool map[20][2... 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2523哈希表..球阀代码：#include#include#include#include#includeusing namespace std;bool hash[2000];int main(){ int c,n,k,i,j; scanf("%d",&c); while(c--) { scanf("%d%d",&n,&k); memset(hash,0,sizeof(hash)); vectorsav(n); for(i=0;i()); .. 阅读全文

摘要： Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3400Accepted Submission(s): 1507Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. E 阅读全文

摘要： Counting SheepTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1782Accepted Submission(s): 1170Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother sugge 阅读全文