NBUT 1647 （多校连萌3）

来源：互联网发布：淘宝优惠券网站怎么做编辑：程序博客网时间：2024/06/05 16:40

题目地址：https://ac.2333.moe/Problem/view.xhtml?id=1647

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;int a[10000] = {0};void cf(){    for(int i=10; i<=100; i++)    {        a[i*i] = 1;    }}int main(){    int t;    cf();    char b[5];    int c[5];    scanf("%d",&t);    int cas = 1;    while(t--)    {        scanf("%s",b);        for(int i=0; i<4; i++)        {            c[i] = b[i] - '0';        }        int sum1 = 0;        for(int i=0; i<4; i++)        {            for(int j=0; j<=9; j++)            {                if(i == 0 && j == 0)                    continue;                if(c[i] != j)                {                    int temp = c[i];                    c[i] = j;                    int sum = c[0] * 1000 + c[1] * 100 + c[2] * 10 + c[3];                    if(a[sum])                    {                        sum1++;                    }                    c[i] = temp;                }            }        }        printf("Case %d: %d\n",cas++,sum1);    }}

0 0