Source code for submission s680

Go to diff to previous submission

fq.cpp

  1. #include <iostream>
  2. #include <set>
  3. #include <stdio.h>
  4. #include <utility>
  5. #include <map>
  6. #include <string>
  7. #include <sstream>
  8. #include <algorithm>
  9. #include <vector>
  10. using namespace std;
  11.  
  12. const long long m = 100000;
  13.  
  14. int main(){
  15. string s;
  16. while(cin >> s){
  17. long long N = s.size();
  18. vector<vector<long long> > A(N+1, vector<long long>(N+1));
  19. A[N-1][0] = 1;
  20. if(s[N-1] == '(' || s[0] == ')'){
  21. cout << 0 << '\n';
  22. continue;
  23. }
  24. for(int i=N-2; i>=0; --i){
  25. for(int j=0; j<N-i+1; ++j){
  26. if(j == 0){
  27. if(s[i+1] == ')'){
  28. A[i][j] = 0;
  29. }
  30. else{
  31. A[i][j] = A[i+1][j+1];
  32. }
  33. }
  34. else{
  35. if(s[i+1] == '('){
  36. A[i][j] = A[i+1][j+1];
  37. }
  38. else if(s[i+1] == ')'){
  39. A[i][j] = A[i+1][j-1];
  40. }
  41. else{
  42. A[i][j] = (A[i+1][j+1] + A[i+1][j-1]) % m;
  43. }
  44. }
  45. }
  46. }
  47. cout << A[0][1] % m << '\n';
  48. }
  49. return 0;
  50. }
  51.  

Diff to submission s663

fq.cpp

--- c5.s663.cteam026.fq.cpp.0.fq.cpp
+++ c5.s680.cteam026.fq.cpp.0.fq.cpp
@@ -10,12 +10,11 @@
 using namespace std;
 
-const long m = 100000;
+const long long m = 100000;
 
 int main(){
         string s;
         while(cin >> s){
-                int res = 0;
-                int N = s.size();
-                vector<vector<long> > A(N+1, vector<long>(N+1));
+                long long N = s.size();
+                vector<vector<long long> > A(N+1, vector<long long>(N+1));
                 A[N-1][0] = 1;
                 if(s[N-1] == '(' || s[0] == ')'){
@@ -41,5 +40,5 @@
                                         }
                                         else{
-                                                A[i][j] = A[i+1][j+1] + A[i+1][j-1] % m;
+                                                A[i][j] = (A[i+1][j+1] + A[i+1][j-1]) % m;
                                         }
                                 }