added extention

Author: d2Anubis

CODE_OF_CONDUCT.md

@@ -0,0 +1,76 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, sex characteristics, gender identity and expression,
+level of experience, education, socio-economic status, nationality, personal
+appearance, race, religion, or sexual identity and orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+ advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+ address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+ professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at larissalages7@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at https://www.contributor-covenant.org/version/1/4/code-of-conduct.html
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see
+https://www.contributor-covenant.org/faq

CodeChef_problems/Chef and Serves.cpp

@@ -0,0 +1,18 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+	int t;
+	cin>>t;// number of test cases
+	while(t--)
+	{
+		int s,p1,p2,k;
+		cin>>p1>>p2>>k;
+		s=int((p1+p2)/k);   //no. of times serves will change
+		if(s%2==0)   //check if that number is even or odd
+			cout<<"CHEF"<<endl;
+		else
+			cout<<"COOK"<<endl;
+	}
+
+}
+

CodeChef_problems/Zombies_and_Magic.cpp

@@ -0,0 +1,50 @@
+#include<bits/stdc++.h>
+#define ll long long
+#define N 100000
+using namespace std;
+
+vector<ll>adj[N];
+vector<ll>vis(N);
+void dfs(ll curr)
+{
+    vis[curr]=1;
+    for(auto neb:adj[curr])
+    {
+        if(vis[neb]==0)
+        dfs(neb);
+    }
+}
+int main()
+{
+    ll n,m;
+    cin>>n>>m;
+    ll z;
+    cin>>z;
+    for(ll i=0;i<m;i++)
+    {
+        ll u,v;
+        cin>>u>>v;
+        adj[u].push_back(v);
+        adj[v].push_back(u);
+    }
+    for(ll i=0;i<n;i++)
+    vis[i]=0;
+    vis[z]=1;
+    if(z==0)dfs(1);
+    else
+    dfs(0);
+    ll flag=0;
+    for(ll i=0;i<n;i++)
+    {
+        if(!vis[i])
+        {
+            flag=1;
+            break;
+        }
+    }
+    if(flag==0)
+    cout<<"yes\n";
+    else
+    cout<<"no\n";
+    
+}

Codeforces_Contests/Global Round 10/A.cpp

@@ -0,0 +1,38 @@
+// nb_9960
+#include <bits/stdc++.h> 
+using namespace std; 
+#define fi(i,a,n) for (ll i=a; i < n; i++) 
+#define ll long long
+
+int main() 
+{  
+  ios_base::sync_with_stdio(0); 
+  cin.tie(0); 
+  cout.tie(0); 
+
+  ll t = 1; 
+  cin >> t;
+
+  while (t--) { 
+    ll n;
+    cin>>n;
+    ll a[n];
+    int flg=0;
+    ll prev;
+    fi(i,0,n){
+      cin>>a[i];
+    }
+    prev = a[0];
+    fi(i,1,n){
+      if(a[i]!=prev){
+          flg=1;
+          break;
+      } 
+      //break;
+    }
+    if(flg)
+    cout<<1<<endl;
+    else cout<<n<<endl;
+  } 
+  return 0; 
+} 

Codeforces_Contests/Global Round 10/B.cpp

@@ -0,0 +1,51 @@
+// nb_9960
+#include <bits/stdc++.h>
+#include<math.h>
+using namespace std;
+#define MOD 1000000007
+#define ll long long int
+#define fi(i,a,n) for(ll i=a;i<n;i++)
+#define fd(i,a,n) for(ll i=a;i>=n;i--)
+#define pb push_back
+#define fv(i,a) for(auto i:a) 
+#define vi vector<int>
+
+int main() { 
+    ll t=1;
+    cin>>t;
+    while(t--){
+        ll n,k;
+        cin>>n>>k;
+        ll a[n],b[n],c[n];
+        ll max=INT_MIN;
+        ll min=INT_MAX;
+        fi(i,0,n){
+            cin>>a[i];
+            if(a[i]>max){
+                max=a[i];
+            }
+            if(a[i]<min){
+                min=a[i];
+            }
+        }
+        fi(i,0,n){
+            b[i]=max-a[i];
+            c[i]=(max-min)-b[i];
+        }
+        if(n==1){
+            cout<<0;
+        }else if(k%2==0){
+            fi(i,0,n){
+                cout<<c[i]<<" ";
+            }
+        }else{
+            fi(i,0,n){
+                cout<<b[i]<<" ";
+            }
+        }
+        cout<<"\n";
+
+        
+    }
+	return 0; 
+} 

Codeforces_Contests/Global Round 10/C.cpp

@@ -0,0 +1,35 @@
+// nb_9960
+#include <bits/stdc++.h>
+#include<math.h>
+using namespace std;
+#define MOD 1000000007
+#define ll long long int
+#define fi(i,a,n) for(ll i=a;i<n;i++)
+#define fd(i,a,n) for(ll i=a;i>=n;i--)
+#define pb push_back
+#define fv(i,a) for(auto i:a) 
+#define vi vector<int>
+
+int main() { 
+    ll t=1;
+    cin>>t;
+    while(t--){
+        ll n;
+        cin>>n;
+        ll a[n],diff[n];
+        fi(i,0,n){
+            cin>>a[i];
+        }
+        fi(i,0,n-1){
+            diff[i]=a[i]-a[i+1];
+        }
+        ll ans=0;
+        fi(i,0,n-1){
+            if(diff[i]>0){
+                ans+=diff[i];
+            }
+        }
+        cout<<ans<<endl;
+    }
+	return 0; 
+} 

Codeforces_Contests/Global Round 10/D.cpp

@@ -0,0 +1,29 @@
+// nb_9960
+#include<bits/stdc++.h>
+#define ll long long 
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        ll n;
+        cin>>n;
+        string s;
+        cin>>s;
+        int ans = 0,i=1,c=0,j;
+        for(;i<n;i++){
+            if(s[i] == s[i-1]);
+            else break;
+        }
+        s=s+s+s;
+        for(j = i;j<i+n;j++){
+            if(s[j] == s[j-1] && s[j] == s[j+1])
+                c++;
+            else{
+                ans+=ceil(c/3.0);
+                c = 0;
+            }
+        }
+        cout<<ans + ceil(c/3.0)<<endl;
+    }
+}

InterviewBit/All_Factors.cpp

@@ -0,0 +1,16 @@
+vector<int> Solution::allFactors(int A) {
+    vector<int>v;
+    for(int i=1;i<=sqrt(A);i++)
+    {
+        if(A%i==0)
+        {
+            v.push_back(i);
+            if(i!=sqrt(A))
+            {
+                v.push_back(A/i);
+            }
+        }
+    }
+    sort(v.begin(),v.end());
+    return v;
+}

InterviewBit/Binary_Representation.cpp

@@ -0,0 +1,15 @@
+string Solution::findDigitsInBinary(int A) {
+    if(A==0)
+    {
+        return "0";
+    }
+    string num;
+    while(A>0)
+    {
+        string i=to_string(A%2);
+        num+=i;
+        A=A/2;
+    }
+    reverse(num.begin(),num.end());
+    return num;
+}