蓝桥杯编程题

算法代码：

#include<stdio.h>//a+b问题
int main()
{
int a, b;
scanf_s("%d%d", &a, &b);
printf("%d", a + b);
return 0;
}
#include<stdio.h>//数列排序
#include<stdlib.h>
void Print(int *data, int n)
{
int i;
for (i = 0; i < n; i++)
{
printf("%d", data[i]);
}
printf("\n");
}
int Split(int*data, int pre, int rear)
{
int value = data[pre];
while (pre < rear)
{
while (data[rear] >= value&&pre < rear)
rear--;
while (data[pre] < value&&pre < rear)
pre++;
}
data[pre] = value;
return pre;
}
void QuickSort(int *data, int pre, int rear)
{
if (pre < rear)
{
int mid = Split(data, pre, rear);
QuickSort(data, pre, mid - 1);
QuickSort(data, mid+1,rear);


}
}
int main()
{
int i, n;
int *data;
scanf_s("%d", &n);
data = (int*)malloc(sizeof(int)*n);
for (i = 0; i < n; i++)
{
scanf_s("%d", &data[i]);
}
QuickSort(data, 0, n - 1);
Print(data, n);
return 0;
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
double sum = 0, x;
char a[8];
int len, i = 0;
gets_s(a);
len = strlen(a);
while (len)
{
if (a[len - 1] >= 'A'&&a[len - 1] <= 'F')
x = (a[len - 1] - '7')*pow(16, i++);
else
x = (a[len - 1] - '0')*pow(16, i++);
sum += x;
len--;
}
printf("%.Olf", sum);
return 0;
#include<stdio.h>
int main()
{
int a, b, c, d,i;
for (i = 1000; i <= 9999; i++)