Solved some more probelms

cf118A.cpp

@@ -0,0 +1,177 @@
+#include <bits/stdc++.h>
+using namespace std;
+/*Like set but has some more functionality:
+ 1. Find kth smallest minimum
+ 2. Find the index of an element
+ Does these in O(log n) time
+ 
+ How to use:
+ ordered_set<type> ss;
+ ss.insert(val);
+ ss.insert(val);
+ ss.insert(val);
+
+ cout<<ss.ordere_of_key(val)<<endl; // number of elements in ss less than val
+ cout<<*ss.find_by_order(k)<<endl; // prints the kth smallest number in s (0-based)
+*/
+/*#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace __gnu_pbds;
+template <typename T>
+using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
+*/
+
+
+#define ms(s, n) memset(s, n, sizeof(s))
+
+#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
+#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
+#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
+
+#define mapHas(t, x) (t.find(x) != t.end()) //for map
+#define vectHas(v,x) (find(v.begin(),v.end(),x)!=v.end()) //for vector
+#define setHas(t,x) (t.count(x)!=0)
+
+
+#define pb push_back
+#define pf push_front
+#define mp make_pair
+#define fi first
+#define se second
+#define prec(n) fixed<<setprecision(n)
+
+
+
+//bit manipulation
+#define bit(n, i) (((n) >> (i)) & 1) //check bit
+#define setBit(n,i) (n|=(1<<i)) //set i'th bit of n
+#define checkBit(n,i) (n &(1<<i)) //check i'th bit of n
+#define resetBit(n,i) (n&=~(1<<i)) //reset i'th bit of n
+#define toggleBit(n,i) (n^=(1<<i)) //toggle i'th bit of n
+#define lsOnBit(n) (n&(-n)) //get lsb of n that is on
+#define turnOnAll(n) ((1<<n) - 1) //turn on size of n bits from right (kind of opposite of clear)
+#define remainder(s,n) (s & (n-1)) //remainder of s when divided by n, where n is power of 2
+#define powerOfTwo(s) ((s & (s-1)) == 0) //determine if s is a power of 2
+#define turnOffLastSetBit(s) (s=(s&(s-1)))
+#define turnOnLastZero(s) (s=(s|(s+1))) 
+#define numLeadZero(s) __builtin_clz(s)
+#define numTrailZero(s) __builtin_ctz(s)
+#define numOnes(s) __builtin_popcount(s)
+#define parity(s) __builtin_parity(s)
+
+
+//shorthands
+typedef long long ll;
+typedef unsigned long long ull;
+typedef long double ld;
+typedef pair<int, int> pii;
+typedef pair<char, int> pci;
+typedef pair<int, char> pic;
+typedef pair<int, string> pis;
+typedef pair<string, int> psi;
+typedef pair<string, string> pss;
+
+const int MOD = (int) 1e9 + 7;
+const int FFTMOD = 1007681537;
+const int INF = (int) 1e9;
+const ll LINF = (ll) 1e18;
+const ld PI = acos((ld) -1);
+const ld EPS = 1e-6;
+
+//some common functions
+
+// inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;} //gcd
+// inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;} //lcm
+// inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;} //nth power
+// inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}  //add mod
+// inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}  //sub mod
+// inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}  //check sqrt
+// inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}  //check cbrt
+
+//some helper functions for input processing
+
+// inline void tokenize(string str,vector<string> &tokens, string delim){ tokens.clear();size_t s = str.find_first_not_of(delim), e=s; while(s!=std::string::npos){e=str.find(delim,s);tokens.push_back(str.substr(s,e-s));s=str.find_first_not_of(delim,e);}}
+// inline bool isPalindrome(string str){for(int i=0;i<(str.size())/2;i++)if(str[i]!=str[str.size()-1-i])return false;return true;}
+// inline string customStrip(string in,string delim){string ret = "";for(int i=0;i<in.size();i++){if(delim.find(in[i],0)==std::string::npos)ret+=in[i];}return ret;}
+// inline string commaSeparate(long long value){string numWithCommas = to_string(value);int insertPosition = numWithCommas.length() - 3;while (insertPosition > 0) {numWithCommas.insert(insertPosition, ",");insertPosition-=3;}return numWithCommas;}
+// inline string strip(string s){int i=0;while(i<s.size()){if(isspace(s[i]))i++;else break;}s.erase(0,i);i = s.size()-1;while(i>=0){if(isspace(s[i]))i--;else break;}s.erase(i+1,s.size()-i-1);return s;}
+
+//errors
+#define db(x) cerr << #x << " = " << (x) << "\n";
+#define endl '\n'
+
+/*
+//double comparisons and ops
+//d1==d2
+inline bool EQ(double d1,double d2){return fabs(d1-d2)<EPS;}
+//d1>d2
+inline bool GT(double d1,double d2){return (d1-d2)>EPS;}
+//d1<d2
+inline bool LT(double d1,double d2){return GT(d2,d1);}
+//d1>=d2
+inline bool GTE(double d1, double d2){return GT(d1,d2)||EQ(d1,d2);}
+//d1<=d2
+inline bool LTE(double d1,double d2){return LT(d1,d2)||EQ(d1,d2);}
+//numPosAfterDecimal={10,100,1000,10000,....}
+//Roundoff(3.56985,10000) = 3.5699
+inline double Roundoff(double val,int numPosAfterDecimal){return round(val*numPosAfterDecimal)/numPosAfterDecimal;}
+*/
+
+
+/*//4 directional movement
+int dx[]={1,0,-1,0};
+int dy[]={0,1,0,-1};*/
+
+#define MAX 12
+
+string deleteAllVowels(string s)
+{
+	string tmp = "";
+	for(int i=0;i<s.size();i++){
+		if(s[i]!='A'&&s[i]!='a'&&
+		   s[i]!='E'&&s[i]!='e'&&
+		   s[i]!='I'&&s[i]!='i'&&
+		   s[i]!='O'&&s[i]!='o'&&
+		   s[i]!='U'&&s[i]!='u'&&
+		   s[i]!='Y'&&s[i]!='y')tmp+=s[i];
+	}
+
+	return tmp;
+}
+
+string appendDots(string s)
+{
+	string tmp="";
+	for(int i=0;i<s.size();i++){
+		tmp+='.';
+		tmp+=s[i];
+	}
+	return tmp;
+}
+
+
+int main()
+{
+/*The standard C++ I/O functions (cin/cout) flush the buffer 
+on every next I/O call which unncecessarily increase I/O time.
+For enhancing C++ I/O speed,you can either use C’s standard I/O
+function (scanf/printf) instead of (cin/cout) or you can write
+the following lines in main function.*/
+
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+
+	freopen("input.txt", "r", stdin);
+	// freopen("output.txt", "w", stdout);
+
+	string inp;
+	cin>>inp;
+	inp = deleteAllVowels(inp);
+	inp = appendDots(inp);
+	transform(inp.begin(),inp.end(),inp.begin(),::tolower);
+	cout<<inp<<endl;
+
+
+	return 0;
+}

cf118B.cpp

@@ -0,0 +1,180 @@
+#include <bits/stdc++.h>
+using namespace std;
+/*Like set but has some more functionality:
+ 1. Find kth smallest minimum
+ 2. Find the index of an element
+ Does these in O(log n) time
+ 
+ How to use:
+ ordered_set<type> ss;
+ ss.insert(val);
+ ss.insert(val);
+ ss.insert(val);
+
+ cout<<ss.ordere_of_key(val)<<endl; // number of elements in ss less than val
+ cout<<*ss.find_by_order(k)<<endl; // prints the kth smallest number in s (0-based)
+*/
+/*#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace __gnu_pbds;
+template <typename T>
+using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
+*/
+
+
+#define ms(s, n) memset(s, n, sizeof(s))
+
+#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
+#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
+#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
+
+#define mapHas(t, x) (t.find(x) != t.end()) //for map
+#define vectHas(v,x) (find(v.begin(),v.end(),x)!=v.end()) //for vector
+#define setHas(t,x) (t.count(x)!=0)
+
+
+#define pb push_back
+#define pf push_front
+#define mp make_pair
+#define fi first
+#define se second
+#define prec(n) fixed<<setprecision(n)
+
+
+
+//bit manipulation
+#define bit(n, i) (((n) >> (i)) & 1) //check bit
+#define setBit(n,i) (n|=(1<<i)) //set i'th bit of n
+#define checkBit(n,i) (n &(1<<i)) //check i'th bit of n
+#define resetBit(n,i) (n&=~(1<<i)) //reset i'th bit of n
+#define toggleBit(n,i) (n^=(1<<i)) //toggle i'th bit of n
+#define lsOnBit(n) (n&(-n)) //get lsb of n that is on
+#define turnOnAll(n) ((1<<n) - 1) //turn on size of n bits from right (kind of opposite of clear)
+#define remainder(s,n) (s & (n-1)) //remainder of s when divided by n, where n is power of 2
+#define powerOfTwo(s) ((s & (s-1)) == 0) //determine if s is a power of 2
+#define turnOffLastSetBit(s) (s=(s&(s-1)))
+#define turnOnLastZero(s) (s=(s|(s+1))) 
+#define numLeadZero(s) __builtin_clz(s)
+#define numTrailZero(s) __builtin_ctz(s)
+#define numOnes(s) __builtin_popcount(s)
+#define parity(s) __builtin_parity(s)
+
+
+//shorthands
+typedef long long ll;
+typedef unsigned long long ull;
+typedef long double ld;
+typedef pair<int, int> pii;
+typedef pair<char, int> pci;
+typedef pair<int, char> pic;
+typedef pair<int, string> pis;
+typedef pair<string, int> psi;
+typedef pair<string, string> pss;
+
+const int MOD = (int) 1e9 + 7;
+const int FFTMOD = 1007681537;
+const int INF = (int) 1e9;
+const ll LINF = (ll) 1e18;
+const ld PI = acos((ld) -1);
+const ld EPS = 1e-6;
+
+//some common functions
+
+// inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;} //gcd
+// inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;} //lcm
+// inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;} //nth power
+// inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}  //add mod
+// inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}  //sub mod
+// inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}  //check sqrt
+// inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}  //check cbrt
+
+//some helper functions for input processing
+
+// inline void tokenize(string str,vector<string> &tokens, string delim){ tokens.clear();size_t s = str.find_first_not_of(delim), e=s; while(s!=std::string::npos){e=str.find(delim,s);tokens.push_back(str.substr(s,e-s));s=str.find_first_not_of(delim,e);}}
+// inline bool isPalindrome(string str){for(int i=0;i<(str.size())/2;i++)if(str[i]!=str[str.size()-1-i])return false;return true;}
+// inline string customStrip(string in,string delim){string ret = "";for(int i=0;i<in.size();i++){if(delim.find(in[i],0)==std::string::npos)ret+=in[i];}return ret;}
+// inline string commaSeparate(long long value){string numWithCommas = to_string(value);int insertPosition = numWithCommas.length() - 3;while (insertPosition > 0) {numWithCommas.insert(insertPosition, ",");insertPosition-=3;}return numWithCommas;}
+// inline string strip(string s){int i=0;while(i<s.size()){if(isspace(s[i]))i++;else break;}s.erase(0,i);i = s.size()-1;while(i>=0){if(isspace(s[i]))i--;else break;}s.erase(i+1,s.size()-i-1);return s;}
+
+//errors
+#define db(x) cerr << #x << " = " << (x) << "\n";
+#define endl '\n'
+
+/*
+//double comparisons and ops
+//d1==d2
+inline bool EQ(double d1,double d2){return fabs(d1-d2)<EPS;}
+//d1>d2
+inline bool GT(double d1,double d2){return (d1-d2)>EPS;}
+//d1<d2
+inline bool LT(double d1,double d2){return GT(d2,d1);}
+//d1>=d2
+inline bool GTE(double d1, double d2){return GT(d1,d2)||EQ(d1,d2);}
+//d1<=d2
+inline bool LTE(double d1,double d2){return LT(d1,d2)||EQ(d1,d2);}
+//numPosAfterDecimal={10,100,1000,10000,....}
+//Roundoff(3.56985,10000) = 3.5699
+inline double Roundoff(double val,int numPosAfterDecimal){return round(val*numPosAfterDecimal)/numPosAfterDecimal;}
+*/
+
+
+/*//4 directional movement
+int dx[]={1,0,-1,0};
+int dy[]={0,1,0,-1};*/
+
+#define MAX 12
+
+int main()
+{
+/*The standard C++ I/O functions (cin/cout) flush the buffer 
+on every next I/O call which unncecessarily increase I/O time.
+For enhancing C++ I/O speed,you can either use C’s standard I/O
+function (scanf/printf) instead of (cin/cout) or you can write
+the following lines in main function.*/
+
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+
+	freopen("input.txt", "r", stdin);
+	// freopen("output.txt", "w", stdout);
+
+	int n;
+	cin>>n;
+
+	int nrows = 2*n+1;
+	int tdir = 1;
+	int target = 1;
+	FOR(i,0,nrows){
+		// cout<<target<<endl;
+
+		int spaces = n-target+1;
+		// cout<<spaces<<endl;
+		FOR(i,0,spaces)
+			cout<<"  ";
+
+		for(int i=0;i<target;i++){
+			cout<<i;
+			if(i<target-1)
+				cout<<" ";
+		}
+		if(target-2>=0)
+			cout<<" ";
+		for(int i=target-2;i>=0;i--){
+			cout<<i;
+			if(i)
+				cout<<" ";
+		}
+		cout<<endl;
+
+		target+=tdir;
+		if(target>n)
+			tdir=-1;
+
+	}
+
+
+
+
+	return 0;
+}