编程笔记

#include <stdio.h> int main (void) { int triangularNumber; triangularNumber = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8; printf ("The eighth triangular number is %i/n", triangularNumber); return …

#include <stdio.h> #include <stdbool.h> int main (void){ bool isPrime; for (int p = 3; p <= 50; p += 2) { isPrime = true; for (int d = 2; d < p; ++d && isPrime) if (p % d ==…

#include <stdio.h> int main (void) { const char baseDigits[16] = { '0', '1', '2', '3', '4','5', '6', '7', '8', '9'…

#include <stdio.h> int main(void) { int i; const int numFibs = 20; unsigned long long int Fibonacci[numFibs]; Fibonacci[0] = 0; // by definition Fibonacci[1] = 1; // by definition for (i = 2; i…

#include <stdio.h> int main() { int counter = 33; long int lngA, lngB, lngC, lngD; char ch; lngA = 0; lngB = 1; printf("Fibonacci Sequence:/n"); for (int k = 1; k <= counter; k++) …

正整数n的阶乘由n!表示 并定义如下： n! = 1 x 2 x ..... x n 例如： 0! = 1 1! = 1 2! = 1 x 2 = 2 3! = 1 x 2 x 3 = 6 示例代码： #include <stdio.h> int main(){ int counter= 10; unsigned long int res…

#include <stdio.h> int main(){ int counter = 100; unsigned long int sum = 0; for (int i = 1; i <= counter; i++) { sum = sum + i; } printf("Required sum is: %lu/n", sum); return(0);…

素数是一个正整数，只能由1和它本身整除。 #include <stdio.h> #include <math.h> int main() { int flag, isPrime; long int number = 367, result, i; if (number == 2) { printf("/n2 is a pri…

#include <stdio.h> int main() { long int counter = 1234, temp, remainder, reverse; temp = counter; reverse = 0; while (temp > 0){ remainder = temp % 10; reverse = reverse * 10 + remainder; t…

#include <stdio.h> #include <math.h> #define SIZE 100 int status[SIZE]; void sieve() { int i, j, sq; for(i = 0; i < SIZE; i++) { status[i] = 0; } sq = sqrt(SIZE); for(i=4;i<=SIZE;i+…