QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#754311#9629. 小 C 的神秘图形Yori#WA 0ms3816kbC++201.0kb2024-11-16 14:43:542024-11-16 14:43:54

Judging History

你现在查看的是最新测评结果

  • [2024-11-16 14:43:54]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3816kb
  • [2024-11-16 14:43:54]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
typedef pair<int, int> PII;
const int N = 2e5+7;
int n, m, k;
int a[N];

string a2[9]={
    "000010000",
    "000111000",
    "000010000",
    "010010010",
    "111111111",
    "010010010",
    "000010000",
    "000111000",
    "000010000"
};

int qmi(int x,int y){
    int res=1;
    while(y){
        if(y&1) res*=x;
        x*=x;
        y>>=1;
    }
    return res;
}

void sovle()
{
    cin>>n;
    string a,b;
    cin>>a>>b;
    int n1=0,n2=0,cnt=1;
    for(int i=a.size()-1;i>=0;i--) n1+=(a[i]-'0')*cnt,cnt*=3;   cnt=1;
    for(int i=b.size()-1;i>=0;i--) n2+=(b[i]-'0')*cnt,cnt*=3;
    for(int i=n;i>=3;i--){
        n1%=qmi(3,i-1);
        n2%=qmi(3,i-1);
    }
    cout<<a2[n1][n2];
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int ING = 1;
    //cin>>ING;
    while (ING--)
    {
        sovle();
    }
    
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3816kb

input:

96
122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022
010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102

output:

1

result:

wrong answer 1st lines differ - expected: '0', found: '1'