zoukankan      html  css  js  c++  java
  • c++ http GET 例子

    #include <winsock2.h>
    #include
    <windows.h>
    #include
    <stdio.h>
    #pragma comment(lib, "ws2_32.lib")

    int main(int argc, char* argv[])
    {
       
    char server_name[256]=www.aidsex.cn; WSADATA wsaData;

        struct sockaddr_in    srv_addr;

       
    if (WSAStartup(0x202,&wsaData) == SOCKET_ERROR) {
            WSACleanup();
           
    return-1;
        }

        SOCKET cli_sock
    =socket(PF_INET,SOCK_STREAM,0);
       
    if (cli_sock==INVALID_SOCKET)
           
    return-1;

       
    // connect to server

        srv_addr.sin_family
    = AF_INET;
        LPHOSTENT lphost
    = gethostbyname(server_name);
       
    if (lphost != NULL)
            srv_addr.sin_addr.s_addr
    = ((LPIN_ADDR)lphost->h_addr)->s_addr;
        srv_addr.sin_port
    = ntohs(80);
       
    if (connect(cli_sock,(LPSOCKADDR)&srv_addr,sizeof(srv_addr))==SOCKET_ERROR){
           
    return-1;
        }

       
    char sz[]="GET / HTTP/1.1\r\nHost:www.aidsex.cn\r\n\r\n";
       
    int retval = send(cli_sock,sz,sizeof(sz)-1,0);
       
    if( SOCKET_ERROR == retval )
           
    return0;
       
    char buffer[1024]={0};
       
    while( SOCKET_ERROR != retval ){
            retval
    = recv(cli_sock ,buffer,1000,0);
            printf(
    "%s\n",buffer);
        }
        closesocket(cli_sock);
       
    return0;
    }

  • 相关阅读:
    luogu P5494 【模板】线段树分裂
    珂朵莉树(ODT)
    luogu P5787 二分图 /【模板】线段树分治
    线段树
    luogu P1450 [HAOI2008]硬币购物
    树形DP
    luogu P3047 [USACO12FEB]Nearby Cows G
    1069: 向Z同学学习
    1067: 有问题的里程表
    1066: 字符分类统计
  • 原文地址:https://www.cnblogs.com/rollrock/p/2439059.html
Copyright © 2011-2022 走看看