Are you over 18 and want to see adult content?
More Annotations
![A complete backup of https://ark-hotel.co.jp](https://www.archivebay.com/archive6/images/56327584-4537-4df9-b2d1-f4a1666e81c5.png)
A complete backup of https://ark-hotel.co.jp
Are you over 18 and want to see adult content?
![A complete backup of https://inrdeals.com](https://www.archivebay.com/archive6/images/22a2f780-5386-44b6-add3-d7309fdb70b9.png)
A complete backup of https://inrdeals.com
Are you over 18 and want to see adult content?
![A complete backup of https://fiftiesstore.com](https://www.archivebay.com/archive6/images/4c3d2f8e-4d77-4231-9d23-daf9ddf4743f.png)
A complete backup of https://fiftiesstore.com
Are you over 18 and want to see adult content?
![A complete backup of https://biurofestiwalowe.pl](https://www.archivebay.com/archive6/images/aeb7ae64-9048-4d96-8f54-416fbb86653e.png)
A complete backup of https://biurofestiwalowe.pl
Are you over 18 and want to see adult content?
![A complete backup of https://airvisual.com](https://www.archivebay.com/archive6/images/7730a5ac-34c4-4655-8ef9-95d00fcfd3e4.png)
A complete backup of https://airvisual.com
Are you over 18 and want to see adult content?
![A complete backup of https://pageflipgallery.com](https://www.archivebay.com/archive6/images/5c25c2b1-2fe5-4a3a-9b46-acb13505f814.png)
A complete backup of https://pageflipgallery.com
Are you over 18 and want to see adult content?
![A complete backup of https://cuenca.es](https://www.archivebay.com/archive6/images/6dc3b451-640f-4b8b-b928-acc45f4690a7.png)
A complete backup of https://cuenca.es
Are you over 18 and want to see adult content?
![A complete backup of https://heraldica.org](https://www.archivebay.com/archive6/images/e05acab3-3dd9-4048-a365-4b6ac5bc4a62.png)
A complete backup of https://heraldica.org
Are you over 18 and want to see adult content?
![A complete backup of https://jalpaigurihealth.com](https://www.archivebay.com/archive6/images/d181a7f0-377b-42c7-8548-19c205f4e5e0.png)
A complete backup of https://jalpaigurihealth.com
Are you over 18 and want to see adult content?
![A complete backup of https://tongeren.be](https://www.archivebay.com/archive6/images/a4deb855-521b-4221-a786-b01a886a81b9.png)
A complete backup of https://tongeren.be
Are you over 18 and want to see adult content?
Favourite Annotations
![A complete backup of https://hot-ishikawa.jp](https://www.archivebay.com/archive6/images/ad1ab5e4-7eea-4e53-8d97-68a86ebc0ae0.png)
A complete backup of https://hot-ishikawa.jp
Are you over 18 and want to see adult content?
![A complete backup of https://yourpart.eu](https://www.archivebay.com/archive6/images/172fbc9e-7415-4a5f-a2d5-c4140f94f3f2.png)
A complete backup of https://yourpart.eu
Are you over 18 and want to see adult content?
![A complete backup of https://cdispatch.com](https://www.archivebay.com/archive6/images/d45b7576-5994-4543-8a95-465e8651d84f.png)
A complete backup of https://cdispatch.com
Are you over 18 and want to see adult content?
![A complete backup of https://dhpfurniture.com](https://www.archivebay.com/archive6/images/15eb4a55-4da0-4ad4-99b0-04b338a37d4c.png)
A complete backup of https://dhpfurniture.com
Are you over 18 and want to see adult content?
![A complete backup of https://shoeology.com](https://www.archivebay.com/archive6/images/a0318db7-7553-44a0-ae70-17357ea69ae7.png)
A complete backup of https://shoeology.com
Are you over 18 and want to see adult content?
![A complete backup of https://treasurechest.com.ua](https://www.archivebay.com/archive6/images/02bbbb2b-a086-4f32-88c2-65207495af45.png)
A complete backup of https://treasurechest.com.ua
Are you over 18 and want to see adult content?
![A complete backup of https://pureref.com](https://www.archivebay.com/archive6/images/15040977-aa1b-4e9e-90d0-665a0b1fcae3.png)
A complete backup of https://pureref.com
Are you over 18 and want to see adult content?
![A complete backup of https://thecalmzone.net](https://www.archivebay.com/archive6/images/83d7e5fb-1d7b-4af8-89e0-5bb4f85302cb.png)
A complete backup of https://thecalmzone.net
Are you over 18 and want to see adult content?
![A complete backup of https://cuisineaddict.com](https://www.archivebay.com/archive6/images/56da274e-762c-4aa0-ac34-05067b05c248.png)
A complete backup of https://cuisineaddict.com
Are you over 18 and want to see adult content?
![A complete backup of https://klotti.de](https://www.archivebay.com/archive6/images/808df8e7-b2d5-4dd1-a1ea-7d1f29e08613.png)
A complete backup of https://klotti.de
Are you over 18 and want to see adult content?
![A complete backup of https://pr-cy.ru](https://www.archivebay.com/archive6/images/aadece7f-d0f8-4dd6-a5a8-d545f8fbd227.png)
A complete backup of https://pr-cy.ru
Are you over 18 and want to see adult content?
![A complete backup of https://refugerecovery.org](https://www.archivebay.com/archive6/images/f32ce8bd-ec57-452e-8162-acfe513e8966.png)
A complete backup of https://refugerecovery.org
Are you over 18 and want to see adult content?
Text
LOGIN - CODEFORCES
The only programming contests Web 2.0 platform. Server time: Jun/08/2021 17:33:43 (h1). Desktop version, switch to mobile version. PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 118E - CODEFORCES Input. The first line contains two space-separated integers n and m ( 2 ≤ n ≤ 105, n - 1 ≤ m ≤ 3·105) which represent the number of junctions and the roads in the town correspondingly. Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers ai and bi ( 1 ≤ ai, bi PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
PROBLEM - 1427B - CODEFORCES The description of the test cases follows. The first line of each testcase contains two integers n, k ( 1 ≤ n ≤ 100, 000, 0 ≤ k ≤ n) – the number of games played and the number of outcomes that you can change. The second line contains a string s of length n containing only the characters W and L. If you have won the i -th gamethen s
DJQ_CPP - CODEFORCES d jq_cpp. Contest rating: 3014 (max. legendary grandmaster, 3055) Contribution: +11. Click on the graph to enable the zoom feature. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic.LOGIN - CODEFORCES
The only programming contests Web 2.0 platform. Server time: Jun/08/2021 17:33:43 (h1). Desktop version, switch to mobile version. PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 118E - CODEFORCES Input. The first line contains two space-separated integers n and m ( 2 ≤ n ≤ 105, n - 1 ≤ m ≤ 3·105) which represent the number of junctions and the roads in the town correspondingly. Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers ai and bi ( 1 ≤ ai, bi PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
PROBLEM - 1427B - CODEFORCES The description of the test cases follows. The first line of each testcase contains two integers n, k ( 1 ≤ n ≤ 100, 000, 0 ≤ k ≤ n) – the number of games played and the number of outcomes that you can change. The second line contains a string s of length n containing only the characters W and L. If you have won the i -th gamethen s
DJQ_CPP - CODEFORCES d jq_cpp. Contest rating: 3014 (max. legendary grandmaster, 3055) Contribution: +11. Click on the graph to enable the zoom feature. PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 600B - CODEFORCES 2 seconds. memory limit per test. 256 megabytes. input. standard input. output. standard output. You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the valuebj.
PROBLEM - 1521A - CODEFORCES A. Nastia and Nearly Good Numbers. Nastia has 2 positive integers A and B. She defines that: For example, if A = 6 and B = 4, the integers 24 and 72 are good, the integers 6, 660 and 12 are nearly good, the integers 16, 7 are neither good nor nearly good. Find 3 different positive integers x, y, and z such that exactly one of them is goodand
PROBLEM - 1427B - CODEFORCES The description of the test cases follows. The first line of each testcase contains two integers n, k ( 1 ≤ n ≤ 100, 000, 0 ≤ k ≤ n) – the number of games played and the number of outcomes that you can change. The second line contains a string s of length n containing only the characters W and L. If you have won the i -th gamethen s
PROBLEM - 230A - CODEFORCES In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level. In the second sample Kirito's strength is too small to defeatthe
PROBLEM - 1374B - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. PROBLEM - 1437A - CODEFORCES In the first test case, you can take, for example, a = 5 as the size of the pack. Then if a customer wants to buy 3 cans, he'll buy 5 instead ( 3 mod 5 = 3, 5 2 = 2.5 ). The one who wants 4 cans will also buy 5 cans. In the second test case, there is no way to choose a. In the third test case, you can take, for example, a = 80. PROBLEM - 1180A - CODEFORCES standard output. While playing with geometric figures Alex has accidentally invented a concept of a n -th order rhombus in a cell grid. A 1 -st order rhombus is just a square 1 × 1 (i.e just a cell). A n -th order rhombus for all n ≥ 2 one obtains from a n − 1 -th order rhombus adding all cells which have a common side with it to it(look
PROBLEM - 1511A - CODEFORCES type 2: a reviewer has watched the movie, and they dislike it — they press the downvote button; type 3: a reviewer hasn't watched the movie — they look at the current number of upvotes and downvotes of the movie on the server they are in and decide what button to press. If there are more downvotes than upvotes, then a reviewer downvotes the CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 118E - CODEFORCES Input. The first line contains two space-separated integers n and m ( 2 ≤ n ≤ 105, n - 1 ≤ m ≤ 3·105) which represent the number of junctions and the roads in the town correspondingly. Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers ai and bi ( 1 ≤ ai, bi PROBLEM - 600B - CODEFORCES 2 seconds. memory limit per test. 256 megabytes. input. standard input. output. standard output. You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the valuebj.
PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/08/2021 17:22:38 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 118E - CODEFORCES Input. The first line contains two space-separated integers n and m ( 2 ≤ n ≤ 105, n - 1 ≤ m ≤ 3·105) which represent the number of junctions and the roads in the town correspondingly. Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers ai and bi ( 1 ≤ ai, bi PROBLEM - 600B - CODEFORCES 2 seconds. memory limit per test. 256 megabytes. input. standard input. output. standard output. You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the valuebj.
PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/08/2021 17:22:38 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version. PROBLEM - 242C - CODEFORCES The black king is standing on a chess field consisting of 10 9 rows and 10 9 columns. We will consider the rows of the field numbered with integers from 1 to 10 9 from top to bottom. The columns are similarly numbered with integers from 1 to 10 9 from left to right. We will denote a cell of the field that is located in the i-th row and j-thcolumn as (i, j).
PROBLEM - 230A - CODEFORCES In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level. In the second sample Kirito's strength is too small to defeatthe
PROBLEM - 4C - CODEFORCES Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used todetermine
PROBLEM - 500A - CODEFORCES The i -th ( 1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i -th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (i + ai) to cell i using the i -th portal. It is easy to see that because of condition 1 ≤ ai ≤ n - ione
PROBLEM - 1437A - CODEFORCES In the first test case, you can take, for example, a = 5 as the size of the pack. Then if a customer wants to buy 3 cans, he'll buy 5 instead ( 3 mod 5 = 3, 5 2 = 2.5 ). The one who wants 4 cans will also buy 5 cans. In the second test case, there is no way to choose a. In the third test case, you can take, for example, a = 80. PROBLEM - 1380A - CODEFORCES The first line contains a single integer T ( 1 ≤ T ≤ 200 ) — the number of test cases. Next 2 T lines contain test cases — two lines per test case. The first line of each test case contains the single integer n ( 3 ≤ n ≤ 1000 ) — the length of the permutation p. The second line contains n integers p 1, p 2, , p n ( 1 ≤ p i PROBLEM - 453A - CODEFORCES Problem - 453A - Codeforces. Codeforces Round #259 (Div. 1) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems inthe
PROBLEM - 1061C - CODEFORCES Problem - 1061C - Codeforces. Codeforces Round #523 (Div. 2) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems inthe
CODER_PULKIT_C
The only programming contests Web 2.0 platform. Server time: Jun/07/2021 02:28:18 (j3). Desktop version, switch to mobile version. DJQ_CPP - CODEFORCES d jq_cpp. Contest rating: 3014 (max. legendary grandmaster, 3055) Contribution: +11. Click on the graph to enable the zoom feature. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 118E - CODEFORCES The first line contains two space-separated integers n and m (2 ≤ n ≤ 10 5, n - 1 ≤ m ≤ 3·10 5) which represent the number of junctions and the roads in the town correspondingly.Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers a i and b i (1 ≤ a i, b i ≤ n, a i ≠ b i) — the numbers of junctions it PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 600B - CODEFORCES 2 seconds. memory limit per test. 256 megabytes. input. standard input. output. standard output. You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the valuebj.
PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
PROBLEM - 1061C - CODEFORCES Problem - 1061C - Codeforces. Codeforces Round #523 (Div. 2) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems inthe
HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/03/2021 15:13:22 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 919D - CODEFORCES The first line contains two positive integers n, m ( 1 ≤ n, m ≤ 300 000 ), denoting that the graph has n nodes and m directed edges. The second line contains a string s with only lowercase English letters. The i -th character is the letter assigned to the i -th node.Then m
PROBLEM - 118E - CODEFORCES The first line contains two space-separated integers n and m (2 ≤ n ≤ 10 5, n - 1 ≤ m ≤ 3·10 5) which represent the number of junctions and the roads in the town correspondingly.Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers a i and b i (1 ≤ a i, b i ≤ n, a i ≠ b i) — the numbers of junctions it PROBLEM - 776C - CODEFORCES Problem - 776C - Codeforces. ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 600B - CODEFORCES 2 seconds. memory limit per test. 256 megabytes. input. standard input. output. standard output. You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the valuebj.
PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 1354B - CODEFORCES output. standard output. You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once. A contiguous substring of string s is a string that can be obtained from s by removing some (possibly zero)characters
PROBLEM - 1061C - CODEFORCES Problem - 1061C - Codeforces. Codeforces Round #523 (Div. 2) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems inthe
HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/03/2021 15:13:22 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version. PROBLEM - 1521A - CODEFORCES A. Nastia and Nearly Good Numbers. Nastia has 2 positive integers A and B. She defines that: For example, if A = 6 and B = 4, the integers 24 and 72 are good, the integers 6, 660 and 12 are nearly good, the integers 16, 7 are neither good nor nearly good. Find 3 different positive integers x, y, and z such that exactly one of them is goodand
PROBLEM - 1514B - CODEFORCES Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given two integers n and k, count the number of arrays of length n such that: the sum of its elements is as large as possible. Since the answer can be very large, print its remainder when divided by 10 9 + 7. PROBLEM - 230A - CODEFORCES In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level. In the second sample Kirito's strength is too small to defeatthe
PROBLEM - 4C - CODEFORCES Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used todetermine
PROBLEM - 500A - CODEFORCES The i -th ( 1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i -th portal. Unfortunately, one cannot use the portal backwards, which means one cannot move from cell (i + ai) to cell i using the i -th portal. It is easy to see that because of condition 1 ≤ ai ≤ n - ione
PROBLEM - 1061C - CODEFORCES Problem - 1061C - Codeforces. Codeforces Round #523 (Div. 2) Finished. → Virtual participation. Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you - solve these problems inthe
PROBLEM - 1437A - CODEFORCES In the first test case, you can take, for example, a = 5 as the size of the pack. Then if a customer wants to buy 3 cans, he'll buy 5 instead ( 3 mod 5 = 3, 5 2 = 2.5 ). The one who wants 4 cans will also buy 5 cans. In the second test case, there is no way to choose a. In the third test case, you can take, for example, a = 80. PROBLEM - 1437B - CODEFORCES standard output. You are given a string s of even length n. String s is binary, in other words, consists only of 0 's and 1 's. String s has exactly n 2 zeroes and n 2 ones ( n is even). In one operation you can reverse any substring of s. A substring of a string is a contiguous subsequence of that string. PROBLEM - 1195C - CODEFORCES The first line of the input contains a single integer n ( 1 ≤ n ≤ 10 5 ) — the number of students in each row. The second line of the input contains n integers h 1, 1, h 1, 2, , h 1, n ( 1 ≤ h 1, i ≤ 10 9 ), where h 1, i is the height of the i -th student in the first row. The third line of the input contains n integers h 2, 1, h 2 PROBLEM - 1380A - CODEFORCES The problem statement has recently been changed. View the changes. A. Three Indices. You are given a permutation p 1, p 2, , p n. Recall that sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once. p i < p j and p j > p k. Or say that there are no such indices. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 919D - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. PROBLEM - 118E - CODEFORCES The first line contains two space-separated integers n and m (2 ≤ n ≤ 10 5, n - 1 ≤ m ≤ 3·10 5) which represent the number of junctions and the roads in the town correspondingly.Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers a i and b i (1 ≤ a i, b i ≤ n, a i ≠ b i) — the numbers of junctions it PROBLEM - 776C - CODEFORCES Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value a i.. Molly wants Sherlock to fall in love with her. She intends to do this by mixing a contiguous segment of chemicals together to make a love potion with total affection value as a non-negative integer power of k. PROBLEM - 500A - CODEFORCES The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 10 4) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.. The second line contains n - 1 space-separated integers a 1, a 2, , a n - 1 (1 ≤ a i ≤ n - i).It is guaranteed, that using the given transportation system, one cannot leave the Line World. PROBLEM - 199A - CODEFORCES Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution PROBLEM - 1437A - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/03/2021 15:13:22 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version.SECONDTHREAD
The only programming contests Web 2.0 platform. Server time: Jun/05/2021 11:11:53 (f2). Desktop version, switch to mobile version. CODEFORCESCONTESTSPROBLEMSETGROUPSRATINGCALENDARHELP Hi, Codeforces users! We are announcing ITMO Summer Camp in Competitive Programming that will be held online. On each of the 10 days from June 21 to July 2 (the weekend are the rest days) two-hour lecture and two-hour practice session is going to take place.. Each day one topic is covered, and the practice session is a set of problems of that topic. PROBLEM - 919D - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. PROBLEM - 118E - CODEFORCES The first line contains two space-separated integers n and m (2 ≤ n ≤ 10 5, n - 1 ≤ m ≤ 3·10 5) which represent the number of junctions and the roads in the town correspondingly.Then follow m lines, each containing two numbers which describe the roads in the city. Each road is determined by two integers a i and b i (1 ≤ a i, b i ≤ n, a i ≠ b i) — the numbers of junctions it PROBLEM - 776C - CODEFORCES Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value a i.. Molly wants Sherlock to fall in love with her. She intends to do this by mixing a contiguous segment of chemicals together to make a love potion with total affection value as a non-negative integer power of k. PROBLEM - 500A - CODEFORCES The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 10 4) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.. The second line contains n - 1 space-separated integers a 1, a 2, , a n - 1 (1 ≤ a i ≤ n - i).It is guaranteed, that using the given transportation system, one cannot leave the Line World. PROBLEM - 199A - CODEFORCES Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution PROBLEM - 1437A - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/03/2021 15:13:22 (h2). Desktop version, switch to mobile version. RITESH1340 - CODEFORCES The only programming contests Web 2.0 platform. Server time: May/30/2021 15:23:53 (f1). Desktop version, switch to mobile version.SECONDTHREAD
The only programming contests Web 2.0 platform. Server time: Jun/05/2021 11:11:53 (f2). Desktop version, switch to mobile version. PROBLEM - 500A - CODEFORCES The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 10 4) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell which I want to go to.. The second line contains n - 1 space-separated integers a 1, a 2, , a n - 1 (1 ≤ a i ≤ n - i).It is guaranteed, that using the given transportation system, one cannot leave the Line World. PROBLEM - 230A - CODEFORCES Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer.In the duel between two opponents the duel's outcome is determined by their strength. PROBLEM - 1354B - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. BUGABOOSET - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/05/2021 07:23:33 (h2). Desktop version, switch to mobile version. PROBLEM - 1511A - CODEFORCES Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode forvirtual contests.
PROBLEM - 1359C - CODEFORCES Codeforces. Programming competitions and contests, programming community. In the first testcase the temperature after $$$2$$$ poured cups: $$$1$$$ hot and $$$1$$$ cold is exactly $$$20$$$. HEALTHYUG - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/03/2021 15:13:22 (h2). Desktop version, switch to mobile version. PROBLEM - 1437A - CODEFORCES Codeforces. Programming competitions and contests, programming community. Virtual contest is a way to take part in past contest, as close as possible to participation on time. DJQ_CPP - CODEFORCES The only programming contests Web 2.0 platform. Server time: Jun/05/2021 14:35:48 (f2). Desktop version, switch to mobile version.TMWILLIAMLIN168
The only programming contests Web 2.0 platform. Server time: Jun/05/2021 05:11:18 (f2). Desktop version, switch to mobile version.__
__ __
Enter | Register
* Home
* Top
* Contests
* Gym
* Problemset
* Groups
* Rating
* Edu
* API
* Calendar
* Help
__ Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×→ Pay attention
Before contest
Educational Codeforces Round 106 (Rated for Div. 2)11:59:38
Register now »
→ Top rated
#
USER
RATING
1
tourist
3668
2
maroonrk
3564
3
Benq
3540
4
Petr
3519
5
ecnerwala
3403
6
Radewoosh
3374
7
jiangly
3355
8
scott_wu
3313
9
ainta
3298
10
Miracle03
3294
Countries | Cities |Organizations
View all →
→ Top contributors#
USER
CONTRIB.
1
1-gon
197
2
Errichto
193
3
rng_58
188
4
awoo
187
5
SecondThread
185
6
Um_nik
182
7
vovuh
177
8
Ashishgup
176
9
antontrygubO_o
175
10
-is-this-fft-
173
View all →
→ Find user
Handle:
→ Recent actions
*
awoo → Educational Codeforces Round 106*
Justice_Hui → Easy Introduction to Kitamasa Method*
shishin → Codeforces Round #708 Editorial*
yutaka1999 → Japanese Olympiad in Informatics (JOI) Spring Camp 2021*
willy108 → a few strange lca algorithms with a few strange time complexities pt 2*
hmehta → 2021 Humblefool Cup w/ $600 in Prizes*
shishin → Codeforces Round #708*
willy108 → a few strange lca algorithms with a few strange time complexities pt 1*
atulgairola08 → How to read inputs usingJAVASCRIPT V8 ?
*
ivaneo → About proposing problems/contests*
RohitKaushal → How to take input in Node.js / Javascript from file or stdin.*
Yukuk → 1-K BFS
*
mansigpt → Congrats Um_nik*
singhabhisek696 → DSA Preparation-FAANG*
upobir → Fast Walsh Hadamard Transforms and it'sinner workings
*
rish-bish → I made a real time collaborative editor like google docs but for pair programming*
risingStark → How to solve problems of thiskind?
*
Vik → Thank you Artyom123 and shishin for Codeforces round # 708*
MikeMirzayanov → Frequently AskedQuestions
*
maroonrk → AtCoder Regular Contest 114Announcement
*
Musin → Update Kotlin targetting to Java 11*
sjsakib → Codeforces Visulaizer*
SPatrik → Codeforces Round #577 (Div 2)Editorial
*
vovuh → Codeforces Round #661 (Div. 3) Editorial*
Imakf → Codeforces Round #706 EditorialDetailed →
*
* Darknight
* Blog
* Teams
* Submissions
* Groups
* Contests
Pupil
DARKNIGHT
* Contest rating:
1349 (max. specialist, 1428)* Contribution: 0
* Friend of: 4 users * Last visit: 4 weeks ago * Registered: 5 years ago * Blog entries (0), comments
* Talks
| Send message
_
This user does not have permission to perform one or more actions fromthe list:
* write blog posts/comments,* create mashups,
* create private groups. You can confirm that you know the user personally and guarantee reasonableness and adequacy. In this case, you can grant him rights bynoting your trust.
In case of violation of any rules of the site, administrative penalties can be applied to you (up to the ban). Think twice before confirming your trust. You can review the list of people you trust by the link . " title=" This user does not have permission to perform one or more actions from the list: write blog posts/comments, create mashups, create private groups. You can confirm that you know the user personally and guarantee reasonableness and adequacy. In this case, you can grant him rights by noting your trust. In case of violation of any rules of the site, administrative penalties can be applied to you (up to the ban). Think twice before confirming your trust. You can review the list of people you trust by the link. " style="position: relative; bottom: 3px;">_ Click on the graph to enable the zoom feature.Only rated All
Apr 2016
Jul 2016
Oct 2016
Jan 2017
Apr 2017
Jul 2017
Oct 2017
Jan 2018
Apr 2018
Jul 2018
Oct 2018
Jan 2019
1200
1400
1600
1900
Darknight
Choose year 2020 2019 2018 2017 2016 AprMayJunJulAugSepOctNovDecJanFebMarMonWedFri"Your browser does not support inline SVG."291 problems
solved for all time
2 problems
solved for the last year0 problems
solved for the last month11 days
in a row max.
1 day
in a row for the last year0 days
in a row for the last month Codeforces (c) Copyright 2010-2021 MikeMirzayanov
The only programming contests Web 2.0 platform Server time: Mar/17/2021 22:35:21UTC-4 (h2). Desktop version, switch to mobile version .Privacy Policy
Supported by
User lists
NAME
No items
Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0