- 博客(11)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 1032. Sharing (25)
遍历所有地址 记录被遍历的地址次数 如有大于1的则是第一个相同首地址#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXnum 100005#define max(a,b) a>b?a:bstruc
2015-12-20 10:16:15
387
原创 1082. Read Number in Chinese (25)
#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ const char *str[9]={"","Shi","Bai","Qian","Wan","Shi","Bai","Qian","Yi"};const
2015-12-19 12:02:33
269
原创 Mysql学习之cannot add foreign key constraint
错误原因如下1 外表没建2 外键不是外表的主键 没有唯一标示 要加一个 unique3外键与表内键的属性不匹配
2015-12-16 18:18:52
439
原创 1029. Median (25)
#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXnum 100005#define max(a,b) a>b?a:bint main(){ vector v; int n,m;
2015-12-16 18:05:43
247
原创 1028. List Sorting (25)
#include#include#include#include#include#include#includeusing namespace std;#define maxsize 100001#define min(a,b) a<b?a:bstruct record{int num;char str[9];int grade;};bool cmp1(record
2015-12-09 19:50:37
293
原创 1024. Palindromic Number (25)
N的范围是10的10次 开始没考虑到这点 直接用int了 后来发现才用字符串#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXnum 100005#define max(a,b) a>b?a:bint chec
2015-12-07 09:53:35
273
转载 1105. Spiral Matrix (25)
感觉写这题思路要很清晰 这题思路还是看别人转载BLOG：http://blog.csdn.net/realxuejin/article/details/50189737先用四个变量标记矩阵的左边界和上边界 右边界和下边界在进行操作时 左边界会右移 右边界会左移 上边界下移 下边界上移先是从左到右 再从上到下 接着从右到左 然后从下到上进行这些操作后 判断左边界是
2015-12-06 15:59:54
382
原创 PAT 1090. Highest Price in Supply Chain (25)
开始用DFS递归 结果段错误 改用BFS 用队列 也有段错误
2015-12-03 20:16:40
353
原创 PAT 1094. The Largest Generation (25)
与六度空间相似 更简单一些#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ vector v[101];
2015-12-02 20:17:35
308
原创 PTA 06-图3 六度空间 (30分)
#include#include#include#include#include#include#includeusing namespace std;#define maxsize 10001#define MIN -10001int num=0,size=0;void BFS(int index,vector v[]){ int visit[maxsize]
2015-12-02 19:48:37
1354
原创 PAT 1093. Count PAT's (25)
#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ char str[100001]; int countp[100001]; int co
2015-12-02 13:54:25
318
Vitamio 5.2.3 Android Studio
2017-11-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人