首届全国中医药院校程序设计大赛

1537	序列的混乱程度	水题
1538	随机数	水题
1539	完美序列	dp
1540	第k大数	二分搜索
1541	选房子	水题
1542	Game
1543	Numbers	模拟+二进制
1544	Counting Words	stringstream操作

 

#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int main(){
    int t; scanf("%d",&t);
    while (t--) {
        int n; scanf("%d",&n);
        int mx = 0, mi = inf;
        while (n--) {
            int x; scanf("%d",&x);
            mx = max(mx,x);
            mi = min(mi,x);
        }
        printf("%d\n",mx-mi);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t; scanf("%d",&t);
    while (t--) {
        int a, b; scanf("%d%d",&a,&b);
        printf("%d %d\n",b-a,a);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2005, mod = 1e9+7;
int dp[maxn][maxn];
int main(){
    for (int i = 1; i <= 2000; i++) dp[1][i] = 1;
    for (int i = 1; i <= 2000; i++)
        for (int j = 1; j <= 2000; j++)
            for (int k = j; k <= 2000; k+=j)
                dp[i+1][k] = (dp[i][j]+dp[i+1][k])%mod;
    int t; scanf("%d",&t);
    while (t--) {
        int n, l; scanf("%d%d",&n,&l);
        ll ans = 0;
        for (int i = 1; i <= n; i++)
            ans = (ans+dp[l][i])%mod;
        printf("%lld\n",ans);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+5;
ll a[maxn], b[maxn];
ll n, m, k;
ll judge(ll val) {
    ll sum = 0;
    int j = 1;
    for (int i = n; i >= 1; i--) {
        for (; j <= m; j++) {
            if (a[i]*b[j] >= val) {
                sum += m-j+1;
                break;
            }
        }
    }
    return sum;
}
int main() {
    int t; scanf("%d",&t);
    while (t--) {
        scanf("%lld%lld%lld",&n,&m,&k);
        for (int i = 1; i <= n; i++) scanf("%lld",&a[i]);
        sort(a+1,a+1+n);
        for (int i = 1; i <= m; i++) scanf("%lld",&b[i]);
        sort(b+1,b+1+m);
 
        ll l = a[1]*b[1], r = a[n]*b[m];
        ll ans;
        while (l <= r) {
            ll mid = (l+r)/2;
            if (judge(mid) >= k) {
                ans = mid, l = mid+1;
            }
            else r = mid-1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
int main(){
    int t; scanf("%d",&t);
    while (t--) {
        int n; scanf("%d",&n);
        int ans = 0;
        while (n--) {
            int a, b; scanf("%d%d",&a,&b);
            if (b-a >= 2) ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool bit[64];
bool judge(ll d) {
    int i = 0;
    while (d) {
        if ((d&1) == bit[i++]) return true;
        d >>= 1;
    }
    return false;
}
int main(){
    int t; scanf("%d",&t);
    while (t--) {
        ll p; scanf("%lld",&p);
        for (int i = 0; i < 64; i++) {
            bit[i] = (p>>i)&1;
        }
        ll ans = 0;
        for (ll d = 1; d <= sqrt(p); d++) {
            if (p%d == 0) {
                if (judge(d)) ans++;
                if (d*d == p) continue;
                if (judge(p/d)) ans++;
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
int main() {
    int t; cin >> t; getchar();
    while (t--) {
        string s; getline(cin,s);
        stringstream ss(s);
        int ans = 0; string word;
        while (ss >> word) ans++;
        cout << ans << endl;
    }
    return 0;
}