E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
TCHS
linux基础(一)
一、用户界面:(1)GUI:GNomeKDE(2)CLI:bash,zsh,sh,csh,
tchs
,ksh查看所用的SHELL类型~]#echo#SHELL二、远程连接查看:ssh协议:sercureshell
lht_8
·
2020-04-13 12:17
linux基础
linux技术
TopCoder
TCHS
16 Divisibility
容斥原理 第三题 要注意求最小公倍数时会超 long long 的问题 代码: #include<iostream> #include<cstring> #include<cstdio> #include<string> #include<set> #include<map&g
·
2015-11-13 10:46
visibility
Topcoder->
TCHS
32 SuperPasture
昨天在topcoder的网站上看到关于
TCHS
32 的解题报告,前2题很简单,关键是第三题SuperPasture,此题分数最高1000,时间有限。
·
2015-11-12 10:40
topcoder
TopCoder 规则入门
基本规则TopCoder的比赛类型很多,最常见的是周赛SRM(Single Round Match),另外还有
TCHS
SRM(TopCoder High School SRM,题目和SRM一样,仅限中学生参加
·
2015-10-31 13:32
topcoder
TopCoder入门教程 -- sqybi完善版
TopCoder:http://www.topcoder.com/ 基本规则TopCoder的比赛类型很多,最常见的是周赛SRM(Single Round Match),另外还有
TCHS
SRM(TopCoder
·
2015-10-31 11:21
topcoder
TopCoder入门教程 — sqybi完善版
TopCoder:http://www.topcoder.com/ 基本规则TopCoder的比赛类型很多,最常见的是周赛SRM(Single Round Match),另外还有
TCHS
SRM(TopCoder
·
2015-10-31 09:14
topcoder
TopCoder - "
TCHS
SRM 1" 答案 及 代码
"TCHSSRM1"答案及代码 由于题目涉密以及英文,不方便一一列出,希望能坚持下去;TopCoder具体网址:http://community.topcoder.com/ 250-points:雷达识别均值问题:Code:#include#include#includeusingnamespacestd;classSpeedRadar{public:doubleaverageSpeed(intm
morndragon
·
2013-10-31 19:00
C++
topcoder
SRM
1
Mystra
TCHS
TopCoder - "
TCHS
SRM 1" 答案 及 代码
"TCHSSRM1"答案及代码 由于题目涉密以及英文,不方便一一列出,希望能坚持下去;TopCoder具体网址:http://community.topcoder.com/ 250-points:雷达识别均值问题:Code:#include #include #include usingnamespacestd; classSpeedRadar{ public: doubleaverageSp
u012515223
·
2013-10-31 19:00
C++
topcoder
SRM
1
Mystra
TCHS
TopCoder - "
TCHS
SRM 1" 答案 及 代码
"TCHSSRM1"答案及代码由于题目涉密以及英文,不方便一一列出,希望能坚持下去;TopCoder具体网址:http://community.topcoder.com/250-points:雷达识别均值问题:Code:#include#include#includeusingnamespacestd;classSpeedRadar{public:doubleaverageSpeed(intmin
morndragon
·
2013-10-31 19:00
C++
Mystra
TopCoder
TCHS
07 Finals C
题意:给一棵无向图构成的树,要求删除一些边,再添加一些边。使得图中每个点直接和其它两个点相连并且保证所有点是连通的。求至少要经过几次操作才能满足题意,每次操作为删除一条边或者增加一条边。 解法:分析可得,要满足题意,那么最后生成的图肯定是所有点连成一个环。并且原图中保留的边越多,那么添加的边就越少。假设原图有N个点,保留了X条边,那么最终的结果就是(N-X)*2-1,所以求出最大的X就求
RaceBug2010
·
2011-08-12 09:00
c
Class
TCHS
-12-950
Problem Statement An army of k knights is going to try to kill an evil dragon. The dragon has h heads, and the knights must cut off all his heads one by one to co
superhack
·
2010-03-01 12:00
Go
TCHS
-12-550
Problem Statement Let's consider a standard six-sided die. Each side contains a distinct number between 1 and 6. We can represent a single die as a sequence of 6
superhack
·
2010-03-01 10:00
ch
TCHS
-12-250
Problem Statement In some of the old historical chronicles the Indict system of chronology was used. Instead of a year, this system uses three integers, calle
superhack
·
2010-02-28 09:00
J#
sun
TCHS
-11-1000
Problem Statement You have beads of several different colors that are to be placed on a string, with the requirement that for any group of three adjacent beads, a
superhack
·
2010-02-22 15:00
Go
TCHS
-11-500
Problem Statement You are playing a game with some friends. The game is played on a rectangular chess board where each cell may be either empty or occupied by a r
superhack
·
2010-02-22 13:00
J#
UP
TCHS
-11-250
Problem Statement You are given a String[] blocks representing the layout of a city. Each character of each element of blocks represents one city block. A 'B' cha
superhack
·
2010-02-22 11:00
J#
TCHS
-10-1000
Problem Statement You have a string s containing only ones and zeroes. Your goal is to make all the characters in s equal using a minimal number of operations. A
superhack
·
2010-02-21 16:00
ch
TCHS
-10-500
Problem Statement There are several cannons located on a plane. Each cannon is represented as a point, and can shoot in one of four directions: left, right, up or
superhack
·
2010-02-21 15:00
J#
UP
TCHS
-10-250
Problem Statement Given a int[] x and a percentile p (between 0 and 100, inclusive), find the smallest element y in x such that at least p percent of the elements
superhack
·
2010-02-21 14:00
ch
TCHS
-9-1000
Problem Statement Consider a square n x n matrix A. The cell Ai ,j is equal to the product i * j ( i, j are 1-based). Let's create a one-dimensional array
superhack
·
2010-02-20 18:00
J#
TCHS
-9-500
Problem Statement A simple way to compress a string is to encode repeated consecutive substrings as a counter followed by the substring. For example, if X repre
superhack
·
2010-02-20 16:00
C++
c
C#
J#
TCHS
-9-250
Problem Statement One day, nClassmates classmates decided to play an exciting game. They formed a circle and assigned themselves player numbers from 0 to
superhack
·
2010-02-20 15:00
ch
TCHS
-8-1000
Problem Statement When scheduling tasks to be executed by a person, it is sometimes the case that when one task is completed, a later task suddenly becomes more imp
superhack
·
2010-02-19 11:00
J#
TCHS
-8-500
Problem Statement A common task for math students is to solve 'word math' questions, where each distinct letter represents a distinct digit. Given a l
superhack
·
2010-02-19 10:00
C++
c
C#
J#
UP
TCHS
-8-250
Problem Statement Last night, after that terrible nightmare about pink elephants, you decided that you would never again go to sleep unless the time showing on your
superhack
·
2010-02-19 10:00
Go
TCHS
-7-1000
Problem Statement You are given an even number of points in the plane. You want to find a rectangle whose corners have integer coordinates and sides are parallel
superhack
·
2010-02-05 15:00
J#
UP
TCHS
-7-500
Problem Statement An array of ints is said to be a straight if it contains five elements that are five consecutive numbers. For example, the array { 6, 1
superhack
·
2010-02-05 13:00
C++
c
C#
J#
TCHS
-7-250
Problem Statement You are given a String text. Determine the letters (both lowercase and uppercase) that appear in text. Return a String which contains those lett
superhack
·
2010-02-05 13:00
ch
TCHS
-6-900
Problem Statement We are given a maze which is a cube of NxNxN cells. We start at (1,1,1) and we move to (N,N,N), in each move visiting one of the three adjacents
superhack
·
2010-02-04 12:00
C++
c
C#
Go
TCHS
-6-600
Problem Statement You have just hacked into your friend's computer, and you want to delete one of his personal files. But wait, why not let him delete it! As you
superhack
·
2010-02-04 11:00
C++
c
F#
C#
J#
TCHS
-6-250
Problem Statement A digital clock displays time in the format "DD:DD:DD" (quotes for clarity only), where each D is a single digit, and each pair of conti
superhack
·
2010-02-04 09:00
C++
c
C#
TCHS
-5-1000
Problem Statement When programming, I don't like to take my fingers off the keyboard, and hence, I don't use the mouse. So, when navigating my source, I like to do
superhack
·
2010-02-02 14:00
qq
J#
OO
UP
idea
TCHS
-5-500
Problem Statement A sentence is composed of words, spaces and punctuation. For this problem, words are maximal contiguous strings of letters. Given a sentence, sor
superhack
·
2010-02-02 12:00
C++
c
F#
C#
J#
TCHS
-5-250
Problem Statement When shopping for TVs consumers may notice that a TV's size is given by its diagonal in inches. The aspect ratio of a screen is the ratio of its w
superhack
·
2010-02-02 12:00
ch
TCHS
-5-600
Problem Statement Masterbrain is a two player board game in which one player decides on a secret combination of digits, while the other must figure it out in 10 g
superhack
·
2010-01-30 14:00
J#
TCHS
-5-300
Problem Statement Given the width and height of a rectangular grid, return the total number of rectangles (NOT counting squares) that can be found on this grid.
superhack
·
2010-01-30 13:00
J#
TCHS
-4-1100
Problem Statement Your master construction unit can build 1 unit of type 0 in times[0] seconds at a cost of costs[0]. Each unit of type 0, once built, can in turn
superhack
·
2010-01-30 10:00
C++
c
C#
TCHS
-4-500
Problem Statement In music, each note has a relative duration. For example, a whole note lasts four times longer than a quarter note. Half notes, eighth notes, an
superhack
·
2010-01-30 09:00
REST
J#
TCHS
-4-250
Problem Statement You will be running a race on a straight track, and you have devised the following trick to help you win. The weather forecast for the day of
superhack
·
2010-01-30 08:00
ch
TCHS
-3-1000
Problem Statement A decomposition of a non-negative integer n is a list of non-negative integers that sum to exactly n. The product of a decomposition is the prod
superhack
·
2010-01-29 15:00
ch
TCHS
-3-450
Problem Statement Three kids are playing the following game: A word is written on a sheet of paper, and one after another, the players take turns adding letters t
superhack
·
2010-01-29 13:00
C++
c
C#
TCHS
-3-250
Problem Statement After selling goods all day, a salesman would like to determine the most desirable item in his inventory. You are given a String[] items, eac
superhack
·
2010-01-28 14:00
apple
TCHS
-2-1000
Problem Statement A spell is defined by its incantation, the word spoken when the spell is being cast. If you know the incantation of a spell, you can create cou
superhack
·
2010-01-28 11:00
C++
c
C#
TCHS
-2-500
Problem Statement The number 666 is considered to be the occult "number of the beast" and is a well used number in all major apocalypse themed blockbuster
superhack
·
2010-01-28 09:00
C++
c
C#
TCHS
-2-250
Problem Statement A Fountain of Life is a special fountain that produces the elixir of life at a constant speed of elixir liters per second. A dark mage managed to
superhack
·
2010-01-28 08:00
ch
TCHS
-1-1000
ProblemStatement Peopleenjoymazes,buttheyalsogetthemdirty.Arrows,graffiti,andchewinggumarejustafewofthesouvenirspeopleleaveonthewalls.You,themazekeeper,areassignedtowhitenthemazewalls.Eachfaceofthe
superhack
·
2010-01-27 12:00
J#
TCHS
-1-500
Problem Statement In written languages, some symbols may appear more often than others. Expected frequency tables have been defined for many languages. For each s
superhack
·
2010-01-26 16:00
C++
c
C#
J#
UP
TCHS
-1-250
Problem Statement A speed radar is installed in a highway zone where the maximum speed limit is maxLimit mph, and the minimum speed limit is minLimit mph. Any rea
superhack
·
2010-01-26 16:00
ch
TC-Practice-Record
tchs
-1none1000ptDFS利用进入的方向划分四个边
tchs
-2250pt直接算就行我写了2分500pt暴力可以过,但是判断时候不能用stringstream用算术判断也可以用构造法1000pt
乱八七糟的代码
·
2009-12-26 17:00
{思路} 关于学习,自我调节
{思路}关于学习,自我调节最近其实看了很多相关的内容,比如Petr在某次
TCHS
前在房间里面和别人聊天的内容啊,之前自己也想过有时候自己太勉强自己了,应该在需要休息的时候放松啊。
尼克舅姑
·
2008-10-02 23:00
上一页
1
2
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他