当前位置:   article > 正文

zoj 5道水题 2818 3323,3333,3479,3486_3323整除

3323整除

  1. #include<iostream>//2818
  2. #include <cstdio>
  3. #include <cmath>
  4. using namespace std;
  5. int main()
  6. {
  7. int B,N,A;
  8. int i,j,sum=1,temp;
  9. while(~scanf("%d%d",&B,&N))
  10. {
  11. if(B==0&&N==0) break;
  12. for(i=1;i<1000005;i++)
  13. {
  14. temp=sum;
  15. sum=1;
  16. for(j=0;j<N;j++)
  17. sum*=i;
  18. if(sum>=B)
  19. {
  20. if(fabs(B-temp)>=fabs(B-sum)) A=i;
  21. else A=i-1;
  22. break;
  23. }
  24. }
  25. cout<<A<<endl;
  26. }
  27. return 0;
  28. }


  1. #include<cstdio>//zoj3323 Somali Pirates
  2. #include <string.h>
  3. #include<string>
  4. #include<iostream>
  5. using namespace std;
  6. int main()
  7. {
  8. int n,len,i,j;
  9. char a[25],b[25];
  10. cin>>n;
  11. while(n--)
  12. {
  13. cin>>a;
  14. len=strlen(a);
  15. for(i=0,j=0;i<len;i++)
  16. {
  17. if(a[i]>='a'&&a[i]<='z'||a[i]>='A'&&a[i]<='Z')
  18. b[j++]=a[i];
  19. }
  20. b[j]='\0';
  21. cout<<b<<endl;
  22. }
  23. return 0;
  24. }
  25. #include <iostream>//zoj3333 Guess the Price
  26. #include <cstdio>
  27. #include <string>
  28. #include <cmath>
  29. using namespace std;
  30. int main ()
  31. {
  32. int T;
  33. cin>>T;
  34. while (T--)
  35. {
  36. int a,b,c;
  37. string d;
  38. cin>>a>>b>>c;
  39. if(fabs(a-b)>fabs(a-c)) d="B";
  40. else d="A";
  41. cout<<d<<endl;
  42. }
  43. return 0;
  44. }
  45. #include<cstdio>//zoj3479 Chinese Zodiac
  46. #include <iostream>
  47. #include <string.h>
  48. using namespace std;
  49. int main()
  50. {
  51. int N,year;
  52. cin>>N;
  53. char a[12][22]={"Rabbit", "Tiger","Ox","Rat", "Pig", "Dog", "Rooster", "Monkey", "Ram", "Horse", "Snake","Dragon"};
  54. while(N--)
  55. {
  56. cin>>year;
  57. if(year%12==0) cout<<a[11]<<endl;
  58. else
  59. cout<<a[year%12-1]<<endl;
  60. }
  61. }
  62. #include<iostream>//zoj 3486Judge Internal Error
  63. #include <string.h>
  64. #include <cstdio>
  65. using namespace std;
  66. int main()
  67. {
  68. int n,m,i,j,a[1005],b[10005],temp;
  69. cin>>n;
  70. while(n--)
  71. {
  72. cin>>m;
  73. memset(b,0,sizeof(b));
  74. for(i=0;i<m;i++)
  75. {
  76. cin>>a[i];
  77. b[a[i]]++;
  78. }
  79. for(i=0;i<m;i++)
  80. {
  81. for(j=i;j<m;j++)
  82. {
  83. if(b[a[i]]<b[a[j]])
  84. {
  85. temp=a[i];
  86. a[i]=a[j];
  87. a[j]=temp;
  88. }
  89. if(b[a[i]]==b[a[j]])
  90. {
  91. if(a[i]<a[j])
  92. {
  93. temp=a[i];
  94. a[i]=a[j];
  95. a[j]=temp;
  96. }
  97. }
  98. }
  99. }
  100. cout<<a[0]<<endl;
  101. }
  102. return 0;
  103. }



声明:本文内容由网友自发贡献,不代表【wpsshop博客】立场,版权归原作者所有,本站不承担相应法律责任。如您发现有侵权的内容,请联系我们。转载请注明出处:https://www.wpsshop.cn/w/weixin_40725706/article/detail/757277
推荐阅读
相关标签
  

闽ICP备14008679号