This page is a NO-INDEX summary of comments posted in this blog.
Total 849 Comments (27/34 Pages) - Newer Comments - Older Comments
651. 2016-04-25 09:10:05 ACMer Comments on Dynamic Programming - Integer Break:
Yes, it is optimal to break integer into multiples of 3.
652. 2016-04-25 05:03:40 Peter Comments on ACM Code Submissions with High Rankings:
Hello
I need help
LoadState:
That is code: FileOpen(FF, pFile, OpenMode.Binary) for VB6, but dosn't work in VB.NET
How convert code to VB.NET ?
Best regards
653. 2016-04-25 01:45:27 0xEDD1E Comments on Dynamic Programming - Integer Break:
what about this approach?
ull integerBreaker(int n)
{
int brksz = (n < 8) ? 8 : (n + 1);
ull *breaks = malloc((size_t) brksz * sizeof (ull));
breaks[0] = 0;
breaks[1] = 1;
breaks[2] = 1;
breaks[3] = 2;
breaks[4] = 4;
breaks[5] = 6;
breaks[6] = 9;
if (n < 7) return breaks[n];
for (int i = 7; i <= n; i++)
breaks[i] = 3 * breaks[i - 3];
return breaks[n];
}
O(n)!
654. 2016-04-20 20:25:53 ACMer Comments on Print 26 Uppercase Letters using 6502 Assembler on 8-bit Famicom Clone BBG (BBK) - Tutorial 5 - Using Loop:
check this post https://helloacm.com/tutorial-5-c-programming-in-6502-video-ram/
655. 2016-04-20 16:53:06 Peter Comments on Print 26 Uppercase Letters using 6502 Assembler on 8-bit Famicom Clone BBG (BBK) - Tutorial 5 - Using Loop:
I mean in games NES how make font begin writing from left to right ?
Thank you
656. 2016-04-19 23:50:36 ACMer Comments on How to Remove Duplicates from Sorted Array in C/C++ (Constant Memory)?:
This is a O(n).
657. 2016-04-19 20:31:38 ACMer Comments on Print 26 Uppercase Letters using 6502 Assembler on 8-bit Famicom Clone BBG (BBK) - Tutorial 5 - Using Loop:
read text? what do you mean? is that read characters from keyboard?
658. 2016-04-19 20:06:23 Peter Comments on Print 26 Uppercase Letters using 6502 Assembler on 8-bit Famicom Clone BBG (BBK) - Tutorial 5 - Using Loop:
how let read text from left to right ?
Thanks
659. 2016-04-19 20:05:16 Peter Comments on Print 26 Uppercase Letters using 6502 Assembler on 8-bit Famicom Clone BBG (BBK) - Tutorial 5 - Using Loop:
Hi
How read text from left to right ?
What is code ?
Best regards
660. 2016-04-17 09:06:08 ACMer Comments on Full Disclosure: helloacm.com XSS vulnerability notification:
dr.zhihua.lai [AT] gmail.com
661. 2016-04-16 21:24:58 Guitch404 Comments on Full Disclosure: helloacm.com XSS vulnerability notification:
Hi,
I found another vulnerability. How can I contact you?
Guitch404
662. 2016-04-15 07:25:50 ACMer Comments on Compute Number of 1's Bits in C/C++:
Another bit tweak
663. 2016-04-15 01:56:34 Benny Prijono Comments on Compute Number of 1's Bits in C/C++:
Another one, with constant complexity and "no loop":
int count_group(uint32_t val)
{
static int bitcnt[] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };
return bitcnt[val & 0xF] +
bitcnt[(val >> 4) & 0x0F ] +
bitcnt[(val >> 8) & 0x0F] +
bitcnt[(val >> 12) & 0x0F] +
bitcnt[(val >> 16) & 0x0F] +
bitcnt[(val >> 20) & 0x0F] +
bitcnt[(val >> 24) & 0x0F] +
bitcnt[(val >> 28) & 0x0F];
}
664. 2016-04-14 18:11:59 ACMer Comments on Compute Number of 1's Bits in C/C++:
Thanks! so it is not available on ARM?
665. 2016-04-14 16:51:08 Giorgi Comments on Compute Number of 1's Bits in C/C++:
Wanted to mention that builtin popcount is actually calling POPCNT instruction of x86 machine.
666. 2016-04-14 08:33:26 Jeff Comments on The Javascript Function to Compute the Stamp Duty Tax:
If the stamp duty is completed after 1st April 2016, there will be a 3% increase. So 2% will become 5%, 5% will become 8% and so on.
I have added a select box with a yes or no option and I have added this to the function:
var home = document.getElementById("additional").value;
if (home == 0) {
p = q * 0.02;
} else {
p = q * 0.05;
}
It doesn't sums up correctly. Can you think of a better solution?
Cheers!
Jeff
667. 2016-04-14 08:25:06 ACMer Comments on The Javascript Function to Compute the Stamp Duty Tax:
wow...
didn't know there is a increase of 3% for 2016....
668. 2016-04-14 07:47:48 Jeff Comments on The Javascript Function to Compute the Stamp Duty Tax:
I could marry you for this, thank you so much. Do you happen to have the 2016 one with second home 3% addition?
Cheers
Jeff
669. 2016-04-12 21:02:45 Nick Sifniotis Comments on C++ Coding Exercise - How to Check Duplicates with Sliding Window?:
Do they? The complexities of the map and set functions are constant time are they?
670. 2016-04-11 07:50:27 ACMer Comments on Valid Anagram String Check Algorithms using Hash Table:
Thanks for the code.
671. 2016-04-11 06:33:31 Chaitanya Yeturi Comments on Valid Anagram String Check Algorithms using Hash Table:
If in case looking for implementation in C, here it is. Aurelian Cucu, I tried it in python, it's working.
Here is the code,
#include
#include
void isAnagram(char s[], char t[]);
int main()
{
char string1[20],string2[20];
printf("Enter the strings");
scanf("%s",string1);
scanf("%s",string2);
isAnagram(string1,string2);
}
void isAnagram(char s[], char t[]) {
int c[26] = {0};
for (int i = 0; i < strlen(s); i ++) {
c[s[i] - 97] ++;
}
for (int i = 0; i < strlen(t); i ++) {
c[t[i] - 97] --;
}
for (int i = 0; i < 26; i ++) {
if (c[i] != 0) {
printf("No, it's not");
}
}
printf("Yes, it is");
}
672. 2016-04-10 17:06:29 ACMer Comments on How to Reverse Bits for 32-bit Unsigned Integer in C/C++?:
yes, you are right, corrected. 🙂
673. 2016-04-10 17:01:03 Or Cy Comments on How to Reverse Bits for 32-bit Unsigned Integer in C/C++?:
Pretty cool but isn't the O(n) example shown actually O(log(N))?
674. 2016-04-10 13:04:32 ACMer Comments on Valid Anagram String Check Algorithms using Hash Table:
yes, excellent idea.
675. 2016-04-10 11:10:45 Aurelian Cucu Comments on Valid Anagram String Check Algorithms using Hash Table:
Or you can just xor all characters from both strings, and check if the result of xor operation is 0.
Newer Comments - Older Comments
–EOF (The Ultimate Computing & Technology Blog) — 46 words