
求公式(p∨q)→t的主析取,主合取范式和成假赋值,并判别该公式类型
1个回答
2017-09-23
展开全部
#include <stdio.h>
#include <math.h>
#define MAX_SIZE 101
#define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t))
void sort(int[], int); /* selection sort */
void main(void)
{
int i, n;
int list[MAX_SIZE];
printf("Enter the number of numbers to generate: ");
scanf_s("%d", &n);
if (n < 1 || n > MAX_SIZE){
fprintf(stderr, "Improper value of n\n");
exit(1);
}
for (i = 0; i < n; i++){ /* randomly generate numbers */
list[i] = rand() * 1000;
printf("%d ", list[i]);
#include <math.h>
#define MAX_SIZE 101
#define SWAP(x, y, t) ((t) = (x), (x) = (y), (y) = (t))
void sort(int[], int); /* selection sort */
void main(void)
{
int i, n;
int list[MAX_SIZE];
printf("Enter the number of numbers to generate: ");
scanf_s("%d", &n);
if (n < 1 || n > MAX_SIZE){
fprintf(stderr, "Improper value of n\n");
exit(1);
}
for (i = 0; i < n; i++){ /* randomly generate numbers */
list[i] = rand() * 1000;
printf("%d ", list[i]);
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询
广告 您可能关注的内容 |