leafinsnowfield的专栏

#include int main(void){ int time; int number; int money; int i,j,k; printf("Please input test times: "); scanf("%d",&time); while(time>0) { int way=0; time--; printf("Output:\nInput D

#include int main(void){ printf("please input ax,ay bx,by:"); scanf("%lf,%lf,")}

计算数字之和#include int main(void){ int number; printf("Input a number with 4-digit: "); scanf("%d",&number); printf("Output:\nsum=%d\n",number/1000+number%10+number/100%10+number/10%10); return 0;

#include int main(void){ int x,y; int n; int minX,minY; printf("Input:\n"); scanf("%d",&n); if(1<=n<=1000){ scanf("%d %d",&x,&y); minX=x; minY=y; while(--n) { scanf("%d %d",&x,&y); i

#include void sort(int arr[],int low,int high);int main(void){ int n; int i=0; int sum=0; int array[101]; printf("Input:"); scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&array[i]); }

赫夫曼编码(huffman codes)是一种非常有用的数据压缩方法，通常能将数据压缩20%~90%。从具体问题出发，假设我们有一包含10000个字符的文件，这些字符仅由6个不同的字符组成，就设这6个字符分别为“abcdef”，下面的表给出了这6个字符在整个文件中的占比，和两种不同的编码方式。--------------abcdefFre

此为打印完数的程序/*#include int main(void){ int a,b; printf("please input a,b:"); scanf("%d,%d",&a,&b); printf("Output:\n"); if(a>1&&a<b&&b<10000) { if(a>6) { puts("6"); } if(a=28){ puts

#include int calulate(int n);int main(void){ int n; int way; for(;;){ printf("please input n:"); if(scanf("%d",&n)==1); printf("Output:\n"); way=calulate(n); printf("%d\n",way); } return

#include long f(int n){ if(n==1) { return 2; }else{ return f(n-1)*3+2; }}int main(void){ int n; printf("please input n:\n"); scanf("%d",&n); printf("Output:\nthe times are:\n"); whil

#include #define N 10int main(void){ int i,j,a[N][N],n; printf("Please input n: "); scanf("%d",&n); printf("Output:\n"); if(n>10||n<=0) printf("Input error!\n"); else{ for(i=0;i<n;i++)

#include int main(void){ float x,y; printf("Input:\n请输入坐标: "); scanf("%f %f",&x,&y); printf("Output:\n该点建筑物的高度: "); if(x>=1&&x=-3&&x<=-1) { if(y>=1&&y=-3&&y<=-1) { printf("10.00"); }e

#include int main(void){ int a; printf("Input: "); scanf("%d",&a); a+=a; printf("Output:\n%d\n",a); return 0;}

#include void change(int n);int main(void){ int input; printf("Please input n: "); scanf("%d",&input); change(input); return 0;}void change(int n){ char letter='a'; int count=n-1; int

#include int calculate(int n,int m);int main(void){ int n,m; int i=0; int c=0; int ok=1; printf("the number of people:"); scanf("%d",&n); printf("the lucky number is:"); scanf("%d",&m);

#include int calculate(int n,int m);int main(void){ int n,m; int i=0; int c=0; int ok=1; printf("the number of people:"); scanf("%d",&n); printf("the lucky number is:"); scanf("%d",&m);

#include int main(void){ float fair; printf("%Input the degree:"); scanf("%f",&fair); printf("Output:\nF(%.2f)=C(%.2f)\n",fair,5.0*(fair-32)/9); return 0;}

#include #include int main(void){ int a,b,c; printf("please input a,b,c: "); scanf("%d %d %d",&a,&b,&c); printf("Output:\nx1=%.4f, x2=%.4f\n",(-b-sqrt(b*b-4*a*c))/(2*a),(-b+sqrt(b*b-4*a*c))/(2*

#include int main(void){ int n; double sum=0.0000; printf("please input n:\n"); scanf("%d",&n); printf("Output:\n"); if(n=1000) { printf("Input error!\n"); }else{ printf("the ans is ");

#include int main(void){ int a,b; int sum=0; int power=1; int numbera,numberb; printf("please input two numbers:\n"); scanf("%d %d",&a,&b); printf("\n"); printf("Output:\nthe right answer is

辗转相除法， 又名欧几里德算法（Euclidean algorithm）乃求两个正整数之最大公因子的算法。它是已知最古老的算法， 其可追溯至3000年前。来源设两数为a、b(a>b），求a和b最大公约数(a，b）的步骤如下：用b除a，得a÷b=q......r1(0≤r1）。若r1=0，则（a，b)=b；若r1≠0，则再用r1除b，得b÷r1=q......r2 (0≤r2）.