C语言基础题
Lifca
会敲代码的⑨
展开
-
SDUT-2561 九九乘法表
Code#include int main(){ int row,col,n; while(scanf("%d",&n)!=EOF) { for(row=1; row<=n; row++) { for(col=1; col<=row; col++) {原创 2017-06-15 16:41:42 · 892 阅读 · 0 评论 -
SDUT-1195 C语言实验——打印金字塔
Code#include int main(){ int n,i,j; scanf("%d",&n); for(i=1; i<=n; i++) { for(j=1; j<=2*(n-i); j++) printf(" "); for(j=1; j<=i; j++) {原创 2017-06-17 11:58:02 · 579 阅读 · 0 评论 -
SDUT-2737 小鑫の日常系列故事(六)——奇遇记
Code#include int main(){ int n,i,day[41]; day[0] = 0; day[1] = 1; day[2] = 2; for(i=3; i<=40; i++) { day[i] = day[i-1] + day[i-2]; } while(~scanf("%d",&n))原创 2017-06-17 12:17:48 · 873 阅读 · 0 评论 -
SDUT-1170 C语言实验——最值
Code#include int main(){ int i,a[10],n,max,min,tmax,tmin,t; scanf("%d",&n); for(i=0; i<n; i++) scanf("%d",&a[i]); max = a[0]; min = a[0]; for(i=0; i<n; i++) {原创 2017-06-17 13:34:18 · 1712 阅读 · 0 评论 -
SDUT-1182 C语言实验——数日子
Code#include int main(){ int n,i,year,month,day; int days[12]= {31,28,31,30,31,30,31,31,30,31,30,31}; while(scanf("%d",&n)!=EOF) { while(n--) { int ans原创 2017-06-17 13:47:15 · 2054 阅读 · 0 评论 -
SDUT-1244 数列有序
Code#include int main(){ int n,m,i,j,t,a[100]; while(scanf("%d%d",&n,&m)&&n&&m) { for(i=0; i<n; i++) scanf("%d",&a[i]); a[n] = m; for(i=0; i<n; i++原创 2017-06-17 13:51:12 · 706 阅读 · 0 评论 -
SDUT-1136 C/C++程序训练6---歌德巴赫猜想的证明
Code#include #include int isPrime(int x){ int i; for(i=2; i<=sqrt(x); i++) { if(x % i == 0) break; } if(i > sqrt(x)) return 1; else re原创 2017-06-17 16:56:59 · 1334 阅读 · 1 评论 -
SDUT-1199 C语言实验——计算表达式
Code#include #include double f(double x,int n){ int i; double s = x; for(i=1; i<=n; i++) { s = sqrt(i+s); } return s;}int main(){ double x; int n;原创 2017-06-17 16:59:24 · 2470 阅读 · 0 评论 -
SDUT-1238 求数列的和
Code#include #include int main(){ double sum,n; int i,m; while(scanf("%lf %d",&n,&m) != EOF) { sum = n; for(i=1; i<m; i++) { n = sqrt(n);原创 2017-06-17 17:05:03 · 397 阅读 · 0 评论 -
SDUT-1161 C语言实验——一元二次方程Ⅰ
Code#include #include int main(){ double a,b,c,x1,x2; scanf("%lf %lf %lf",&a,&b,&c); x1 = (-b+sqrt(b*b-4*a*c)) / (2*a); x2 = (-b-sqrt(b*b-4*a*c)) / (2*a); if(x1 > x2)原创 2017-06-17 17:07:49 · 1073 阅读 · 1 评论 -
SDUT-1206 求三角形面积
Code #include #include int main(){ double a,b,c,S,s; scanf("%lf %lf %lf",&a,&b,&c); s = 0.5 * (a + b + c); S = sqrt(s * (s - a) * (s - b) * (s - c)); printf("%.3lf",S); r原创 2017-06-17 17:12:09 · 398 阅读 · 0 评论 -
SDUT-1209 求实数绝对值
Code#include double Abs(double x){ if(x > 0) return x; else return -x;}int main(){ double num; while(scanf("%lf",&num) != EOF) { printf原创 2017-06-17 17:19:39 · 698 阅读 · 0 评论 -
SDUT-2557 分段函数
Code#include #include double f(double x){ double y; if(x > 0 && x < 10) y = log2(x); else if(x < 0) y = fabs(x) + sin(x); else if(x >= 10) y = x*x; el原创 2017-06-17 17:27:56 · 761 阅读 · 0 评论 -
SDUT-1132 C/C++经典程序训练2---斐波那契数列
Code #include int Fib(int n){ if (n <= 2) return 1; else return Fib(n-1) + Fib(n-2);}int main(){ int n,sum; scanf("%d",&n); printf("%d",Fib(n)); return原创 2017-06-17 17:36:17 · 475 阅读 · 0 评论 -
SDUT-1149 计算题
Code#include int f(int m,int n){ if(m == 1) return n; if(n == 1) return m; if(m > 1 && n > 1) return f(m-1,n) + f(m,n-1);}int main(){ int i,m,n; sc原创 2017-06-17 17:39:47 · 487 阅读 · 0 评论 -
SDUT-2400 高中数学?
Code#include int f(int x){ if(x == 1) return 0; else if(x == 2) return 1; else return 4 * f(x-1) - 5 * f(x-2);}int main(){ int x,i; scanf("%d",&i);原创 2017-06-17 17:46:33 · 372 阅读 · 0 评论 -
SDUT-1135 C/C++经典程序训练5---图形打印问题
Code#include int main(){ int n,i,j; scanf("%d",&n); for(i=1; i<=n; i++) { for(j=1; j<=n-i; j++) printf(" "); printf("+"); if(i!=1) {原创 2017-06-17 11:34:57 · 512 阅读 · 0 评论 -
SDUT-1179 C语言实验——打印数字图形
Code#include int main(){ int i,j,n; scanf("%d",&n); for(i=1; i<=n; i++) { for(j=1; j<=n-i; j++) printf(" "); for(j=1; j<=i; j++) printf("%d原创 2017-06-17 11:07:48 · 696 阅读 · 0 评论 -
SDUT-1169 分数序列
Code#include int main(){ int i,n,a = 2,b = 1; double sum = 2; scanf("%d",&n); for(i=1;i<n;i++) { a = a + b; b = a - b; sum += (a*1.0/b*1.0); }原创 2017-06-15 17:03:24 · 373 阅读 · 0 评论 -
SDUT-1174 打印菱形
Code#include int main(){ int i,j,n; scanf("%d",&n); for(i=1; i<=n; i++) { for(j=1; j<=n-i; j++) printf(" "); for(j=1; j<=2*i-1; j++) printf原创 2017-06-15 17:06:47 · 338 阅读 · 0 评论 -
SDUT-1131 最大公约数与最小公倍数
Code#include int main(){ int m,n,a,b,r,s,t; scanf("%d %d",&m,&n); a = m; b = n; if(m < n) { t = m; m = n; n = t; } while(n != 0) {原创 2017-06-15 17:10:06 · 472 阅读 · 0 评论 -
SDUT-2749 区域内点的个数
Code#include int main(){ int n,xb,yb,xt,yt,a,b; while(~scanf("%d",&n)) { scanf("%d %d",&xb,&yb); scanf("%d %d",&xt,&yt); int count = 0; while(n--)原创 2017-06-15 17:14:20 · 637 阅读 · 0 评论 -
SDUT-1147 求绝对值最大值
Code#include #include int main() { int a[100],i,n,max; scanf("%d",&n); for(i=0; i<n; i++) scanf("%d",&a[i]); max = a[0]; for(i=0; i<n; i++) {原创 2017-06-15 17:17:14 · 665 阅读 · 0 评论 -
SDUT-1239 水仙花数
Code#includeint main(){ int num,i,m,n,x,y,z; while(scanf("%d %d",&m,&n) != EOF) { i = 0; for(num=m; num<=n; num++) { x = num/100; y =原创 2017-06-15 16:37:53 · 946 阅读 · 0 评论 -
SDUT-1194 余弦
Code#include #include int main(){ int i,j,n; double x,cos,item; while(~scanf("%lf %d",&x,&n)) { cos = 1; for(i=1; i<=n; i++) { item = 1.0;原创 2017-06-15 17:19:50 · 446 阅读 · 0 评论 -
SDUT-1122 判断素数
Code#include #include int main(){ int n,i; scanf("%d",&n); for(i=2; i<=(int)sqrt(n); i++) { if(n % i == 0) break; } if(n == 1) printf("This is原创 2017-06-15 17:24:26 · 609 阅读 · 0 评论 -
SDUT-1193 圆周率
Code#include int main(){ double i,n,vary,pi = 0; scanf("%lf",&n); for(i=1; i<=n; i++) { vary = 1/(4*i-3) - 1/(4*i-1); pi += vary; } pi = 4 * pi; printf原创 2017-06-16 22:51:14 · 429 阅读 · 0 评论 -
SDUT-2251 期末考试之分等级
Code#include int main(){ int i,n,rank; int A,B,C,D,E; A=0;B=0;C=0;D=0;E=0; scanf("%d",&n); for(i=1; i<=n; i++) { scanf("%d",&rank); if(rank >= 90)原创 2017-06-16 22:53:03 · 966 阅读 · 0 评论 -
SDUT-2250 简单计算
Code#include int main(){ int i,n,a[100]; int max,min,ave,sum = 0; scanf("%d",&n); for(i=0; i<n; i++) { scanf("%d",&a[i]); max = a[0]; min = a[0];原创 2017-06-16 22:58:07 · 1119 阅读 · 0 评论 -
SDUT-3425 小金掰呀掰不够玉米
Code#include int main(){ int i,n,m,sum1,sum2; while(scanf("%d %d",&n,&m)!=EOF) { sum1 = 0; sum2 = 0; for(i=1; i<=n; i++) sum1 += i; for(i=1原创 2017-06-16 23:00:44 · 1474 阅读 · 0 评论 -
SDUT-1137 C/C++练习7---求某个范围内的所有素数
Code#include #include int main(){ int i,j,n,count; scanf("%d",&n); count = 0; for(i=2; i<=n; i++) { for(j=2; j<=sqrt(i); j++) { if(i%j == 0)原创 2017-06-16 23:05:25 · 1349 阅读 · 1 评论 -
SDUT-2553 完美的素数
Code#include #include int IsPrime(int x){ int i; for(i=2; i<=sqrt(x); i++) { if(x % i == 0) break; } if(i <= sqrt(x)) return 0; return 1;}i原创 2017-06-17 11:04:40 · 990 阅读 · 0 评论 -
SDUT-2552 猜糖块
Code#include int main(){ int n,i,candy = 0,day = 0; scanf("%d",&n); for(i=1;i<=n;i++) { candy += i*i; if(candy <= n) day++; else br原创 2017-06-17 11:06:31 · 578 阅读 · 0 评论 -
SDUT-3106 小鑫数数儿
Code#include int main(){ int n,i,a[100]; while(scanf("%d",&n)!=EOF) { int sum = 0,ave = 0,big = 0,equal = 0,small = 0; for(i=0; i<n; i++) { scanf("原创 2017-06-17 17:49:46 · 581 阅读 · 0 评论 -
SDUT-3103 小鑫爱运动
Code#include int main(){ int i,j,n,t,temp,rank,a[10]; while(scanf("%d",&n) != EOF) { for(i=0; i<n; i++) scanf("%d",&a[i]); t = a[0]; for(i=0;i<n;i+原创 2017-06-18 17:10:31 · 599 阅读 · 0 评论 -
SDUT-1173 字符逆序
Code#include #include int main(){ char s[101]; int i; gets(s); int len = strlen(s); for(i=len-1;i>=0;i--) printf("%c",s[i]); return 0;}反思:字符串练习,类似数组的逆序输出。原创 2017-06-23 12:23:02 · 547 阅读 · 0 评论 -
SDUT-1187 简单编码
Code#include #include int main(){ char s[101]; int i; gets(s); int len = strlen(s); for(i=0; i<len; i++) { if(s[i] >= 'a' && s[i] <= 'z') s[i] -= 32;原创 2017-06-23 12:25:21 · 885 阅读 · 0 评论 -
SDUT-1201 字符串排序
Code#include #include int main(){ char a[100],b[100],c[100],t[100]; scanf("%s %s %s",a,b,c); if(strcmp(a,b) > 0) { strcpy(t,a); strcpy(a,b); strcpy(b,t);原创 2017-06-23 12:30:04 · 878 阅读 · 0 评论 -
SDUT-1204 C语言实验——字符编码
Code#include int main(){ char s[6]; int i; gets(s); for(i=0; i<5; i++) s[i] = s[i] + 4; printf("password is %s",s); return 0;}反思:字符串练习,因为不含w、x、y、z,直接将每位字符的ASCII码后原创 2017-06-23 12:37:06 · 1215 阅读 · 0 评论 -
SDUT-1210 简单密码破解
Code#include #include int main(){ char password[101]; int i,len; while(gets(password)) { len = strlen(password); for(i=0; i<len; i++) { if(pas原创 2017-06-23 12:42:14 · 966 阅读 · 0 评论