sgu
文章平均质量分 78
utoppia
这个作者很懒,什么都没留下…
展开
-
SGU 244. Height, Bisector and Median
Link To The ProblemSolution : 二分、二分a的长度,然后根据l,h计算出角平分线的长度,判断即可。。。Code: // SGU 244 Height Bisector and Median// Solution : Math Calculate//#include#include#include#include#inclu原创 2013-10-24 00:10:49 · 934 阅读 · 0 评论 -
sgu 172 eXam
172. eXamtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardIn Russia school pupils must do some exams before leaving school. Among others, t原创 2012-11-06 17:29:24 · 495 阅读 · 0 评论 -
sgu 170 Particles
170. Particlestime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardA new kind of elementary particles was discovered in recent physical experim原创 2012-11-06 16:58:44 · 360 阅读 · 0 评论 -
sgu 193 Chinese Girls' Amusement
193. Chinese Girls' Amusementtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardYou must have heard that the Chinese culture is quite differ原创 2012-11-06 23:18:13 · 9658 阅读 · 0 评论 -
sgu 184 Patties
184. Pattiestime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputPetya is well-known with his famous cabbage patties. Petya's birt原创 2012-11-06 20:53:52 · 421 阅读 · 0 评论 -
sgu 181 X-Sequence
181. X-Sequencetime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet {xi} be the infinite sequence of integers:1) x0 = A;2) xi = (alpha原创 2012-11-06 20:46:44 · 400 阅读 · 0 评论 -
sgu 118 Digital Root
118. Digital Roottime limit per test: 0.5 sec. memory limit per test: 4096 KBLet f(n) be a sum of digits for positive integern. If f(n) is one-digit number then it is a digital root for n原创 2012-10-29 09:26:13 · 344 阅读 · 0 评论 -
sgu 117 Counting
题目描述:117. Countingtime limit per test: 0.5 sec. memory limit per test: 4096 KBFind amount of numbers for given sequence of integer numbers such that after raising them to theM-th pow原创 2012-10-29 08:54:15 · 424 阅读 · 0 评论 -
sgu 196 Matrix Multiplication
196. Matrix Multiplicationtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardLet us consider an undirected graph G = which has N vertices a原创 2012-11-07 00:26:01 · 513 阅读 · 0 评论 -
sgu 163 Wise King
163. Wise Kingtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standard inputoutput: standard outputOnce upon a time in a country far away lived a king and he had原创 2012-11-05 23:29:59 · 420 阅读 · 0 评论 -
sgu 160 Magic Multiplying Machine
160. Magic Multiplying Machinetime limit per test: 1 sec.memory limit per test: 65536 KBinput: standard inputoutput: standard outputWell known Las-Vegas casino "Big Jo" has recentl原创 2012-11-05 23:13:25 · 533 阅读 · 0 评论 -
sgu 168 Matrix
168. Matrixtime limit per test: 1 sec.memory limit per test: 16000 KBinput: standardoutput: standardYou are given N*M matrix A. You are to find such matrix B, that B[i,j]=min{ A[x,原创 2012-11-06 00:19:01 · 443 阅读 · 0 评论 -
sgu 155 Cartesian Tree
155. Cartesian Treetime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standard inputoutput: standard outputLet us consider a special type of binary search trees, ca原创 2012-11-05 21:07:23 · 383 阅读 · 0 评论 -
sgu 116 Index of super-prime
题目描述:116. Index of super-primetime limit per test: 0.5 sec. memory limit per test: 4096 KBLet P1, P2, … ,PN, … be a sequence of prime numbers. Super-prime number is such a prime number原创 2012-10-26 11:38:49 · 562 阅读 · 0 评论 -
sgu 115 Calendar
题目描述:115. Calendartime limit per test: 0.5 sec. memory limit per test: 4096 KBFirst year of new millenium is gone away. In commemoration of it write a program that finds the name of th原创 2012-10-26 10:52:48 · 363 阅读 · 0 评论 -
sgu 114 Telecasting station
题目描述:114. Telecasting stationtime limit per test: 0.5 sec. memory limit per test: 4096 KBEvery city in Berland is situated on Ox axis. The government of the country decided to build ne原创 2012-10-26 10:31:12 · 461 阅读 · 0 评论 -
sgu 175 Encoding
175. Encodingtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet phi(W) is the result of encoding for algorithm:1. If the length of W is原创 2012-11-06 17:39:00 · 412 阅读 · 0 评论 -
sgu 180 Inversions
180. Inversionstime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardThere are N integers (1A[j].InputThe first line of the input contains原创 2012-11-06 20:16:19 · 399 阅读 · 0 评论 -
SGU 283. Mechanics
Link To The ProblemSolution : 先判断是否碰撞、然后模拟。Code:// SGU 283 Mechanics// Solution : 模拟//#include#include#include#include#include#include#includeusing namespace std;#define F原创 2013-10-22 23:03:08 · 662 阅读 · 0 评论 -
SGU 446. Rotation Estimation
Link To The ProblemSolution : 枚举旋转的角度、注意精度,开到1e-6就行了,太大了可能出错Code:// SGU 446 Rotation Estimation// 枚举、凸包、旋转#include#include#include#include#include#include#includeusing names原创 2013-10-22 13:16:12 · 743 阅读 · 0 评论 -
SGU 227. The art to the broad masses!
Link To The ProblemSolution : 圆交、点在弧上的判断PS: SGU 的数据真真有点恶心,一开始完全没有意识到还有重合的情况啊。。Code:// SGU 227 The art to thr broad masses// Solution :圆交、点在弧上的判断、// 两弧相交的结果是,一个点、两个点、一段弧、没有//#in原创 2013-10-22 09:54:39 · 685 阅读 · 0 评论 -
SGU 253. Theodore Roosevelt
Link To The ProblemSolution : 三角剖分、二分、极角排序Code://SGU 253 Theodore Roosevelt//Solution : 三角剖分、二分#include#include#include#include#include#include#includeusing namespace std;#原创 2013-10-22 11:14:27 · 770 阅读 · 0 评论 -
SGU 110. Dungeon
Link To The Problem知识点: 三维 直线和球的交、向量旋转Code:// SGU 110 Dungeon// 三维直线和圆的交、向量旋转#include#include#include#include#include#includeusing namespace std;#define nMax 10010#define原创 2013-10-18 17:06:31 · 665 阅读 · 0 评论 -
SGU 497. Abelian Groups
SGU 497497. Abelian GroupsTime limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardAndrew has just made a breakthrough in group theory: he reali原创 2013-08-23 20:12:08 · 770 阅读 · 0 评论 -
SGU_511_Fermat's Last Theorem
PRO IS HEREx^n + y^n = z^n (mod p)假设p的原根是r我们设 x=r^a,y=r^b,z=r^c;原方程化为r^an + r^bn = r^cn (mod p)令R=r^n设a=> 1 + R^(b-a) = R^(c-a) (mod p) (c>=a)或者R^(a-c) + R^(b-c) = 1 (mod p)原创 2013-07-29 17:09:01 · 1213 阅读 · 5 评论 -
SGU_271_Book_Pile
PRO IS HERE双端队列模拟过程即可,很像2013华中网络预赛的某题。。。好像是D#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)原创 2013-04-19 21:08:02 · 604 阅读 · 0 评论 -
sgu 142 Keyword
142. Keywordtime limit per test: 1 sec. memory limit per test: 16384 KBKevin has inventeda new algorithm to crypt and decrypt messages, which he thinks is unbeatable.The algorithm uses a very原创 2012-11-15 23:15:09 · 432 阅读 · 0 评论 -
sgu 194 Reactor Cooling
194. Reactor Coolingtime limit per test: 1 sec.memory limit per test: 65536 KBinput: standardoutput: standardThe terrorist group leaded by a well known international terrorist Ben原创 2012-11-10 11:01:48 · 461 阅读 · 0 评论 -
sgu 199 Beautiful People
199. Beautiful Peopletime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardThe most prestigious sports club in one city has exactly N members.原创 2012-11-08 12:31:05 · 828 阅读 · 0 评论 -
sgu 174 Walls
174. Wallstime limit per test: 1.5 sec.memory limit per test: 32768 KBinput: standardoutput: standardPeople of country T-land lived on the big plain many years ago. It is happened原创 2012-11-07 19:53:19 · 627 阅读 · 0 评论 -
sgu 178 Golden chain
178. Golden chaintime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardPeter arrived to the city and stayed in the hotel. He has no money but fe原创 2012-11-07 19:37:18 · 569 阅读 · 0 评论 -
sgu 169 Numbers
169. Numberstime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet us call P(n) - the product of all digits of number n (in decimal notation)原创 2012-11-06 15:43:39 · 449 阅读 · 0 评论 -
sgu 186 The Chain
186. The Chaintime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputSmith has N chains. Each chain is the sequence of successively原创 2012-11-06 22:31:26 · 656 阅读 · 0 评论 -
sgu 113 Nearly prime numbers
题目描述:113. Nearly prime numberstime limit per test: 0.5 sec. memory limit per test: 4096 KBNearly prime number is an integer positive number for which it is possible to find such primes原创 2012-10-26 09:07:18 · 406 阅读 · 0 评论 -
sgu 154 Factorial
154. Factorialtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputYou task is to find minimal natural number N, so that N! contai原创 2012-11-05 02:07:04 · 369 阅读 · 0 评论 -
sgu 153 Playing with matches
153. Playing with matchestime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputLittle boy Petya plays a game with his friend. They原创 2012-11-04 23:05:10 · 393 阅读 · 0 评论 -
sgu 133 Border
题目描述:133. Bordertime limit per test: 0.5 sec. memory limit per test: 4096 KBAlong the border betweenstates A and B there are N defence outposts. For everyoutpostk, the interval [Ak原创 2012-11-01 20:34:48 · 382 阅读 · 0 评论 -
sgu 131 Hardwood floor
题目描述:131. Hardwood floortime limit per test: 0.5 sec. memory limit per test: 4096 KBThe banquet hall of Computer Scientists' Palace has a rectangular form of the size M x N (11) rect原创 2012-11-01 18:48:23 · 911 阅读 · 1 评论 -
sgu 101 Domino
题目描述: 101. Domino time limit per test: 0.5 sec.原创 2012-10-23 19:15:29 · 781 阅读 · 0 评论 -
sgu 130 Circle
题目描述:130. Circletime limit per test: 0.5 sec. memory limit per test: 4096 KBOn a circle border there are 2k different points A1, A2, ..., A2k, located contiguously. These points connec原创 2012-11-01 14:58:04 · 479 阅读 · 0 评论