admin管理员组文章数量:1596345
问题 J: Eliminate zero AC
时间限制: 1 Sec 内存限制: 128 MB题目描述
Last night,Kid submitted a problem for many times but he got many WA,so he is sad.Out of
sympathy, his coach gave him a very simple problem so that Kid can solve it quickly. The problem
is to select as many numbers as possible range 1 to n so that among these selected number there
are no number can be divided exactly by other number. Can you solve it as quick as Kid?
输入
There are multiple cases.
For each case, there is a integer n(1<=n<=10^9)
输出
For each case,just output the answer.(the most numbers you can select)
样例输入
5
样例输出
3
提示
You can select {2,3,5} or {3,4,5}... but you can’t select {2,3,4,5} because 2|4.
So the answer is 3.
题解:有规律。详见代码。
1 #include <stdio.h> 2 3 int main() 4 { 5 #ifdef CDZSC_OFFLINE 6 freopen("in.txt", "r", stdin); 7 freopen("out.txt", "w", stdout); 8 #endif 9 int n; 10 while(~scanf("%d", &n)) 11 { 12 if(n % 2) 13 printf("%d\n", (n >> 1) + 1); 14 else 15 printf("%d\n", n >> 1); 16 } 17 return 0; 18 }View Code
转载于:https://wwwblogs/LiuACG/p/4264443.html
版权声明:本文标题:2015年NEUACM一月月赛 J: Eliminate zero AC 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://www.elefans.com/dongtai/1728255818a1150999.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论