计算机复试题目（附答案）

题目一：

 

Problem Description

The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times the value of that product back! What is more, the shop also offers some bonus product for free. However, if you apply a coupon with a positive N to this bonus product, you will have to pay the shop N times the value of the bonus product... but hey, magically, they have some coupons with negative N's!
For example, given a set of coupons {1 2 4 -1}, and a set of product values {7 6 -2 -3} (in Mars dollars M$) where a negative value corresponds to a bonus product. You can apply coupon 3 (with N being 4) to product 1 (with value M$7) to get M$28 back; coupon 2 to product 2 to get M$12 back; and coupon 4 to product 4 to get M$3 back. On the other hand, if you apply coupon 3 to product 4, you will have to pay M$12 to the shop.
Each coupon and each product may be selected at most once. Your task is to get as much money back as possible.

 

Input

Your program must read test cases from standard input.
The input file consists of several test cases. For each case, the first line contains the number of coupons NC, followed by a line with NC coupon integers. Then the next line contains the number of products NP, followed by a line with NP product values. Here 1<= NC, NP <= 10^6, and it is guaranteed that all the numbers will not exceed 10^7.
The input is finished by a negative NC.

 

Output

For each test case, your program must output to standard output. Simply print in a line the maximum amount of money you can get back.

 

Sample Input

  
  

   
   4 1 2 4 -1 4 7 6 -2 -3 4 3 2 6 1 3 2 6 3 -1
  
  

 

Sample Output

  
  

   
   43 49
  
  

 

Source

**计算机研究生复试上机考试-2011年

 

[cpp] view plain copy print ?

1. #include "iostream"   
2. #include "stdio.h"   
3. #include "math.h"   
4. #include "vector"   
5. #include "queue"   
6. #include "memory.h"   
7. #include "algorithm"   
8. #include "string"   
9. using namespace std;  
10. #define N 1000005   
11. __int64 a1[N];  
12. __int64 a2[N];  
13.   
14. int main()  
15. {  
16.     int n1,n2,i,j;  
17.     while(scanf("%d",&n1)!=EOF&&n1>=0)  
18.     {  
19.         for(i=0;i<n1;i++)  
20.             scanf("%I64d",&a1[i]);  
21.         scanf("%d",&n2);  
22.         for(i=0;i<n2;i++)  
23.             scanf("%I64d",&a2[i]);  
24.         sort(a1,a1+n1);//或者降序可以用sort(a1,a1+n1,greater<int>())   
25.         sort(a2,a2+n2);  
26.         i=0;  
27.         __int64 sum=0;  
28.         while(a1[i]<0&&a2[i]<0&&i<n1&&i<n2)  
29.             sum+=a1[i]*a2[i++];  
30.         i=n1-1,j=n2-1;  
31.         while(a1[i]>0&&a2[j]>0&&i>=0&&j>=0)  
32.             sum+=a1[i--]*a2[j--];  
33.         printf("%I64d\n",sum);  
34.     }  
35. }  

题目二：

Is It Symmetric

Problem Description

It is easy to see that a string of digits like 1234321 is symmetric with 4 being the central digit. However it is less obvious if we consider the string as a circular one and shift it to the left as 2343211. Your task is to write a program to check if a circular string is symmetric.

 

Input

Your program must read test cases from standard input.
The input file consists of several test cases. Each case occupies a line which contains the string. Each string contains less than 100 digits.
The input is finished by a "#".

 

Output

For each test case, your program must output to standard output. If the string is not symmetric, output "NO" in a line; else output "YES", followed by a space and the position of the center (the position index starts from 0). It is guaranteed that the length of the string is an odd number and the center is unique.

 

Sample Input

   
   

    
    2112343 798 #
   
   

 

Sample Output

   
   

    
    YES 5 NO
   
   

 

Source

** 计算机研究生by复试上机考试-2011年

[cpp] view plain copy print ?

1. #include "iostream"   
2. #include "stdio.h"   
3. #include "math.h"   
4. #include "vector"   
5. #include "queue"   
6. #include "memory.h"   
7. #include "algorithm"   
8. #include "string"   
9. using namespace std;  
10. #define N 105   
11. char str[N];  
12.   
13. int Div(int s,int t)  
14. {  
15.     int center=-2;  
16.     if(s==t)  
17.        center=-1;  
18.     bool flag=(t-s+1)%2;  
19.     while(t>s&&str[s]==str[t])  
20.         s++,t--;  
21.     if(s>t&&!flag)//even  
22.         center=-1;  
23.     else if(s==t&&flag)//odd  
24.         center=s;  
25.     return center;  
26. }  
27.   
28. int main()  
29. {  
30.     int center1,center2,center;  
31.     while(cin>>str&&strcmp(str,"#")!=0)  
32.     {  
33.         int len=strlen(str);  
34.         bool flag=false;  
35.         for(int i=0;i<len;i++)  
36.         {  
37.             center1=Div(0,i);  
38.             center2=Div(i+1,len-1);  
39.             if(center1!=-2&&center2!=-2)  
40.             {  
41.                 center=center1==-1?center2:center1;  
42.                 cout<<"YES "<<center<<endl;  
43.                 flag=true;  
44.                 break;  
45.             }  
46.         }  
47.         if(!flag)  
48.             printf("NO\n");  
49.     }  
50. }  

题目三：

Twin Prime Conjecture

Problem Description

If we define dn as: dn = p(n+1)-p(n), where pi is the i-th prime. It is easy to see that d1 = 1 and dn=even for n>1. Twin Prime Conjecture states that "There are infinite consecutive primes differing by 2".
Now given any positive integer N (< 10^5), you are supposed to count the number of twin primes which are no greater than N.

 

Input

Your program must read test cases from standard input.
The input file consists of several test cases. Each case occupies a line which contains one integer N. The input is finished by a negative N.

 

Output

For each test case, your program must output to standard output. Print in one line the number of twin primes which are no greater than N.

 

Sample Input

   
   

    
    1 5 20 -2
   
   

 

Sample Output

   
   

    
    0 1 4
   
   

 

Source

** 计算机研究生复试上机考试-2011年

 

关键在求prime时的效率，类似找朋友那道题的做法，把x的倍数标记为非素数即可。

[cpp] view plain copy print ?

1. #include "iostream"   
2. #include "stdio.h"   
3. #include "math.h"   
4. #include "vector"   
5. #include "queue"   
6. #include "memory.h"   
7. #include "algorithm"   
8. #include "string"   
9. using namespace std;  
10. #define N 100000   
11. bool prime[N+10];  
12. int twinp[N+10];  
13.   
14. int main()  
15. {  
16.     memset(prime,true,sizeof(prime));  
17.     prime[0]=prime[1]=false;  
18.     int i,j,n;  
19.     //initial prime array   
20.     for(i=2;i<=(int)sqrt(1.0*N);i++)  
21.     {  
22.         for(j=2;i*j<=N;j++)  
23.             prime[i*j]=false;  
24.     }  
25.     //calculate twin prime conjecture array   
26.     twinp[0]=twinp[1]=twinp[2]=twinp[3]=twinp[4]=0;  
27.       
28.     for(i=5;i<=N;i++)  
29.         if(prime[i]&&prime[i-2])  
30.             twinp[i]=twinp[i-1]+1;  
31.         else twinp[i]=twinp[i-1];  
32.       
33.     while(cin>>n&&n>=0)  
34.         printf("%d\n",twinp[n]);  
35. }