nahakyuu nahakyuu

## index.ts
interface Room {
    name: string;
    floor: string;
    unit: string;
    buildId: string;
}
interface Build {
    buildId: string;
    unit: Array<Unit>;
}

## demo.html
<!DOCTYPE html>
<html lang="zh-hans">

<head>
    <meta charset="UTF-8">
    <title>Document</title>
    <style>
        #main {
            border: 1px solid #000;
            width: 200px;

## user.ts
import * as mongoose from 'mongoose';

import Schema = mongoose.Schema;
import Document = mongoose.Document;

var UserSchema = new Schema({
  name: String,
  password: String,
  email: String,
  head: String

## decode.js
module.exports = function (str ,num) {
  var line = Math.floor(str.length / num);
  var begin = 0;
  var end = line;
  var temp = [];
  //切割str
  for (var i = line * num - str.length; i; i++) {
    temp.push(str.slice(begin, ++end));
    begin = end;end += line;
  }

## 1201.cpp
/*
作者:youye
题目:p1201 最小数和最大数
*/

#include <iostream>
#include <algorithm>
#include <cstdio>

using namespace std;

## hdu-1087.cpp
/*
	hdu-1087
	Super Jumping! Jumping! Jumping!
	http://acm.hdu.edu.cn/showproblem.php?pid=1087
*/
#include <iostream>
#include <cstdio>

using namespace std;

## template.cpp
#include <iostream>
#include <cstdio>

using namespace std;

int main(){
#ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
#endif
	interface Room {
	name: string;
	floor: string;
	unit: string;
	buildId: string;
	}
	interface Build {
	buildId: string;
	unit: Array<Unit>;
	}
	<!DOCTYPE html>
	<html lang="zh-hans">

	<head>
	<meta charset="UTF-8">
	<title>Document</title>
	<style>
	#main {
	border: 1px solid #000;
	width: 200px;
	import * as mongoose from 'mongoose';

	import Schema = mongoose.Schema;
	import Document = mongoose.Document;

	var UserSchema = new Schema({
	name: String,
	password: String,
	email: String,
	head: String
	module.exports = function (str ,num) {
	var line = Math.floor(str.length / num);
	var begin = 0;
	var end = line;
	var temp = [];
	//切割str
	for (var i = line * num - str.length; i; i++) {
	temp.push(str.slice(begin, ++end));
	begin = end;end += line;
	}
	/*
	作者:youye
	题目:p1201 最小数和最大数
	*/

	#include <iostream>
	#include <algorithm>
	#include <cstdio>

	using namespace std;
	/*
	hdu-1087
	Super Jumping! Jumping! Jumping!
	http://acm.hdu.edu.cn/showproblem.php?pid=1087
	*/
	#include <iostream>
	#include <cstdio>

	using namespace std;