摘要：
How Many TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9828Accepted Submission(s): 4872 Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he ne 阅读全文
摘要：
Edge Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1590Accepted Submission(s): 1040 Problem DescriptionFor products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its 阅读全文
摘要：
Design T-ShirtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4370 Accepted Submission(s): 2124 Problem DescriptionSoon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of s 阅读全文
摘要：
Delta-waveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4684Accepted Submission(s): 1777 Problem DescriptionA triangle field is numbered with successive integers in the way shown on the picture below.The traveller needs to go from the cell with 阅读全文
摘要：
1、使用管理员身份运行CMD2、使用命令netsh wlan set hostednetwork mode=allow ssid=建立的无线网名称最好是英文 key=8位数字(是无线网密码) 例：netshwlan set hostednetwork mode=allow ssid=xiaozhou key=888888883、打开网络共享中心--左边第二项好像是更改适配器，里面会多出一个microsoft虚拟无线连接，右击本地连接（已经连到互连网的那个），选择属性，选择共享，勾上“允许其他网络用户通过此计算机的INTERNET连接来连接”，选择网卡时选择多出来的虚拟无线网卡,单击确定4、输入 阅读全文
摘要：
What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 10963Accepted Submission(s): 3521 Problem DescriptionIgnatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Marti 阅读全文
摘要：
统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 14434 Accepted Submission(s): 6219 Problem ... 阅读全文
摘要：
StarsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3680Accepted Submission(s): 1449 Problem DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of 阅读全文
摘要：
Farm IrrigationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4491 Accepted Submission(s): 1947 Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes 阅读全文
摘要：
Problem A三角形时间限制：1000 ms | 内存限制：65535 KB描述在数学中，如果知道了三个点的坐标，我们就可以判断这三个点能否组成一个三角形；如果可以组成三角形，那么我们还可以求出这个三角形的面积。作为一个大学生，如果给你三个点的坐标，你能快速判断出这三个点能组成一个三角形吗？如果可以组成三角形，你能快速求出三角形的面积吗？输入第一行输入一个整数N（1 ≤ N ≤ 100），表示有N组测试数据。 接下来有N行，每行包括六个数x1,y1,x2,y2,x3,y3,分别代表三个点的坐标。 (0 ≤ x1,y1,x2,y2,x3,y3 ≤ 15)输出根据点的坐标判断这三个点能不能组成 阅读全文
摘要：
Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16859Accepted Submission(s): 6300 Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(becau 阅读全文
摘要：
RSATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1135 Accepted Submission(s): 833 Problem DescriptionRSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:> choose two large prime integer p, q > 阅读全文
摘要：
素数环时间限制：1000 ms | 内存限制：65535 KB难度：2描述有一个整数n，把从1到n的数字无重复的排列成环，且使每相邻两个数（包括首尾）的和都为素数，称为素数环。为了简便起见，我们规定每个素数环都从1开始。例如，下图就是6的一个素数环。输入有多组测试数据，每组输入一个n(0 2 #include 3 #include 4 int save[21],ans[21],step,n; 5 void dfs() 6 { 7 int i,k; 8 if(step==n) 9 {10 if(ans[step-1]%2==0&&ans[step-1]!=... 阅读全文
摘要：
Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4083 Accepted Submission(s): 2140 Problem DescriptionA message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in 阅读全文
摘要：
Red and BlackTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6905Accepted Submission(s): 4384 Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. F 阅读全文
摘要：
Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5175Accepted Submission(s): 2908 Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a 阅读全文
摘要：
连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14847 Accepted Submission(s): 3880 Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了 阅读全文
摘要：
NightmareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5795 Accepted Submission(s): 2868 Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 int main() 8 { 9 int a;10 dequestr;11 for(int i=0;i>a;14 str.push_back(a);15 }16 for(deque::iterator j=str.begin();j!=str.end();j++)17 cout<<*j;18 return 0;19 }上面的代码实现输入输出....... 阅读全文
摘要：
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21151 Accepted Submission(s): 9465 Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum o 阅读全文
摘要：
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6779 Accepted Submission(s): 3370 Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. 阅读全文
摘要：
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 55812 Accepted Submission(s): 15052 Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to sha 阅读全文
摘要：
第一步：工具栏上右键选择Customize(定制)，选择“Add-ins and Macro Files(附加项和宏文件)”页，把SAMPLE前面打上钩。第二步：选择“Commands(命令)”页，Category(类别)选Macros，然后在Commands中把CommentOut(注释)拖曳到工具栏快捷方式。第三步：选择“Keyboard（键盘）”tab页，还是Category（工具栏）选Macros，选中CommentOut（注释），然后换到“Press new shortcut key（设置快捷键）”，设置快捷键ALT+/,单击分配后确认即完成设置。第四部 退出即可.... 阅读全文
摘要：
找球号(一）时间限制：3000 ms | 内存限制：65535 KB难度：3描述在某一国度里流行着一种游戏。游戏规则为：在一堆球中，每个球上都有一个整数编号i(0 3 #include 4 using namespace std; 5 int main() 6 { 7 int m,n,i,c; 8 setstr; 9 cin>>m>>n;10 for(i=0;i>c;13 str.insert(c);14 }15 for(i=0;i>c;18 if(str.find(c)==str.end())19 cout<<"NO"< 阅读全文
摘要：
1.关于setC++ STL 之所以得到广泛的赞誉，也被很多人使用，不只是提供了像vector, string, list等方便的容器，更重要的是STL封装了许多复杂的数据结构算法和大量常用数据结构操作。vector封装数组，list封装了链表，map和set封装了二叉树等，在封装这些数据结构的时候，STL按照程序员的使用习惯，以成员函数方式提供的常用操作，如：插入、排序、删除、查找等。让用户在STL使用过程中，并不会感到陌生。关于set，必须说明的是set关联式容器。set作为一个容器也是用来存储同一数据类型的数据类型，并且能从一个数据集合中取出数据，在set中每个元素的值都唯一，而且系统能 阅读全文
摘要：
擅长排列的小明时间限制：1000 ms | 内存限制：65535 KB难度：4描述小明十分聪明，而且十分擅长排列计算。比如给小明一个数字5，他能立刻给出1-5按字典序的全排列，如果你想为难他，在这5个数字中选出几个数字让他继续全排列，那么你就错了，他同样的很擅长。现在需要你写一个程序来验证擅长排列的小明到底对不对。输入第一行输入整数N（1 2 #include 3 #include 4 #include 5 using namespace std; 6 int str[12]={1,2,3,4,5,6,7,8,9,10},maze[12]; 7 int main() 8 { 9 int t.. 阅读全文
摘要：
strcpy和memcpy都是标准C库函数，它们有下面的特点。 strcpy提供了字符串的复制。即strcpy只用于字符串复制，并且它不仅复制字符串内容之外，还会复制字符串的结束符。已知strcpy函数的原型是：char* strcpy(char* dest, const char* src); memcpy提供了一般内存的复制。即memcpy对于需要复制的内容没有限制，因此用途更广。 void *memcpy( void *dest, const void *src, size_t count );?char * strcpy(char * dest, const char * src) / 阅读全文
摘要：
D的小L时间限制：4000 ms | 内存限制：65535 KB难度：2描述 一天TC的匡匡找ACM的小L玩三国杀，但是这会小L忙着哩，不想和匡匡玩但又怕匡匡生气，这时小L给匡匡出了个题目想难倒匡匡(小L很D吧)，有一个数n(0 2 #include 3 #include 4 using namespace std; 5 int main() 6 { 7 int n,t,i; 8 int str[]={1,2,3,4,5,6,7,8,9,10}; 9 scanf("%d",&t);10 while(t--)11 {12 scanf("%d",&a 阅读全文
摘要：
中文版: 工具-->选项-->格式 -->注释英文版:tools-->options->format -->comment其中还有其它各种文本的颜色和字体的设置, 阅读全文
摘要：
经过了几天的思索，我下定决心来搞了,我知道也许会有很多的挫折，但是既然决定了，就要努力的做下去，半途而废者，岂可能是我的风格!!! 阅读全文
摘要：
剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6489Accepted Submission(s): 4342 Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有 阅读全文
摘要：
The Moving PointsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 612 Accepted Submission(s): 250 Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the large 阅读全文
摘要：
F(x)Time Limit: 1000/500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 468Accepted Submission(s): 171 Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2... A2A1), we define its weight as F(x) = An* 2n-1+ An-1* 2n-2+ ... + A2* 2 + A1* 1. Now you are g 阅读全文
摘要：
Kia's CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 624 Accepted Submission(s): 178 Problem DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a numbe 阅读全文
摘要：
Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 673 Accepted Submission(s): 242 Problem DescriptionIf we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required 阅读全文
摘要：
1 数位DP 2 3 4 这类题，才刚刚接触，记得去年网络赛，就有道这样的题，我完全不会， 5 6 对于这类题基本方法是，是利用数的位数来构造转移方程。 7 8 下面给出两篇论文的链接： 9 10 《数位计数问题解法研究》11 12 《浅谈数位类统计问题》13 14 下面给出某位大牛关于此类题报告的链接：15 16 http://www.cppblog.com/Yuan/archive/2011/07/15/139299.html17 18 FOJ 204219 20 http://acm.fzu.edu.cn/problem.php?pid=204221 22 解法23 24 h... 阅读全文
摘要：
The Number Off of FFFTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 169 Accepted Submission(s): 83 Problem DescriptionX soldiers from the famous "*FFF* army" is standing in a line, from left to right. You, as the captain of *FFF*, deci 阅读全文
摘要：
Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 61 Accepted Submission(s): 39 Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, w 阅读全文
摘要：
A Computer Graphics ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 92 Accepted Submission(s): 80 Problem DescriptionIn this problem we talk about the study of Computer Graphics. Of course, this is very, very hard. We have designed a new m 阅读全文
摘要：
HerdingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 937 Accepted Submission(s): 254 Problem DescriptionLittle John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing the cattles all the time to avoid unnecessary omi 阅读全文