Added some solutions to the Codeforces Problems

1028A.cpp

@@ -0,0 +1,66 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#define FOR(i,a,b) for(int i=a;i<=b;++i)
+#define FORD(i,a,b) for(int i=a;i>=b;--i)
+#define REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+char a[116][116];
+
+int main(){
+
+	int n,m;
+	cin>>n>>m;
+	FOR(i,1,n){
+		FOR(j,1,m){
+			cin>>a[i][j];
+		}
+	}
+	int length=0;
+	int br=-1, bc=-1;
+	FOR(i,1,n){
+		FOR(j,1,m)
+		if(a[i][j]=='B'){
+			if(br==-1 && bc==-1){
+				br=i;
+				bc=j;
+			}
+			length++;
+		}
+		if(br!=-1 and bc!= -1){
+			break;
+		}
+	}
+	br+=length/2 ;
+	bc+=length/2 ;
+	cout<<br<<" "<<bc<<endl;
+
+	return 0;
+}

1054A.cpp

@@ -0,0 +1,45 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#define FOR(i,a,b) for(int i=a;i<=b;++i)
+#define FORD(i,a,b) for(int i=a;i>=b;--i)
+#define REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+//int a[100000];
+
+int main(){
+
+	int x,y,z,t1,t2,t3;
+	cin>>x>>y>>z>>t1>>t2>>t3;
+
+	int time;
+	abs(z-x)*t2 + 3*t3 + abs(x-y)*t2 > abs(x-y)*t1 ? cout<< "NO": cout<<"YES";
+	return 0;
+}

1081A.cpp

@@ -0,0 +1,47 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#define FOR(i,a,b) for(int i=a;i<=b;++i)
+#define FORD(i,a,b) for(int i=a;i>=b;--i)
+#define REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+//int a[100000];
+
+int main(){
+
+	int n;
+	cin>>n;
+	if(n==2){
+		cout<<"2";
+	}
+	else
+		cout<<"1";
+	return 0;
+}

1162A.cpp

@@ -0,0 +1,54 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#define FOR(i,a,b) for(int i=a;i<=b;++i)
+#define FORD(i,a,b) for(int i=a;i>=b;--i)
+#define REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+int main(){
+
+	int n,h,m;
+	cin>>n>>h>>m;
+	int arr[n];
+	fill_n(arr, n, h);
+	int sum=0;
+	REP(i,m){
+		int l,r,x;
+		cin>>l>>r>>x;
+		FOR(j,l,r){
+			arr[j-1]=min(arr[j-1],x);
+		}
+	}
+	for(int j=0; j< sizeof(arr)/sizeof(*arr); j++){
+        sum += arr[j]*arr[j];
+    }
+    cout << sum;
+	return 0;
+}

1305A.cpp

@@ -0,0 +1,63 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#define FOR(i,a,b) for(int i=a;i<=b;++i)
+#define FORD(i,a,b) for(int i=a;i>=b;--i)
+#define REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+//int a[100000];
+
+int main(){
+
+	int t, n;
+	cin>>t;
+	int a[1001],b[1001];
+	REP(tc, t){
+
+		cin>>n;
+		REP(i,n){
+			cin>>a[i];
+		}
+		SORT(a,n);
+		REP(i,n){
+			cin>>b[i];
+		}
+		SORT(b,n);
+		REP(i,n){
+			cout<<a[i]<<" ";
+		}
+		cout<<endl;
+		REP(i,n){
+			cout<<b[i]<<" ";
+		}
+		cout<<endl;
+	}
+	return 0;
+}