2016年01月_LoHiauFung

12月 11月 10月 09月 08月 05月 03月 01月

原创 489 - Hangman Judge

题目来源：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=6&problem=430&mosmsg=Submission+received+with+ID+16764260#include<stdio.h> #include<stdlib.h> #incl

2016-01-27 21:02:33 344

原创 1015. 德才论 (25)

题目来源:http://www.patest.cn/contests/pat-b-practise/1015#include<stdio.h> #include<stdlib.h>typedef struct student { int id; int virtue; int intellect; int stage; } student;int cmp (const

2016-01-26 14:02:20 493

原创 1035. DNA matching

题目来源：http://222.200.185.45/show_problem.php?pid=1035&cid=#include<stdio.h>int IsMatched (char* a, char* b);int main() { int T = 0, i = 0, j = 0, n = 0, counter = 0; char table[210][105] = {{0}}

2016-01-24 16:28:59 406

原创 1001. 害死人不偿命的(3n+1)猜想 (15)

来源：http://www.patest.cn/contests/pat-b-practise/1001 重点：循环条件控制，很容易出细微的逻辑错误。#include<stdio.h>int main() { int n = 0, hold = 0, i = 0, j = 0, k = 0, times = 0; int arr[105] = {0}; scanf("%d"

2016-01-22 11:17:28 854

原创 1014. 福尔摩斯的约会 (20)

来源：http://www.patest.cn/contests/pat-b-practise/1014#include<stdio.h> #include<ctype.h>int main() { char arr1[61], arr2[61], arr3[61], arr4[61] = {0}; int i = 0, k = 0; int time[3] = {0};

2016-01-20 16:53:58 356

原创 1020. 月饼 (25)

PAT(乙) 1020. 月饼 (25) 来源：http://www.patest.cn/contests/pat-b-practise/1020#include<stdio.h> #include<stdlib.h> #include<math.h>int main() { int n = 0, need = 0, inthold = 0, i = 0, j = 0; double ha

2016-01-20 15:42:05 586

原创 Sicily 1027. MJ, Nowhere to Hide

简要题意:找马甲来源http://222.200.185.45/1027#include<stdio.h> #include<string.h>void swap(char a[16], char b[16]);int main() { int n = 0, i = 0, j = 0, k = 0, flat = 0, look = 0; char hold_id[16], ho

2016-01-20 15:37:27 441

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人