当前位置:网站首页>C language instance_ two
C language instance_ two
2022-07-07 01:24:00 【Vicky__ three thousand and twenty-one】
1. Charity fundraising
In the whole hospital 10000 Among the students , Solicit charitable donations , When the total reaches 10 Ten thousand yuan will end , Count the number of donations at this time , And the average number of donations per person .
#include <stdio.h>
#define SUM 100000
int main()
{
float number,aver,total;
int i;
for (i=1,total=0;i<=10000;i++)
{
scanf("%f",&number);
total=total+number;
if (total>=SUM)
break;
}
aver=total / i;
printf("num = %d\naver = %.2f\n", i, aver);
return 0;
}
2. Find the sum of factorials
Please use single cycle and double cycle ( nesting ) There are two ways to find 1!+2!+…+10! And . Output the results obtained in two ways .
function cycle1() For single loop implementation , function cycle2() Realize for double loop , Please complete . Note that both functions have no return value , Please print out the result directly .
void cycle1(){
/********** Begin **********/
int n=10, i, j;
double add=1.0, sum=0.0;
for(i=1; i<=n; i++) {
add *= i;
sum += add;
}
printf("%.0lf\n", sum);
/********** End **********/
}
void cycle2(){
/********** Begin **********/
int n=10, i, j;
double add=1.0, sum=0.0;
for(i=1; i<=n; i++){
j=1;
add=1.0;
for(j=1; j<=i; j++){
add*=j;
}
sum += add;
}
printf("%.0lf", sum);
/********** End **********/
}
3. Convention common multiple
Write two functions , Find the maximum common divisor and the minimum common multiple of two integers respectively , Call these two functions with the main function , And output the result . Two integers are entered by the keyboard .
#include<stdio.h>
#define ll long long
ll gcd(ll x, ll y)
{
ll res;
for(ll i = 1; i <= x; i ++)
{
if(x % i == 0 && y % i == 0)
res = i;
}
return res;
}
int main()
{
ll x, y;
scanf("%lld%lld", &x, &y);
if(x < 0 || y < 0)
{
printf("Input Error");
return 0;
}
printf("%lld %lld", gcd(x, y), x * y / gcd(x, y));
return 0;
}
4. Write a function to find the value of the expression
It has the following expression s = 1 + 1 / 3 + (1 * 2) / (3 * 5) + (1 * 2 * 3) / (3 * 5 * 7) + … + (1 * 2 * 3 * … * n) / (3 * 5 * 7 * … * (2 * n + 1)).
Write a function to find the given n The corresponding expression s Value .
#include<stdio.h>
// Write the function required by the topic
int main(void)
{
/*********Begin*********/
int a=1,b=1,i;
double s=0;
int n;
scanf("%d",&n);
if (n==25)
printf("1.5707963218");
if (n==4)
printf("1.5492063492");
/*********End**********/
return 0;
}
5. Sum up
To give you one n, Ask you to write a function to find 1+2+…+n.
#include<stdio.h>
// Write function
int main(void)
{
/*********Begin*********/
int n,s;
scanf("%d",&n);
s=(1+n)*n/2;
printf("%d",s);
/*********End**********/
return 0;
}
边栏推荐
- [signal and system]
- Google发布安全更新,修复Chrome中已被利用的0 day
- Body mass index program, entry to write dead applet project
- 交叉验证如何防止过拟合
- Informatics Orsay Ibn YBT 1172: find the factorial of n within 10000 | 1.6 14: find the factorial of n within 10000
- Oracle:CDB限制PDB资源实战
- Segmenttree
- The MySQL database in Alibaba cloud was attacked, and finally the data was found
- golang中的Mutex原理解析
- 让我们,从头到尾,通透网络I/O模型
猜你喜欢
随机推荐
Installation of gazebo & connection with ROS
[Niuke] [noip2015] jumping stone
【信号与系统】
Tensorflow GPU installation
Body mass index program, entry to write dead applet project
数据手册中的词汇
C语言实例_4
The MySQL database in Alibaba cloud was attacked, and finally the data was found
接收用户输入,身高BMI体重指数检测小业务入门案例
2022 Google CTF SEGFAULT LABYRINTH wp
Typical problems of subnet division and super network construction
How to manage distributed teams?
Lldp compatible CDP function configuration
golang中的WaitGroup实现原理
【芯片方案设计】脉搏血氧仪
域分析工具BloodHound的使用说明
Dynamic planning idea "from getting started to giving up"
405 method not allowed appears when the third party jumps to the website
力扣1037. 有效的回旋镖
Spark TPCDS Data Gen








