| 18856 | 2025-11-07 14:46:22 | diak | Binária könyvtára | cpp17 | Wrong answer 36/100 | 4ms | 756 KiB |
// NOTE: it is recommended to use this even if you don't understand the following code.
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// uncomment the two following lines if you want to read/write from files
// ifstream cin("input.txt");
// ofstream cout("output.txt");
int N;
cin >> N;
vector<int> T(N);
for (int i = 0; i < N; ++i)
cin >> T[i];
int B = 0;
int polcdb,kosszeg,kh,kellkonyv=0;
// INSERT YOUR CODE HERE
for (int i = 0; i < N; ++i){
polcdb = T[i];
kh= 1;
kosszeg= 1;
while(kosszeg<polcdb){
kh*=2;
kosszeg+=kh;
}
kellkonyv+=kosszeg-polcdb;
}
cout<< kellkonyv;
return 0;
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| 3 | Wrong answer | 1ms | 316 KiB | ||||
| subtask2 | 4/4 | ||||||
| 4 | Accepted | 1ms | 316 KiB | ||||
| 5 | Accepted | 1ms | 316 KiB | ||||
| 6 | Accepted | 1ms | 316 KiB | ||||
| 7 | Accepted | 1ms | 316 KiB | ||||
| 8 | Accepted | 1ms | 316 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| 10 | Accepted | 1ms | 316 KiB | ||||
| 11 | Accepted | 1ms | 316 KiB | ||||
| 12 | Accepted | 1ms | 316 KiB | ||||
| 13 | Accepted | 1ms | 316 KiB | ||||
| subtask3 | 32/32 | ||||||
| 14 | Accepted | 1ms | 316 KiB | ||||
| 15 | Accepted | 1ms | 316 KiB | ||||
| 16 | Accepted | 1ms | 316 KiB | ||||
| 17 | Accepted | 1ms | 316 KiB | ||||
| 18 | Accepted | 1ms | 316 KiB | ||||
| 19 | Accepted | 1ms | 316 KiB | ||||
| 20 | Accepted | 1ms | 316 KiB | ||||
| 21 | Accepted | 1ms | 316 KiB | ||||
| 22 | Accepted | 1ms | 316 KiB | ||||
| 23 | Accepted | 1ms | 316 KiB | ||||
| 24 | Accepted | 1ms | 316 KiB | ||||
| 25 | Accepted | 1ms | 316 KiB | ||||
| 26 | Accepted | 1ms | 316 KiB | ||||
| 27 | Accepted | 1ms | 316 KiB | ||||
| 28 | Accepted | 1ms | 316 KiB | ||||
| 29 | Accepted | 1ms | 316 KiB | ||||
| 30 | Accepted | 1ms | 316 KiB | ||||
| 31 | Accepted | 1ms | 372 KiB | ||||
| 32 | Accepted | 1ms | 316 KiB | ||||
| subtask4 | 0/64 | ||||||
| 33 | Accepted | 1ms | 316 KiB | ||||
| 34 | Accepted | 1ms | 316 KiB | ||||
| 35 | Wrong answer | 1ms | 316 KiB | ||||
| 36 | Accepted | 1ms | 316 KiB | ||||
| 37 | Accepted | 1ms | 316 KiB | ||||
| 38 | Accepted | 1ms | 316 KiB | ||||
| 39 | Accepted | 1ms | 316 KiB | ||||
| 40 | Accepted | 1ms | 316 KiB | ||||
| 41 | Accepted | 1ms | 316 KiB | ||||
| 42 | Accepted | 1ms | 316 KiB | ||||
| 43 | Accepted | 1ms | 316 KiB | ||||
| 44 | Accepted | 1ms | 316 KiB | ||||
| 45 | Accepted | 1ms | 316 KiB | ||||
| 46 | Accepted | 1ms | 316 KiB | ||||
| 47 | Accepted | 1ms | 316 KiB | ||||
| 48 | Accepted | 1ms | 316 KiB | ||||
| 49 | Accepted | 1ms | 316 KiB | ||||
| 50 | Accepted | 1ms | 316 KiB | ||||
| 51 | Accepted | 1ms | 316 KiB | ||||
| 52 | Accepted | 1ms | 316 KiB | ||||
| 53 | Accepted | 1ms | 372 KiB | ||||
| 54 | Accepted | 1ms | 316 KiB | ||||
| 55 | Accepted | 1ms | 316 KiB | ||||
| 56 | Wrong answer | 4ms | 316 KiB | ||||
| 57 | Wrong answer | 2ms | 564 KiB | ||||
| 58 | Wrong answer | 2ms | 564 KiB | ||||
| 59 | Wrong answer | 2ms | 756 KiB | ||||
| 60 | Wrong answer | 2ms | 564 KiB | ||||
| 61 | Wrong answer | 2ms | 564 KiB | ||||
| 62 | Wrong answer | 2ms | 564 KiB | ||||
| 63 | Wrong answer | 2ms | 564 KiB | ||||
| 64 | Wrong answer | 2ms | 564 KiB | ||||