20-04-2021

Author: sonuKumar03

codeforces/CF1512A.cpp

@@ -0,0 +1,38 @@
+#include<iostream>
+using namespace std;
+int solve(){
+	int n ;
+	cin>>n;
+	int *br = new int[101];
+	int *ar = new int[101];
+	for(int i=0;i<101;i++){
+		br[i]=0;
+	}
+	int a;
+	for(int i =0;i<n;i++){
+		cin>>a;
+		ar[i]=a;
+		br[a]++;
+	}
+	int el ;
+	for(int i =0;i<101;i++){
+		if(br[i]!=0 && br[i]==1){
+			el = i;
+		}
+	}
+	for(int i =0;i<n;i++){
+		if(el==ar[i]){
+			return i+1;
+		}
+	}
+	return 0;
+}
+
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		cout<<solve()<<endl;
+	}
+	return 0;
+}

codeforces/CF1512B.cpp

@@ -0,0 +1,80 @@
+#include<iostream>
+using namespace std;
+int up(char **ar ,int n,int i  , int j){
+	if(j>=0){
+		return 0;
+	}
+	if(ar[i][j]=='*'){
+		return 1;
+	}
+	return up(ar,n,i,j-1);
+}
+
+int down(char **ar ,int n,int i  , int j){
+	if(j<n){
+		return 0;
+	}
+	if(ar[i][j]=='*'){
+		return 1;
+	}
+	return down(ar,n,i,j+1);
+}
+int left(char **ar ,int n,int i  , int j){
+	if(j>=0){
+		return 0;
+	}
+	if(ar[i][j]=='*'){
+		return 1;
+	}
+	return left(ar,n,i-1,j);
+}
+
+int right(char **ar ,int n,int i  , int j){
+	if(i<n){
+		return 0;
+	}
+	if(ar[i][j]=='*'){
+		return 1;
+	}
+	return right(ar,n,i+1,j);
+}
+
+
+
+void solve(){
+	int n ;
+	cin>>n;
+	char **ar = new char*[n];
+	for(int i =0;i<n;i++){
+		ar[i]= new char[n];
+	}
+	for(int i =0;i<n;i++){
+		for(int j =0;j<n;j++){
+			cin>>ar[i][j];
+		}
+	}
+	for(int i =0;i<n;i++){
+		for(int j =0;j<n;j++){
+			if((up(ar,n,i,j)+down(ar,n,i,j)+left(ar,n,i,j)+right(ar,n,i,j))>0){
+				ar[i][j]='*';
+			}
+		}
+	}
+
+	for(int i =0;i<n;i++){
+		for(int j =0;j<n;j++){
+			cout<<ar[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	cout<<endl;
+}
+
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeforces/CF1514A.cpp

@@ -0,0 +1,36 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+
+bool isperfectSquare(ll n){
+	ll x = sqrt(n);
+	return n==x*x;
+}
+
+void solve(){
+	ll n ;
+	cin>>n;
+	ll *ar = new ll[n];
+	bool flag = true;
+	for(int i =0;i<n;i++){
+		cin>>ar[i];
+	}
+	for(int i =0;i<n;i++){
+		if(!isperfectSquare(ar[i])){
+			flag = false; break;
+		}
+	}
+	if(!flag){
+		cout<<"Yes\n";
+	}else{
+		cout<<"No\n";
+	}
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeforces/CF1514B.cpp

@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+ll _max = LLONG_MIN;
+ll _k;
+
+void subset(vector<ll>ar, int i ,int n , vector<ll>pr){
+	if(i==n-1){
+		cout<<i<<" "<<n-1<<endl;
+	}else{
+		pr.push_back(ar[i]);
+		subset(ar,i+1,n,pr);
+		pr.pop_back();
+		subset(ar,i+1,n,pr);
+		cout<<_max<<endl;
+	}
+}
+
+void solve(){
+	ll n,k;
+	cin>>n>>k;
+	_k=k;
+	ll l = pow(2,k);
+	cout<<l<<endl;
+	vector<ll> ar,pr;
+	for(int i =0;i<=l;i++){
+		ar.push_back(i);
+	}
+	subset(ar,0,ar.size(),pr);
+}
+
+int main(){
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/ADADISH.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+
+bool f(int a,int b){
+	return a-b;
+}
+
+void solve(){
+	ll n;
+	cin>>n;
+	int *ar = new int[n];
+	int sum =0;
+	for(int i =0;i<n;i++){
+		cin>>ar[i];
+		sum+=ar[i];
+	}
+	int ans  = sum;
+	for(int i =0;i<n;i++){
+		int k = max(ar[i],sum-ar[i]);
+		ans = min (ans,k);
+	}
+
+	for(int i =0;i<n;i++){
+		for(int j =i+1;j<n;j++){
+			int t = ar[i]+ar[j];
+			int  k = max(t,sum-t);
+			ans = min(ans,k);
+		}
+	}
+	
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/BOLT.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+#include <cmath>
+ using namespace std;
+ void solve(){
+ 	float k1,k2,k3,v;
+ 	cin>>k1>>k2>>k3>>v;
+ 	float finalSpeed = k1*k2*k3*v;
+ 	float time = 100/finalSpeed;
+ 	float precise_speed =round(time*100.0)/100.0;
+	
+	if(precise_speed < (float)9.58){
+		cout<<"YES\n";
+	}else{
+		cout<<"NO\n";
+	}
+ }
+ int main(){
+ 	int t;
+ 	cin>>t;
+ 	while(t--){
+ 		solve();
+ 	}
+ 	return 0;
+ }

codeshef/BRKBKS.cpp

@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+void solve(){
+	int st;
+	int *ar = new int[3];
+	cin>>st;
+	int a;
+	for(int i =0;i<3;i++){
+		cin>>ar[i];
+	}
+	int s1 = ar[0]+ar[1]+ar[2];
+	int s2 = ar[0]+ar[1];
+	int s3 = ar[0]+ar[2];
+	if(st>=s1){
+		cout<<"1\n";
+	}
+	else if (st>=s2 || st>=s3){
+		cout<<"2\n";
+	}
+	else {
+		cout<<"3\n";
+	}
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/CANDY123.cpp

@@ -0,0 +1,36 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+
+void solve(){
+	int a,b;
+	cin>>a>>b;
+	int candies = 1;
+	int player = 1;
+	while(true){
+		if(player==1){
+			a-=candies;
+			player=2;
+		}else{
+			b-=candies;
+			player=1;
+		}
+		candies++;
+		if(a<0 || b<0){
+			break;
+		}
+	}
+	if(player==1){
+		cout<<"Limak\n";
+	}else{
+		cout<<"Bob\n";
+	}	
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/CASH.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+void solve(){
+	ll n,k;
+	cin>>n>>k;
+	ll sum = 0;
+	ll a;
+	for(int i =0;i<n;i++){
+		cin>>a;
+		sum+=a;
+	}
+	cout<<sum%k<<endl;
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}