机智勇敢的马少爷-优快云博客

转载各大OJ题目分类

POJ题目分类模拟题: POJ1006POJ1008POJ1013POJ1016POJ1017POJ1169POJ1298POJ1326POJ1350POJ1363POJ1676POJ1786POJ1791POJ1835POJ1970POJ2317POJ2325POJ2390POJ1012POJ1082POJ1099POJ1114POJ1642POJ1677POJ1684POJ188

2015-08-01 14:03:32 1756

原创 HDU 1096 A+B for Input-Output Practice (VIII)

A+B for Input-Output Practice (VIII) Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 115017 Accepted Submission(s): 35331 Problem Des

2015-08-04 18:39:06 319

原创 HDU 1040 As Easy As A+B

As Easy As A+B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 46281 Accepted Submission(s): 19778 Problem Description These days, I

2015-08-04 18:20:03 433

原创 Hdu 1029 Ignatius and the Princess IV

Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 21455 Accepted Submission(s): 8897 Problem Description

2015-08-04 18:01:07 324

原创数据结构线性表的顺序存储

#include #include #include #define MAX 1000 typedef struct { int num; char name[6]; }Mem; typedef struct { Mem mem[MAX]; int len; }Seqlist ; Seqlist L; void Print() { printf("\n"); system("col

2015-08-01 15:14:53 388

原创动态规划求最大连续和

#include #include int a[100005],sum[100005]; int main() { //freopen("input.txt","r",stdin); int t,n,i,max,x=0; scanf("%d",&t); while(t--) { if(x) printf("\n"); scan

2015-08-01 15:13:10 425

原创暴力枚举法求最大连续和

#include int max(int a,int b) { if(a>b) return a; else return b; } int main() { int n,i,j,a[10000],s[10000],maxsum; while(scanf("%d",&n)==1) { for(i=0;i<n;i++) scanf("%d",&a[i]); s[0]=a[0];ma

2015-08-01 15:09:46 374

原创分治法求最大连续和

#include int maxs(int a,int b) { if(a>b) return a; else return b; } int maxsum(int* a,int x,int y) //分治算法 { int v,l,r,max,m,i; if(y-x==1) return a[x]; //只有一个元素返回 m=x+(y-x)/2;//第一步划分区间 [x,m)

2015-08-01 15:09:26 515

原创 UVa 1586 Molar Mass

UVa 1586 Molar Mass An organic compoundis any member of a large class of chemical compounds whose molecules containcarbon. The molar mass of an organic compound is the mass of one mole of theorgani

2015-08-01 14:56:29 456

原创回溯法解决N皇后问题

#include int place(int x[ ],int k) { int i; for (i=1;i<k;i++) if ((x[i]==x[k])||(abs(x[i]-x[k])==abs(i-k))) return 0; return 1; } void print(int n,int x[]) { int i; for(i=

2015-08-01 14:54:32 468

原创分治法和指针求最大最小数

代码： #include void Lookmin_max(int* a,int i,int j,int *min,int *max) { int mid,min1,max1,min2,max2; if(i==j) { *max=a[j]; *min=a[i]; return ; } if(i==j-1) { *min=a[i]>a[j]?a[j]:a[i];

2015-08-01 14:50:37 319

原创 UVa 232 Crossword Answers

UVa 232 Crossword Answers A crossword puzzle consists of a rectangular grid of black and whitesquares and two lists of definitions (or descriptions). One list of definitions is for ``words" to be

2015-08-01 14:32:59 308

原创 UVa 10340 All in All

10340 All in All You have devised anew encryption technique which encodes a message by inserting between itscharacters randomly generated strings in a clever way. Because of pendingpatent issues

2015-08-01 14:27:02 255

原创整除15问题

整除15问题 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)

2015-08-01 13:59:48 1213

原创 HDU 1008 Elevator

Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 52319 Accepted Submission(s): 28883 Problem Description The highest buildin

2015-08-01 13:25:34 282

原创 HDU 1012 u Calculate e

u Calculate e Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35702 Accepted Submission(s): 16097 Problem Description A simple mathe

2015-08-01 13:23:45 356

原创 HDU 1049 Climbing Worm

Climbing Worm Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14369 Accepted Submission(s): 9696 Problem Description An inch worm is

2015-08-01 09:30:14 279

原创 HDU 1009 FatMouse' Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 53861 Accepted Submission(s): 18013 Problem Description FatMouse pre

2015-08-01 08:54:46 306

原创 HDU 1003 Max Sum

Max Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 177393 Accepted Submission(s): 41369 Problem Description Given a sequence a[

2015-08-01 08:51:03 226

原创 HDU 1213 How Many Tables

How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18365 Accepted Submission(s): 9080 Problem Description Today is Igna

2015-08-01 08:48:27 317

原创 HDU 1232 畅通工程

畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37747 Accepted Submission(s): 19990 Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出

2015-08-01 08:46:21 210

原创 HDU 2955 Robberies

Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16116 Accepted Submission(s): 5905 Problem Description The aspiring Roy th

2015-07-31 11:03:59 218

马少爷~