cg学习代码

1.1
#include<stdio.h>
int main()
{
	printf("Hello World!");
}
1.2
#include<stdio.h>
int main()
{
	int a,b;
	scanf("%d,%d",&a,&b);
	
	printf("a+b=%d\n",a+b);
	printf("a-b=%d\n",a-b);
	printf("a*b=%d\n",a*b);
	printf("a/b=%d\n",a/b);
}
2.1
#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	
	if(n%2==1){
		printf("%d",n/2);
	}else{
		printf("%d",n*n);
	}
	
}
2.2
#include<stdio.h>
int main()
{
	int year;
	scanf("%d",&year);
	
	if((year%4==0&&year%100!=0)||year%400==0){
		printf("%d is a leap year",year);
	}else{
		printf("%d is not a leap year",year);
	}
}
2.3
#include<stdio.h>
int main()
{
	int n1,n2,n3,n4;
	scanf("%d,%d,%d,%d",&n1,&n2,&n3,&n4);
	
	int t1,t2;
	t1=(n1>n2)?n2:n1;
	t2=(n3>n4)?n3:n4;
	
	printf("%d",t1+t2);
}
2.4
#include<stdio.h>

void switch1(int n)
{
	switch(n){
		
		case 2:printf("twenty");break;
		case 3:printf("thirty");break;
		case 4:printf("forty");break;
		case 5:printf("fifty");break;
		case 6:printf("sixty");break;
		case 7:printf("seventy");break;
		case 8:printf("eighty");break;
		case 9:printf("ninety");break;
	}
}
void switch2(int n)
{
	switch(n){
		case 1:printf("-one");break;
		case 2:printf("-two");break;
		case 3:printf("-three");break;
		case 4:printf("-four");break;
		case 5:printf("-five");break;
		case 6:printf("-six");break;
		case 7:printf("-seven");break;
		case 8:printf("-eight");break;
		case 9:printf("-nine");break;
		default:break;
	}
}
void switch3(int n)
{
	switch(n){
		case 0:printf("ten");break;
		case 1:printf("eleven");break;
		case 2:printf("twelve");break;
		case 3:printf("thirteen");break;
		case 4:printf("forteen");break;
		case 5:printf("fifteen");break;
		case 6:printf("sixteen");break;
		case 7:printf("seventeen");break;
		case 8:printf("eighteen");break;
		case 9:printf("nineteen");break;
	}
}
int main()
{
	int a,b;
	int n;
	scanf("%d",&n);
	a=n/10;
	b=n%10;
 	
 	if(a==1){
	 	switch3(b);
	 }else{
	 	switch1(a);
	 	switch2(b);
	 }
}
3.1
#include<stdio.h>
int main()
{
	int i;
	int sum;
	int t;
	int a;
	for(i=100;i<1000;i++){
		sum=0;
		t=i;
		while(t>0){
			a=t%10;
			t/=10;
			sum+=a*a*a;
		}
		if(sum==i){
			printf("%d\n",i);
		}
	}
}
3.2
#include<stdio.h>
int main()
{
	int n;
	int sum=0;
	int i;
	for(i=0;i<8;i++){
		scanf("%d",&n);
		if(n%2==0){
			sum+=n;
		}
	}
	printf("%d",sum);
}
3.3
#include<stdio.h>
int main()
{
	int i;
	int n=1;
	for(i=1;i<10;i++){
		n=(n+1)*2;
	}
	printf("%d",n);
}
3.4
#include<stdio.h>

int main()
{
	int m,n,t;
	scanf("%d,%d",&m,&n);
	
	if((m>9999||m<=0)||(n>9999||n<=0)){
		printf("error");
	}else {
		if(m>n){
			t=m;
			m=n;
			n=t;
		}
		int i,j;
		int cnt=0;
		for(i=m;i<=n;i++){
			int sum=0;
			for(j=1;j<=n;j++){
				if(i%j==0){
					sum+=j;
				}
			}
			sum-=i;
			if(sum==i){
				if(cnt==0){
					printf("%d",i);
				}else{
					printf(",%d",i);
				}
				cnt++;
			}
		}
	}
	
}
4.1
#include<stdio.h>

int main()
{
	int n;
	scanf("%d",&n);
	if(n>=10){
		printf("Please input 1-9.");
	}else{
		int a[n][4];
		int i,j;
		for(i=0;i<n;i++){
			for(j=0;j<4;j++){
				scanf("%d",&a[i][j]);
			}
		}
		int sum[n];
		for(i=0;i<n;i++){
			sum[i]=0;
		}
		for(i=0;i<n;i++){
			for(j=1;j<4;j++){
				sum[i]+=a[i][j];
			}
		}
		
		int k,l;
		int t,q;
		for(k=1;k<n;k++){
			for(l=0;l<n-1;l++){
				if(sum[l]<sum[l+1]){
					for(i=0;i<4;i++){
						t=a[l][i];
						a[l][i]=a[l+1][i];
						a[l+1][i]=t;
					}
					q=sum[l];
					sum[l]=sum[l+1];
					sum[l+1]=q;
					}
			}
			
		}
		
		int cnt[n];
		cnt[0]=1;
		for(i=1;i<n;i++){
			if(sum[i]==sum[i-1]){
				cnt[i]=cnt[i-1];
			}else{
				cnt[i]=i+1;
			}
		}
		for(i=0;i<n;i++){
			printf("%4d",cnt[i]);
			for(j=0;j<4;j++){
				if(j==0){
					printf("%10d",a[i][j]);
				}else{
					printf("%5d",a[i][j]);
				}
			}
			printf("\n");
		}
	}	
}
4.2
#include<stdio.h>
int main()
{
	int a[3][3];
	int i,j;
	for(i=0;i<3;i++){
		for(j=0;j<3;j++){
			scanf("%d",&a[i][j]);
		}
	}
	int t;
	for(i=0;i<=1;i++){
		for(j=i+1;j<=2;j++){
			t=a[i][j];
			a[i][j]=a[j][i];
			a[j][i]=t;
		}
	}
	for(i=0;i<3;i++){
		for(j=0;j<3;j++){
			printf("%d",a[i][j]);
			if(j<2){
				printf(" ");
			}
		}
		printf("\n");
	}
}
4.3
#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	int a[n+1][n+1];
	int i,j;
	a[0][0]=1;
	for(i=1;i<n+1;i++){
		a[i][0]=a[i][i]=1;
	}
	for(i=2;i<n+1;i++){
		for(j=1;j<i;j++){
			a[i][j]=a[i-1][j]+a[i-1][j-1];
		}
	}
	for(i=0;i<n+1;i++){
		for(j=2*(n-i);j>0;j--){
			printf(" ");
		}
		for(j=0;j<=i;j++){
			printf("%4d",a[i][j]);
		}
		printf("\n");
	}
}
4.4
#include<stdio.h>
int main()
{
	int basic[15][10];
	int i,j,k;
	for(i=0;i<15;i++){
		for(j=0;j<10;j++){
			scanf("%d",&basic[i][j]);
		}
	}
	int add[4][4];
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			scanf("%d",&add[i][j]);
		}
	}
	int n;
	scanf("%d",&n);
	n-=1;
	int up[4];
	int low[4];
	int dif[4];
	
	for(i=0;i<4;i++){
		for(j=3;j>=0;j--){
			low[i]=-5;
			if(add[j][i]==1){
				low[i]=j;
				break;
			}
		}
	}
	for(i=n;i<n+4;i++){
		for(j=0;j<15;j++){
			up[n-i]=14;
			if(basic[j][i]==1){
				up[i-n]=j;
				break;
			}
		}
	}
	int min=0;
	for(i=0;i<4;i++){
		dif[i]=up[i]-low[i];
		if(dif[min]>dif[i]){
			min=i;
		}	
	}
	for(i=n;i<n+4;i++){
		for(j=up[i-n]-dif[i-n]+dif[min]-1,k=low[i-n];k>=0;k--,j--){
			basic[j][i]+=add[k][i-n];
		}
	}
	for(i=0;i<15;i++){
		for(j=0;j<10;j++){
			printf("%d",basic[i][j]);
			if(j!=9){
				printf(" ");
			}
		}
		printf("\n");
	}
	
}

5.1
#include<stdio.h>
int main()
{
	double n1=2.0;
	double n2=1.0;
	int t;
	int n;
	scanf("%d",&n);
	
	int i;
	double sum=0.0;
	for(i=1;i<=n;i++){
		sum+=n1/n2;
		t=n1;
		n1=n1+n2;
		n2=t;
	}
	
	printf("%.2f",sum);
}
5.2
#include<stdio.h>
#include<math.h>
int main()
{
	int m,n;
	scanf("%d,%d",&m,&n);
	int i,j;
	int is1,is2;
	int n1,n2;
	for(i=m;i<=n;i++){
		is1=0;
		for(j=2;j<=sqrt(i);j++){
			if(i%j==0){
				is1=1;
				break;
			}
		}
		if(is1==0){
			is2=0;
			for(j=2;j<=sqrt(i+2);j++){
				if((i+2)%j==0){
					is2=1;
					break;
				}
			}
		}
		if(is1==0&&is2==0){
			printf("%d,%d\n",i,i+2);
		}
	}
}
5.3
#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	int t;
	int sum;
	int re;
	int i;
	printf("0,");
	int cnt=1;
	for(i=1;i<n;i++){
		sum=0;
		t=i;
		while(t>0){
			re=t%10;
			t/=10;
			sum=sum*10+re;	
		}
		if(sum==i){
			printf("%d,",i);
			cnt++;
			if(cnt%10==0){
				printf("\n");
			}
		}
		
	}	
}

6.1
#include<stdio.h>

float Pn(int n,int x);
int main()
{
	int n;
	float x;
	float result=0.0;
	scanf("%d,%f",&n,&x);
	
	if(n<0){
		printf("error");
	}else if(n==0){
		printf("1");
	}else if(n==1){
		printf("%.2f",x);
	}else{
		result=Pn(n,x);
		printf("%.2f",result);
	}
	
}
float Pn(int n,int x)
{
	float re;
	if(n==0){
		re=1;
	}else if(n==1){
		re=x;
	}else{
		re=((2*n-1)*x-Pn(n-1,x)-(n-1)*Pn(n-2,x))/n*1.0;
	}
	return re;
}

6.2
#include<stdio.h>
#include<math.h>
int main()
{
	int n;
	scanf("%d",&n);
	
	int i,j;
	int a[10000];
	a[0]=2;
	int cnt=1;
	int is;
	for(i=3;i<=sqrt(n)+10;i++){
		is=0;
		for(j=2;j<=sqrt(i);j++){
			if(i%j==0){
				is=1;
				break;
			}
		}
		if(is==0){
			a[cnt++]=i;
		}
	}
	for(i=0;i<cnt;i++){
		if(n%a[i]==0){
			printf("%d ",a[i]);
			n/=a[i];
			i--;
		}
	}
}

6.3
#include <stdio.h>
int a[10];
int is[10]={0};
int n;

void sort(int index,int a[]);
int main()
{

	scanf("%d",&n);
	sort(1,a);
	
}
void sort(int index,int a[])
{
	int i;
	if(index>n){
		for(i=1;i<=n;i++){
			printf("%d",a[i]);
		}
		printf("\n");
		return;
	}
	
	for(i=1;i<=n;i++){
		if(!is[i]){
			a[index]=i;
			is[i]=1;
			sort(index+1,a);
			is[i]=0;
		}
	}
	return;
}
7.1
#include<stdio.h>
#include<string.h>

int main()
{
	char s1[20];
	char s11[20];
	char s2[20];
	char s[200];
	char ss[200];
	scanf("%s",s1);
	scanf("%s",s2);
	getchar();
	int i,k;
	for(i=0;i<strlen(s1);i++){
		if(s1[i]>='A'&&s1[i]<='Z'){
			s11[i]=s1[i]+32;
		}else{
			s11[i]=s1[i];
		}
	}
	int is;
	char c;
	int cnt=0;
	while((c=getchar())!='\n'){
		if(c==' '){
			
			for(i=0;i<cnt;i++){
				if(ss[i]==s11[0]&&(cnt-i)>=strlen(s1)){
					
					is=1;
					for(k=1;k<strlen(s1);k++){
						if(s11[k]!=ss[k+i]){
							is=0;
							break;
						}
					}
					if(is==1){
						printf("%s",s2);
						i+=strlen(s1)-1;
					}else{
						printf("%c",s[i]);
					}	
				}else{
					
					printf("%c",s[i]);
				}
			}
			cnt=0;
			
			putchar(' ');
		}else{
			s[cnt]=c;
			if(c>='A'&&c<='Z'){
				ss[cnt]=c+32;
			}else{
				ss[cnt]=c;
			}
			cnt++;
		}
	}
	for(i=0;i<cnt;i++){
		if(ss[i]==s11[0]&&(cnt-i)>=strlen(s1)){
			
			is=1;
			for(k=1;k<strlen(s1);k++){
				if(s11[k]!=ss[k+i]){
					is=0;
					break;
				}
			}
			if(is==1){
				printf("%s",s2);
				i+=strlen(s1)-1;
			}else{
				printf("%c",s[i]);
			}		
		}else{
			printf("%c",s[i]);
		}

	}
	putchar('\n');
	
}
7.2
#include<stdio.h>
#include<string.h>
int main()
{
	int n=0;
	int i;
	char s[20][100];
	char s1[20];
	char s2[20];
	while(gets(s[n])){
		if(strcmp(s[n],"")==0) 
		break;
		n++;	
	}
	
	for(i=0;i<n;i++){
		s2[i]=i;
		s1[i]=s[i][0];
	}
	
	int j;
	int min;
	char t;
	int q;
	for(i=0;i<n-1;i++){
		min=i;
		for(j=i+1;j<n;j++){
			if(s1[min]>s1[j]){
				min=j;
			}
		}
		t=s1[min];
		s1[min]=s1[i];
		s1[i]=t;
		q=s2[min];
		s2[min]=s2[i];
		s2[i]=q;
	}
	if(s1[7]=='j'){
		t=s1[7];
		s1[7]=s1[6];
		s1[6]=t;
		q=s2[7];
		s2[7]=s2[6];
		s2[6]=q;
	}
	
	for(i=0;i<n;i++){
		
		puts(s[s2[i]]);
	}
}
7.3
#include<stdio.h>
int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	
	int i;
	int a[n+1];
	for(i=1;i<n+1;i++){
		a[i]=i;
	}
	
	int cnt=0;
	i=1;
	int t=n;
	while(t>1){
		if(a[i]!=0){
			cnt++;
			if(cnt%m==0){
				a[i]=0;
				t--;
			}
		}
		
		i++;
		if(i==n+1){
			i=1;
		}
	}
	for(i=1;i<n+1;i++){
		if(a[i]!=0){
			printf("%d\n",a[i]);
		}
	}
}
7.4
#include<stdio.h>
int main()
{
	float a[10];
	float b[10];
	int i;
	for(i=0;i<10;i++){
		scanf("%f",&a[i]);
		if(a[i]>=0){
			b[i]=a[i];
		}else{
			b[i]=-1.0*a[i];
		}
	}
	int j;
	int max;
	float t;
	for(i=0;i<9;i++){
		max=i;
		for(j=i+1;j<10;j++){
			if(*(b+max)<*(b+j)){
				max=j;
			}
		}
		t=*(a+max);
		*(a+max)=*(a+i);
		*(a+i)=t;
		t=*(b+max);
		*(b+max)=*(b+i);
		*(b+i)=t;
	}
	for(i=0;i<10;i++){
		if(i==9){
			printf("%.2f",*(a+i));
		}else{
			printf("%.2f,",*(a+i));
		}
	}
}
8
#include<stdio.h>
#include<string.h>
const int G = 12;
int n;
typedef struct q{
	char name[100];
	int a, b, c, t;
}Q;
Q q[55];
void sort(Q *a, int n){
	int i , j;
	for(i = 1; i <= n; i++){
		for(j = 1; j <= n - 1; j++){
			if(a[j].t < a[j + 1].t){
				Q t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
		}
	}
}
char s[1003];
int read(char *s, int *i){
	while(s[*i] < '0' || s[*i] > '9')
		(*i)++;
	int ret = 0;
	while(s[*i] <= '9' && s[*i] >= '0'){
		ret = ret * 10 + s[*i] - '0';
		(*i)++;
	}
	return ret;
}
int main(){
	#ifdef DoubleHappy
		freopen("in.txt", "r", stdin);
	#endif
	freopen("result.txt", "w", stdout);
	int i = 1, n = 0;;
	while(gets(s)){
		int j = 0;
		while(s[j] != ' ' && !(s[j] <= '9' && s[j] >= '0'))j++;
		s[j] = 0;
//		puts(s);
		strcpy(q[i].name, s);
		q[i].a = read(s, &j); q[i].b = read(s, &j), q[i].c = read(s, &j);
		q[i].t = q[i].a + q[i].b + q[i].c;
		n++;
		i++;
	}
	sort(q, n);
	char t[] = "        Name    English     Math       C        Total\n";
	printf("%s", t);
//	return 0;
	for(i = 1; i <= n; i++){
		printf("%12s%12d%12d%12d%12d\n", q[i].name, q[i].a, q[i].b, q[i].c, q[i].t);
//		puts(q[i].name)
	}
	return 0;
}