当前位置:网站首页>Xiaoqingtai officially set foot on the third day of no return

Xiaoqingtai officially set foot on the third day of no return

2020-11-08 13:52:17 osc_3vp99iw6

Xiaoqingtai officially set foot on the road of no return 3 God

Look at the notes before
Look at the current level
I can't help but flow down Regretful Tears

Do your homework. It's fun to do it ( Catch ) Cause ( ear ) Bo ( Scratch ) Bo ( Gill )
I'd like to have my hair pulled out
There's so much bullshit
Well, I'm going to record every simple question that I just can't do TAT


  1. Given two numbers , Find the greatest common divisor of these two numbers
    < I hate common divisors >
#include <stdio.h>
int main()
{
   
   
	int a,b,c,i;
	scanf("%d%d",&a,&b);
	if (a < b)
	{
   
   
        c = a; a = b; b = c;
    }
    for (i = b;i <= a; i--)
	{
   
   if (a % i == 0 && b % i == 0)
	 {
   
   
      printf(" The greatest common divisor is :");
	  printf("%d\n",i);
      break;
     }
	}
	return 0;
}
  1. Print 1000 Year to 2000 Leap year between years
    < I also hate leap year >
#include <stdio.h>
int main()
{
   
   
	int i;
	printf(" Interval leap years have :");
    for(i=1000;i<2001;i+=4)
    {
   
   
    	if(i%4==0)
    	{
   
   
			printf("%d\n",i); 
		}
	}
	return 0;
}
  1. Calculation 1/1-1/2+1/3-1/4+1/5 …… + 1/99 - 1/100 Value , Print out the results
    < It's practical to do this problem 40min I'm stone >
 Calculation 1/1-1/2+1/3-1/4+1/5 …… + 1/99 - 1/100  Value , Print out the results 
#include <stdio.h>
int main()
{
   
   
	int i;
	float sum=1;
	printf(" The sum of the required items is :");
    for(i=2;i<=100;i++)
    {
   
   
    	if(i%2==0)
		{
   
   
    	sum+=-1.0/i;
		}
    	else{
   
   
    	sum+=1.0/i;
		}
	}
	printf("%f\n",sum);
	return 0;
}
  1. 1 To 100 How many numbers appear in all integers of 9
#include <stdio.h>
int main()
{
   
   
	int i,j=0;
	printf(" Numbers 9 The number of :");
    for(i=1;i<101;i++)
    {
   
   
    if(i%10==9)
    {
   
   
	j++;
	}
	}
	printf("%d",j);
	return 0;
}
  1. Print 100~200 The prime between
    < prime number = Abnormal number >
#include <stdio.h>
int main()
{
   
   
	int i,j;
	printf(" Prime numbers have intervals :");
    for(i=100;i<=200;i++)
    {
   
   
    	for(j=2;j<i;j++)
		{
   
   
		  if(i%j==0)
    	  {
   
   
	       break;
		  }
		}
		if(i==j)
		{
   
   
		printf("%d\n",i);
	    }
	    }
	return 0;
}
  1. Output... On the screen 99 Multiplication table
#include<stdio.h>

int main()
{
   
   
    int i=0;
    for(i=1;i<=9;i++)
    {
   
   
     int j=0;
     for(j=1;j<=i;j++)
     {
   
   
       printf("%d*%d=%d ",i,j,i*j);
     }
    printf("\n");
    }
return 0;
}
  1. seek 10 The maximum of integers
#include <stdio.h>
int main()
{
   
   
  int a[11],i;
  for(i=1;i<=10;i++)
  {
   
   
    scanf("%d",&a[i]);
  }
  a[0]=a[1];
  for(i=1;i<=10;i++)
  {
   
   
    if(a[i]>=a[0]) a[0]=a[i];
  }
  printf(" The maximum value is :");
  printf("%d\n",a[0]);
  return 0;
}

Total time 120min;
total error n Time ;
Total collapse n+1 Time ;

版权声明
本文为[osc_3vp99iw6]所创,转载请带上原文链接,感谢