西北大学第四届程序设计竞赛新生赛（同步赛）（重现赛）

A.
思路：容斥原理

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;
typedef long long ll;
const ll N=1e9;

ll gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        ll a,b,c;
        cin>>a>>b>>c;
        ll cnt=0;
        cnt=N-N/a-N/b-N/c+(N/(a*b)*gcd(a,b))+(N/(b*c)*gcd(b,c))+(N/(a*c)*gcd(a,c))-(N/(a*b*c)*gcd(a,gcd(b,c)));
        cout<<cnt<<endl;
    }
    return 0;
}

C.
思路：数学

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

typedef long long ll;

/*ll quick_mul(ll x,ll y)
{
    ll ans=0;
    while(y){
        if(y&1)ans=ans+x;
        x=(x+x);
        y>>=1;
    }
    return ans;
}*/

int main()
{
    int t;
    cin>>t;
    while(t--){
        ll n,m;
        cin>>n>>m;
        //ll res=quick_mul(n,n-1);
        ll ans=n*(n-1)/2-m;
        cout<<ans<<endl;
    }
    return 0;
}

D.
思路：数学思维题

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>

using namespace std;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    while(cin>>n){
        int cnt=0;
        //if(n==1){cout<<"-1"<<endl;continue;}
        while(n>=2){
            if(n%2==0)n/=2;
            else n--;
            cnt++;
        }
        cout<<cnt<<endl;
    }
    return 0;
}

G.

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

typedef long long ll;

ll fun(ll n)
{
    return n*(n+1)*(2*n+1)/6;//高中数学1~n^2求和公式
}

int main()
{
    int t;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        ll l=0,r=1500000;
        while(l<r){
            ll mid=l+r+1 >>1;
            if(fun(mid)>n)r=mid-1;
            else l=mid;
        }
        cout<<fun(l)<<endl;
    }
    return 0;
}

ps:可用STL中的upper_bound解，都是利用二分查找的思想