195080410 李荪玮
T5
#include <stdio.h>int main() { int n=1,count=1,result=0; while (n<=101){ result+=n*count; count*=-1; n+=2; } printf("%d",result); return 0;}
T6
#include <stdio.h>float Process(int n){ float result; result=1-1.0/(n+1); return result;}int main() { int n; scanf("%d",&n); printf("%f",Process(n)); return 0;}
T7
#include <stdio.h>int isPrime(int n) { for (int i = 2; i < n; ++i) { if (n % i == 0)return 0; } return 1;}int main() { int count = 1,flag=0; for (int i = 1; i <= 100; ++i) { if (isPrime(i)){ flag++; printf("%d ", count); } count++; if (flag == 10) { flag = 0; printf("\n"); } } return 0;}
T9
#include <stdio.h>int fun(char *str) { int count = 0; while (*str != '\0') { if (*str >= '0' && *str <= '9')count++; str++; } return count;}int main() { char str[40]; scanf("%s", str); printf("%d", fun(str)); return 0;}