1.国际象棋棋盘
#include<stdio.h>
#include<conio.h>
int main()
{
int i, j;
for (i = 0; i < 8; i++)
{
for (j = 0; j < 8; j++)
if ((i + j) % 2 == 0)
printf("%c%c", 219, 219);
else printf(" ");
printf("\n");
}
getchar();
getchar();
return 0;
}
#include<conio.h>
int main()
{
int i, j;
for (i = 0; i < 8; i++)
{
for (j = 0; j < 8; j++)
if ((i + j) % 2 == 0)
printf("%c%c", 219, 219);
else printf(" ");
printf("\n");
}
getchar();
getchar();
return 0;
}
2.因式分解
#include<stdio.h>
int main()
{
int i, n,k,j;
printf("the n:\n");
scanf_s("%d", &n);
printf("%d=", n);
for (i = 2; i < n; i++)
{
if (n%i == 0)
{
#include<stdio.h>
int main()
{
int i, n,k,j;
printf("the n:\n");
scanf_s("%d", &n);
printf("%d=", n);
for (i = 2; i < n; i++)
{
if (n%i == 0)
{
printf("%d", i);
n = n / i;
printf("*");
if (n%i == 0)
{
printf("%d", i);
n = n / i;
printf("*");
printf("%d", n);
}
else continue;
n = n / i;
printf("*");
if (n%i == 0)
{
printf("%d", i);
n = n / i;
printf("*");
printf("%d", n);
}
else continue;
}
else continue;
}
getchar();
getchar();
return 0;
}
else continue;
}
getchar();
getchar();
return 0;
}
3.因式分解
#include<stdio.h>
int main()
{
int i, n;
printf("the n:\n");
scanf_s("%d", &n);
printf("%d=", n);
for (i = 2; i <= n; i++)
{
while (n>i)
{
if (n%i == 0)
{
printf("%d", i);
n = n / i;
printf("*");
}
#include<stdio.h>
int main()
{
int i, n;
printf("the n:\n");
scanf_s("%d", &n);
printf("%d=", n);
for (i = 2; i <= n; i++)
{
while (n>i)
{
if (n%i == 0)
{
printf("%d", i);
n = n / i;
printf("*");
}
else break;
}
}
printf("%d", n);
getchar();
getchar();
return 0;
}
}
}
printf("%d", n);
getchar();
getchar();
return 0;
}
4.用条件运算符
#include<stdio.h>
int main()
{
int score;
char grade;
printf("the score:\n");
scanf_s("%d", &score);
getchar();
getchar();
grade=score >= 90 ? 'a' : (score >= 60 ? 'b' : 'c');
printf("%c", grade);
getchar();
getchar();
return 0;
}
#include<stdio.h>
int main()
{
int score;
char grade;
printf("the score:\n");
scanf_s("%d", &score);
getchar();
getchar();
grade=score >= 90 ? 'a' : (score >= 60 ? 'b' : 'c');
printf("%c", grade);
getchar();
getchar();
return 0;
}
5.求两个数的最小公倍数和最大公因式
#include<stdio.h>
int main()
{
int m, n, temp;
int num1, num2;
printf("the m and n:\n");
scanf_s("%d%d", &m, &n);
if (m<n)
{
temp = m;
m = n;
n = temp;
}
num1=m;
num2=n;
while (n != 0)
{
temp = (m%n);
m = n;
n = temp;
}
printf("the zuidagongyinshu:%d\n", m);
printf("the zuixiaogongyinshu:%d", num1*num2 / m);
getchar();
getchar();
return 0;
}
#include<stdio.h>
int main()
{
int m, n, temp;
int num1, num2;
printf("the m and n:\n");
scanf_s("%d%d", &m, &n);
if (m<n)
{
temp = m;
m = n;
n = temp;
}
num1=m;
num2=n;
while (n != 0)
{
temp = (m%n);
m = n;
n = temp;
}
printf("the zuidagongyinshu:%d\n", m);
printf("the zuixiaogongyinshu:%d", num1*num2 / m);
getchar();
getchar();
return 0;
}