Data_Structure/作業/unit5/DS5_not_Recursion.cpp

38 lines
556 B
C++
Raw Normal View History

2025-01-20 21:30:53 +08:00
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main(){
int num ,i=0 , j=1 ,temp;
printf("*** <20>̤p<CCA4>]<5D>˭<EFBFBD><CBAD>n<EFBFBD><6E><EFBFBD>l<EFBFBD>H<EFBFBD>]<5D>L<EFBFBD>{<7B><> ***\n\n<EFBFBD><EFBFBD><EFBFBD>J<EFBFBD>}<7D>j<EFBFBD><6A> ==> ");
scanf("%d",&num);
temp = num ;
while(1){
if(pow(i,2)<=temp) i++;
else break;
}
i--;
printf("\n<EFBFBD>]<5D>ˤ覡<CBA4><E8A6A1><EFBFBD><EFBFBD><EFBFBD>Y<EFBFBD>z<EFBFBD><7A>\n\n");
while(1){
if(temp>=i){
printf("<EFBFBD><EFBFBD>%d<>ơA%d<><64>\n",j,i);
temp -= i;
j++;
}else if(temp!=0){
printf("<EFBFBD><EFBFBD>%d<>ơA%d<><64>\n",j,temp);
j++;
break;
}else{
break;
}
}
j--;
printf("\n<EFBFBD>̤p<EFBFBD>]<5D>˯ȭ<CBAF><C8AD>n = %d\n",(j+i+num)*2*100);
return 0;
}