(
#include<stdio.h>
#define N 4 //4位数
int main(){
int *transform(int num);
int num,i;
scanf("%d",&num);
int *new_num = transform(num);
printf("加密数据为:");
for(i=N-1;i>=0;i--)
printf("%d",new_num[i]);
printf("\n");
}
int *transform(int num){
int *tra = (int *)malloc(N*sizeof(int));
tra[0] = (num / 1000 + 5) % 10;
tra[1] = (num % 1000 / 100 + 5 )% 10;
tra[2] = (num % 1000 % 100 / 10 + 5 )% 10;
tra[3] = (num % 1000 % 100 % 10 + 5) % 10;
return tra;
}
#include<stdio.h>
int main(){
int STEP(int num);
int num;
scanf("%d",&num);
printf("经过%d次变换\n",STEP(num));
}
int STEP(int num){
int step = 1;
while(num != 1){
if(num % 2 == 0)
num = num / 2;
else
num = num * 3 + 1;
step++;
}
return step;
}
#include<stdio.h>
#include<math.h>
#include<time.h>//time函数
#include<stdlib.h>//srand函数
#define N 100 //100个点
int main(){
double *Line(double point[][2]);
double point[N][2]={};
int i;
srand(time(NULL));
for(i=0;i<N;i++){
point[i][0] = (double)(rand()%1000)/10;
point[i][1] = (double)(rand()%1000)/10;
printf("(%.2f,%.2f)\t",point[i][0],point[i][1]);
}
double *l = Line(point);
printf("最长的线:(%.2f,%.2f),(%.2f,%.2f),长度为:%.4f\n",l[0],l[1],l[2],l[3],l[4]);
}
double *Line(double point[][2]){
double *line = (int *)malloc(5 * sizeof(int));//长度为5,分别存放构成最长距离的两个点的xy坐标,和距离长度
int i,j;
double x1,y1,x2,y2,distance,max=0,n;
for(i=0;i<N;i++){
x1 = point[i][0];
y1 = point[i][1];
for(j=i;j<N;j++){
x2 = point[j][0];
y2 = point[j][1];
n = fabs((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
distance = sqrt(n);
if(distance > max){
line[4] = distance;
line[0] = x1;
line[1] = y1;
line[2] = x2;
line[3] = y2;
}
}
}
return line;
}
#include<stdio.h>
#include <time.h>
#include <stdlib.h>
#define N 10//10 *10矩阵
int main(){
int **sort(int **a);
int i,j,a[N][N],m,n=1,t;
srand(time(NULL));
for(i=0;i<N;i++){
for(j=0;j<N;j++){
a[i][j]=rand()%100;
printf("%d\t",a[i][j]);
}
printf("\n");
}
int **b = sort(a);
printf("排序后:-------------------\n");
for(i=0;i<N;i++){
for(j=0;j<N;j++){
//a[i][j]=rand()%20;
printf("%d\t",*((int *)b+i*N+j));
}
printf("\n");
}
}
int **sort(int **a){
int i,j,k,t;
//冒泡排序,先行排序,后列排序
for(k=0;k<N;k++)//每行
for(i=0;i<N;i++)//冒泡
for(j=N-1;j>i;j--)
if(*((int *)a+k*N+j-1)>*((int *)a+k*N+j)){
t=*((int *)a+k*N+j);
*((int *)a+k*N+j)=*((int *)a+k*N+j-1);
*((int *)a+k*N+j-1)=t;
}
for(k=0;k<N;k++)//每列
for(i=0;i<N;i++)//冒泡
for(j=N-1;j>i;j--)
if(*((int *)a+(j-1)*N+k)>*((int *)a+j*N+k)){
t=*((int *)a+j*N+k);
*((int *)a+j*N+k)=*((int *)a+(j-1)*N+k);
*((int *)a+(j-1)*N+k)=t;
}
return a;
}