吉大计算机专硕是几年,吉大计算机专硕947-2011年

(

#include#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;

}

#includeint 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#include#include//time函数

#include//srand函数

#define N 100 //100个点

int main(){

double *Line(double point[][2]);

double point[N][2]={};

int i;

srand(time(NULL));

for(i=0;imax){

line[4] = distance;

line[0] = x1;

line[1] = y1;

line[2] = x2;

line[3] = y2;

}

}

}

return line;

}

#include#include #include #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;ii;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;ki;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;

}