195080410 李荪玮

T5

  1. #include <stdio.h>
  2. int main() {
  3. int n=1,count=1,result=0;
  4. while (n<=101){
  5. result+=n*count;
  6. count*=-1;
  7. n+=2;
  8. }
  9. printf("%d",result);
  10. return 0;
  11. }

T6

  1. #include <stdio.h>
  2. float Process(int n){
  3. float result;
  4. result=1-1.0/(n+1);
  5. return result;
  6. }
  7. int main() {
  8. int n;
  9. scanf("%d",&n);
  10. printf("%f",Process(n));
  11. return 0;
  12. }

T7

  1. #include <stdio.h>
  2. int isPrime(int n) {
  3. for (int i = 2; i < n; ++i) {
  4. if (n % i == 0)return 0;
  5. }
  6. return 1;
  7. }
  8. int main() {
  9. int count = 1,flag=0;
  10. for (int i = 1; i <= 100; ++i) {
  11. if (isPrime(i)){
  12. flag++;
  13. printf("%d ", count);
  14. }
  15. count++;
  16. if (flag == 10) {
  17. flag = 0;
  18. printf("\n");
  19. }
  20. }
  21. return 0;
  22. }

T9

  1. #include <stdio.h>
  2. int fun(char *str) {
  3. int count = 0;
  4. while (*str != '\0') {
  5. if (*str >= '0' && *str <= '9')count++;
  6. str++;
  7. }
  8. return count;
  9. }
  10. int main() {
  11. char str[40];
  12. scanf("%s", str);
  13. printf("%d", fun(str));
  14. return 0;
  15. }