# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
11189 | qja0950 | Sequence (BOI14_sequence) | C++98 | 164 ms | 3972 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.
//
// main.cpp
// 32
//
// Created by KJBS2 on 2014. 11. 18..
// Copyright (c) 2014년 KJBS2. All rights reserved.
//
#include <stdio.h>
#define MAXN 101101
typedef long long ll;
int N;
int Nr[MAXN];
void INPUT() {
scanf("%d", &N);
for(int i=0; i<N; i++) {
int x; scanf("%d", &x);
Nr[i] = (1 << x);
}
return;
}
ll Get(int Now[], int n, int pp) {
if(n==1) {
ll ans = 0;
bool iszero = false;
if( (Now[0] >> 0) % 2 == 1 )
# | 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... |