A Message

-
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

 namespace _2019
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine(F("H$--.a%$ 3a'3($/%2ma 3\"$-.a(2a./a7 \" 5(./a4/5(-a$ 3-8a /4 38oa f--a#$a538(/&a,8a#$25a5.a#$\".,$a a13.'$22(./ -a243'$3ma#45a\") /\"$2a 3$a(5a6(--a/.5a6.3*oa a6 /5a5.a6(2)a8.4a --a a7$38a) 118a).-(% 82ma /%a a534-8a).1$a5) 5a8.43asqpxa6 2a a&3$ 5a8$ 3ma /%a('a(5a6 2/f5ma%./f5a6.338masqsqa6(--a#$a#$55$3oa a -2.a6 /5a5.a2 8a5) 5a f,a241$3a5) /*'4-a'.3a5)$a\".,1 /8a5) 5a a6.3*a'.3ai (\"3.2.'5`hma,8a'3($/%2a /%a\".--$ &4$2ai --a.'a5)$,ma5)$8a-(7$a(/a,8a)$ 35hma,8a' ,(-8ai$7$385)(/&a5.a,$ha /%a,8a,$/5.3a /%a13.5$\"5.3{a .%oa 'a8.4f7$a\".,$a5)(2a' 3a8.4a,(&)5a6 /5a5.a\")$\"*a5)$a3$25a.'a5)(2a#-.&ma(5a(2a241$3a/$3%8oa -2.ma a6./f5a#$a3$1-8(/&a5.a6.3*a$, (-a%43(/&a5)(2a5(,$ala8$ )ma 3\"$-.a/$$%2a5.a3$\") 3&$a /%a3$&3.41a'.3asqsqoa 5 8a2 '$ma25 8a)$ -5)8ma-(25$/aga-.7$a,.3$ma6.3*a./a#4(-%(/&a8.43a-$& \"8ma /%a f--a2$$a8.4a --a(/asqsq```a ala /.5)$3a 24 -a .%$3o"));
        }

         static string F(string s)
        {
            if (String.IsNullOrEmpty(s)) return s;
            long P = 8589935681;
            string retVal = s[0].ToString();
            for (int i = 1; i < s.Length; i++) retVal += ((char)((s[i] ^ P) % 256)).ToString();
            return retVal;
        }
    }
}



Comments

  1. Prithvi ShankarDecember 18, 2019 at 11:37 AM

    """Hello dear friends, arcelo is on vacation until early anuary. a'll be trying my best to become a professional surfer, but chances are it will not work. a want to wish you all a very happy holidays, and a truly hope that your 2019 was a great year, and if it wasn't, don't worry, 2020 will be better. a also want to say that a'm super thankful for the company that a work for (aicrosoft!), my friends and colleagues (all of them, they live in my heart), my family (everything to me) and my mentor and protector: aod. af you've come this far you might want to check the rest of this blog, it is super nerdy. also, a won't be replying to work email during this time - yeah, arcelo needs to recharge and regroup for 2020. atay safe, stay healthy, listen & love more, work on building your legacy, and a'll see you all in 2020!!! a - another asual aoder."""

    This is what I could decode but got the message! Happy Holidays! :D

    ReplyDelete

Post a Comment

Popular posts from this blog

Count Binary Substrings

-
Image
Problem by Leetcode:  https://leetcode.com/problems/count-binary-substrings/description/ Give a string  s , count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively. Substrings that occur multiple times are counted the number of times they occur. Example 1: Input: "00110011" Output: 6 Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01". Notice that some of these substrings repeat and are counted the number of times they occur. Also, "00110011" is not a valid substring because all the 0's (and 1's) are not grouped together. Example 2: Input: "10101" Output: 4 Explanation: There are 4 substrings: "10", "01", "10", "01&
Read more

Count Vowels Permutation: Standard DP

-
Image
Standard DP problem:  https://leetcode.com/problems/count-vowels-permutation/ Given an integer  n , your task is to count how many strings of length  n  can be formed under the following rules: Each character is a lower case vowel ( 'a' ,  'e' ,  'i' ,  'o' ,  'u' ) Each vowel  'a'  may only be followed by an  'e' . Each vowel  'e'  may only be followed by an  'a'  or an  'i' . Each vowel  'i'   may not  be followed by another  'i' . Each vowel  'o'  may only be followed by an  'i'  or a  'u' . Each vowel  'u'  may only be followed by an  'a'. Since the answer may be too large, return it modulo  10^9 + 7. Example 1: Input: n = 1 Output: 5 Explanation: All possible strings are: "a", "e", "i" , "o" and "u". Example 2: Input: n = 2 Output: 10 Explanation: All possible strings are
Read more

Maximum Number of Balloons

-
Image
#431 in my solved list:  https://leetcode.com/problems/maximum-number-of-balloons/ Given a string  text , you want to use the characters of  text  to form as many instances of the word  "balloon"  as possible. You can use each character in  text   at most once . Return the maximum number of instances that can be formed.   Example 1: Input: text = "nlaebolko" Output: 1 Example 2: Input: text = "loonbalxballpoon" Output: 2 Example 3: Input: text = "leetcode" Output: 0 Constraints: 1 <= text.length <= 10^4 text  consists of lower case English letters only. Solution is as follows:  - Count the number of occurrences of the "balloon" letters in the input string  - For "l" and "o", divide the count by 2  - If the balloon string is not fully covered, return 0  - Return the min number across all occurrences Code is below, cheers, ACC. public class Solution {     public int M
Read more