以下C++程序中，可正确计算[n,m]区间（包含两端）内数字d出现总次数的是哪一项？

int n,m,res,d;
cin >> n >> m >> d;
for(int i = n+1; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res,d;
cin >> n >> m >> d;
for(int i = n; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 = d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res=0,d;
cin >> n >> m >> d;
for(int i = n; i <= m; i++){
    int temp = i;
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;

int n,m,res=0,d;
cin >> n >> m >> d;
for(int i = n; i <= m; i++){
    while(temp){
        if(temp % 10 == d) res++;
        temp /= 10;
    }
}
cout << res << endl;
return 0;