当前位置:网站首页>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;
}
边栏推荐
- NEON优化:关于交叉存取与反向交叉存取
- Transplant DAC chip mcp4725 to nuc980
- THREE. AxesHelper is not a constructor
- Eventbus source code analysis
- Spark TPCDS Data Gen
- 分享一个通用的so动态库的编译方法
- 前置机是什么意思?主要作用是什么?与堡垒机有什么区别?
- mysql: error while loading shared libraries: libtinfo. so. 5: cannot open shared object file: No such
- THREE.AxesHelper is not a constructor
- Metauniverse urban legend 02: metaphor of the number one player
猜你喜欢
2022 Google CTF segfault Labyrinth WP
Force buckle 1037 Effective boomerang
2022 Google CTF SEGFAULT LABYRINTH wp
【C语言进阶篇】指针的8道笔试题
AI 从代码中自动生成注释文档
2022 Google CTF SEGFAULT LABYRINTH wp
405 method not allowed appears when the third party jumps to the website
Dark horse notes - create immutable sets and streams
boot - prometheus-push gateway 使用
Wood extraction in Halcon
随机推荐
AI automatically generates annotation documents from code
2022 Google CTF SEGFAULT LABYRINTH wp
NEON优化:关于交叉存取与反向交叉存取
[100 cases of JVM tuning practice] 05 - Method area tuning practice (Part 2)
Typical problems of subnet division and super network construction
Maidong Internet won the bid of Beijing life insurance to boost customers' brand value
Taro中添加小程序 “lazyCodeLoading“: “requiredComponents“,
从底层结构开始学习FPGA----FIFO IP的定制与测试
c语言—数组
mysql: error while loading shared libraries: libtinfo. so. 5: cannot open shared object file: No such
「笔记」折半搜索(Meet in the Middle)
Dark horse notes - create immutable sets and streams
安全保护能力是什么意思?等保不同级别保护能力分别是怎样?
How to prevent overfitting in cross validation
子网划分、构造超网 典型题
Vocabulary in Data Book
[Niuke] b-complete square
Neon Optimization: summary of performance optimization experience
Implementation principle of waitgroup in golang
Neon Optimization: an optimization case of log10 function