7_9_2013 A: Triangles

Problem A: Triangles Time Limit: 2 Sec Memory Limit: 128 MB Submit: 20 Solved: 9 [ Submit][ Status][ Web Board] Description You are given a figure consisting of n points in a 2D...

2013/07/11 11:29
20
7_7_2013 F.Triangle

Problem F: Triangle Time Limit: 1 Sec Memory Limit: 32 MB Submit: 29 Solved: 8 [ Submit][ Status][ Web Board] Description It is a simple task, for N points on the 2D plane, you ...

2013/07/09 08:59
11
7_7_2013 E.Function

Problem E: Function Time Limit: 1 Sec Memory Limit: 32 MB Submit: 52 Solved: 26 [ Submit][ Status][ Web Board] Description Define a function f(n)=(f(n-1)+1)/f(n-2). You already ...

2013/07/09 08:58
8
7_7_2013 D.Brackets

Problem D: Brackets Time Limit: 1 Sec Memory Limit: 32 MB Submit: 70 Solved: 23 [ Submit][ Status][ Web Board] Description This year MK is 5 years old. So he decides to learn so...

2013/07/09 08:55
14
7_7_2013 C.An Easy Puz

Problem C: An Easy Puz Time Limit: 1 Sec Memory Limit: 32 MB Submit: 17 Solved: 10 [ Submit][ Status][ Web Board] Description Wddpdh find an interesting mini-game in the BBS of ...

2013/07/09 08:53
21
7_7_2013 B.Arithmetic Progression

Problem B: Arithmetic Progression Time Limit: 1 Sec Memory Limit: 32 MB Submit: 55 Solved: 25 [ Submit][ Status][ Web Board] Description “In mathematics, an arithmetic progres...

2013/07/09 08:52
20
7_7_2013 A.Eming

A.Eming Eming is a contest hold by WHUACM training team. The aim is to select new members of the team. Usually, the first problem is a very simple problem such as “a+b problem...

2013/07/09 08:51
30
zzy的寵物

#include <iostream> #include <stdio.h> #include <string.h> using namespace std; struct matrix{ int s[6][6]; }r, d, p, q,tt; void view(matrix x){ for(int i=0;...

2013/07/06 23:37
14
zoj_1008_Gnome Tetravex

2013/07/06 11:54
21

#include <iostream> #include <algorithm> #include <stdio.h> using namespace std; int a[10000], dp[10000], k=0, n; void ul(int n) { int i; for(i=1; i*i<n; i++){ ...

2013/05/06 10:52
17
ZOJ_1094/hdoj_1082_Matrix Chain Multiplication_...

Matrix Chain Multiplication Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 893 Accepted Submission(s): 603 Problem Descrip...

2013/04/26 20:06
36
hdoj_1711_Number Sequence

#include <stdio.h> #include <iostream> using namespace std; int s[1000010], p[10010]; int next[10010]; int m, n, ans, t; void getnext() { int i, j; next[1]=0; j=0...

2013/04/24 17:41
34
ZOJ_1004/HDOJ_1515_Anagrams by Stack stack ve...

O和o的区别又把我坑 #include <stdio.h> #include <iostream> #include <string> #include <stack> #include <vector> using namespace std; int length; string a, b; vector<char>operate...

2013/04/23 23:25
54
zoj 1002 fire net 簡單搜索dfs

#include <iostream> #include <stdio.h> using namespace std; int n, maxcur; char a[4][4]; bool check(int x, int y) { for(int i=x-1; i>=0; i--){ if(a[i][y]=='O')ret...

2013/04/22 22:59
65
zoj 1006 Do the Untwist 簡單字符串

2013/04/22 22:08
291

memset(flag, 0, sizeof(bool)); //memset(flag, 0, sizeof(flag));這麼一個錯誤，太坑了吧，基礎不扎實害死人呀，一晚上就死在這裡了 Problem Description Ignatius has just come back sc...

2013/04/12 03:22
15

#include <iostream> #include <stdio.h> using namespace std; int M, S, N, len, temp, id, st, en; struct se{ int s; int e; }s[200010]; int cmp(se a, se b){ retur...

2013/04/12 02:52
10

2013/04/07 19:41
102

2013/04/05 12:09
130
map容器學習與使用 多校聯合 2013 ProblemA 小 Y做家教

map容器 #include <map> map <int , int>mp; map<int,int>::iterator it; begin() 返回指向map头部的迭代器 end() 返回指向map末尾的迭代器 erase() 删除一个元素 1．iterator erase(iterat...

2013/04/01 10:54
15