1
#include<stdio.h>
2
int main(void)
3
{
4
  int a,b,c,n;
5
  scanf("%d %d %d",&a,&b,&c);
6
  if (a<(b<c?b:c))//a是最小值
7
    printf("%d %d %d",(b>c?b:c),(b>c?c:b),a);
8
  else if (a>(b>c?b:c))
9
    printf("%d %d %d",a,(b>c?b:c),(b>c?c:b));
10
  else
11
    printf("%d %d %d",(b>c?b:c),a,(b>c?c:b));
12
  return 0;
13
}

1
#include<stdio.h>
2
#include<math.h>
3
int main(void)
4
{
5
    int N=200,i,flag,count=0;
6
    for (i=100;i <= N;i++)
7
    {
8
        flag = 1;
9
        int n = (int)sqrt(i);
10
        for (int k=2;k<=n;k++)
11
        {
12
            if (i%k == 0)
13
            {
14
                flag = 0;
15
                break;
16
            }
17
        }
18
        if (flag)
19
        {
20
            printf("%5d",i);
21
            count +=1;
22
            if (count==8)
23
            {
24
                printf("\n");
25
                count = 0;
26
            }
27
        }
28
    }
29
    return 0;
30
}

1
#include<stdio.h>
2
#include<math.h>
3

4
int isprime(int);
5

6
int main(void)
7
{
8
    int n, i = 2;
9
    int N = 0, p = 0;
10
    int a[101];
11
    scanf("%d", &n);
12
    N = n;
13
    while (N > 1)
14
    {
15
        while (N % i == 0 && isprime(i))
16
        {
17
            N /= i;
18
            a[p++] = i;
19
        }
20
        i++;
21
    }
22
    printf("%d=", n);
23
    for (int j = 0; j < p; j++)
24
    {
25
        if (j<p-1)
26
            printf("%d*", a[j]);
27
        else
28
            printf("%d", a[j]);
29
    }
30
    if (p == 0)
31
        printf("%d", n);
32
    return 0;
33
}
34

35
int isprime(int n)
36
{
37
    if (n < 2)
38
        return 0;
39
    for (int k = 2; k <= (int)sqrt(n); k++)
40
    {
41
        if (n % k == 0)
42
        {
43
            return 0;
44
        }
45
    }
46
    return 1;
47
}