Google Code Jam 2010 Qualification Round 2012 Problem B && C
来源:互联网 发布:怪物猎人p2g武器数据 编辑:程序博客网 时间:2024/06/04 18:22
B题
当p=0时所有的总分都在sum1++,
当p=1时,总分>=1时在sum1++,总分==0,是无论如何都满足不了题意(坑点);
总分>=29时是没有surprising情况的,无论p取何值都在sum1++;
#include<cstdio>#include<cstring>using namespace std;int main(){int n,i,j,T,t,s,p,a;char ch;freopen( "B-large.in", "r", stdin );freopen( "output1.out", "w", stdout );scanf("%d",&T);for(t=1;t<=T;t++){printf("Case #%d: ",t);int sum1=0,sum2=0,sum=0;scanf("%d %d %d",&n,&s,&p);for(i=1;i<=n;i++){scanf("%d",&a);if(a>=p*3-2)sum1++;else if(a==0 && p==1);else if(a>=p*3-4)sum2++;}if(sum2>s)printf("%d\n",s+sum1);elseprintf("%d\n",sum1+sum2);}}
C题
这个题有个易错点。就是1212这种自身带循环节的情况。
易分析如果一个数移位后得到自身,那么此数一定有循环节。
#include<cstdio>#include<cstring>#include<math.h>using namespace std;int main(){int i,j,T,t,a,b,n,p;char ch;freopen("C-large.in","r",stdin);freopen("output1.out","w",stdout);scanf("%d",&T);for(t=1;t<=T;t++){printf("Case #%d: ",t);scanf("%d %d",&a,&b);if(a<10)printf("0\n");else{int n=(int)log10((double)b)+1;int con=(int )pow((double)10,(double)n);int sum=0;for(i=a;i<=b;i++){int tem1,tem2=a;p=10;while(1){tem1=i%p;tem2=i/p;if(tem1*(con/p)+tem2==i) //////break;if(tem1*(con/p)+tem2>i && tem1*(con/p)+tem2<=b)sum++;p*=10;}}printf("%d\n",sum);}}}
- Google Code Jam 2010 Qualification Round 2012 Problem B && C
- Google Code Jam 2014-Qualification Round-Problem C. Minesweeper Master
- Google Code Jam 2015 Qualification Round: Problem C. Dijkstra
- Google Code Jam 2012 Qualification Round
- Google Code Jam Qualification Round 2012
- Google Code Jam Qualification Round 2014 Problem B. Cookie Clicker Alpha 题解
- Google Code Jam 2014 Qualification Round:Problem B. Cookie Clicker Alpha
- Google Code Jam 2015 Qualification Round: Problem B. Infinite House of Pancakes
- Google Code Jam Qualification Round 2015 Problem B. Infinite House of Pancakes
- Google Code Jam 2014 Qualification Round:Problem A. Magic Trick
- Google Code Jam 2015 Qualification Round: Problem A. Standing Ovation
- Google Code jam Qualification Round 2015 --- Problem A. Standing Ovation
- Code Jam 2017 Qualification Round Problem B. Tidy Numbers
- Google Code Jam 2014 Qualification Round 2014 A B D
- google code jam 2011 Qualification Round 资格赛 Problem C. Candy Splitting
- Code Jam 2017 Qualification Round Problem C. Bathroom Stalls
- Google Code Jam 2010 Qualification Round 资格赛 Problem A. Snapper Chain 问题A.按扣链条
- Google Code Jam 2012 Qualification Round. Problem D. Hall of Mirrors
- Linux Platform Device and Driver
- 我对C++11内存模型的一点理解(附面经)
- 关于 XtratuM 的中断接管过程
- JavaScript打开链接
- WMI004-WMI学习笔记(四)——Managing Applications Using WMI(使用WMI管理应用程序)
- Google Code Jam 2010 Qualification Round 2012 Problem B && C
- api 游戏
- MFC剪切板使用
- jqGrid与Struts2的结合应用(一) —— 显示基本Grid表格
- eclipse快捷键使用及设置
- poj 2010 二叉堆
- [原创+翻译]《算法导论(第二版)》习题22.1-6:图的通用汇点(Universal Sink)
- 在ubuntu下安装jdk
- 记录一个粗心所导致的bug