update code

118B Present from Lena/118B.cpp

@@ -0,0 +1,86 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(ll n){ if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res;}
+ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    n++;
+    for(int i=1; i<=n; ++i)
+    {
+        int p=0;
+        for(int j=i; j<n; ++j)
+            cout<<"  ";
+        for(int j=0; j<i-1; ++j)
+        {
+            cout<<p++;
+            if(j+1<i)
+                cout<<" ";
+        }
+        for(int j=0; j<i; ++j)
+        {
+            cout<<p--;
+            if(j+1<i)
+                cout<<" ";
+        }
+        cout<<endl;
+    }
+    n--;
+    for(int i=0; i<=n; ++i)
+    {
+        int p=0;
+        for(int j=0; j<=i; ++j)
+            cout<<"  ";
+        for(int j=i; j<n-1; ++j)
+        {
+            cout<<p++;
+            if(j+1<n)
+                cout<<" ";
+        }
+        for(int j=i; j<n; ++j)
+        {
+            cout<<p--;
+            if(j+1<n)
+                cout<<" ";
+        }
+        cout<<endl;
+    }
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    //cin >> TC;
+    while (TC--) solve();
+}

59A Word/59A.cpp

@@ -1,30 +1,66 @@
 #include<bits/stdc++.h>
 using namespace std;
 
-int main()
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(ll n){ if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res;}
+ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
 {
-    int i,len,uppercase=0,lowercase=0;
+    string s;
-    char s[1000];
     cin>>s;
-    len=strlen(s);
+    int lower_ct=0,upper_ct=0;
-    for(i=0;i<len;i++)
+    for(char c:s)
     {
-        if(islower(s[i])) lowercase++;
+        if(islower(c))
-        else uppercase++;
+            lower_ct++;
+        else
+            upper_ct++;
     }
-    if(lowercase<uppercase)
+    if(upper_ct>lower_ct)
     {
-        for(i=0;i<len;i++)
+        for(auto c:s)
-        {
+            cout<<char(toupper(c));
-            s[i]=toupper(s[i]);
+        cout<<endl;
-        }
     }
     else
     {
-        for(i=0;i<len;i++)
+        for(auto c:s)
+            cout<<char(tolower(c));
+        cout<<endl;
+    }
+}
+ 
+int main()
 {
-            s[i]=tolower(s[i]);
+    fast_io;
-        }
+    int TC = 1;
-    }
+    //cin >> TC;
-    cout<<s<<endl;
+    while (TC--) solve();
 }