temă 13.09

///#621 NumarLipsa
#include <iostream>

using namespace std;
int v[101];
int main()
{
    int n;
    cin>>n;
    int i, j, p;
    for (i=1; i<=n; ++i)
        cin>>v[i];
    for (i=1; i<n; ++i)
    {
        p=i;
        for (j=i+1; j<=n; ++j)
            if (v[j]<v[p])
                p=j;
        if (i!=p)
            swap (v[i],v[p]);
    }
    for (i=1; i<=n; ++i)
        if (v[i]-v[i-1]>1)
        {
            cout<<v[i-1]+1;
            return 0;
        }
        cout<<v[n]+1;

    return 0;
}


///#1400 e_palindrom
#include <iostream>

using namespace std;

int fr[10001];
int main()
{
    int n, x;
    cin>>n;
    int i;
    for (i=1; i<=n; ++i)
        cin>>x, ++fr[x];
    int nrimp=0;
    for (i=0; i<=10000; ++i)
        if (fr[i]%2==1)
             ++nrimp;

    if (nrimp>1)
        cout<<"NU";
    else
        cout<<"DA";

    return 0;
}


///#528 Multimi
#include <iostream>

using namespace std;
int a[1001], b[1001], ab[2001];
int re[2001], in[1001];
int main()
{
    int n, m, nm;
    int i, j, p;
    cin>>n;
    for (i=1; i<=n; ++i)
        cin>>a[i], ab[i]=a[i];
    cin>>m;
    for (j=1; j<=m; ++j)
        cin>>b[j], ab[j+n]=b[j];
    nm=n+m;
    //
    for (i=1; i<nm; ++i)
    {
        p=i;
        for (j=i+1; j<=nm; ++j)
            if(ab[j]<ab[p])
                p=j;
        if (i!=p)
            swap(ab[i], ab[p]);
    }
    ab[0]=-1, j=0;
    for (i=1; i<=nm; ++i)
        if (ab[i]!=ab[i-1])
            re[++j]=ab[i];
    for (i=1; i<=j; ++i)
        cout<<re[i]<<" ";
    cout<<'\n';
    //
    int x=0;
    for (i=1; i<=n; ++i)
        for (j=1; j<=m; ++j)
            if(a[i]==b[j])
                in[++x]=a[i];
    for (i=1; i<=x; ++i)
        cout<<in[i]<<" ";
    //
    return 0;
}


///#535 Fabrica
#include <iostream>

using namespace std;

int main()
{
    int n, t, x, s=0;
    cin>>n>>t;
    int i;
    for (i=1; i<=n; ++i)
        cin>>x, s+=(t/x);
    cout<<s;
    return 0;
}


///#567 Pereche
#include <iostream>
#include <math.h>

using namespace std;
int v[1001];
int main()
{
    int n;
    cin>>n;
    int i, j;
    for (i=1; i<=n; ++i)
        cin>>v[i];
    int dif, st, dr, minn;
    minn=abs(v[1]-v[n]);
    st=1, dr=n;
    for (i=2; i<=n; ++i)
    {
        dif=abs(v[i]-v[i-1]);
        if (dif<minn)
            minn=dif, st=i-1, dr=i;
    }

    cout<<st<<" "<<dr;
    return 0;
}