题解 | #牛牛学数列2#
牛牛学数列2
https://www.nowcoder.com/practice/fc72951f52984f3abd286d82eeffacba
#include <stdio.h> double qudao(int num)//取倒数 { double result=1.000000/num; return result; } int main() { int num,i; double sum = 0; scanf("%d",&num); for(i = 1;i<=num;i++) { sum +=qudao(i); } printf("%.6lf",sum); return 0; }