- Logic and Computation: Interactive Proof with Cambridge LCF (Cambridge Tracts in Theoretical Computer Science)
- Mathematical Theory of Programme Correctness (Prentice-Hall International series in computer science)
- The Haskell School of Expression: Learning Functional Programming through Multimedia
- LaTeX: A Document Preparation System (2nd Edition)
- Denotational Semantics
- Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
- Programs and Machines
- The Denotational Description of Programming Languages: An Introduction
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| int longestValidParentheses(string s) { | |
| uint count = 0; | |
| char lp = '('; | |
| char emptyChar = '\0'; | |
| char rp = ')'; |
Assuming p=71 for all below problems.
- Find the elements in a finite field that are congruent to the following values:
- -1 ≅ 70 (since -1 mod 71 = 70 and 70-(-1) = 71, 71 % 71 == 0;
- -4 ≅ 67. 67 - (-4) = 71;
- -160 ≅ 53;
- 500 ≅ TBE.