HackerRank 热身赛代码(一)
所有的题目都简单,就不写注释了
Utopian Tree
思路 一个简单的数列,找到通项公式就搞定
难度Easy
#include<stdio.h>
#include<math.h>
int height(int cycles)
{
if (cycles == 0)
return 1;
if (cycles % 2 == 1)
return pow(2.0, (cycles+3) / 2) - 2;
else
return pow(2.0, (cycles + 2) / 2) - 1;
}
int main()
{
int times,cycles[20];
scanf("%d", ×);
for (int i = 0; i < times;i++)
{
scanf("%d",&cycles[i]);
}
for (int i = 0; i < times; i++)
{
printf("%d\n",height(cycles[i]));
}
return 0;
}
Maximizing XOR
思路 遍历加异或运算即可
难度Easy
#include<stdio.h>
#include<math.h>
int main()
{
int a, b,i,j;
int max=0;
scanf("%d", &a);
scanf("%d", &b);
for (i = a; i <= b; i++)
for (j = i; j <= b; j++)
{
if ((i^j) >max)
max = i^j;
}
printf("%d\n",max);
return 0;
}
Service Lane
思路:在给定数组的范围内找到最小值,循环即可
难度:Easy
#include<stdio.h>
#include<stdlib.h>
int range[1000][2] ;
int arr[100000];
int min(int a,int b)
{
int i=a,min=3;
while (i <= b)
{
if (arr[i] == 3)
{
i++;
continue;
}
if (arr[i] == 1)
return 1;
if (arr[i] == 2)
min = 2;
i++;
}
return min;
}
int main()
{
int length, testcase;
scanf("%d%d",&length,&testcase);
for (int i = 0; i < length; i++)
{
scanf("%d",&arr[i]);
}
for (int i = 0; i < testcase; i++)
{
scanf("%d%d",&range[i][1],&range[i][2]);
}
for (int i = 0; i < testcase; i++)
{
printf("%d