http://blog.csdn.net/queuelovestack/article/details/53055418

?

?

下午重現了一下大連賽區的比賽,感覺有點神奇,重現時居然改了現場賽的數據范圍,原本過的人數比較多的題結果重現過的變少了,而原本現場賽全場過的人最少的題重現做出的人反而多了一堆,不過還是不影響最水的6題,然而殘酷的現實是6題才有機會拿銅...(╥╯^╰╥)

鏈接→2016ACM/ICPC亞洲區大連站-重現賽

?

?Problem 1001 Wrestling Match

Accept: 0 ? ?Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is "good player”, the rest is "bad player”. Now, Xiao Ming is referee of the wrestling match and he has a list of the matches in his hand. At the same time, he knows some people are good players,some are bad players. He believes that every game is a battle between the good and the bad player. Now he wants to know whether all the people can be divided into "good player" and "bad player".?

?

?Input

Input contains multiple sets of data.For each set of data,there are four numbers in the first line:N (1 ≤ N≤ 1000)、M(1 ≤M ≤ 10000)、X,Y(X+Y≤N ),in order to show the number of players(numbered 1toN ),the number of matches,the number of known "good players" and the number of known "bad players".In the next M lines,Each line has two numbersa, b(a≠b) ,said there is a game between a and b .The next line has X different numbers.Each number is known as a "good player" number.The last line contains Y different numbers.Each number represents a known "bad player" number.Data guarantees there will not be a player number is a good player and also a bad player.

?

?Output

If all the people can be divided into "good players" and "bad players”, output "YES", otherwise output "NO".

?Sample Input

5 4 0 0
1 3
1 4
3 5
4 5
5 4 1 0
1 3
1 4
3 5
4 5
2

?Sample Output

NO
YES

?Problem Idea

?

解題思路:

【題意】

這個題目意思，感覺還是存疑的(￣へ￣)，我只能以本人過了此題的想法來解釋

N個選手，M場摔跤比賽，已知N個選手中有X個選手是"good player"，Y個選手是"bad player"

問是否可以將N個選手劃分成"good player"和"bad player"兩個陣營，使得每場摔跤比賽的兩位選手必定是一位來自"good player"，一位來自"bad player"

【類型】
搜索(bfs or dfs)
【分析】

有挺多人要求解釋樣例的，因為不太明白為啥不告訴2是哪一個陣營就無法劃分陣營了？明明(1,5)和(3,4)也不知道是哪一陣營

但是，我們可以這樣理解一下，即便我不知道(1,5)是屬于"good player"陣營還是屬于"bad player"陣營，他們只能屬于一種陣營

而2是沒有告訴你和其他選手的關系，那么2可以同屬于兩個陣營，顯然這與題目要求" there will not be a player number is a good player and also a bad player"不符

好了，接下來講做法，首先考慮已經告訴你是哪個陣營的選手A，那么和A選手比賽的選手B必定對立陣營的，若選手B和選手A是同一陣營，那顯然是無法繼續劃分的，bfs or dfs一下，將已知陣營的選手確定

然后開始處理未知陣營但有比賽的選手，我們完全可以假設其中一方為"good player"，那么另一方就是"bad player"，接著還是bfs or dfs判斷

處理完之后，再遍歷一遍每個選手，看是否還有未知陣營的選手存在即可

重現的時候被自己蠢哭了，(? _ ?)，因為每輸入一個已知陣營的選手，我都會去搜索判一次，然后遇到沖突就break了，導致題目還沒有完全輸入就被我結束了，于是WA了好幾發，心疼自己

【時間復雜度&&優化】
O(n)

題目鏈接→HDU 5971 Wrestling Match

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?1005;??
25. const?int?M?=?10005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. struct?edge??
29. {??
30. ????int?v,to;??
31. }e[2*M];??
32. struct?node??
33. {??
34. ????int?u,k;??
35. ????node(){}??
36. ????node(int?_u,int?_k):u(_u),k(_k){}??
37. };??
38. int?p,v[N],a[M],b[M],h[N];??
39. bool?flag;??
40. void?add_edge(int?u,int?v)??
41. {??
42. ????e[p].v=v;??
43. ????e[p].to=h[u];??
44. ????h[u]=p++;??
45. }??
46. void?bfs(int?u,int?k)??
47. {??
48. ????queue<node>?q;??
49. ????int?i;??
50. ????v[u]=k;??
51. ????q.push(node(u,k));??
52. ????while(!q.empty())??
53. ????{??
54. ????????u=q.front().u;??
55. ????????k=q.front().k;??
56. ????????q.pop();??
57. ????????for(i=h[u];i+1;i=e[i].to)??
58. ????????{??
59. ????????????if(v[e[i].v]==k)??
60. ????????????{??
61. ????????????????flag=false;??
62. ????????????????return?;??
63. ????????????}??
64. ????????????if(!v[e[i].v])??
65. ????????????{??
66. ????????????????v[e[i].v]=-k;??
67. ????????????????q.push(node(e[i].v,-k));??
68. ????????????}??
69. ????????}??
70. ????}??
71. }??
72. int?main()??
73. {??
74. ????int?n,m,x,y,s,i;??
75. ????while(~scanf("%d%d%d%d",&n,&m,&x,&y))??
76. ????{??
77. ????????p=0;??
78. ????????flag=true;??
79. ????????memset(v,0,sizeof(v));??
80. ????????memset(h,-1,sizeof(h));??
81. ????????for(i=0;i<m;i++)??
82. ????????{??
83. ????????????scanf("%d%d",&a[i],&b[i]);??
84. ????????????add_edge(a[i],b[i]);??
85. ????????????add_edge(b[i],a[i]);??
86. ????????}??
87. ????????for(i=0;i<x;i++)??
88. ????????{??
89. ????????????scanf("%d",&s);??
90. ????????????if(v[s]==-1)??
91. ????????????????flag=false;??
92. ????????????bfs(s,1);??
93. ????????}??
94. ????????for(i=0;i<y;i++)??
95. ????????{??
96. ????????????scanf("%d",&s);??
97. ????????????if(v[s]==1)??
98. ????????????????flag=false;??
99. ????????????bfs(s,-1);??
100. ????????}??
101. ????????for(i=0;i<m&&flag;i++)??
102. ????????????if(!v[a[i]]&&!v[b[i]])??
103. ????????????????bfs(a[i],1);??
104. ????????for(i=1;i<=n&&flag;i++)??
105. ????????????if(!v[i])??
106. ????????????{??
107. ????????????????flag=false;??
108. ????????????????break;??
109. ????????????}??
110. ????????if(flag)??
111. ????????????puts("YES");??
112. ????????else??
113. ????????????puts("NO");??
114. ????}??
115. ????return?0;??
116. }??

?

?

?Problem 1004 A Simple Math Problem

Accept: 0 ? ?Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

Given two positive integers a and b,find suitable X and Y to meet the conditions:?

?X+Y=a?

?Least Common Multiple (X, Y) =b

?

?Input

Input includes multiple sets of test data.Each test data occupies one line,including two positive integers a(1≤a≤2*10^4),b(1≤b≤10^9),and their meanings are shown in the description.Contains most of the 12W test cases.

?

?Output

For each set of input data,output a line of two integers,representing X, Y.If you cannot find such X and Y,output one line of "No Solution"(without quotation).

?Sample Input

6 8
798 10780

?Sample Output

No Solution
308 490

?Problem Idea

?

解題思路:

【題意】

給你兩個整數a和b

求X和Y，滿足X+Y=a，且LCM(X,Y)=b [LCM(X,Y)表示X和Y的最小公倍數]

若不存在，輸出"No Solution"

否則輸出X最小的解

【類型】
數學推導題
【分析】

現場賽的時候，咋看一眼感覺是水題啊，a的范圍才10^4，那我枚舉一下X和Y，然后判斷它們的最小公倍數是不是b不就完事了？

但看做的人并不多，又仔細看了下題，發現題目組數有點多，12萬，好吧，放棄暴力枚舉

首先，學過最小公倍數的我們知道，兩數之積等于兩數的最大公約數乘最小公倍數，用式子表示如下

X*Y=LCM(X,Y)*GCD(X,Y)

于是，我們不妨假設GCD(X,Y)=k，那么我們可以知道

假設X≥Y，則

這個方程組還是好解的

無解的情況有如下三種(滿足任意一種都是無解):

【時間復雜度&&優化】
O(1)

題目鏈接→HDU 5974 A Simple Math Problem

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?1005;??
25. const?int?M?=?10005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. __int64?gcd(__int64?a,__int64?b)??
29. {??
30. ????if(a%b)??
31. ????????return?gcd(b,a%b);??
32. ????return?b;??
33. }??
34. int?main()??
35. {??
36. ????__int64?a,b,k,d,X,Y,s;??
37. ????while(~scanf("%I64d%I64d",&a,&b))??
38. ????{??
39. ????????k=gcd(a,b);??
40. ????????d=a*a-4*k*b;??
41. ????????if(d<0)??
42. ????????{??
43. ????????????puts("No?Solution");??
44. ????????????continue;??
45. ????????}??
46. ????????s=(__int64)sqrt(1.0*d);??
47. ????????if(s*s!=d||(s+a)%2)??
48. ????????{??
49. ????????????puts("No?Solution");??
50. ????????????continue;??
51. ????????}??
52. ????????X=(s+a)/2;??
53. ????????Y=a-X;??
54. ????????if(X>Y)??
55. ????????????swap(X,Y);??
56. ????????printf("%I64d?%I64d\n",X,Y);??
57. ??
58. ????}??
59. ????return?0;??
60. }??

?

?

?Problem 1006 Detachment

Accept: 0 ? ?Submit: 0
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

In a highly developed alien society, the habitats are almost infinite dimensional space.

In the history of this planet,there is an old puzzle.

You have a line segment with x units’ length representing one dimension.The line segment can be split into a number of small line segments: a1,a2, … (x= a1+a2+…) assigned to different dimensions. And then, the multidimensional space has been established. Now there are two requirements for this space:?

1．Two different small line segments cannot be equal ( ai≠aj when i≠j).

2．Make this multidimensional space size s as large as possible (s= a1?a2*...).Note that it allows to keep one dimension.That's to say, the number of ai can be only one.

Now can you solve this question and find the maximum size of the space?(For the final number is too large,your answer will be modulo 10^9+7)

?

?Input

The first line is an integer T,meaning the number of test cases.

Then T lines follow. Each line contains one integer x.

1≤T≤10^6, 1≤x≤10^9

?

?Output

Maximum s you can get modulo 10^9+7. Note that we wants to be greatest product before modulo 10^9+7.

?Sample Input

1
4

?Sample Output

4

?Problem Idea

?

解題思路:

【題意】

給定一個自然數x，讓你給出一種拆分方式x=a1+a2+...(ai≠aj)，使得每個小部分的乘積s=a1*a2*...最大

【類型】
貪心構造
【分析】

此題關鍵在于得出如何能使乘積s最大

按照以往經驗，必然是取一段連續自然數能夠使得乘積最大，而這段連續自然數可從2開始(為啥不從1開始?從1開始還不如將這個1給這段連續自然數的最后一個數)，于是我們可以得到形如2+3+4+...+k(k=2,3,...)的式子，而x是10^9內的任意整數，我們不可能恰好能夠湊成連續自然數之和，可能會多出△x

而這個△x的值，我可以保證它的范圍為0≤△x≤k，相信大于等于0還是好理解的，為什么會小于等于k呢?因為當它大于k時，原式不是可以增加一項?即2+3+4+...+k+(k+1)

那么多出來的△x怎么處理呢?顯然是從后往前均攤給連續自然數中的(k-1)個數，為啥從后往前?因為若我們從前往后，總是會使連續自然數重復，不好處理

于是，在我們分配完△x之后，我們大致會得到下述兩種式子:

①2*3*...*(i-1)*(i+1)*...*k*(k+1)

②3*4*...*i*(i+1)*...*k*(k+2)

顯然，我們要計算此結果，可以借助階乘，而階乘中缺失的項，我們除掉就可以了，那么便會涉及除法取模，顯然需要用到乘法逆元

做法講解完畢，以下是為什么連續段乘積最大的大概證明:

【時間復雜度&&優化】
O(logn)

題目鏈接→HDU 5976 Detachment

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?45000;??
25. const?int?M?=?10005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. __int64?inv[N]={0,1};//逆元篩??
29. __int64?f[N]={1,1};//階乘??
30. int?main()??
31. {??
32. ????int?t,i,x,l,r,mid,k;??
33. ????__int64?ans;??
34. ????for(i=2;i<N;i++)??
35. ????{??
36. ????????inv[i]=inv[mod%i]*(mod-mod/i)%mod;??
37. ????????f[i]=(f[i-1]*i)%mod;??
38. ????}??
39. ????scanf("%d",&t);??
40. ????while(t--)??
41. ????{??
42. ????????scanf("%d",&x);??
43. ????????if(x<=1)??
44. ????????{??
45. ????????????printf("%d\n",x);??
46. ????????????continue;??
47. ????????}??
48. ????????l=k=2,r=N;??
49. ????????while(l<=r)??
50. ????????{??
51. ????????????mid=(l+r)/2;??
52. ????????????if((mid+2)*(mid-1)/2<=x)??
53. ????????????????l=mid+1,k=max(k,mid);??
54. ????????????else??
55. ????????????????r=mid-1;??
56. ????????}??
57. ????????//printf("%d\n",k);??
58. ????????x-=(k+2)*(k-1)/2;??
59. ????????if(x==k)//3*4*...*(k-1)*k*(k+2)??
60. ????????????ans=(f[k]*inv[2])%mod*(k+2)%mod;??
61. ????????else?if(x==0)??
62. ????????????ans=f[k];??
63. ????????else??
64. ????????????ans=(f[k+1]*inv[k-x+1])%mod;??
65. ????????printf("%I64d\n",ans);??
66. ????}??
67. ????return?0;??
68. }??

?

?

?Problem 1008 To begin or not to begin

Accept: 0 ? ?Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

A box contains black balls and a single red ball. Alice and Bob draw balls from this box without replacement, alternating after each draws until the red ball is drawn. The game is won by the player who happens to draw the single red ball. Bob is a gentleman and offers Alice the choice of whether she wants to start or not. Alice has a hunch that she might be better off if she starts; after all, she might succeed in the first draw. On the other hand, if her first draw yields a black ball, then Bob’s chances to draw the red ball in his first draw are increased, because then one black ball is already removed from the box. How should Alice decide in order to maximize her probability of winning? Help Alice with decision.

?

?Input

Multiple test cases (number of test cases≤50), process till end of input.

For each case, a positive integer k (1≤k≤10^5) is given on a single line.

?

?Output

For each case, output:

1, if the player who starts drawing has an advantage

2, if the player who starts drawing has a disadvantage

0, if Alice's and Bob's chances are equal, no matter who starts drawing

on a single line.

?Sample Input

1
2

?Sample Output

0
1

?Problem Idea

?

解題思路:

【題意】

箱子里有1個紅球和k個黑球

Alice和Bob輪流不放回地從箱子里隨機取出一個球

當某人取到紅球時獲得勝利，游戲結束

問先手是否獲勝幾率更大，幾率更大，輸出"1"；幾率更小，輸出"2"；幾率相等，輸出"0"

【類型】
概率水題
【分析】

此題關鍵還是要多嘗試，手動計算一下

當k=1時，一個紅球和一個黑球，先手獲勝的概率P為

當k=2時，一個紅球和兩個黑球，先手獲勝的概率P為

當k=3時，一個紅球和三個黑球，先手獲勝的概率P為

故，當k時，先手獲勝的概率P為

那我只需判斷兩者大小關系即可

【時間復雜度&&優化】
O(1)

題目鏈接→HDU 5978 To begin or not to begin

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?5005;??
25. const?int?M?=?100005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. const?int?MAXN?=?100005;??
29. int?main()??
30. {??
31. ????int?k,p;??
32. ????while(~scanf("%d",&k))??
33. ????{??
34. ????????p=k/2+1;??
35. ????????if(p>k+1-p)??
36. ????????????puts("1");??
37. ????????else?if(p<k+1-p)??
38. ????????????puts("2");??
39. ????????else??
40. ????????????puts("0");??
41. ????}??
42. ????return?0;??
43. }??

?

?

?Problem 1009 Convex

Accept: 0 ? ?Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

We have a special convex that all points have the same distance to origin point.
As you know we can get N segments after linking the origin point and the points on the convex. We can also get N angles between each pair of the neighbor segments.

Now give you the data about the angle, please calculate the area of the convex

?

?Input

There are multiple test cases.

The first line contains two integer N and D indicating the number of the points and their distance to origin. (3 <= N <= 10, 1 <= D <= 10)

The next lines contain N integers indicating the angles. The sum of the N numbers is always 360.

?

?Output

For each test case output one float numbers indicating the area of the convex. The printed values should have 3 digits after the decimal point.

?Sample Input

4 1
90 90 90 90
6 1
60 60 60 60 60 60

?Sample Output

2.000
2.598

?Problem Idea

?

解題思路:

【題意】

二維坐標中有N個點，它們到原點的距離均為D

將這N個點分別與原點相連，現在告訴你任意相鄰兩條線段的夾角為θi，求這N個點構成的凸包面積(N邊形面積)

【類型】
三角形面積水題
【分析】

題目大概樣子如下

由圖可知，n邊形的面積可以拆分成n個三角形面積之和

而已知每個三角形的兩邊及兩邊夾角，我們可以通過三角形面積公式算出每個三角形的面積，相加之和便是最終的n邊形面積

由于math.h頭文件中封裝的sin運算是以弧度制來計算的，而題目所給的是角度制，故我們還需多一步角度轉弧度

【時間復雜度&&優化】
O(1)

題目鏈接→HDU 5979 Convex

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?5005;??
25. const?int?M?=?100005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. const?int?MAXN?=?100005;??
29. int?main()??
30. {??
31. ????int?n,d,i,x;??
32. ????double?ans;??
33. ????while(~scanf("%d%d",&n,&d))??
34. ????{??
35. ????????ans=0;??
36. ????????for(i=0;i<n;i++)??
37. ????????{??
38. ????????????scanf("%d",&x);??
39. ????????????ans+=d*d*sin(PI*x/180)/2;??
40. ????????}??
41. ????????printf("%.3f\n",ans);??
42. ????}??
43. ????return?0;??
44. }??

?

?

?Problem 1010 Find Small A

Accept: 0 ? ?Submit: 0
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

?Problem Description

As is known to all,the ASCII of character 'a' is 97. Now,find out how many character 'a' in a group of given numbers. Please note that the numbers here are given by 32 bits’ integers in the computer.That means,1digit represents 4 characters(one character is represented by 8 bits’ binary digits).

?

?Input

The input contains a set of test data.The first number is one positive integer N (1≤N≤100),and then N positive integersai (1≤ ai≤2^32 - 1) follow

?

?Output

Output one line,including an integer representing the number of 'a' in the group of given numbers.

?Sample Input

3
97 24929 100

?Sample Output

3

?Problem Idea

?

解題思路:

【題意】

給你n個32位整數,每個整數可以表示成4個字符(因為一個字符在計算機中占8位)，問n個整數共包含多少個字符'a'

【類型】
簽到題
【分析】

由于一個字符占二進制8位，所以每個整數相當于轉化為2^8=256進制數

那么將32位整數循環對256取模，看是不是97(字符'a')即可

其中需要注意的一點是，2^32-1已經超過了int型的范圍，故須定義成 __int64 或 long long

int型的最大值為2^31-1

【時間復雜度&&優化】
O(1)

題目鏈接→HDU 5980 Find Small A

?Source Code

?

[cpp]?view plaincopy print?

1. /*Sherlock?and?Watson?and?Adler*/??
2. #pragma?comment(linker,?"/STACK:1024000000,1024000000")??
3. #include<stdio.h>??
4. #include<string.h>??
5. #include<stdlib.h>??
6. #include<queue>??
7. #include<stack>??
8. #include<math.h>??
9. #include<vector>??
10. #include<map>??
11. #include<set>??
12. #include<list>??
13. #include<bitset>??
14. #include<cmath>??
15. #include<complex>??
16. #include<string>??
17. #include<algorithm>??
18. #include<iostream>??
19. #define?eps?1e-9??
20. #define?LL?long?long??
21. #define?PI?acos(-1.0)??
22. #define?bitnum(a)?__builtin_popcount(a)??
23. using?namespace?std;??
24. const?int?N?=?5005;??
25. const?int?M?=?100005;??
26. const?int?inf?=?1000000007;??
27. const?int?mod?=?1000000007;??
28. const?int?MAXN?=?100005;??
29. int?main()??
30. {??
31. ????int?n,i,ans;??
32. ????__int64?a;??
33. ????while(~scanf("%d",&n))??
34. ????{??
35. ????????ans=0;??
36. ????????for(i=0;i<n;i++)??
37. ????????{??
38. ????????????scanf("%I64d",&a);??
39. ????????????while(a)??
40. ????????????{??
41. ????????????????if(a%256==97)??
42. ????????????????????ans++;??
43. ????????????????a/=256;??
44. ????????????}??
45. ????????}??
46. ????????printf("%d\n",ans);??
47. ????}??
48. ????return?0;??
49. }??

菜鳥成長記

轉載于:https://www.cnblogs.com/bofengyu/p/6796862.html

總結

以上是生活随笔為你收集整理的2016ACM/ICPC亚洲区大连站现场赛题解报告（转）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。