青枫焱燚-CSDN博客

转载最大子段和

超时的 #includeconst int MAXN=50005;int a[MAXN];int main(){ int n; while(scanf("%d",&n)) { for(int i=1;i scanf("%d",&a[i]); long long Max=-1,sum=0; for(int i=1;i

2017-12-26 20:56:04 195

转载求最大公约数和最小公倍数

#includeint main(){ int m,n,a,b; scanf("%d%d",&m,&n); a=m*n; while(n!=0) { b=m%n; m=n; n=b; } printf("%d %d",m,a/m); printf("\n");}

2017-12-25 18:16:28 232

转载素数距离问题

int is_prime(int n){ int i; if(n for(i=2;i*i if(n%i==0)return 0; return 1;}#includeint main(){ int m,n; scanf("%d",&m); for(int i=1;i { scanf("%d",&n); i

2017-12-22 20:38:58 239

转载用函数实现3*3转制

#includevoid change(int a[3][3]);int main(){ int a[3][3],i,j; for(i=0;i for(j=0;j scanf("%d",&a[i][j]); change(a); return 0;}void change(int a[3][3]){ int i,j;

2017-12-19 09:40:56 426

转载用两个函数求最大公约数和最小公倍数

int yue(int x,int y){ int t,m; if(x>y) { t=x; x=y; y=t; } while(x!=0) { m=y%x; y=x; x=m; } return y;}int bei(int x,int y){

2017-12-19 09:10:46 3259

转载字符串替换

#include#includeint main(){ int i; char a[1000]; while(gets(a)) { int len; len=strlen(a); for(i=0;i { if(a[i]=='y'&&a[i+1]=='o'&&a[i+2]=='u') { print

2017-12-16 19:59:47 226

转载奇偶数分离

#includeint main(){ int a,n; scanf("%d",&n); for(int j=1;j { scanf("%d",&a); for(int i=1;i printf("%d ",i); printf("\n"); for(int i=2;i printf("%d ",i);

2017-12-13 20:07:12 294

转载用递归输出n的阶乘

int fac(int n){ int f; if(n==0||n==1) f=1; else f=fac(n-1)*n; return f;}#includeint main(){ int n,m; scanf("%d",&n); for(int i=1;i m=fac(n); printf("%

2017-12-11 20:20:58 2954

转载用选择法对10个数由小到大排序

void sort(int a[],int n){ int k,i,t,j; for(i=0;i { k=i; for(j=i+1;j if(a[k]>a[j]) { t=a[k]; a[k]=a[j]; a[j]=t; } }}

2017-12-11 20:13:52 3448

转载多组字符串大小写互换

#includeint main(){int n;char x;scanf("%d",&n);getchar();while(n--){while(scanf("%c",&x)&&x!='\n'){if(x>='a'&&xelse if(x='Z') printf("%c",x+32);}printf("\n");}}

2017-12-08 20:34:54 501

转载用函数判断多组数据是否是水仙花数

int is_water(int x){ int a,b,c; a=x/100;b=x/10%10;c=x%10; if(x==a*a*a+b*b*b+c*c*c)return 1; return 0;}#includeint main(){ int n; for(n=100;n { scanf("%d",&n);

2017-12-08 20:31:02 731

转载多组从一到n的阶乘之和

#include int main(){ int n, i, n1 = 1,s=0,m; scanf("%d",&m); for(int j=1;j<=m;j++) { scanf("%d",&n);s=0;n1=1; for(i=1; i <= n; i ++) { n1*=i;

2017-12-06 20:52:44 552

转载素数求和问题

int is_prime(int x){ if(x for(int i=2;i*i if(x%i==0)return 0; return 1;}#includeint main(){ int a,n,m,sum=0; scanf("%d",&m); for(int j=1;j { scanf("%d",&n);

2017-12-01 14:59:17 187

转载输出菱形

#includeint main(){int n,j,i,k;scanf("%d",&n);for(j=1;j{for(k=n;k>j;k--){printf(" ");}for(i=1;i{printf("* ");}printf("\n");} for(j=1;j {for(k

2017-11-02 20:13:54 215

转载输出倒正三角形

#includeint main(){ int n; scanf("%d",&n); for(int i=1;i { for(int j=1;j printf(" "); for(int z=1;z printf(" *"); printf("\n"); }}

2017-11-02 16:04:55 1465

转载输出正三角形

#includeint main(){ int a,b,c,n; scanf("%d",&n); for(a=1;a { for(b=n;b>=a;b--) { printf(" "); } for(c=1;c {

2017-11-01 20:11:04 1551

转载输入m和n两个正整数，求其最大公约数和最小公倍数

#include#includeint main(){ int m,n,a,b,c,d; scanf("%d%d",&m,&n); d=m*n; if(m { a=n; n=m; m=a; } for(b=m%n;b!=0;b=m%n) { m=n; n

2017-10-30 20:07:33 1507

转载判断n个数中的素数，是yes，不是no。

#includeint main(){ int i,a,w,n; for(w=1;w scanf("%d,%d",&a,&n); for(i=2;i if(a%i==0)break; if(i else printf("yes\n");} return 0;}

2017-10-27 14:08:57 1191

转载输出100·200之间的素数

#include#includeint main(){ int i,n,k,m=0; for(n=101;n {k=sqrt(n); for(i=2;i if(n%i==0)break; if(i>=k+1) { printf("%d",n); m=m+1; } if(m%10==0)p

2017-10-26 16:44:31 809

转载三个数排序

#include int main(){ int a,b,c,d; scanf("%d,%d,%d",&a,&b,&c); if(a>b) {d=a;a=b;b=d;}; if(a>c) {d=a;a=c;c=d;}; if(b>c) {d=b;b=c;c=d;}; printf("small to big %d,%d

2017-10-24 09:33:51 365

转载 n个数的阶乘

#includeint main(){ int i,sum=1,n; scanf("%d",&n); for(i=1;i { sum=sum*i; } printf("阶乘=%d",sum); return 0;}

2017-10-24 09:32:23 366

转载 n个数中奇数和，偶数和

#includeint main(){ int j=0,o=0,i,x,n; scanf("%d",&n); for(i=1;i { scanf("%d",&x); if(x%2==1)j=j+x; else(o=o+x); } printf("奇数和=%d,偶数和=%d",j,o); ret

2017-10-23 19:42:36 2394

原创 n个数中取最大值与最小值

#includeint main(){ int max,min,i,a,n; scanf("%d",&a); max=min=a; for(i=1;i { scanf("%d,%d",&a,&n); if(max if(min>a)min=a; } printf("max=%d,min=%d",max,m

2017-10-23 19:17:53 2281

QINGFENGYANYI的博客