first commit

Author: its-asif

1105A.cpp

@@ -0,0 +1,74 @@
+#include<bits/stdc++.h>
+#define ll long long
+#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
+
+#define fi(n) for(ll i=0; i<n; i++)
+#define fj(n) for(ll j=0; j<n; j++)
+#define rfi(n) for(ll i = n-1; i >=0; --i)
+#define fa(n) for(auto i:n)
+#define fa2(n) for(auto i:n) cout<<i<<' ';
+#define llt ll t; cin>>t; while(t--)
+#define lln ll n; cin>>n;
+#define llnm ll n,m; cin>>n>>m;
+#define llx ll x; cin>>x;
+#define llxy ll x,y; cin>>x>>y;
+#define llab ll a,b; cin>>a>>b;
+
+#define vi vector<int>
+#define vll vector<ll>
+#define vs vector<string>
+#define pb push_back
+#define mp make_pair
+#define pbx ll xx; cin>> xx; v.pb(xx);
+#define pbs string xx; cin>> xx; v.pb(xx);
+#define all(x) x.begin(), x.end()
+#define srt(x) sort(all(x))
+#define rsrt(x) sort(all(x),greater<ll>())
+#define veccin(n) vll v(n); fi(n) cin>>v[i];
+
+#define gcd(a, b) __gcd(a, b)
+#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
+
+#define endl "\n"
+#define nl <<endl
+#define sp <<' '
+#define sps <<' '<<
+#define yes cout<<"YES"<<endl
+#define no cout<<"NO"<<endl
+#define C(x) cout<< x <<endl;
+#define F i.first
+#define S i.second
+// ll arr[100000000]={0};
+
+using namespace std;
+int main(){
+    lln;
+    // vll v(n);
+    // ll sum=0;
+    // fi(n){
+    // 	cin>>v[i];
+    // 	sum+=v[i];
+    // }
+    // ll avg = ceil((double)sum/v.size());
+    // sum=0;
+    // fi(n){
+    // 	sum+= min(min(abs(v[i]-avg),abs(v[i]-avg-1)),abs(v[i]-avg+1));
+    // }
+    // cout<<avg sps sum;
+
+    map<ll, ll > m;
+    vll v(n);
+    ll mx=0,temp,sum=0;
+    fi(n){
+    	cin>>v[i];
+    	m[v[i]]++;
+    	if(m[v[i]]>=mx){
+    		mx=m[v[i]];
+    		temp=v[i];
+    	}
+    }
+	fi(n){
+    	sum+= min(min(abs(v[i]-temp),abs(v[i]-temp-1)),abs(v[i]-temp+1));
+    }
+    cout<<temp sps sum;
+}

1105A.exe

@@ -0,0 +1,58 @@
+#include<bits/stdc++.h>
+#define ll long long
+#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
+
+#define fi(n) for(ll i=0; i<n; i++)
+#define fj(n) for(ll j=0; j<n; j++)
+#define rfi(n) for(ll i = n-1; i >=0; --i)
+#define fa(n) for(auto i:n)
+#define fa2(n) for(auto i:n) cout<<i<<' ';
+#define llt ll t; cin>>t; while(t--)
+#define lln ll n; cin>>n;
+#define llnm ll n,m; cin>>n>>m;
+#define llx ll x; cin>>x;
+#define llxy ll x,y; cin>>x>>y;
+#define llab ll a,b; cin>>a>>b;
+
+#define vi vector<int>
+#define vll vector<ll>
+#define vs vector<string>
+#define pb push_back
+#define mp make_pair
+#define pbx ll xx; cin>> xx; v.pb(xx);
+#define pbs string xx; cin>> xx; v.pb(xx);
+#define all(x) x.begin(), x.end()
+#define srt(x) sort(all(x))
+#define rsrt(x) sort(all(x),greater<ll>())
+#define veccin(n) vll v(n); fi(n) cin>>v[i];
+
+#define gcd(a, b) __gcd(a, b)
+#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
+
+#define endl "\n"
+#define nl <<endl
+#define sp <<' '
+#define sps <<' '<<
+#define yes cout<<"YES"<<endl
+#define no cout<<"NO"<<endl
+#define C(x) cout<< x <<endl;
+#define F i.first
+#define S i.second
+// ll arr[100000000]={0};
+
+using namespace std;
+int main(){
+    lln;
+    vll v(n);
+    fi(n) cin>>v[i];
+    srt(v);
+    ll x = v[n-1],y=-1;
+    for (int i = n-2; i >0; --i)
+    {
+        if(x%v[i]!=0 || v[i]==v[i+1]){  
+            y=v[i];
+            break;
+        }
+    }
+    cout<< x sps y nl;
+}

1108B.cpp

@@ -0,0 +1,66 @@
+#include<bits/stdc++.h>
+#define ll long long
+#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
+
+#define fi(n) for(ll i=0; i<n; i++)
+#define rfi(n) for(ll i=n-1; i>=0; i--)
+#define fj(n) for(ll j=0; j<n; j++)
+#define fa(n) for(auto i:n)
+#define fa2(n) for(auto i:n) cout<<i<<' ';
+#define llt ll t; cin>>t; while(t--)
+#define lln ll n; cin>>n;
+
+#define vi vector<int>
+#define vll vector<ll>
+#define vs vector<string>
+#define pb push_back
+#define pbx ll xx; cin>> xx; v.pb(xx);
+#define pbs string xx; cin>> xx; v.pb(xx);
+#define all(x) x.begin(), x.end()
+#define sortall(x) sort(all(x))
+#define rsortall(x) sort(all(x),greater<ll>())
+
+#define gcd(a, b) __gcd(a, b)
+#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
+
+#define endl "\n"
+#define yes cout<<"YES"<<endl
+#define no cout<<"NO"<<endl
+#define C(x) cout<< x <<endl;
+#define F i.first
+#define S i.second
+
+
+using namespace std;
+int main(){
+	lln;
+	vll v(n);
+	ll cnt=0,mx=0;
+	fi(n){
+		cin>>v[i];
+		if(v[i]==1){
+			cnt++;
+			mx = max(mx,cnt);
+		}
+		else cnt=0;
+	} cnt=0; ll temp=0;
+
+	fi(n){
+		if(v[i]==1) cnt++;
+		else{
+			temp=i;
+			break;
+		}
+	}
+	for (int i = n-1; i >temp; --i)
+	{
+		if(v[i]==1) cnt++;
+		else{
+			temp=i;
+			break;
+		}
+	}
+
+	mx = max(mx,cnt);
+	cout<<mx;
+}

1108B.exe

@@ -0,0 +1,80 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+/**----data type----*/
+#define ll long long int
+#define llu unsigned long long int
+
+#define fast      ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define pi          acos(-1.0)
+#define nl          '\n'
+/**-------Shortend Library-------*/
+#define vi vector<int>
+#define mii map<int, int>
+#define f(i,n) for(ll i=0; i<n; i++)
+#define FOR(i, a, b) for(ll i=a; i<=b; i++)
+#define testcase ll t;cin>>t;while(t--)
+
+#define ff first
+#define ss second
+#define all(a)         a.begin(),a.end()
+#define Sort(x)        sort(x.begin(),x.end())
+#define SortR(x)       sort(x.begin(),x.end(),greater<int>())
+#define Reverse(x)     reverse(x.begin(),x.end())
+
+#define SortA(ar,s)    sort(ar,ar+s)
+#define SortD(ar,s)    sort(ar,ar+s,greater<int>())
+
+#define gcd(a,b)       __gcd(a,b)
+#define lcm(a,b)       (a*(b/gcd(a,b)))
+#define sq(x)          (x)*(x)
+#define mid(l,r)       (l+(r-l)/2)
+
+#define leftShift(p)         (p<<1)
+#define rightShift(p)        (p>>1)
+
+#define min3(a,b,c)       min(a,min(b,c))
+#define min4(a,b,c,d)     min(a,min(b,min(c,d)))
+#define max3(a,b,c)       max(a,max(b,c))
+#define max4(a,b,c,d)     max(a,max(b,max(c,d)))
+#define pb(x)             push_back(x)
+#define mod               1e8+7
+#define precision(x)      cout<<fixed<<setprecision(x)
+#define yes               cout<<"YES"<<nl
+#define no                cout<<"NO"<<nl
+
+/**----Functions to use----**/
+ll powerLog(ll base, ll power)
+{
+    ll res = 1;
+    while(power)
+    {
+        if(power%2)
+        {
+            res *= base;
+            power--;
+        } else 
+        {
+            base *=base;
+            power/=2;
+        }
+    }
+    return res;
+}
+
+void cholokori()
+{
+    ll n;
+    cin>>n;
+    if(n%2==1) cout<<0;
+    else
+        cout<< powerLog(2,n/2);
+}
+
+int main()
+{
+    // testcase{
+        cholokori();
+    // }
+    return 0;
+}

1141B.cpp

@@ -0,0 +1,43 @@
+#include<bits/stdc++.h>
+#define ll long long
+using namespace std;
+int main(){
+	ll n; cin>>n;
+
+	for (int i = 0; i <= n; ++i)
+	{
+		for (int j = 1; j <= n-i; ++j)
+		{
+			cout<<"  ";
+		}
+		for (int j = 0; j <= i; ++j)
+		{
+			if(j==i) {cout<<j; continue;}
+			cout<<j<<' ';
+		}
+		for (int j = i-1; j >= 0; --j)
+		{
+			//if(j==0) {cout<<j; continue;}
+			cout<<' '<<j; 
+		}
+		cout<<endl;
+	}
+	for (int i = n-1; i >=0; --i)
+	{
+		for (int j = 1; j <= n-i; ++j)
+		{
+			cout<<"  ";
+		}
+		for (int j = 0; j <= i; ++j)
+		{
+			if(j==i) {cout<<j; continue;}
+			cout<<j<<' ';
+		}
+		for (int j = i-1; j >= 0; --j)
+		{
+			//if(j==0) {cout<<j; continue;}
+			cout<<' '<<j; 
+		}
+		cout<<endl;
+	}
+}