<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[calamity_coming]]></title><description><![CDATA[想想自己還這麼菜，還有設麼理由浪費時間]]></description><link>https://blog.youkuaiyun.com/calamity_coming</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; calamity_coming]]></copyright><item><title><![CDATA[发表一下感慨吧]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/52950177</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/52950177</guid><author>calamity_coming</author><pubDate>Thu, 27 Oct 2016 21:57:11 +0800</pubDate><description><![CDATA[实习快4个月了，这近3个月一直在写c++ 的底层计算模块，至今独立编写近W行代码，感触挺深的
实习第一个月感觉就是熟悉一下公司业务，写点外围的小东西，感受一下公司氛围吧，开始给我分配和郭博士合作的时候才开始有写代码的感觉。
现在看来当初海泉讲过的所有东西，都是有用的，而且现在的编写这些东西很有用，如何编写可复用代码，如何把控代码的整体结构，如何去理清整体结构，
如何去把一个清晰的思路，对每个]]></description><category></category></item><item><title><![CDATA[python批量修改编码]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/52192982</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/52192982</guid><author>calamity_coming</author><pubDate>Fri, 12 Aug 2016 16:32:47 +0800</pubDate><description><![CDATA[#!/usr/bin/env python
# coding : utf-8

import os,sys  
import re;

def convert( filename, in_enc = "gbk", out_enc="utf-8" ):  
    try:  
        p = re.search(r'cpp' , filename); #添加过滤条件
        if ]]></description><category></category></item><item><title><![CDATA[2016年8月2日总结]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/52094562</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/52094562</guid><author>calamity_coming</author><pubDate>Tue, 02 Aug 2016 16:20:10 +0800</pubDate><description><![CDATA[实习一个月了，感觉后半段效率低下，心里毛躁，现在在这里总结一下，沉沉心


django：
MVC模式，模型视图控制器模型
    这是一个项目的树形结构
├── log
        ├── manage.py
        ├── property_msg
        │   ├── __init__.py
        │   ├── __pycache__
]]></description><category></category></item><item><title><![CDATA[2016年5月26日总结]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/51509741</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/51509741</guid><author>calamity_coming</author><pubDate>Thu, 26 May 2016 19:09:46 +0800</pubDate><description><![CDATA[现在爬虫提交部分算是暂时写完了，总结一下


hdu是windows服务器，编码是gbk的，而我的服务器是ubuntu，编码是utf-8,如何统一编码是一个问题
暂时我理解的是这样的：
有两个操作一个叫encode 一个叫decode
encode是把二进制变成中文字符串，中文字符串是存在与内存中的，我理解他是对应的是屏幕的图形，最后要打印在屏幕上的，所以不同编码解码后的中文字符串对应]]></description><category></category></item><item><title><![CDATA[2016年5月20日总结]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/51464233</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/51464233</guid><author>calamity_coming</author><pubDate>Fri, 20 May 2016 20:11:47 +0800</pubDate><description><![CDATA[最近在写虚拟oj的爬虫部分，颇有收获，在此总结一发


python 多线程写法：
首先包含模块threading
import threading as th;定义一个run函数，表示每个线程跑的东西t = th.Thread(target = run , args = (proid,));#args是个元组，表示给run传递的参数t.start()表示开始跑

再有个守护线程，他]]></description><category></category></item><item><title><![CDATA[HDU 5358 多校第6场 First One]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/47336075</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/47336075</guid><author>calamity_coming</author><pubDate>Fri, 07 Aug 2015 11:32:23 +0800</pubDate><description><![CDATA[First One
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 672    Accepted Submission(s): 193



Problem Description

soda has an inte]]></description><category></category></item><item><title><![CDATA[HDU 5335 多校第4场 1009 Walk Out]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/47170467</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/47170467</guid><author>calamity_coming</author><pubDate>Fri, 31 Jul 2015 15:20:29 +0800</pubDate><description><![CDATA[Walk Out
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1794    Accepted Submission(s): 340



Problem Description

In an n∗m maze,
 ]]></description><category></category></item><item><title><![CDATA[如果是初学C语言请看完 一些成功人士的心得 (转自程先的专栏)]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/46922361</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/46922361</guid><author>calamity_coming</author><pubDate>Fri, 17 Jul 2015 08:45:39 +0800</pubDate><description><![CDATA[如果是初学C语言请看完 一些成功人士的心得
转自程先的专栏
    今天，我能够自称是一个混IT的人，并能以此谋生，将来大家能一次谋生，都要感谢两个人：克劳德.香农和约翰.冯.诺依曼，是他们发现了所有的数字化信息，不论是一段程序，一封email，一部电影都是用一连串的1和0进行编码的；是他们发现了我们可以利用一个预先编写好的程序控制机器，并使之完成我们期望它完成的动作。建议大家在心里默念三遍他]]></description><category></category></item><item><title><![CDATA[codeforces 229/D 动态规划]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/46804567</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/46804567</guid><author>calamity_coming</author><pubDate>Wed, 08 Jul 2015 15:58:55 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/229/D







D. Towers


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
stand]]></description><category></category></item><item><title><![CDATA[2015百度之星资格赛1004放盘子]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/45954569</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/45954569</guid><author>calamity_coming</author><pubDate>Sun, 24 May 2015 19:50:50 +0800</pubDate><description><![CDATA[放盘子
 
 Accepts: 756
 
 Submissions: 1971

 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)





Problem Description

小度熊喜欢恶作剧。今天他向来访者们提出一个恶俗的游戏。他和来访]]></description><category></category></item><item><title><![CDATA[2015百度之星资格赛1002列变位法解密]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/45952987</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/45952987</guid><author>calamity_coming</author><pubDate>Sun, 24 May 2015 16:37:59 +0800</pubDate><description><![CDATA[列变位法是古典密码算法中变位加密的一种方法，具体过程如下 将明文字符分割成个数固定的分组（如5个一组，5即为密钥），按一组一行的次序整齐排列，最后不足一组不放置任何字符，完成后按列读取即成密文。]]></description><category></category></item><item><title><![CDATA[字典树模板]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/45330911</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/45330911</guid><author>calamity_coming</author><pubDate>Tue, 28 Apr 2015 08:46:41 +0800</pubDate><description><![CDATA[#include using namespace std;
const int MA=10;
const char MU='0';
struct dian
{
    int sum;
    dian *next[MA];
    dian ()//构造函数
    {
        sum=0;
        for(int i=0;i<MA;++i)
            next[i]]></description><category></category></item><item><title><![CDATA[bnu 4291   Arbitrage?]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/45046657</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/45046657</guid><author>calamity_coming</author><pubDate>Tue, 14 Apr 2015 19:24:31 +0800</pubDate><description><![CDATA[Arbitrage?


Time Limit: 5000ms

Memory Limit: 65536KB
64-bit integer IO format: %lld     
 Java class name: Main

Prev 

Submit Status Statistics Discuss
 Next


Type: 

None



]]></description><category></category></item><item><title><![CDATA[NYOJ542试制品,<虐心模拟题>]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/44955421</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/44955421</guid><author>calamity_coming</author><pubDate>Thu, 09 Apr 2015 09:39:59 +0800</pubDate><description><![CDATA[试 制 品
时间限制：1000 ms  |  内存限制：65535 KB
难度：4

描述
ZZ大学的Dr.Kong最近发现实验室的很多试制品都已经用完。由于项目经费有限，为了节省，Dr.Kong决定利用实验室现有的试制品来生成所缺的试制品。为此，Dr.Kong连续几天通宵达旦整理出一份研究资料并让研究生Bill去实验并统计能产生多少种所缺的试制品。
Bill从头到尾翻完所有的资料，发]]></description><category></category></item><item><title><![CDATA[c++课程设计，职工管理系统]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/42388451</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/42388451</guid><author>calamity_coming</author><pubDate>Sun, 04 Jan 2015 11:15:40 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define I 12 //爱心的上半部分两个小半圆的半径
#define R 240 //爱心的下半部分圆弧曲线半径
using namespace std;
class zhigong//职工类，表示单个职工
{
    string]]></description><category></category></item><item><title><![CDATA[NYOJ40一笔画问题]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/41521217</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/41521217</guid><author>calamity_coming</author><pubDate>Wed, 26 Nov 2014 20:19:08 +0800</pubDate><description><![CDATA[一笔画问题
时间限制：3000 ms  |  内存限制：65535 KB
难度：4





描述

zyc从小就比较喜欢玩一些小游戏，其中就包括画一笔画，他想请你帮他写一个程序，判断一个图是否能够用一笔画下来。

规定，所有的边都只能画一次，不能重复画。

 


输入第一行只有一个正整数N(N
每组测试数据的第一行有两个正整数P,Q(P
随后的Q行，每行有]]></description><category></category></item><item><title><![CDATA[输入输出外挂]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/41250461</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/41250461</guid><author>calamity_coming</author><pubDate>Tue, 18 Nov 2014 17:59:47 +0800</pubDate><description><![CDATA[int shuru(int &a)/////当输入数据非常庞大是，用自定一输入函数会相对比较快
{
    bool fushu=0;
    char ch;
    while(!((ch=getchar())>='0'&&ch<='9'))
    {
        if(ch=='-')
        {
            fushu=1;
            ch=getc]]></description><category></category></item><item><title><![CDATA[UVA136 丑数]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/41089037</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/41089037</guid><author>calamity_coming</author><pubDate>Thu, 13 Nov 2014 21:41:48 +0800</pubDate><description><![CDATA[题目的意思是要输出第1500个丑数]]></description><category></category></item><item><title><![CDATA[俄罗斯方块]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/40986557</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/40986557</guid><author>calamity_coming</author><pubDate>Mon, 10 Nov 2014 20:45:44 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;
#include
#include
#define mem(a,b) memset(a,b,sizeof(a))
const int sudu=40;
const int dir[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};
const st]]></description><category></category></item><item><title><![CDATA[学生管理系统]]></title><link>https://blog.youkuaiyun.com/calamity_coming/article/details/40828591</link><guid>https://blog.youkuaiyun.com/calamity_coming/article/details/40828591</guid><author>calamity_coming</author><pubDate>Wed, 05 Nov 2014 19:12:54 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#define mall(student) (struct student *)malloc(sizeof(struct student))
struct student
{
    char xuehao[111];
    char name[111];
    int fen;
   ]]></description><category></category></item></channel></rss>