• ▸ PHP
• ▸ Java
• ▸ Java SE
• ▸ Python
• ▸ C#
• ▸ C&C++
• ▸ Ruby
• ▸ VB
• ▸ asp.Net
• ▸ Go
• ▸ Perl
• ▸ netty
• ▸ Django
• ▸ Delphi
• ▸ Jsp
• ▸ .NET Core
• ▸ Spring
• ▸ Flask
• ▸ Springboot
• ▸ SpringMVC
• ▸ Lua
• ▸ Laravel
• ▸ Mybatis
• ▸ Asp
• ▸ Groovy
• ▸ ThinkPHP
• ▸ Yii
• ▸ swoole
• ▸ HTML
• ▸ HTML5
• ▸ JavaScript
• ▸ CSS
• ▸ jQuery
• ▸ Bootstrap
• ▸ Angularjs
• ▸ TypeScript
• ▸ Vue
• ▸ Dojo
• ▸ Json
• ▸ Electron
• ▸ Node.js
• ▸ extjs
• ▸ Express
• ▸ XML
• ▸ ES6
• ▸ Ajax
• ▸ Flash
• ▸ Unity
• ▸ React
• ▸ Flex
• ▸ Ant Design
• ▸ Web前端
• ▸ 微信小程序
• ▸ 微信公众号
• ▸ iOS
• ▸ Android
• ▸ Swift
• ▸ Hybrid
• ▸ Cocos2d-x
• ▸ Flutter
• ▸ Xcode
• ▸ Silverlight
• ▸ cocoa
• ▸ Cordova

• 前端之家
• 设计模式
• 百度之星资格赛2015IP聚合

2
5 2
192.168.1.0
192.168.1.101
192.168.2.5
192.168.2.7
202.14.27.235
255.255.255.0
255.255.0.0
4 2
127.127.0.1
10.134.52.0
127.0.10.1
10.134.0.2
235.235.0.0
1.57.16.0

之前题目理解错了，以为是要输出同子网掩码下在同一网段的IP个数。

实际上是统计那n个地址在那个子网掩码下有多少个不同的网段。

#include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;

vector<string> str_vec(string a)
{
    vector<string> res;
    string tmp;
    for (int i = 0; i < a.size(); i++)
    {
        if (a[i] == '.')
        {
            res.push_back(tmp);
            tmp.clear();
            continue;
        }
        if (i == a.size() - 1)
        {
            tmp = tmp + a[i];
            res.push_back(tmp);
            break;
        }
        tmp = tmp + a[i];
    }
    return res;
}

vector<int> str_int(vector<string> a)
{
    vector<int> ans;
    for (int i = 0; i < a.size(); i++)
    {
        string tmp = a[i];
        int len = a[i].size();
        int res = 0;
        for (int j = 0; j < len; j++)
        {
            res = res * 10 + (a[i][j] - '0');
        }
        ans.push_back(res);
    }
    return ans;
}

vector<int> net_code(vector<int> a,vector<int> b)
{
    vector<int>ans;
    for (int i = 0; i < 4; i++)
    {
        int tmp = a[i] & b[i];
        ans.push_back(tmp);
    }
    return ans;
}

int main()
{

    int t;
    cin >> t;
    for(int tt = 1; tt <= t;tt++)
    {
        int n,m;
        cin >> n >> m;
        string s;
        vector<vector<int> > nn;
        vector<vector<int> > mm;
        vector<string> s1;
        vector<int>s2;
        for (int i = 0; i < n; i++)
        {
            cin >> s;
            s1 = str_vec(s);
            s2 = str_int(s1);
            nn.push_back(s2);
        }

        for (int i = 0; i < m; i++)
        {
            cin >> s;
            s1 = str_vec(s);
            s2 = str_int(s1);
            mm.push_back(s2);
        }
        cout << "Case #" << tt << ":" << endl;
        for (int i = 0; i < m; i++)
        {
            map<vector<int>,int>mp;
            for (int j = 0; j < n; j++)
            {
                mp[net_code(mm[i],nn[j])]++;
            }
            cout << mp.size() << endl;
        }
    }
    //system("pause");
    return 0;
}