当前位置:网站首页>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;
}
边栏推荐
- HMM 笔记
- 免费白嫖的图床对比
- Atomic in golang and CAS operations
- Come on, don't spread it out. Fashion cloud secretly takes you to collect "cloud" wool, and then secretly builds a personal website to be the king of scrolls, hehe
- Data type of pytorch tensor
- 自旋与sleep的区别
- 安全保护能力是什么意思?等保不同级别保护能力分别是怎样?
- Neon Optimization: performance optimization FAQ QA
- C # method of calculating lunar calendar date 2022
- 身体质量指数程序,入门写死的小程序项目
猜你喜欢

Installation of gazebo & connection with ROS

Tensorflow GPU installation

Wood extraction in Halcon

Send template message via wechat official account

云呐|工单管理软件,工单管理软件APP

Go zero micro service practical series (IX. ultimate optimization of seckill performance)

2022 Google CTF SEGFAULT LABYRINTH wp

1123. 最深叶节点的最近公共祖先

Windows installation mysql8 (5 minutes)

Dynamic planning idea "from getting started to giving up"
随机推荐
C # method of calculating lunar calendar date 2022
Boot - Prometheus push gateway use
从零开始匹配vim(0)——vimscript 简介
Dynamic planning idea "from getting started to giving up"
[JS] obtain the N days before and after the current time or the n months before and after the current time (hour, minute, second, year, month, day)
从底层结构开始学习FPGA----FIFO IP的定制与测试
The MySQL database in Alibaba cloud was attacked, and finally the data was found
SuperSocket 1.6 创建一个简易的报文长度在头部的Socket服务器
Neon Optimization: performance optimization FAQ QA
Go zero micro service practical series (IX. ultimate optimization of seckill performance)
NEON优化:log10函数的优化案例
Using the entry level of DVA in taro3.*
接收用户输入,身高BMI体重指数检测小业务入门案例
NEON优化:关于交叉存取与反向交叉存取
Atomic in golang and CAS operations
黑马笔记---创建不可变集合与Stream流
Data type of pytorch tensor
【芯片方案设计】脉搏血氧仪
Asset security issues or constraints on the development of the encryption industry, risk control + compliance has become the key to breaking the platform
Google发布安全更新,修复Chrome中已被利用的0 day