You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.

angular

Last visit:  23 months ago
Registered:  7 years ago
2.
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 130 [рейтинговый для Div. 2] Привет, Codeforces! В [contest_time:1697] состоится [contest:1697]. Продолжается серия образовательных раундов в рамках инициативы [Harbour.Space University](https://harbour.space/)! Подробности о сотрудничестве [Harbour.Space University](https://harbour.space/) и Codeforces можно прочитать <a href="http://codeforces.me/blog/entry/51208">в посте</a>. Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за каждую неверную посылку до посылки, являющейся полным решением, равен 10 минутам. После окончания раунда будет период времени длительностью в 12 часов, в течение которого вы можете попробовать взломать абсолютно любое решение (в том числе свое). Причем исходный код будет предоставлен не только для чтения, но и для копирования. Вам будет предложено **6 или 7 задач на 2 часа**. Мы надеемся, что вам они покажутся интересными. Задачи вместе со мной придумывали и готовили Адилбек [...
years of experience in Angular._ - _At least 1-3 year of experience working in React._ - _Strong, )_ _Требования для **Frontend разработчика**:_ - _Опыт работы в Angular не менее 1-3 лет, - _At least 1-3 years of experience in Angular._ - _At least 1-3 year of experience working in, - _Опыт работы в Angular не менее 1-3 лет._ - _Опыт работы в React не менее 1-3 лет

Full text and comments »

  • Vote: I like it
  • +150
  • Vote: I do not like it

3.
By brunomont, 4 weeks ago, In English
tgen::miniblog(7): random simple polygons <center> <img src="/predownloaded/72/82/7282f22a0748c711b1964af0315893578b0d32d5.png" style="width: 350.0px;max-width: 100.0%;max-height: 100.0%;"> </center> <i>This is blog 7 of a series of blogs about algorithmic challenges I came across when creating [tgen](https://codeforces.me/blog/entry/154468).</i> In this blog we will tackle: 1. Given $n$ distinct points that are not all collinear, order them as the vertices of a random simple polygon, in $\mathcal O(n\log n)$ expected time. <center> <img src="/predownloaded/62/2d/622d80615310a2bf5fc005ab7924ff87d1f413d3.gif" alt="Animation of a simple polygon being built by recursively splitting the points" style="width: 560.0px;max-width: 100.0%;max-height: 100.0%;"> <br> <i>Building a simple polygon by recursively splitting the points.</i> </center> A polygon is **simple** if its boundary does not intersect itself. A random permutation of the points usually has many crossings, and repeatedly removing crossings by local ...
points in angular order around D, with pivot C separating four earlier points from four later points, ="Nine points in angular order around D, with pivot C separating four earlier points from four later

Full text and comments »

  • Vote: I like it
  • +90
  • Vote: I do not like it

4.
By hyforces, history, 3 years ago, In English
Teamscode Summer 2023 Editorial This is the editorial for the recent Teamscode Summer 2023 contest, and the problems are open for upsolving on this [gym](https://codeforces.me/gym/104520). Problems were prepared by [user:oursaco,2023-08-22], [user:dutin,2023-08-22], [user:thehunterjames,2023-08-22], [user:Bossologist,2023-08-22], [user:Esomer,2023-08-22], [user:danx,2023-08-22], [user:codicon,2023-08-22], [user:willy108,2023-08-22], and [user:hyforces,2023-08-22]. The problems were tested by [user:omeganot,2023-08-22], [user:codicon,2023-08-22], [user:cry,2023-08-22], [user:skye_,2023-08-22], [user:Litusiano_,2023-08-22], and [user:apple_method,2023-08-22]. ### [A. Who is cooking?](https://codeforces.me/gym/104520/problem/A) <spoiler summary="Solution"> danx </spoiler> <spoiler summary="Code"> ~~~~~ print("Esomer") ~~~~~ </spoiler> ### [B. Restaurant Sorting](https://codeforces.me/gym/104520/problem/B) <spoiler summary="Solution"> The answer is $n - $ the longest prefix of the array where a...
Try doing a DP in angular-sweep order for each point. , all points $j$ with a simple radial sweep. For angular queries, let $\rho_{i,j}$ be the sum of weights, using a push-forward DP and a second angular sweep.

Full text and comments »

  • Vote: I like it
  • +84
  • Vote: I do not like it

5.
By arthur_9548, 6 months ago, In English
Editorial: VII UnBalloon Contest We hope everyone enjoyed the problems of [contest:106523]! This editorial contains the description of the solutions and their implementation. Feel free to discuss them in the comments! #### Problem A - Idea: [user:lucassala,2026-05-17] - Preparation: [user:lucassala,2026-05-17] <spoiler summary="Solution"> This is a classic problem where we can solve the queries offline. First, we receive all the queries, calculate the response for each node, and then respond. To calculate the response for each node, we will perform a DFS starting at vertex $1$ and create a map where we maintain the frequency of each color along the path from the root to the current node in the DFS. When we enter a new vertex, we add $1$ to the frequency of the current vertex's color in the map, and when we leave that node, we subtract $1$ from that color's frequency. Furthermore, we must ensure that all colors in the map have a positive frequency, removing any colors that reach a frequency of $0$ from the map...
**Be careful with the point $(0, 0)$ during angular sorting.** , . **Complexity:** $O((n+q)\log(n+q))$. **Be careful with the point $(0, 0)$ duringangular sorting

Full text and comments »

  • Vote: I like it
  • +23
  • Vote: I do not like it

6.
By skywalkert, history, 7 years ago, In English
2017 CMUT BeihangU Contest, Editorial This editorial corresponds to [contest:102253] (stage 1), which was held on Jun 25th, 2017. There are 12 problems in total. You can solve them as a team member or an individual in a 5-hour contest. By the time you join as virtual participants, 770 teams, or even more, will compete with you virtually. --- Editorial in the English version has been completed, which is a bit different from its Chinese version (mostly because I don't want bad editorials to ruin the contest, lol). However, **for the sake of hiding spoilers**, editorials are locked and will be shown as the following conditions are met: - Editorials for the easiest 4 problems will be revealed after the replay **(all unlocked)**; - Each for the hardest 5 will be released if the corresponding problem has been solved by at least 5 users or teams on Codeforces::Gym **(all unlocked)**; - Each for the others will be published when the relevant problem has been solved by at least 10 users or teams in virtual participati...
consider coaxial gears, which have the same angular velocity, as a block and then consider the effect of, gear. Together with the maximum relative difference in the component, the real maximumangular velocity, their angular velocities be $\omega_x$, $\omega_y$ respectively, and then we have $\ln \omega_y, , which have the same angular velocity, as a block and then consider the effect of gear meshing. If the, When a gear is replaced, the angular velocity of its block may be changed if it is the shallowest

Full text and comments »

  • Vote: I like it
  • +49
  • Vote: I do not like it

7.
By dalex, 12 years ago, translation, In English
EZ Collections, EZ Life (new Java library for contests) Hello guys, I'm going to tell you about one of the negative aspects of Java on programming contests (actually, not only on contests), or, more precisely, how I have tried to resolve it. As you may know, Java has the disadvantage related to its collections library: the constraints of this language make you use object types even when using primitive types should be enough. Compare `ArrayList<Integer>` and `vector<int>`: Java list stores objects of type Integer, which are created every time when you add an element into the list (it's called boxing / unboxing), whereas C++ vector just stores ints. This behaviour slows down Java programs, and many people don't like it. All this shit comes from the language design: you can't simply write a primitive type inside the angular brackets in Java. Some months ago I was thinking about this problem and came to the solution: why not just write my own collections library, with primitive types? Moreover, I haven't found any library with really all...
from the language design: you can't simply write a primitive type inside the angular brackets in, angular brackets in Java. Some months ago I was thinking about this problem and came to the solution

Full text and comments »

  • Vote: I like it
  • +77
  • Vote: I do not like it

8.
By megaspazz, history, 4 years ago, In English
Visualize your ranking as a function of time into the contest! I have always been curious about my ranking in the leaderboard as a function of time, since I have always suspected that I am rather slow on easy problems. To learn Angular, I built a web app that displays your ranking throughout any given contest. If you are interested, please give it a try: https://megaspazz.github.io/CodeRank/ As of now, it works with normal CF rounds and ICPC-style rounds; it should *probably* work with IOI-style contests, but they seem to be rare on Codeforces. It doesn't really work for marathon-style contests. Example screenshot: ![Example screenshot](/predownloaded/61/f2/61f229357e8579e17752bcf517be12adb1729007.png) Some notes: 1. Codeforces API sometimes doesn't report hacks for contests, for example [API link](https://codeforces.me/api/contest.hacks?contestId=1198) for [contest:1198] seems to always report an internal error. 2. It's hosted serverless on Github pages, so I manually pre-process all of the contests so that the JSON only ...
always suspected that I am rather slow on easy problems. To learn Angular, I built a web app that, To learn Angular, I built a web app that displays your ranking throughout any given contest.

Full text and comments »

  • Vote: I like it
  • +188
  • Vote: I do not like it

9.
By MrMoon, 4 months ago, In English
PSUT JCPC Qualification 2026 Tutorial Hints are mostly related, so you have to think and get some observations before understanding the next, make sure to understand the code before you submit it as well, "Most problems in life are due two reasons: act without thinking, think without acting" ~the,2026-08-02 poet,2026-08-01 Big thank you to the testers for improving this problem set beyond what it was, [user:the_seal,2026-08-02] , [user:Rayo,2026-08-02], [user:samsoom,2026-08-02], [user:lazlooz,2026-08-02] The contest exist in the group so make sure to join https://codeforces.me/group/ppRciMeJFg Some of these problems were inspired from other problems across the internet, "If I have seen further, it is by standing on the shoulders of giants." ~the,2026-08-02 poet [Problem A: MrMoon creates Lucky Number Seven Command](https://codeforces.me/group/ppRciMeJFg/contest/707652/problem/A) ================== ### 7 [Problem B: Moon creates seal backflips](https://codeforces.me/group/ppRciMeJFg/contest/707652/probl...
"vulnerable" angular interval. The most frustrating part, The core of the problem is determining the exact angular interval, origin, the beam's intersection with the whole shape is continuous. The total angular range where, vertices to find the polygon's total "vulnerable" angular interval. , . The angular half-width of this interaction is $\beta_i = \arcsin(d / r_i)$. - Therefore, the beam

Full text and comments »

  • Vote: I like it
  • +21
  • Vote: I do not like it

10.
By amartya110, 5 months ago, In English
Editorial CodeHurdle Athlos 06 We want to thank you all for participating in the contest, and hope you enjoyed it. Any feedback would be appreciated! [contest:697296] [problem:697296A] Writer: [user:amartya110,2026-01-19] <spoiler summary="Hint"> Consider the best possible opening move for Alice. Is there a move she can make that immediately removes all future options for Bob?</spoiler> <spoiler summary="Editorial"> Any positive integer $n$ can be uniquely factored into $n = S \cdot M$, where $S$ is the largest perfect square that divides $n$, and $M$ is a strictly square-free integer. This is a finite game of perfect information, but we don't need Nim-values or Grundy's Theorem because there is a dominating "instant win" strategy. * If $n$ is initially square-free, it has no perfect square divisors $> 1$. Alice has no valid moves on turn 1 and loses immediately. * If $n$ is not square-free, Alice can simply choose to divide $n$ by $S$ (the largest perfect square divisor) on her very first...
$V_0$ to all other vertices divide the polygon into $K-2$ angular wedges., $. The rays from $V_0$ to all other vertices divide the polygon into $K-2$ angular wedges. For each

Full text and comments »

  • Vote: I like it
  • +11
  • Vote: I do not like it

11.
By Fefer_Ivan, 16 years ago, In English
Codeforces Round 28 - tutorial <p> <size =="" 18=""><strong>A. <a href="http://codeforces.me/contest/28/problem/A">Bender Problem</a></strong></size><br> Solution by <a href="http://codeforces.me/profile/Polichka">Polichka</a><br> Let's look at the first nail. If it is occupied by the fold place, then Bender will put next fold place on the third nail, then on fifth and so on. Else, is the first nail occupied by end, than second, fourth, sixth and so on nail will be occupied by the fold places.<br> Let's see, if we can complete our polyline with the first nail, occupied by rhe fold place. It means we should check, if we have an unused pod with length $dist(nails[n], nails[1]) + dist(nails[1], nails[2])$. Then check the third nail and so on.<br> If we have completed the polyline, then we have an answer. Else repeat previous procedure, but starting from the second nail.<br><br> <size =="" 18=""><strong>B. <a href="http://codeforces.me/contest/28/problem/B">pSort</a></strong></size><br> Solution by <a hr...
Oxy plane is not collinear. This angle is easy to calculate. Angular vertex is DravDe starting, collinear. This angle is easy to calculate. Angular vertex is DravDe starting point and one of half

Full text and comments »

  • Vote: I like it
  • +12
  • Vote: I do not like it

12.
By Siyah, history, 12 months ago, In English
Euler to AVX: Hi, I'm AmirMohammad (commonly known as **Danet**). I was inspired to write this article after completing my Calculus 1 course to bridge the gap between theory and implementation. Naturally, as a non-native speaker, the translation and editing process involved some assistance. If you spot any technical or linguistic errors, I would be grateful if you pointed them out! ## 1. Mathematical Foundations and Definitions The trigonometric and hyperbolic function families are intrinsically linked through complex analysis, specifically via Euler's formula: $$ e^{ix} = \cos x + i \sin x $$ ### 1.1 Trigonometric Functions (Circular Functions) These functions are defined geometrically based on a point $(x, y)$ on a unit circle of radius 1, where the angle subtended at the origin is $\theta$ (or $x$ radians): $$ \begin{align} \sin x &= y \\ \cos x &= x \\ \tan x &= \frac{\sin x}{\cos x} = \frac{y}{x} \\ \csc x &= \frac{1}{\sin x} \\ \sec x &= \frac{1}{\cos x} \\ \cot x...
like `atan2` for multi-quadrant angular calculations. Mastering these numerical nuances is, angular calculations. Mastering these numerical nuances is paramount for reliable solutions in

Full text and comments »

  • Vote: I like it
  • +21
  • Vote: I do not like it

13.
By shestimerk, 10 years ago, In Russian
Анонс Tinkoff Challenge Про Tinkoff.ru ============== Мы самый технологичный IT-банк России, работаем онлайн, без отделений. Больше всего похожи на IT-компанию: молодые сотрудники, молодой менеджмент, отсутствие дресс-кода на большинстве позиций, минимум бюрократии, классный офис, высокая зарплата за ум и талант. Мы делаем финансовые продукты, которые упрощают жизнь миллионам людей. Мы заботимся о клиентах и сотрудниках. Недавно переехали в новый офис с огромным спортзалом. В офисе есть несколько переговорных зон для проведения встреч, кухни. В офисе работает сервис по доставке здоровой еды, основанный одним из сотрудников. Работники могут заказать себе обед с вечера, а утром он окажется в холодильнике в офисе. В планах руководства — в ближайшие несколько месяцев открыть в офисе столовую. ![ ](http://codeforces.me/predownloaded/cd/1c/cd1c331abaac6234aac1443a40a7d5ea20809bcd.jpg) Мы знаем ценность аналитического ума и помогаем талантливым ребятам развиваться дальше. У нас есть своя бесплатная шко...
============== Используем Angular 2 и 4, React для фронтенда, Java, Scala, C#, Python для бэкенда и, Про технологии ============== Используем Angular 2 и 4, React для фронтенда, Java, Scala, C

Full text and comments »

  • Vote: I like it
  • +177
  • Vote: I do not like it

14.
By karamkontar, 8 years ago, In English
ACPC Arab Collegiate Programming Contest 2018 Editorial Hello, Since the editorial posted for the ACPC 2018 is rather complicated (no offense), I decided to write my own tutorial with much simpler solutions. There are two problems missing, and, hopefully, they will be available soon. Hope you like it! [problem:101991A] <spoiler summary="Hint"> A tree has all its edges as bridges (initially $ \relax N-1 $ bridges). </spoiler> <spoiler summary="Hint"> Joining the end-points of a simple path with length $ \relax P $ edges, removes $ \relax P $ bridges from the tree (resulting in $ \relax N-1-P $ bridges). </spoiler> <spoiler summary="Tutorial"> Initially, all edges of the given tree are bridges since removing any of them disconnects the graph. So, we start with $ \relax N-1 $ bridges. Joining the end-points of a simple path with length $ \relax P $ edges, removes $ \relax P $ bridges from the tree (resulting in $ \relax N-1-P $ bridges). Since we want the resulting graph to have the number of bridges in $ \relax [L, R] $,...
$ \relax OK $ is also an angular bisector of the angle, then $ \relax \alpha = \angle KOF = 1/2 * \angle, $ are isosceles with vertex $ \relax O $ and heights (medians, perpendicular bisectors,angular, with vertex $ \relax O $ and heights (medians, perpendicular bisectors, angular bisectors) $ \relax

Full text and comments »

  • Vote: I like it
  • +11
  • Vote: I do not like it

15.
By Abanoub_Ashraf, 4 years ago, In English
How to sort points (x,y) in clockwise ? Angular Sorting ================== hello , my friends This is my first blog and I want to share some knowledge that may help other to solve some problems and if you have another algorithm you can explain it in comments . Let's start , you are given n points . each point is at integer coordinates (x,y) . can you sort them in clockwise order and vice versa ? the points are here like that ![ ](/predownloaded/ca/4f/ca4fd5cae86b49161742c860be172febf56afa69.png) Think about it for a bit and then continue with me ... if we have slope from each point and (0,0) ? Nice , we can get angle with x-axis and from this we can sort them !! we can see like this ![ ](/predownloaded/2f/a4/2fa4791c68c322b81f94c8a94f63b0203dafdd09.png) let's calculate the angle angle = atan2(y,x) &mdash; in redius . angle = atan2(y,x) * 180 /PI &mdash; this is in degree . but what about negative angles ?! we can add 360 degree to be positive . angle...
Angular Sorting ================== hello , my friends

Full text and comments »

  • Vote: I like it
  • +9
  • Vote: I do not like it

16.
By KamilBek, 9 years ago, In Russian
Команда Казанского федерального университета принимает участие в сборах Сазанка-2017. Спонсором выступил CLOVER GROUP Команда КФУ принимает участие в медународной школе по программированию Сазанка-2017. От нашего университета выступают Нигматуллин Ранис(3 курс ИВМиИТ-ВМК КФУ), Иликаев Артем(1 курс ИВМиИТ-ВМК КФУ), Капралов Руслан(1 курс ИВМиИТ-ВМК КФУ). ![ ](/predownloaded/c6/01/c6016615d65b037f973214e49da9bb8006f6202b.jpg) Ребята получают новые знания и тренируются перед новым сезоном. Мы благодарим спонсоров за финансирование этой поездки. Спонсором выступила компания CLOVER GROUP. Мы приведем информацию о компании: Российский разработчик платформы интеллектуального анализа данных для промышленных предприятий. Внедряем интеллектуальную предиктивную аналитику на промышленных предприятиях: энергетика, машиностроение, нефть, газ, металлообработка. В компании работают специалисты по машинному обучению, разработчики и отраслевые эксперты. Присоединяйтесь к Clover Group для трансформации производства в цифровое пространство и развития рынка IIoT. Вакансии: data scientist https://tat...
о средствах помогающих в создании SPA приложений: Angular 1, Angular 2, React. Что нужно будет, , linters, GIT; Имеешь представление о средствах помогающих в создании SPA приложений:Angular 1, Angular

Full text and comments »

  • Vote: I like it
  • -23
  • Vote: I do not like it

17.
By rng_58, history, 10 years ago, In English
GP of Eurasia Let's discuss problems. How to solve 8? I have no idea at all and finally decided to believe that we don't need nested addition/subtraction blocks, but it got WA. It seems there are harder cases. How to solve 12? Essentially it reduces to the following: you are given a circle $C$ and a point $P$. Find the movement of a point on $C$ whose angular velocity is proportional to the distance from $P$. Is numerical integration accurate enough?
$P$. Find the movement of a point on $C$ whose angular velocity is proportional to the distance from, $. Find the movement of a point on $C$ whose angular velocity is proportional to the distance from

Full text and comments »

  • Vote: I like it
  • +53
  • Vote: I do not like it

18.
By longyitongxue, history, 4 weeks ago, In English
AtCoder ABC481 Solution (A~E) A ================== Convert the value of $A+B$ to a string, and output the length of the string. <spoiler summary="Code"> [Submissions](https://atcoder.jp/contests/abc481/submissions/80297478) ~~~~~cpp #include<bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); long long a,b; cin>>a>>b; cout<<to_string(a+b).size(); return 0; } ~~~~~ </spoiler> B ================== Determine whether $k$ belongs to $(\min(a_i, a_{i+1}), \max(a_i, a_{i+1}))$ or $a_{i+1}$. <spoiler summary="Code"> [Submissions](https://atcoder.jp/contests/abc481/submissions/80311177) ~~~~~cpp #include<bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); long long n,k; cin>>n>>k; long long ans=0,a=0; cin>>a; if(a==k) ans++; for(int i=2;i<=n;i++){ long long x; cin>>x; if(x==k)ans++; if(min(a,x)<k&&k<max(a,x))ans++; a=x; } co...
$, is positive, which guarantees the angular span is strictly less than $180^\circ$.

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

19.
By sahilanand, history, 5 years ago, In English
Sequences Helpful In CP ### **Arithmetic Sequence:-** - The sequence in which each consecutive terms has a same common difference. - Eg:-0, 2, 4, 6, 8,... - a is the first term of the sequence, d is the common difference and n is no. of terms - To find the nth term of AP:an = a+(n-1)*d - To find the sum of the AP: Sn = (n/2)*[2a + (n-1)*d] - = (n/2)*[a + {a + (n-1)*d}] [: expression in angular bracket is an] - = (n/2)*(af+al) - Hence, the sum of AP can also be written as: Sn = (n/2)*(af+al) [:af=first term & al=last term] ### **Geometric Sequence:-** - The sequence in which each consecutive term has a common ratio. - Eg:-1, 5, 25, 125,... - a is the first term of the sequence, r is the common ratio and n is no. of terms - To find the nth term of GP:an = (a * r^(n-1)) - To find the sum of the GP: Sn = a * {[r^(n-1)-1]/[r-1]} ### **Harmonic Sequence:-** - The sequence in which the reciprocal of each term forms an arithmetic sequence. - Eg:-(1/2),(1/4),(1/6),(1/8),... - Summat...
= (n/2)*[2a + (n-1)*d] - = (n/2)*[a + {a + (n-1)*d}] [: expression in angular bracket is an

Full text and comments »

  • Vote: I like it
  • -42
  • Vote: I do not like it

20.
By ashmelev, 16 years ago, translation, In English
Codeforces Beta Round #66 editorial: Problems D, E, F <p class="MsoNormal"><b><span lang="EN-US">Problem D</span>.</b></p> <p class="MsoNormal"></p><p class="MsoNormal"><p class="MsoNormal"><span class="apple-style-span"><span lang="EN-US" style="font-size:12.0pt;line-height:115%;font-family:&quot;Times New Roman&quot;,&quot;serif&quot;; mso-ansi-language:EN-US">First, let’s divide graph to connected components (provinces). Next, we consider only new graph on these components – for each province we assign a vertex of the <span style="color:black">graph.</span></span></span><span class="apple-converted-space"><span lang="EN-US" style="font-size:12.0pt; line-height:115%;font-family:&quot;Times New Roman&quot;,&quot;serif&quot;;color:black;mso-ansi-language: EN-US">&nbsp;</span></span><span class="apple-style-span"><span lang="EN-US" style="font-size:12.0pt;line-height:115%;font-family:&quot;Times New Roman&quot;,&quot;serif&quot;; color:black;mso-ansi-language:EN-US">Let the total number of provinces is <i style="mso-bidi-font-styl...
">It is easy to check that while the angular velocity of the turret is a constant, the linear, angular velocity of the turret is a constant, the linear velocity of the enemy sight along the segment

Full text and comments »

  • Vote: I like it
  • +24
  • Vote: I do not like it