{"id":107,"date":"2010-02-14T03:38:00","date_gmt":"2010-02-13T19:38:00","guid":{"rendered":"http:\/\/localhost\/?p=107"},"modified":"2010-02-14T03:38:00","modified_gmt":"2010-02-13T19:38:00","slug":"coci_2010-4-_3iks","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/wjmzbmr\/?p=107","title":{"rendered":"COCI 2010-4- 3:iks"},"content":{"rendered":"

\u5c31\u662f\u8bf4\u6709N\u4e2a\u6570\u3002\u3002\u7136\u540e\u6bcf\u6b21\u53ef\u4ee5\u628a\u4e00\u4e2a\u6570\u7684\u8d28\u56e0\u5b50\u6254\u7ed9\u53e6\u4e00\u4e2a\u6570\u3002\u3002\u8ba9\u6700\u7ec8\u5168\u4f53\u6570gcd\u5c3d\u91cf\u5927\u3002\u3002\u5e76\u6c42\u51fa\u6700\u5c0f\u6b65\u6570\u3002\u3002 \u5f88\u660e\u663e\u5206\u8d28\u56e0\u5b50\u8ba8\u8bba\u3002\u3002\u6bcf\u4e2a\u56e0\u5b50\u7b97\u51fa\u5e73\u5747\u62e5\u6709\u6b21\u6570\uff08round down\uff09\u3002\u3002\u7136\u540e\u5bf9\u6bcf\u4e2a\u4e0d\u591f\u7684\u5168\u90e8\u8865\u4e0a\u5c31\u53ef\u4ee5\u4e86\u3002\u3002 \u4f46\u62110\u5206\u3002\u3002\u4e3a\u4ec0\u4e48\u5462\uff1f\u6211\u5f88\u8ff7\u60d1\u3002\u3002\u540e\u6765\u53d1\u73b0\u6211\u5c11\u5199\u4e86\u4e00\u884c\u3002\u3002\u8be5\u6b7b\u7684\u6837\u4f8b\uff01
\u73b0\u5728\u76f4\u63a5A\u6389\u4e86\u3002\u3002\u3002555
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
const int maxn=100;
int n,minstep=0;
set<int> Prime;
int A[maxn];
void getPrime(int x)
{
if(x%2==0)    Prime.insert(2);
while(x%2==0) x\/=2;
int p=x;
for(int i=3;i*i<=p&&x!=1;i+=2)
while(x%i==0)
{
Prime.insert(i);
x\/=i;
}
if(x!=1) Prime.insert(x);
}
vector<int> Ps;
void init()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>A[i],getPrime(A[i]);
Ps=vector<int>(Prime.begin(),Prime.end());
}
int CalAPrime(int x)
{
static int con[maxn];
memset(con,0,sizeof(con));\/\/\u8fd9\u884c\u6ca1\u5199\u3002\u3002\u5168\u90e8\u7b97\u9519\u3002\u30020\u5206\u3002\u3002TMD
int sum=0;
memset(con,0,sizeof(0));
for(int i=0;i<n;i++)
{
int t=A[i];
while(t%x==0)
con[i]++,t\/=x,sum++;
}
int a=sum\/n;
for(int i=0;i<n;i++)
if(con[i]<a)
minstep+=a-con[i];
int res=1;for(int i=0;i<a;i++) res*=x;
return res;
}
int main()
{
\/\/freopen("in","r",stdin);
\/\/freopen("out","w",stdout);
init();ll ans=1;
for(int i=0;i<Ps.size();i++)
ans*=CalAPrime(Ps[i]);
cout<<ans<<" "<<minstep<<endl;
}<\/p>\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

\u5c31\u662f\u8bf4\u6709N\u4e2a\u6570\u3002\u3002\u7136\u540e\u6bcf\u6b21\u53ef\u4ee5\u628a\u4e00\u4e2a\u6570\u7684\u8d28\u56e0\u5b50\u6254\u7ed9\u53e6\u4e00\u4e2a\u6570\u3002\u3002\u8ba9\u6700\u7ec8\u5168\u4f53\u6570gcd\u5c3d\u91cf\u5927\u3002\u3002\u5e76\u6c42\u51fa\u6700\u5c0f\u6b65\u6570\u3002\u3002 \u5f88\u660e\u663e\u5206\u8d28\u56e0\u5b50\u8ba8\u8bba\u3002\u3002\u6bcf\u4e2a\u56e0\u5b50\u7b97\u51fa\u5e73\u5747\u62e5\u6709\u6b21\u6570\uff08round down\uff09\u3002\u3002\u7136\u540e\u5bf9\u6bcf\u4e2a\u4e0d\u591f\u7684\u5168\u90e8\u8865\u4e0a\u5c31\u53ef\u4ee5\u4e86\u3002\u3002 \u4f46\u62110\u5206\u3002\u3002\u4e3a\u4ec0\u4e48\u5462\uff1f\u6211\u5f88\u8ff7\u60d1\u3002\u3002\u540e\u6765\u53d1\u73b0\u6211\u5c11\u5199\u4e86\u4e00\u884c\u3002\u3002\u8be5\u6b7b\u7684\u6837\u4f8b\uff01\u73b0\u5728\u76f4\u63a5A\u6389\u4e86\u3002\u3002\u3002555#include<iostream>#include<string>#include<vector>#include<cmath>#include<cstdio>#include<cstring>#include<set>using namespace std;typedef long long ll;const int maxn=100;int n,minstep=0;set<int> Prime;int A[maxn];void getPrime(int x){if(x%2==0)    Prime.insert(2);while(x%2==0) x\/=2;int p=x;for(int i=3;i*i<=p&&x!=1;i+=2)while(x%i==0){Prime.insert(i);x\/=i;}if(x!=1) Prime.insert(x);}vector<int> Ps;void init(){cin>>n;for(int i=0;i<n;i++)cin>>A[i],getPrime(A[i]);Ps=vector<int>(Prime.begin(),Prime.end());}int CalAPrime(int x){static int con[maxn];memset(con,0,sizeof(con));\/\/\u8fd9\u884c\u6ca1\u5199\u3002\u3002\u5168\u90e8\u7b97\u9519\u3002\u30020\u5206\u3002\u3002TMDint sum=0;memset(con,0,sizeof(0));for(int i=0;i<n;i++){int t=A[i];while(t%x==0)con[i]++,t\/=x,sum++;}int a=sum\/n;for(int i=0;i<n;i++)if(con[i]<a)minstep+=a-con[i];int res=1;for(int i=0;i<a;i++) res*=x;return res;}int main(){\/\/freopen("in","r",stdin);\/\/freopen("out","w",stdout);init();ll ans=1;for(int i=0;i<Ps.size();i++)ans*=CalAPrime(Ps[i]);cout<<ans<<" "<<minstep<<endl;}<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/107"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=107"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/107\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=107"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=107"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=107"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}