1188 solve

Author: nayonacademy

10-Steps-to-Solve-Any-Problems.md

@@ -9,4 +9,4 @@
 7. Then optimize the real code.
 8. Take care of boundary conditions as well.
 9. Get feedback from your teammates, professors, and other developers and also ask your question on Stack Overflow if possible. Try to learn from others’ guidelines and what they are handling those problems. A problem may be solved in several ways. So, don’t get disappointed if you can’t think like an expert. You need to stick to the problem and you will gradually become better and quicker in solving problems like others.
-10. Practice, Practice, and Practice.
+10. Practice, Practice, and Practice.

Uri-online-judge/1188

@@ -1,25 +1,44 @@
-#include <iostream>
+#include <bits/stdc++.h>
 using namespace std;
 int main()
 {
     double N[12][12];
     char p;
+    int c=0, m=6, n=5;
     double soma = 0.0;
     cin >> p;
     for (int i=0; i < 12; i++)
     {
-        for (int j=0; i< 12; j++)
+        for (int j=0; j < 12; j++)
         {
             cin >> N[i][j];
-            if (j < (11 - i) && j < i)
-            {
-                soma +=N[i][j];
-            }
+            // if (j < (11 - i) && j < i)
+            // if(i > 6)
+            // {
+            //     soma +=N[i][j];
+            // }
+            
         }
+        
     }
+int i=7;
+while(i<=11)
+    
+     {   
+         for(int j = n; j<=m; j++){
+           
+            soma = soma+N[i][j];
+        
+            // c++;
+        }
+            m++;
+            n--;
+        i++;
+        }
+  
     if (p=='S')
-        cout << soma;
+        cout<<fixed<<setprecision(1)<< soma<<endl;
     else
-        cout << soma/30.00;
+        cout << soma/30.00<<endl;
     return 0;
 }