牛客小白月赛10

牛客小白月赛10
A题:类斐波那契规律题
B题:判断大数能不能被n整除
C题:求两个大数的所有公约数gcd();
D题:dijkstra优先队列--最短路？？？

A题

找规律即可,类斐波那契
题目链接:
https://ac.nowcoder.com/acm/contest/280/A

#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#define ll long long
using namespace std;
int main(){
    ll n;
    while(scanf("%lld",&n)!=EOF){
        ll f[10000010],ans;
        f[1]=1;f[2]=2;
        for(int i=3;i<=n;i++){
            f[i]=(f[i-1]+f[i-2])%10000000007;
        }
        for(int i=1;i<=n;i++){
            ans=(ans+f[i])%10000000007;
        }
        printf("%lld\n",ans%10000000007);
    }


    return 0;
}

B题

题目链接:
https://ac.nowcoder.com/acm/contest/280/B
大数取模运算，将平常数学的除法进行代码化，判断大数能不能被某个数整除

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long LL;
const int maxn = 1e4 + 10;
const LL inf = 0x3f3f3f3f;
char s[maxn];
int a[11];

int isok(int k){//判断一个大数是不是某个数的倍数,就是平常数学的运算方式
    int tem = 0;
    for (int i=0; s[i]!='\0'; i++){
        tem = (tem * 10 + (s[i] - '0'));
        tem%=k;
    }
    if (tem == 0){
        return 1;
    }else{
        return 0;
    }
}
int main(){
    scanf("%s", s);
    int k = 0;
    for (int i=1; i<=4; i++){
        int x;
        if (i == 1)  x = 3;
        else if (i == 2)  x = 5;
        else if (i == 3)  x = 8;
        else if (i == 4)  x = 11;
        if (isok(x))  a[++k] = x;
    }

    if (k == 0)  puts("No");
    else {
        puts("Yes");
        for (int i=1; i<k; i++)  printf("%d ", a[i]);
        printf("%d\n", a[k]);
    }
    return 0;
}

C题

题目链接:
https://ac.nowcoder.com/acm/contest/280/C
先用gcd求出最大公约数，然后求出最大公约数的所有约数即可
但最大公约数也很大，就遍历到sqrt(gcd),然后把i和gcd/i都放到vector里
最后把vector排序，因为是一个容器，要用sort(.begin(),.end())

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cmath>
#define ll long long
using namespace std;

ll gcd(ll a,ll b){
    if(a<b)swap(a,b);

    return b==0?a:gcd(b,a%b);
}
int main(){
    ll a,b;
    while(scanf("%lld%lld",&a,&b)!=EOF){
        vector<ll>allgcd;
        ll maxgcd=gcd(a,b);

        for(ll i=1;i<=sqrt(maxgcd);i++){
            if(maxgcd%i==0){
                allgcd.push_back(i);
                if(maxgcd/i!=i){
                    allgcd.push_back(maxgcd/i);
                }
            }
        }
        sort(allgcd.begin(),allgcd.end());
        printf("%lld",allgcd[0]);
        for(ll i=1;i<allgcd.size();i++){
            printf(" %lld",allgcd[i]);
        }
        putchar('\n');

    }
    return 0;
}

D题

但因为数据太大，超内存了，邻接矩阵超内存了
题目链接:
https://ac.nowcoder.com/acm/contest/280/D
dijkstra优先队列

#include<bits/stdc++.h>
using namespace std;
const int inf=1000000002;
const int maxn=100100,maxm=200200;
int head[maxm],vis[maxn],dis[maxn];
int i,j;
int u,v,w,z;
int n,m,s,t;
int cnt=1;
struct edge
{
    int to;
    int nx;
    int w;
}e[maxm];
inline void add(int u,int v,int w)
{
    e[cnt].to=v;
    e[cnt].w=w;
    e[cnt].nx=head[u];
    head[u]=cnt;
    cnt++;
}
struct node
{
    int dis;
    int pos;
    bool operator < (const node &x)const
    {
        return x.dis<dis;
    }
} ;
std::priority_queue<node> q;
inline void dijkstra()
{
    q.push((node){0,s});
    while(!q.empty())
    {
        node tmp=q.top();
        q.pop();
        int x=tmp.pos,d=tmp.dis;
        if(vis[x])
            continue;
        vis[x]=1;
        for(i=head[x];i;i=e[i].nx)
        {
            int y=e[i].to;
            if(dis[y]>dis[x]+e[i].w)
              {
                dis[y]=dis[x]+e[i].w;
                q.push((node){dis[y],y});
              }
        }

    }
}
int main()
{
    scanf("%d%d%d%d",&n,&m,&s,&t);
    for(i=1;i<=n;i++)
        dis[i]=inf;
    dis[s]=0;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d%d",&z,&u,&v,&w);
        if(z==1)
        {
            add(u,v,w);
            add(v,u,w);
        }
    }
    dijkstra();
    if(dis[t]!=inf)printf("%d",dis[t]);
    else printf("My gold");
}

转载于:https://www.cnblogs.com/Emcikem/p/11354198.html