练习5

practise

A 184215092008

#include <iostream>
#define ll long long
using namespace std;
int main()
{
    ll x;
    cin>>x;
    ll num = 1;
    ll ans = 0;
    while(x)
    {
        x /= 2 ;
        ans += num;
        num = num*2;
    }
    cout<<ans<<endl;
    return 0;
}

B 184215092008

#include <iostream>
#define ll long long
using namespace std;
int main()
{
    int n,k;
    cin>>n>>k;
    int num = 1;
    while(n--)
    {
        if(num*2 < num+k)
        num = num * 2 ;
        else num = num + k;
    }
    cout<<num<<endl;
    return 0;
}

C OUHE_csc

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int N = 1010;
char s[N];
int f[N][N];
bool check(string s)
{
    if(s.size() < 3)  return false;
    if(s.substr(s.size() / 2 - 1, 3) != "iwi")  return false;
    for(int i = 0; i < s.size() / 2 - 1; i ++)
    {
        int j = s.size() - i - 1;
        if(     s[i] == '(' and s[j] != ')'
            or  s[i] == ')' and s[j] != '('
            or  s[i] == '[' and s[j] != ']'
            or  s[i] == ']' and s[j] != '['
            or  s[i] == '{' and s[j] != '}'
            or  s[i] == '}' and s[j] != '{')
            return false;
    }
    return true;
}
int main()
{
    scanf("%s", s);
    int n = strlen(s);
    int res = 0;
    for(int i = 0; i < 1 << n; i ++)
    {
        string str;
        for(int j = 0; j < n; j ++)
            if(i >> j & 1)  str += s[j];
        if(check(str))  res = max(res, (int)str.size());
    }
    printf("%d\n", res);
    return 0;
}

D 184215092008

#include <iostream>
#include <map>
#include <string>
#define ll long long
using namespace std;
int main()
{
    map<string,bool>mp;
    int n;
    cin>>n;
    int ans = 0;
    while(n--)
    {
        string s;
        cin>>s;
        if(mp[s]) ans++;
        string ss;
        ss.assign(s.rbegin(),s.rend());
        mp[ss]=true;
    }
    cout<<ans<<endl;
    return 0;
}

E 184215092008

#include <iostream>
#include <map>
#include <string>
#define ll long long
using namespace std;
int main()
{
    string s[] = {"142857","0588235294117647","052631578947368421","0434782608695652173913","0344827586206896551724137931","0212765957446808510638297872340425531914893617","0169491525423728813559322033898305084745762711864406779661","016393442622950819672131147540983606557377049180327868852459"};
    string k;
    cin>>k;
    for(int i =0;i<8;i++)
    {
        if(k == s[i])
            {
                cout<<1<<endl;
                return 0;
            }
    }
    cout<<0<<endl;
    return 0;
}

F 184215092008

#include <iostream>
#include <map>
#include <string>
#include <queue>
#define ll long long
using namespace std;
int main()
{
    priority_queue<int>q;
    int n;
    cin>>n;
    while(n--)
    {
        string op;
        int val;
        cin>>op;
        if(op == "A")
        {
            cin>>val;q.push(val);
        }
        else 
        {
            cout<<q.top()<<endl;
            q.pop();
        }
    }
    return 0;
}

G 184215092008

#include <iostream>
#include <map>
#include <string>
#include <queue>
#include <string.h>
#define ll long long
using namespace std;
int main()
{
    std::ios::sync_with_stdio(false);
    int n;
    while(cin>>n,n)
    {
        int num[100010];
        memset(num,0,sizeof(num));
        for(int i=0,l,r; i<n; i++)
        {
            cin>>l>>r;
            num[l]++;
            num[r+1]--;
        }
        for(int i=1; i<=n+5; i++)
        {
            num[i]=num[i] + num[i-1];
        }
    for(int i=1; i<=n; i++)
            cout<<num[i]<< ((i==n)?"\n":" ");
    }
    return 0;
}

H 184215092008

#include <iostream>
#include <map>
#include <string>
#include <queue>
#include <string.h>
#define ll long long
using namespace std;
int n,m;
int num[1000005];
int mum[10005];
int _next[10005];
inline void GetNext()
{
    int i = 0, j = -1, len = m;
    _next[i] = j;
    while(i < len){
        while( j != -1 && mum[i] != mum[j])
            j = _next[j];
        _next[++i] = ++j;
    }
}
int kmp_num()
{
    GetNext();
    int i =0, j = 0, strL = n, moL = m;
    while(i < strL && j < moL){
        while( j != -1 && num[i] != mum[j]) j = _next[j];
        i++, j++;
    }
    if(j == moL) return i - moL+1;
    else return -1;
}
int main()
{
    std::ios::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(int i=0; i<n; i++)
            cin>>num[i];
        for(int i=0; i<m; i++)
            cin>>mum[i];
        cout<<kmp_num()<<endl;
    }
    return 0;
}

I 184215092008

#include <iostream>
#include <map>
#include <string>
#include <queue>
#include <string.h>
#include <math.h>
#define ll long long
using namespace std;
int main()
{
    std::ios::sync_with_stdio(false);
    int n;
    cin>>n;
    int maxe,mine,max_pos,min_pos;
    maxe = -10000005,max_pos = 1;
    mine = -maxe,min_pos = 1;
    int num[55];
    for(int i=1;i<=n;i++)
        cin>>num[i];
    for(int i=1;i<=n;i++)
    {
        if(maxe < num[i])
        {
            maxe = num[i];
            max_pos = i;
        }
        if(num[i] < mine)
        {
            mine = num[i];
            min_pos = i;
        }
    }
    cout<<n*2-2<<endl;
    if(abs(maxe) >= abs(mine))
    {
        for(int i=1;i<=n;i++)
        {
            if(i == max_pos);
            else
                cout<<max_pos<<" "<<i<<endl;
        }
        for(int i=2;i<=n;i++)
        {
            cout<<i-1<<" "<<i<<endl;
        }
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            if(i == min_pos);
            else cout<<min_pos<<" "<<i<<endl;
        }
        for(int i=n-1;i>=1;i--)
        {
            cout<<i+1<<" "<<i<<endl;
        }
    }
    return 0;
}