QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #123635 | #6661. 야유회 | lcjlcj | Compile Error | / | / | C++14 | 555b | 2023-07-13 07:56:10 | 2023-07-13 07:56:14 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-07-13 07:56:14]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2023-07-13 07:56:10]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5;
int f1[maxn+5],f2[maxn+5],f3[maxn+5];
void init() {
int cnt=0;
for (int i=0;i<(1<<20);i++) {
if (__builtin_popcount(i)==10) {
f1[cnt++]=i;
}
}
cnt=0;
for (int i=0;i<(1<<6);i++) {
if (__builtin_popcount(i)==3) {
f2[cnt++]=i;
}
}
cnt=0;
for (int i=0;i<(1<<6);i++) {
if (__builtin_popcount(i)==2) {
f3[cnt++]=i;
}
}
}
int F1(,int f[],int u,int v) {
int x=u,y=v;
for (int i=0;i<(1<<))
}
int morning(int x,int y) {
}
詳細信息
answer.code:28:8: error: expected primary-expression before ‘,’ token
28 | int F1(,int f[],int u,int v) {
| ^
answer.code:28:9: error: expected primary-expression before ‘int’
28 | int F1(,int f[],int u,int v) {
| ^~~
answer.code:28:17: error: expected primary-expression before ‘int’
28 | int F1(,int f[],int u,int v) {
| ^~~
answer.code:28:23: error: expected primary-expression before ‘int’
28 | int F1(,int f[],int u,int v) {
| ^~~
answer.code:28:28: error: expression list treated as compound expression in initializer [-fpermissive]
28 | int F1(,int f[],int u,int v) {
| ^
answer.code: In function ‘int morning(int, int)’:
answer.code:34:1: warning: no return statement in function returning non-void [-Wreturn-type]
34 | }
| ^