NZY

1

#include<bits/stdc++.h>
using namespace std;
class Array{
private:
    int *s_;
    int size_;
public:
    Array():s_(NULL),size_(0) {}
    ~Array(){ delete []s_; }
    int size() { return size_; }
    void get(int n){
        size_=n;
        s_ = new int[n*2];
        for(int i=0;i<n;i++)
            cin>>s_[i];
    }
    int& operator[](int i) { return s_[i]; }
};

2

#include<bits/stdc++.h>
using namespace std;
template<class T>
class Array{
private:
    T *s_;
    int size_;
public:
    Array():s_(NULL),size_(0) {}
    Array(int l){
        s_ = new T[l*2];
        size_=l;
    }
    ~Array(){ delete []s_; }
    int size() { return size_; }
    void get(int n){
        size_=n;
        s_ = new T[n*2];
        for(int i=0;i<n;i++)
            cin>>s_[i];
    }
    T& operator[](int i) { return s_[i]; }
public:
    void put(int n){
        if(size_ < n) n=size_;
        sort(s_,s_+size_);
        for(int i=size_-1;i>size_-n;i--) cout<<s_[i]<<" "; cout<<s_[size_-n]<<endl;
    }
};

3

#include<bits/stdc++.h>
using namespace std;
class STR{
private:
    char *s_;
    size_t len_;
public:
    STR():s_(NULL),len_(0) {}
    STR(const char* s){
        int l = strlen(s);
        len_=l;
        s_ = new char[l*2];
        strcpy(s_,s);
    }
    int length() {return len_;}
    void putline(){
        for(int i=0;i<len_;i++) cout<<s_[i]; cout<<endl;
    }
    ~STR() { delete[] s_; }
};

4

#include<bits/stdc++.h>
using namespace std;
class STR{
private:
    char *s_;
    size_t len_;
public:
    STR():s_(NULL),len_(0) {}
    STR(int l,char*s):len_(l),s_(s) {}
    STR(const char* s){
        int l = strlen(s);
        len_=l;
        s_ = new char[l*2];
        strcpy(s_,s);
    }
    int length() {return len_;}
    void putline(){
        for(int i=0;i<len_;i++) cout<<s_[i]; cout<<endl;
    }
    ~STR() { delete[] s_; }
    char& operator[](int i) const {return s_[i];}
    friend const STR operator + ( STR&lhs, STR& rhs){
        size_t length = lhs.length() + rhs.length();
        char *arr_ = new char[length*2];
        int i=0;
        for(; i < lhs.len_; i++)
        arr_[i] = lhs[i];
        for( ; i < lhs.len_ + rhs.length(); i++)
        arr_[i] = rhs[i - lhs.length()];
        return STR(length,arr_);
    }
      STR& operator += ( STR &rhs){
        char *ss;
        int l=len_;
        len_+=rhs.length();
        ss=new char [len_];
        for(int i=0;i<l;i++) ss[i]=s_[i];
        delete[] s_;
        for(int i=l;i<len_;i++) ss[i]=rhs[i-l];
        s_=ss;
        return *this;
    }
};

5

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;int a,b;
    cin>>s>>a>>b;
    vector<int> x(a,b);
    while(cin>>s>>a>>b){
        if(s=="Modify") x[a-1]=b;
        if(s=="Insert") {
            int c;cin>>c;
            x.insert(x.begin()+a-1,x.begin()+b-1,x.begin()+c);
        }
        if(s=="Erase") x.erase(x.begin()+a-1,x.begin()+b);
        if(s=="Print") {
            for(int i=a-1;i<b-1;i++){
                cout<<"["<<i+1<<"]:"<<x[i]<<" ";
            }
            cout<<"["<<b<<"]:"<<x[b-1]<<"\n";
        }
    }
    return 0;
}

6

#include<bits/stdc++.h>
using namespace std;
void f(set<int> A){
    for(set<int>::iterator it=A.begin();it!=A.end();it++){
            if(it==A.begin()) cout<<*it;
            else cout<<", "<<*it;
        } cout<<"}\n";
}
int main()
{
    int t,c=1;
    cin>>t;
    while(t--){

        set<int> A,B,C,D;
        int n;cin>>n;
        for(int i=0;i<n;i++) { int x; cin>>x; A.insert(x);}
        cin>>n;
        for(int i=0;i<n;i++) { int x; cin>>x; B.insert(x); }
        cout<<"Case# "<<c++<<":\n";
        cout<<"A = {";f(A);
        cout<<"B = {";f(B);
        set_union(A.begin(), A.end(), B.begin(), B.end(), inserter(C, C.begin()));
        cout<<"A u B = {";f(C);
        set_intersection(A.begin(), A.end(), B.begin(), B.end(), inserter(D, D.begin()));
        cout<<"A n B = {";f(D);D.clear();
        set_difference(A.begin(), A.end(), B.begin(), B.end(), inserter(D, D.begin()));
        cout<<"A - B = {";f(D);D.clear();
        set_difference(C.begin(), C.end(), A.begin(), A.end(), inserter(D, D.begin()));
        cout<<"SA = {";f(D);D.clear();
        set_difference(C.begin(), C.end(), B.begin(), B.end(), inserter(D, D.begin()));
        cout<<"SB = {";f(D);D.clear();
    }
    return 0;
}

7

#include<bits/stdc++.h>
using namespace std;
int main()
{
    set<int> a,b,c,d;
    int n;
    while(cin>>n){
        a.clear();
        b.clear();
        c.clear();
        d.clear();
        if(n==0){
            int p;
            while(cin>>p&&p) b.insert(p);
        }
        else {
            int p;
            a.insert(n);
            while(cin>>p&&p) a.insert(p);
            while(cin>>p&&p) b.insert(p);
        }
        set_difference(a.begin(), a.end(), b.begin(), b.end(), inserter(c, c.begin()));
        set_difference(b.begin(), b.end(), a.begin(), a.end(), inserter(d, d.begin()));
        if(c.empty()&&d.empty()) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}

8

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    while(cin>>n){
        char s[1000];double a[1000],sum=0;
        for(int i=0;i<n;i++) cin>>a[i]>>s[i];
        for(int i=0;i<n-1;i++){
            if(s[i]=='-') a[i+1]=-a[i+1];
            if(s[i]=='*') { a[i+1]=a[i]*a[i+1]; a[i]=0; }
        }
        for(int i=0;i<n;i++) sum+=a[i];
        printf("%.2lf\n",sum);
    }
    return 0;
}

9

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string a;
    while(cin>>a){
        int i,len=a.length(),sum=0,flag=1;
        for(i=0;i<len;i++){
            if(a[i]=='(') sum++;
            if(a[i]==')') sum--;
            if(sum < 0) { flag=0;break; }
        }
        if(sum==0) cout<<"YES"; else cout<<"NO"; cout<<endl;
    }
    return 0;
}