# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44419 | wzy | Carnival (CEOI14_carnival) | C++11 | 22 ms | 708 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int c[160];
int dp[160][160];
int n ;
int query(int l , int r){
if(l == r) return 1;
cout<<(r - l + 1)<<" ";
for(int i = l ; i <= r ;i ++){
cout<<i<<" ";
}
cout<<endl;
int x;
cin>>x;
return x;
}
int main(){
cin>>n;
for(int i = 1 ; i <=n ; i++){
c[i] = i;
if(i == 1){
dp[i][i] = 1;
for(int j = 2 ; j <= n ; j++){
cout<<(j - i + 1)<<" ";
for(int w = 1 ; w <= j ; w++){
cout<<w<<" ";
}
cout<<endl;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |