暑假第六次周赛--阿福场

比赛传送门

A.弗朗明哥舞步

19260817是素数这是常识(逃。 1926081719260817=19260817*100 000 001 。另外数数就是了。

B.龙卷风摧毁停车场

C.超行星燃烧

D.乌鸦坐飞机

原题poj 3270(出题人没有好的idea 所以在原题上加了欧拉而已。题解

在题解的基础上加欧拉。

E.老鼠偷奶酪

D题代码如下：

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e3+10;
const int maxx=1e5+100;
const double EPS=1e-7;
const int mod=10000007;
#define mod(x) ((x)%MOD);
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
inline LL Scan()
{
    int f=1;char C=getchar();LL x=0;
    while (C<'0'||C>'9'){if (C=='-')f=-f;C=getchar();}
    while (C>='0'&&C<='9'){x=x*10+C-'0';C=getchar();}
    x*=f;return x;
}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.out" , "w" , stdout );
//cerr << "run time is " << clock() << endl;
struct node
{
    int id,num;
}Q[maxx];
int vis[maxx],n,minc;
bool cmp(node a,node b)
{
    return a.num<b.num;
}
void oula(int x)
{
    int ans=x;
    if(x%2==0)
    {
            while(x%2==0) x/=2;
            ans=ans/2;
    }
    for(LL i=3;i*i<=x;i+=2)
    {
        if(x%i==0)
        {
            while(x%i==0) x/=i;
            ans=ans/i*(i-1);
        }
    }
    if(x>1) ans=ans/x*(x-1);
    cout<<ans<<endl;
}
void solve()
{
    me(vis,0);
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            vis[i]=1;
            int l=Q[i].id;
            int sum=Q[i].num;
            int m=Q[i].num,cnt=1;
            while(l!=i)
            {
                vis[l]=1;
                cnt++;
                sum+=Q[l].num;
                m=min(m,Q[l].num);
                l=Q[l].id;
            }
            ans=ans+min(sum+(cnt-2)*m,sum+m+(cnt+1)*minc);
        }
    }
    oula(ans);
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        minc=INF;
        for(int i=1;i<=n;i++)
        {
            Q[i].id=i;Q[i].num=Scan();
            minc=min(minc,Q[i].num);
        }
        sort(Q+1,Q+n+1,cmp);
        solve();
    }
}

本次出题人fold,AnXdada,twh233，若有疑问请加Q群588053356