Add files via upload

Dima_and_friends.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,f,count=0,sum=0,a;
+    cin>>n;
+    for(int i=1;i<=n;i++){
+        cin>>f;
+        sum+=f;
+    }
+    for(int j=1;j<=5;j++){
+        a= sum+j;
+        if(a%(n+1)!=1){
+            count++;
+        }
+    }
+    cout<<count;
+}

Football2.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <string>
+using namespace std;
+int main(){
+    string s;
+    cin>>s;
+    int count=1;
+    for(int i=0;i<s.length();i++){
+        if(s[i]==s[i+1]){
+            count++;
+            if(count==7){
+                cout<<"YES"<<endl;
+                return 0;
+            }
+        }
+        else {
+            count=1;
+        }
+
+    }
+    cout<<"NO"<<endl;
+    return 0;
+}

Jzzhu_and_children.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,m,pos,arr[101];
+    bool flag=true;
+    cin>>n>>m;
+    pos=n;
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    while(flag)
+    {
+        for(int i=0;i<n;i++){
+            arr[i] -= m;
+            if(arr[i]>0){
+                pos=i+1;
+            }
+        }
+        for(int i=0;i<n;i++){
+            if(arr[i]>0){
+                flag=true;
+                break;
+            }
+            else{
+                flag=false;
+            }
+        }
+    }
+    cout<<pos<<endl;
+
+
+}

Little_elephant_2.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    cout << n;
+    for (int i = 1; i < n; ++i)
+    {
+        cout << " " << i;
+    }
+    cout << endl;
+    return 0;
+}

Petr_and_book.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,pages[8],sum=0;
+    cin>>n;
+    for(int i=1;i<=7;i++){
+        cin>>pages[i];
+    }
+    while(sum<n){
+        for(int i=1;i<=7;i++){
+            sum += pages[i];
+            if(sum>=n){
+                cout<<i;
+                break;
+            }
+        }
+
+    }
+
+
+}

R _two.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n, a1;
+    cin >> n >> a1;
+
+    int prev(a1), cur, reconnaissance(1000), index1, index2;
+    for (int i = 2; i <= n; ++i)
+    {
+        cin >> cur;
+        int diff = abs(cur - prev);
+        if (diff < reconnaissance)
+        {
+            reconnaissance = diff;
+            index1 = i - 1;
+            index2 = i;
+        }
+        prev = cur;
+    }
+    int diff = abs(a1 - prev);
+    if (diff < reconnaissance)
+    {
+        index1 = n;
+        index2 = 1;
+    }
+    cout << index1 << " " << index2 << endl;
+    return 0;
+}

The_number_of_positions.cpp

@@ -0,0 +1,7 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,a,b,count=0;
+    cin>>n>>a>>b;
+    cout<<min(n-a,b+1);
+}

Translation.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+int main(){
+    string s,t;
+    cin>>s>>t;
+    reverse(s.begin(),s.end());
+    if(s==t){
+        cout<<"YES";
+    }
+    else{
+        cout<<"NO";
+    }
+}

Xenia_and_ringroad.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+int main(){
+    long long n,m,loc=1,ans=0;
+    cin>>n>>m;
+    for(int i=0;i<m;i++){
+        int now;
+        cin>>now;
+        if(now>=loc){
+            ans += now-loc;  //because now is greater than loc
+        }
+        else {
+            ans += n-(loc-now);
+        }
+        loc=now;
+    }
+    cout<<ans;
+}

airport.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+int main(){
+    int n,m,a[1000];
+    cin>>n>>m;
+    for(int i=0;i<m;i++){
+        cin>>a[i];
+    }
+    sort(a,a+m);
+    int min=0,no=a[0],k=0;
+    for(int i=0;i<n;i++){
+        min += no;
+        no -= 1;
+        if(no==0){
+            no=a[++k];
+        }
+    }
+    sort(a,a+m,greater<int>());
+    int max=0;
+    while(n--){
+        max += a[0];
+        a[0] -= 1;
+        for(int i=1;i<m;i++){
+            if(a[i]<=a[i-1]){
+                break;
+            }
+            swap(a[i],a[i-1]);
+        }
+    }
+    cout<<max<<" "<<min<<endl;
+    return 0;
+
+}

bicycle_chain.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n,m,a[50],max=0,count=1,b;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>a[i];    
+    }
+    cin>>m;
+    for(int i=0;i<m;i++){
+        cin>>b;
+        for(int j=0;j<n;j++){
+            if(b%a[j]==0){
+                int x = b/a[j];
+                if(x>max){
+                    max=x;
+                    count=1;
+                }
+                else if(x==max){
+                    count+=1;
+                }
+                break;
+            }
+        }
+    }
+    cout<<count;
+}

buisness_trip.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+int main(){
+    int k,sum=0,arr[12],count=0,total=0;
+    cin>>k;
+    for(int i=0;i<12;i++){
+        cin>>arr[i];
+        total+=arr[i];
+    }
+    sort(arr,arr+12,greater<int>());
+    if(total<k){
+        cout<<-1;
+    }
+    else if(k==0){
+        cout<<0;
+    }
+    else{
+        for(int i=0;i<12;i++){
+            sum+=arr[i];
+            count++;
+            if(sum>=k){
+                cout<<count;
+                break;
+            }
+        }
+    }
+}

chat_room.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <algorithm>
+#include <string>
+using namespace std;
+int main(){
+    string a,b="hello";
+    int l,j=0,count=0;
+    cin>>a;
+    l=a.length();
+    for(int i=0;i<l;i++){       //try a[i]==b[j]
+        if(a[i]==b[j]){
+            j++;
+            count++;
+
+            if(count==5){
+                break;
+            }
+        }
+    }
+    if(count==5){
+        cout<<"YES";
+    }
+    else{
+        cout<<"NO";
+    }
+}

dragons.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+int main(){
+    int s,n,count=0;
+    pair<int, int>a[1000];
+    cin>>s>>n; //s=2
+    int c=s; //c=2
+    for(int i=0;i<n;i++){
+        cin>>a[i].first>>a[i].second;
+    }
+    sort(a,a+n);
+    for(int i=0;i<n;i++){
+        if(a[i].first>=c){
+            cout<<"NO";
+            break;
+        }
+        else {
+            c=c+a[i].second;
+            count++;
+        }
+    }
+
+    if(count==n){
+        cout<<"YES";
+    }
+}

dubstep.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <string>
+using namespace std;
+ int main(){
+    string s;
+    cin>>s;
+    int count=1;
+    int l=s.length();
+    for(int i=0;i<l;){
+        if(s[i]=='W' && s[i+1]=='U' && s[i+2]=='B'){
+            i+=3;
+            if(!count){
+                cout<<" ";
+                count=1;
+            }
+            continue;
+        }
+        else {
+            cout<<s[i];
+            i++;
+            count=0;
+        }
+    }
+ }