Professional Documents
Culture Documents
#include <stdio.h>
int main(){
int n,Tich=1;
scanf("%d",&n);
if(n<8&&n>=0){
Tich*=i;
printf("%d",Tich);
else printf("ERROR");
return 0;
4.2
#include <stdio.h>
#include <math.h>
int main(){
int n;
scanf("%d",&n);
if(n<2)
return 0;}
if (n%i==0) {
4.3
#include <stdio.h>
#include <math.h>
int n, sum=0 ;
scanf ("%d",&n);
if (n<0||n>1000)
{ printf("ERROR");
return 0; }
while (n>0) {
int cnt=n%10;
sum+=cnt;
n/=10;
printf("%d",sum);
return 0;
4.4
#include <stdio.h>
int main()
{
int m, n;
printf ("ERROR");
return 0;
int a = m;
int b = n;
while (b != 0)
int temp = a;
a = b;
b = temp % b;
int ucln = a;
return 0;
4.10
#include <stdio.h>
#include <math.h>
int main (){
int n;
double x, S=1;
scanf("%lf",&x);
scanf("%d",&n);
if(n<1||x<0) printf("Error");
else{
S = S + (pow(x,i)/i);}
printf("%.4lf",S);
return 0;
4.11
#include <stdio.h>
#include <math.h>
int n;
scanf ("%lf",&x);
scanf ("%d",&n);
if (n<1||x<0) printf("Error");
else{
gt=gt*i;
S = S + (pow(x,i)/gt);
printf("%.4lf",S);
return 0;
4.12
#include <stdio.h>
#include <math.h>
int n;
scanf("%lf",&x);
scanf("%d",&n);
if (n<1||x<0) printf("Error");
else{
gt=gt*i;
S+=(pow(x,i)*pow(-1,i))/gt;
printf("%.4lf",S);
return 0;
}
5.1
#include <stdio.h>
int main () {
int n, S=0 ;
scanf("%d",&n);
int a[n];
if (n<=0) printf("Error");
else{
scanf("%d ",&a[i]);
S=S+a[i];
return 0;
5.2
#include <stdio.h>
int n;
scanf("%d",&n);
int a[n];
for (int i=0; i<n; i++){ //i=0 thi i<n, i=1 thi i<=n
scanf("%d",&a[i]);
if (a[i]>0){
Sduong+=a[i];
demsoduong++;
else if (a[i]<0){
Sam+=a[i];
demsoam++;
else {
tbc=Sam/demsoam;
printf("%lf ",tbc);
else printf("%lf",Sduong);
5.3
#include <stdio.h>
int main() {
int n;
int a[n];
// Bubble Sort
a[j + 1] = temp;
return 0;
5.4
#include <stdio.h>
int main ()
int n;
scanf("%d",&n);
int a[n];
if (n<=0||n>10) return 0;
scanf("%d",&a[i]);
int max=0;
int tich=a[i]*a[i+1];
if (tich>max) max=tich;
printf("%d",max);
return 0;
5.5
#include <stdio.h>
int main ()
int n;
scanf("%d",&n);
int a[n];
if (n<=0||n>10) return 0;
for (int i=0; i<n; i++)
scanf("%d",&a[i]);
int max=0;
int tong=a[i]+a[i+1];
if (tong>max) max=tong;
printf("%d",max);
return 0;