A bad vacation

　　My story happened in the winter of 2012, the first year I began to work in Beijing. It was a cold weekend, and I went skiing with two of my coworkers in the suburbs.

　　I was very excitied because I had never skied before. After they two taught me some basic knowlege of skiing, they went to the profiessional skidway, and I decided to play by myself in the beginner‘s skidway.

　　After a while, I felt exhausted and a little hungry. I deside to stop to have lunch. I went to the washroom before I wanted to restart the ski. I remembered clearly that I put my skiing tool just under my cupboard, expecially used for deposit for guests‘ belongings. Unfortunately, I can‘t find my skiing tool when I returned. They must be taken away by somebody else by mistake. I was warned by the stuffs who worked in the skiing park that I had to pay for them if I can‘t give them back, 2000 yuan or so. I was anxious. Luckly, we went to watch the monitor, and found that it is a man who used the cupboard under mine took away my skiing tool. We guess that he would come back after he finished skiing. I had to wait him in case he took my tool out of the skiing park.

　　In the end, I caught him. I need not to pay for the tool any more. But I went so long a way just for two hours‘ skiing, I can‘t enjoy myself to the full. It‘ really a bad vacation!

　　

时间： 2024-08-02 15:13:44

A bad vacation的相关文章

[LeetCode] Maximum Vacation Days 最大化休假日

LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play makes Jack a dull boy, you could take vacations in some particular cities and weeks. Your job is to schedule

bzoj4093: [Usaco2013 Dec]Vacation Planning

bzoj4093: [Usaco2013 Dec]Vacation Planning Time Limit: 10 Sec  Memory Limit: 128 MBSubmit: 81  Solved: 38[Submit][Status][Discuss] Description Bovinia设计了连接N (1 < = N < = 20,000)个农场的航班.对于任何航班,指定了其中的k个农场作为枢纽. (1 < = K <= 200 , K < = N). 目前,共有

UVa 10192 Vacation （最长公共子序列）

Vacation Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Description   The Problem You are planning to take some rest and to go out on vacation, but you really don't know which cities you should visit. So, you ask your paren

BZOJ3550: [ONTAK2010]Vacation

3550: [ONTAK2010]Vacation Time Limit: 10 Sec  Memory Limit: 96 MBSubmit: 91  Solved: 71[Submit][Status] Description 有3N个数,你需要选出一些数,首先保证任意长度为N的区间中选出的数的个数<=K个,其次要保证选出的数的个数最大. Input 第一行两个整数N,K.第二行有3N个整数. Output 一行一个整数表示答案. Sample Input 5 3 14 21 9 30 11

Lesson 43-44 Vacation Season is Approaching?

1 at first glance 乍一看 2 disruption中断,混乱,破坏n eg. The rail strike is causing major disruptions at the country's ports.铁路罢工使该国港口陷入了一片混乱 3 boredom 厌烦,无聊n eg. He had given up attending lectures out of sheer boredom.他不再去听那些讲座完全是出于厌倦 4 occur to 发生在 eg. I ho

568. Maximum Vacation Days

Problem statement:  LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play makes Jack a dull boy, you could take vacations in some particular cities and weeks. Your

UVa 10192 - Vacation ( LCS 最长公共子串)

链接:UVa 10192 题意:给定两个字符串,求最长公共子串的长度 思路:这个事最长公共子串的直接应用 #include<stdio.h> #include<string.h> int max(int a,int b) { return a>b?a:b; } int main() { char s[105],t[105]; int i,j,k=0,m,n,dp[105][105]; while(gets(s)!=NULL){ if(strcmp(s,"#"

uva 10192 Vacation（最长公共子序列）

uva 10192 Vacation The Problem You are planning to take some rest and to go out on vacation, but you really don't know which cities you should visit. So, you ask your parents for help. Your mother says "My son, you MUST visit Paris, Madrid, Lisboa an

Atcoder C - Vacation （ DP ）

C - Vacation Time Limit: 2 sec / Memory Limit: 1024 MB Score : 100100 points Problem Statement Taro's summer vacation starts tomorrow, and he has decided to make plans for it now. The vacation consists of NN days. For each ii (1≤i≤N1≤i≤N), Taro will