622C - Not Equal on a Segment 15943480 It gives TLE on test case number 14!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
622C - Not Equal on a Segment 15943480 It gives TLE on test case number 14!
Given an array of integers and a range find the count of subarrays whose sum lies in the given range. Do so in less than O(n^2) complexity.
Given a number n, how to perform atmost k swap operations on number's digits to get the largest number. Ex- n=7899, k=2 ans=9987
Given an array of 3 different colored balls, we have to sort it using minimum number of swaps. It could be done in O(n) using 3-pointers and two traversals(one to count no. of occurrences of each color and other to sort). Could this be implemented in one traversal(count is not known before).
Link to problem:- http://www.codechef.com/problems/SUBARRAY
Link to solution:- http://www.codechef.com/viewsolution/7071035 Can anyone tell me the testcase my code gives wrong output for.
int main()
{
//Beauty is in relaxed hard work.
//SSGCA :)
//Keep doing your thing, complexity would turn into simplicity! :)
unsigned short int a=0xffff;
~a;
printf("%x",a);
return 0;
}
Why does this program output 'ffff' and not 0000?
Hey, could anyone please share problems on codeforces based on vertex cover problem. Thanks :)
The problem statement can be found here-> (http://www.codechef.com/DBYZ15/problems/DBYZ15C).
Why do many programmers use assert() function in their codes giving as its argument the answer to be outputed?
Название |
---|