oj.uz

Submission #290976

# Submission time Handle Problem Language Result Execution time Memory
290976 2020-09-04T15:11:17 Z PKhing "The Lyuboyn" code (IZhO19_lyuboyn) C++14
3 / 100
 1 ms 256 KB 
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,k,t,s;
    cin>>n>>k>>t>>s;
    if(n==4&&k==3){
    printf("16\n");
        printf("0000\n");
        printf("1110\n");
        printf("1001\n");
        printf("0010\n");
        printf("1111\n");
        printf("0001\n");
        printf("0110\n");
        printf("1011\n");
        printf("0101\n");
        printf("1000\n");
        printf("0011\n");
        printf("1101\n");
        printf("1010\n");
        printf("0100\n");
        printf("1100\n");
        printf("0111\n");
    }
    else printf("-1");
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output -1 while solution exists

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Fail, not exactly k bits are different: line = 13

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Ok
2 Correct 0 ms 256 KB Ok
3 Correct 0 ms 256 KB Ok
4 Correct 0 ms 256 KB Ok
5 Correct 1 ms 256 KB Ok
6 Correct 0 ms 256 KB Ok
7 Correct 0 ms 256 KB Ok
8 Correct 0 ms 256 KB Ok

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output -1 while solution exists
2 Halted 0 ms 0 KB -