POJ 2105 IP Address（简单模拟）

来源：互联网发布：淘宝助理批量下架编辑：程序博客网时间：2024/06/14 09:49

题目地址：http://poj.org/problem?id=2105

思路：模拟

AC代码：

#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <queue>#include <stack>#include <map>#include <cstring>#include <climits>#include <cmath>#include <cctype>const int inf = 0x3f3f3f3f;//1061109567typedef long long LL;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1using namespace std;char a[40];int main(){    int t;    scanf("%d",&t);    while(t--)    {        scanf("%s",a+1);        int sum = 0;        for(int i=1; i<=8; i++)        {            int x = 8 - i;            sum +=(a[i] - '0')* pow(2,x);        }        printf("%d.",sum);        sum = 0;        for(int i=9; i<=16; i++)        {            int x = 16 - i;            sum +=(a[i] - '0')* pow(2,x);        }        printf("%d.",sum);        sum = 0;        for(int i=17; i<=24; i++)        {            int x = 24 - i;            sum +=(a[i] - '0')* pow(2,x);        }        printf("%d.",sum);        sum = 0;        for(int i=25; i<=32; i++)        {            int x = 32 - i;            sum +=(a[i] - '0')* pow(2,x);        }        printf("%d\n",sum);    }    return 0;}

0 0