牛客小白月赛5

/**
A:
链接：https://www.nowcoder.com/acm/contest/135/A
题意：求解区间[l,r]与集合A无关的数的个数
无关:[l,r]中的数不能整数A中的元素 
思路： 算出每个数对ans的贡献后 进行容斥
example ： 2 3 5
分别计算完每个数贡献之后 则需要剔除2*3 2*5 3*5 2*3*5
因此用dfs维护两个ans 在计算贡献的时候同时维护一个容斥的情况;
*/

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ll_INF 0x3f3f3f3f3f3f3f3f
using namespace std;

bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){ll gg=gcd(a,b);a/=gg;if(a<=ll_INF/b) return a*b;return ll_INF;}


const int maxn=1e3+7;
ll l,r,k;
int num[maxn];
ll ans;

void dfs(int x,ll tmp,int flag){
    if(x==k){
        ans+=flag*(r/tmp-(l-1)/tmp);
        return ;
    }
    dfs(x+1,tmp,flag);
    dfs(x+1,lcm(tmp,num[x]),-flag);
}

void solved(){
    read(l),read(r),read(k);
    for(int i=0;i<k;i++) read(num[i]);
    ans=0;
    dfs(0,1,1);
    writeln(ans);
}

int main(){
    solved();
    return 0;
}
/**
B
链接：https://www.nowcoder.com/acm/contest/135/B
求解满足条件的x取值范围 经典柯西不等式的求解
柯西不等式的二维形式:https://baike.baidu.com/item/%E6%9F%AF%E8%A5%BF%E4%B8%8D%E7%AD%89%E5%BC%8F/212423?fr=aladdin
最后化简为求解一元二次方程的解;
*/

#include<bits/stdc++.h>
using namespace std;
int main (){
    int a,b;
    cin>>a>>b;
    if(2*b-a*a<0) {
        puts("No Answer.");
    }
    else {
        printf("%.2f %.2f\n",(a*1.0-sqrt(2*b-a*a))*0.5,(a*1.0+sqrt(2*b-a*a))*0.5);
    }
    return 0;
}
/**
C
链接：https://www.nowcoder.com/acm/contest/135/C
题意：如题面；
x使得阶乘在m进制下末尾0的个数；
将m因数分解 取出x阶乘下m的个数  取得m分配因子最小的即为ans 

example ： 666  18进制
将18进行分解得到2*3^2;  分别找到666阶乘中2的个数cnt1和3的个数cnt2
取最小值min(cnt1/幂次,cnt2/幂次)--->ans;
*/

#include<bits/stdc++.h>
#define ll long long
using namespace std;
 
ll a[2000];
 
ll ans[18]={0,1,0,0,2,10,4,40,92,352,724,2680,14200,73712,365596,2279184,14772512};
int prime[200],cnt=0;
 
ll solved(ll x,ll m){
    ll ret=0;
    while(x){
        ret+=x/m;
        x/=m;
    }
    return ret;
}
 
bool judge(int x){
    for(int i=2;i*i<=x;i++) if(x%i==0)  return false;
    return true;
}
 
int main (){
    for(int i=2;i<=200;i++){
        if(judge(i)) prime[cnt++]=i;
     }

    ll  x;
    int m;
 
    a[0]=0ll;a[1]=1ll;a[2]=1ll;
    for(int i=3;;i++){
        a[i]=a[i-1]+a[i-2];
        if(a[i]>1e18) {
                break;
        }
    }
    cin>>x>>m;
    int flag=0;
    for(int i=0;i<88;i++) {
        if(a[i]==x){
            flag=1;
            break;
        }
    }
    //cout<<flag<<"      000000000000000000"<<endl;
    //cout<<"888888888"<<" "<<flag<<endl;
    if(!flag) {
        int z=x%(min(13*1ll,m*1ll))+1;
        printf("%lld\n",ans[z]);
    }
    else {
        ll ans=1e18+7;
        for(int i=0;i<cnt;i++){
            if(m%prime[i]==0){
                int ret=0;
                while(m%prime[i]==0) {
                    ret++;
                    m/=prime[i];
                }
                ans=min(solved(x,prime[i]*1ll)/(1ll*ret),ans);
            }
        }
        printf("%lld\n",ans);
    }
    /**
    100000000000000000 99
    */
    return 0;
}
/**
D：
链接：https://www.nowcoder.com/acm/contest/135/D
题意:求解阶乘的阶乘末尾的0的个数
直接判断m阶乘的存在多少个5 进行累加和 值中部分周期为5 
直接暴力判断就好了  ummm  1e8    NO  T
*/


#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ll_INF 0x3f3f3f3f3f3f3f3f
#define  PI acos(-1.0)
#define  inf 0x3f3f3f3f
#define  E 2.7182818284590452353602874713527
using namespace std;

bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){ll gg=gcd(a,b);a/=gg;if(a<=ll_INF/b) return a*b;return ll_INF;}
/********************************Head----Temlate**********************************************/

int f(ll x){
    int ans=0;
    while(x){
        ans+=x/5;
        x/=5;
    }
    return ans;
}

void solved(){
    int n;read(n);
    ll ans=0,pre;
    for(int i=0;i<=n;i++)  {
        if(i%5==0) pre=f(i);
        ans+=pre;
    }
    writeln(ans);
}

int main(){
    solved();
    return 0;
}
/**
E
题面:https://www.nowcoder.com/acm/contest/135/E
可以证明出最大密度子图的面积恒为（m*n/2）-1 
再利用叉积计算面积
判断相等即可
*/


#include <bits/stdc++.h>
using namespace std;
  
int main(){
    std::ios::sync_with_stdio(false);
    long long n,m,x1,x2,y1,y2;
    double s1,s2;
    while(cin>>n>>m){
        cin>>x1>>y1>>x2>>y2;
        s1=1.0*n/2.0*m-1;
        s2=abs(x1*y2-x2*y1)/2.0;
        if(s1==s2) cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;
}