QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#692753#7512. Almost Prefix ConcatenationafyTL 0ms0kbC++20387b2024-10-31 14:59:452024-10-31 14:59:59

Judging History

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

  • [2024-10-31 14:59:59]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-10-31 14:59:45]
  • 提交

answer

// #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
signed main() {
    int n = 4E3;
    bitset<30> ans;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j += 2) {
            for (int k = 1; k <= n; k += 4) {
                ans |= i | j | k;
            }
        }
    }
    cout << ans.to_ullong() << "\n";
}

詳細信息

Test #1:

score: 0
Time Limit Exceeded

input:

ababaab
aba

output:


result: