第一次月賽1—11題
阿新 • • 發佈：2019-01-30
1001:對於一個排序好的序列再次排序，很簡單，在設定一個編號，然後改變編號的值，再次按編號的值排序就可以了。
1002：根據題意，我們可以很清楚的的把n*(n+1)/2天的獲得的硬幣算出來。接下來要做的，就是到這些區間裡面去找就可以了。#include <iostream> #include <string> #include <algorithm> #define N 30 using namespace std; struct node { int num; string s; }a[N]; int cmp(node x,node y) {return x.num<y.num;} int main () { //freopen("order.in","r",stdin); //freopen("order.out","w",stdout); int n,i,j,k,t=0; while(cin>>n,n) { getchar(); for(k=1,i=1,j=0;i<=n;i++) { cin>>a[i].s; if(i%2==1) {a[i].num=k;k++;} else {a[i].num=n-j;j++;} } sort(a+1,a+n+1,cmp); cout<<"SET "<<++t<<endl; for(i=1;i<=n;i++) cout<<a[i].s<<endl; } return 0; }
1003：很顯然是一個簡單的動態規劃題，dp【i】=min（dp【i-1】+t【i】，dp【i-2】+T[i]）。#include <iostream> #define N 11001 #define M 146 using namespace std; int a[M],b[N]; void init() { int s=0,i; for(a[0]=1,b[0]=1,i=1;i<M;i++) { s+=i;a[i]=s; b[s]=b[s-i]+i*(a[i]-a[i-1]); } } int main () { //freopen("coins.in","r",stdin); //freopen("coins.out","w",stdout); int n,k; init(); while(cin>>n,n) { for(int i=1;i<M;i++) if(a[i]>=n) {k=i;break;} cout<<n<<' '<<k*(n-a[k-1])+b[a[k-1]]<<endl; } return 0; }
1004：思路首先打印出素數，然後暴力查詢，由於資料海量，要注意查詢的效率，o（n^3）會超時！#include <iostream> #include <cstdio> #define N 1000 using namespace std; int min(int x,int y) {return x<y?x:y;} int main () { //freopen("3.in","r",stdin); //freopen("3.out","w",stdout); int i,j,n,m,t[N],T[N],dp[N],s; for(cin>>m,i=0;i<m;i++) { cin>>n; memset(dp,0,sizeof(dp)); for(j=1;j<=n;j++) cin>>t[j]; for(j=2;j<=n;j++) cin>>T[j]; dp[1]=t[1]; for(cin>>s,j=2;j<=n;j++) dp[j]=min(dp[j-1]+t[j],dp[j-2]+T[j]); if(dp[n]>s) cout<<"Hi,buddy please quickly!"<<endl; else cout<<"Hi,buddy good job!"<<endl; } return 0; }
#include <iostream>
#define N 10010
using namespace std;
int p[N];bool f[N];
void prime()
{
int i,j,k=0;
f[1]=1;
for(i=2;i<N;i++)
{
if(!f[i]) p[k++]=i;
for(j=2;j*i<N;j++)
f[i*j]=1;
}
}
int main ()
{
//freopen("C.in","r",stdin);
//freopen("C.out","w",stdout);
ios::sync_with_stdio(false);
int n,s,i,j,m,t;
prime();
while(cin>>n,n)
{
for(s=i=0;i<=n;i++)
if(n<=p[i]) {m=i;break;}
for(i=0;i<=m;i++)
{
for(t=0,j=i;j<=m && t<n;j++)
t+=p[j];
if(t==n) s++;
}
cout<<s<<endl;
}
return 0;
}import java.util.*;
import java.math.*;
import java.io.*;
public class Main
{
public static void main(String arg[])
{
int i,f1,f2;
Scanner cin=new Scanner(System.in);
BigInteger a[]=new BigInteger[1005];
BigInteger c,d;
a[0]=new BigInteger("1");
a[1]=new BigInteger("1");
a[2]=new BigInteger("2");
for(i=3;i<1005;i++) a[i]=a[i-1].add(a[i-2]);
while(cin.hasNext())
{
f1=0;f2=0;
c=d=new BigInteger("0");
c=cin.nextBigInteger();
d=cin.nextBigInteger();
if(c.equals(BigInteger.ZERO) && d.equals(BigInteger.ZERO)) break;
for(i=1;i<1005;i++)
{
if(a[i].compareTo(c)>=0 && f1==0)f1=i;
if(a[i].compareTo(d)>0 && f2==0) f2=i;
if(f1>0 && f2>0 ){f2=f2-f1;break;}
}
System.out.println(f2);
}
}
}
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
struct node
{
int f;
string s1;
node *next[26];
node() {
f=0;s1="";
for(int i=0;i<26;i++) next[i]=NULL;
}
}*R;
void insert(string t2,string t1)
{
node *r=R;
for(int i=0;t1[i]!='\0';i++)
{
if(!(r->next[t1[i]-'a'])) r->next[t1[i]-'a']=new node();
r=r->next[t1[i]-'a'];
}
r->f=1;r->s1=t2;
}
void search(string s)
{
node *r=R;
for(int i=0;s[i]!='\0';i++)
{
if(!(r->next[s[i]-'a'])) break;
r=r->next[s[i]-'a'];
}
if(r->f==1) cout<<r->s1<<endl;
else cout<<"eh"<<endl;
}
int main ()
{
//freopen("C.in","r",stdin);
//freopen("C.out","w",stdout);
ios::sync_with_stdio(false);
string s,t1,t2;int i,j;
R=new node();
while(getline(cin,s))
{
if(s=="")break;
s+=' '; t1=t2="";
for(i=0;s[i]!=' ';i++) t1+=s[i];
for(j=i+1;s[j]!=' ';j++) t2+=s[j];
insert(t1,t2);
}
while(cin>>s)
{
search(s);
}
return 0;
}
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main()
{
//freopen("C.in","r",stdin);
//freopen("C.out","w",stdout);
int n,k,i,num;
string c;
//ios::sync_with_stdio(false);
while(cin>>n>>k)
{
priority_queue<int,vector<int>,greater<int> >que;
getchar();
for(i=0;i<n;i++)
{
cin>>c;
if(c[0]=='I')
{
cin>>num;
que.push(num);
if(que.size()>k) que.pop();
}
else cout<<que.top()<<endl;
}
}
return 0;
}#include <iostream>
using namespace std;
int a,b,l,r;
void doing()
{
while(1)
{
int w;
if(a==0 || b==0 || a==b ) break;
if(a>b)
{
w=a/b;l+=w;a-=w*b;
if(b==1) l--;
}
else if(b>a)
{
w=b/a;r+=w;b-=w*a;
if(a==1) r--;
}
}
}
int main ()
{
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
int t,k=0,f=0;
scanf("%d",&t);
while(t--)
{
r=l=0;
scanf("%d%d",&a,&b);
doing();
if(f) puts("");
printf("Scenario #%d:\n%d %d\n",++k,l,r);
f++;
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <math.h>
#define N 10000
using namespace std;
bool f[N];int x,y,flag[N];
struct node {
int val,s;
}p,q;
int POW(int k)
{
int s=1,i;
for(i=0;i<k;i++) s*=10;
return s;
}
bool check(int a)
{
for(int i=2;i<=sqrt(a*1.0);i++)
if(a%i==0) return 1;
return 0;
}
void prime()
{
memset(f,0,sizeof(f));
for(int i=1000;i<N;i++)
f[i]=check(i);
}
int deal(int j,int k,int value)
{
int i,str[4],res=0;
for(i=0;i<4;i++)
{
str[i]=value/POW(4-i-1);
value%=POW(4-i-1);
}
str[j]=k;
for(i=0;i<4;i++)
res+=str[i]*POW(4-i-1);
return res;
}
void bfs()
{
int i,j;
queue<node> que;
q.val=x;q.s=0;flag[x]=1;
que.push(q);
while(!que.empty())
{
p=que.front();que.pop();
for(i=0;i<4;i++)
{
for(j=0;j<10;j++)
{
if(j==0 && i==0) continue;
int temp=deal(i,j,p.val);
if(f[temp] || flag[temp]) continue;
if(temp==y) {cout<<p.s+1<<endl;return;}
q.s=p.s+1;q.val=temp;que.push(q);
flag[temp]=1;
}
}
}
cout<<"Impossible"<<endl;
}
int main ()
{
//freopen("C.in","r",stdin);
//freopen("C.out","w",stdout);
int t;
prime();
cin>>t;
while(t--)
{
cin>>x>>y;
memset(flag,0,sizeof(flag));
if(x==y) {cout<<0<<endl;continue;}
bfs();
}
return 0;
}#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#define N 50
using namespace std;
map<string,int> Map;
double a[N][N];
int main ()
{
//freopen("arbitrage.in","r",stdin);
//freopen("arbitrage.out","w",stdout);
double r;
int n,m,i,j,k,f,cases=0;
string s1,s2;
while(cin>>n,n)
{
cout<<"Case "<<++cases<<": ";
memset(a,0,sizeof(a));
for(i=0;i<n;i++) a[i][i]=1;
for(i=0;i<n;i++){cin>>s1;Map[s1]=i;}
for(cin>>m,i=0;i<m;i++)
{
cin>>s1>>r>>s2;
a[Map[s1]][Map[s2]]=r;
}
for(i=0;i<n;i++) {
for(j=0;j<n;j++) {
for(k=0;k<n;k++)
if(a[j][k]<a[j][i]*a[i][k])
a[j][k]=a[j][i]*a[i][k];
}
}
for(f=0,i=0;i<n;i++)
if(a[i][i]>1) f=1;
if(f) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
double a[3][2],t[3],d,s,r,m,c;
const double p=3.141592653589793;
double distance(double x,double y,double x1,double y1)
{
return sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1));
}
int main ()
{
//freopen("C.in","r",stdin);
//freopen("C.out","w",stdout);
while(~scanf("%lf%lf%lf%lf%lf%lf",&a[0][0],&a[0][1],&a[1][0],&a[1][1],&a[2][0],&a[2][1]))
{
d=s=r=0;m=1;
t[0]=distance(a[0][0],a[0][1],a[1][0],a[1][1]);
t[1]=distance(a[1][0],a[1][1],a[2][0],a[2][1]);
t[2]=distance(a[0][0],a[0][1],a[2][0],a[2][1]);
for(int i=0;i<3;i++) {d+=t[i];m*=t[i];}
d/=2.0;s=sqrt(d*(d-t[0])*(d-t[1])*(d-t[2]));
s*=4.0;c=2*m/s*p;
printf("%.2lf\n",c);
}
return 0;
}