首页 \ 问答 \ Apple的iCloud阻止来自我网站的电子邮件(Apple's iCloud blocking emails from my website)

Apple的iCloud阻止来自我网站的电子邮件(Apple's iCloud blocking emails from my website)

 我正在开发一个Web应用程序，并且在使用最基本的功能时遇到问题，发送电子邮件。 我的电子邮件代码确实有效，我可以整天发送到gmail，yahoo和我的工作电子邮件地址。 问题是，当Web应用程序尝试发送到Apple iCloud电子邮件地址时，电子邮件永远不会成功。 我已经检查了电子邮件服务器日志，它确实发送了，这会让我相信Apple在他们到达用户之前以某种方式阻止了我的电子邮件。  
 系统设置  
 
  通过GoDaddy购买的域名。 我设置了一个DNS A记录，将所有访问该域名的流量转发到我们的虚拟服务器，该服务器托管在1and1  
  虚拟服务器是Windows 2008服务器。 我将其设置为实际发送电子邮件的电子邮件服务器，而不是通过GoDaddy进行中继。 注意：在上面，我所做的只是添加一个*。 在iis电子邮件配置中输入  
 
 下面是我的PHP测试代码，它发送到每个没有问题的地方，除了iCloud。  
mail("person@me.com", "test", "this is a plain test", 'From: Site <no-    reply@domainname.com>');
 
 任何帮助将不胜感激！ 

I am working on a web application, and am having trouble with the most basic of functions, sending an email. My email code does work, I can send to gmail, yahoo, and my work email address all day long. The problem is that when ever the web application attempts to send to an Apple iCloud email address, the email never makes it. I've checked the email server logs, and it does send, which would lead me to believe that Apple is somehow blocking my emails before they ever reach the user.  
System Setup 
 
 Domain name purchased through GoDaddy. I set up a DNS A record to forward all traffic that hits that domain name to our virtual server, which is hosted at 1and1 
 The virtual server is a windows 2008 server. I set it up as an email server that actually sends the email itself, as opposed to relaying through GoDaddy. Note: on the above, all i did was add a *. entry in the iis email configuration 
 
Below is my PHP test code, that sends to every where with no problems, except iCloud.  
mail("person@me.com", "test", "this is a plain test", 'From: Site <no-    reply@domainname.com>');
 
Any help would be greatly appreciated!

原文：https://stackoverflow.com/questions/17526457

更新时间：2023-12-03 15:12

最满意答案

 这里有一些代码可能很复杂但递归！  
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void sierpinsky(int N, char c[1000]){
    int i=0,j,k,l,born;

    for(i=0;i<N;i++){printf("%c",c[i]);}
    printf("\n");

    if(N==1){}
    else{
        if((c[0]=='#')&&(c[1]=='#')&&(c[2]=='#')){
            for (j=0;2*j<N;j++){
                if(c[2*j]=='#'){
                    c[2*j]='#';c[2*j+1]=' ';
                }
                else{
                    c[2*j]=' ';c[2*j+1]=' ';
                }
            }
        }
        else if ((c[0]=='#')&&(c[1]!='#')&&(c[2]=='#')){
                for (j=0;4*j<N;j++){
                    if(c[4*j]=='#'){
                        c[4*j]='#';c[4*j+1]='#';c[4*j+2]=' ';c[4*j+3]=' ';
                    }
                    else{
                        c[4*j]=' ';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                    }
                }
            }
        else if ((c[0]=='#')&&(c[1]!='#')&&(c[2] !='#')){
                k=0;
            while(c[k+1] !='#'){k++;}
            born = k+1;
            j=0;

            while(j<N){
                if((c[j]=='#')&&(c[j+born]=='#')){
                for(l=0;l<born;l++){
                    c[j+l]='#';
                    }
                    j=j+born+1;
                }

                else if ((c[j]!='#')&&(c[j-1+born]=='#')&&(c[j-1+2*born] !='#'))
                {
                    c[j-1]='#';
                    for(l=0;l<born;l++){
                        c[j+l]='#';
                    }
                    j=j+born+1;
                }
                else{
                    c[j-1]= ' ';
                    c[j]=' ';
                    j++;
                }
            }
        }
        else if ((c[0] =='#')&&(c[1] =='#')&&(c[2] !='#')){
            for (j=0;4*j<N;j++){
                if(c[4*j]=='#'){
                    c[4*j]='#';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                }
                else{
                    c[4*j]=' ';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                }
            }

        }
            else{}

            sierpinsky(N-1, c);
        }
    }

int main()
{   int i,size;
    scanf("%d",&size);
    char c[1000];
    for(i=0;i<size;i++){c[i]='#';}
    for(i=size;i<1000;i++){c[i]='a';}
    sierpinsky(size, c);
}

Here's some code that is perhaps complicated but recursive !  
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void sierpinsky(int N, char c[1000]){
    int i=0,j,k,l,born;

    for(i=0;i<N;i++){printf("%c",c[i]);}
    printf("\n");

    if(N==1){}
    else{
        if((c[0]=='#')&&(c[1]=='#')&&(c[2]=='#')){
            for (j=0;2*j<N;j++){
                if(c[2*j]=='#'){
                    c[2*j]='#';c[2*j+1]=' ';
                }
                else{
                    c[2*j]=' ';c[2*j+1]=' ';
                }
            }
        }
        else if ((c[0]=='#')&&(c[1]!='#')&&(c[2]=='#')){
                for (j=0;4*j<N;j++){
                    if(c[4*j]=='#'){
                        c[4*j]='#';c[4*j+1]='#';c[4*j+2]=' ';c[4*j+3]=' ';
                    }
                    else{
                        c[4*j]=' ';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                    }
                }
            }
        else if ((c[0]=='#')&&(c[1]!='#')&&(c[2] !='#')){
                k=0;
            while(c[k+1] !='#'){k++;}
            born = k+1;
            j=0;

            while(j<N){
                if((c[j]=='#')&&(c[j+born]=='#')){
                for(l=0;l<born;l++){
                    c[j+l]='#';
                    }
                    j=j+born+1;
                }

                else if ((c[j]!='#')&&(c[j-1+born]=='#')&&(c[j-1+2*born] !='#'))
                {
                    c[j-1]='#';
                    for(l=0;l<born;l++){
                        c[j+l]='#';
                    }
                    j=j+born+1;
                }
                else{
                    c[j-1]= ' ';
                    c[j]=' ';
                    j++;
                }
            }
        }
        else if ((c[0] =='#')&&(c[1] =='#')&&(c[2] !='#')){
            for (j=0;4*j<N;j++){
                if(c[4*j]=='#'){
                    c[4*j]='#';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                }
                else{
                    c[4*j]=' ';c[4*j+1]=' ';c[4*j+2]=' ';c[4*j+3]=' ';
                }
            }

        }
            else{}

            sierpinsky(N-1, c);
        }
    }

int main()
{   int i,size;
    scanf("%d",&size);
    char c[1000];
    for(i=0;i<size;i++){c[i]='#';}
    for(i=size;i<1000;i++){c[i]='a';}
    sierpinsky(size, c);
}

Apple的iCloud阻止来自我网站的电子邮件(Apple's iCloud blocking emails from my website)

最满意答案

相关问答

预测三角形是否可以在C中形成3个角度（和三角形的类型）(Predict if triangle can be formed with 3 angles (and type of triangle) in C)[2022-05-20]

C编程语言三角形邻接(C programming language triangle adjacency)[2024-03-18]

c - Sierpinsky三角形中的分形(A fractal in c - Sierpinsky triangle)[2021-02-16]

TkInter python - 在画布上创建点以获得Sierpinsky三角形(TkInter python - creating points on a canvas to obtain a Sierpinsky triangle)[2023-01-21]

如何检查三边是否在C ++中形成一个三角形(How to check if 3 sides form a triangle in C++)[2023-03-31]

在CSS中创建三角形标记(Creating a Triangle marker in CSS)[2022-03-30]

普通和UpsideDown C ++中的恒星三角形(Normal And UpsideDown Triangle of stars in C++)[2022-11-16]

如何旋转三角形？(How to rotate a triangle?)[2022-12-04]

查找三角形中某点的Z值[关闭](Finding the Z value of a point in a Triangle [closed])[2022-11-18]

有条件地用下三角形替换矩阵上三角形元素(Conditionally replace matrix upper-triangle elements with lower-triangle)[2022-01-16]

相关文章

最新问答