当前位置:网站首页>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 Optimization: About Cross access and reverse cross access
- Gnet: notes on the use of a lightweight and high-performance go network framework
- ESP Arduino (IV) PWM waveform control output
- Oracle:CDB限制PDB资源实战
- Eventbus source code analysis
- Asset security issues or constraints on the development of the encryption industry, risk control + compliance has become the key to breaking the platform
- Spark TPCDS Data Gen
- Add the applet "lazycodeloading": "requiredcomponents" in taro,
- Send template message via wechat official account
猜你喜欢
随机推荐
Sword finger offer II 035 Minimum time difference - quick sort plus data conversion
Taro2.* applet configuration sharing wechat circle of friends
剑指 Offer II 035. 最小时间差-快速排序加数据转换
安全保护能力是什么意思?等保不同级别保护能力分别是怎样?
[case sharing] basic function configuration of network loop detection
JTAG principle of arm bare board debugging
Analysis of mutex principle in golang
MySQL script batch queries all tables containing specified field types in the database
Meet in the middle
golang中的Mutex原理解析
How to prevent overfitting in cross validation
Do you understand this patch of the interface control devaxpress WinForms skin editor?
Dark horse notes - exception handling
ARM裸板调试之JTAG原理
Machine learning: the difference between random gradient descent (SGD) and gradient descent (GD) and code implementation.
Implementation principle of waitgroup in golang
table表格设置圆角
Neon Optimization: an optimization case of log10 function
[Niuke] [noip2015] jumping stone
Windows installation mysql8 (5 minutes)