Reminder: in case of any technical issues, you can use the lightweight website m1.codeforces.com, m2.codeforces.com, m3.codeforces.com. ×

By awoo, history, 3 years ago, translation,

Hello Codeforces!

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extented ACM ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

Our friends at Harbour.Space also have a message for you:

Hello Codeforces!

We are excited to announce that the Hello Muscat Programming Bootcamp registration is open! The camp will take place from March 9th to March 15th, 2019, and our early bird discount of 15% is going until December 15th!

This next edition in our Hello Programming Bootcamp will run in parallel with the traditional Moscow ICPC Workshop — both Bootcamps’ contests will be identical, and contestants will be able to see their position in the General Leaderboard. Every day, both camps will be competing simultaneously, 4,000 kilometers from each other!

REGISTER FOR THE BOOTCAMP

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 waynetuinfor 7 190
2 nuip 7 226
3 ToTLeS 7 246
4 danya.smelskiy 7 252
5 Batrr 7 272

Congratulations to the best hackers:

Rank Competitor Hack Count
1 9646516 75:-20
2 interestingLSY 49:-24
3 niki4smirn 12:-1
4 katana_handler 11
5 marismmm 8
298 successful hacks and 565 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A sorry_stefdasca_snsdsux 0:01
B KerimKochekov 0:02
C Golovanov399 0:05
D Golovanov399 0:09
E ko_osaga 0:25
G tfg 0:09

UPD: Editorial is out

• +142

 » 3 years ago, # |   0 Auto comment: topic has been updated by awoo (previous revision, new revision, compare).
 » 3 years ago, # |   0 Clashes with COCI #3
•  » » 3 years ago, # ^ | ← Rev. 2 →   0 Best plan is participate in AGC29 and after 15 min participate in this round.
 » 3 years ago, # |   -24 Yes, it is rated for Div. 2
•  » » 3 years ago, # ^ |   -7 ikr
 » 3 years ago, # |   +1 vintage_Vlad_Makeev is back
•  » » 3 years ago, # ^ |   0 why gritukan decreasing his rating ?
•  » » » 3 years ago, # ^ |   +8 To provide company to people like me xD
 » 3 years ago, # |   +4 Is D bipartite checking?
•  » » 3 years ago, # ^ |   +3 yes
•  » » » 3 years ago, # ^ |   0 Pls explain in detail.
•  » » » » 3 years ago, # ^ |   0 check if each connected part graph is biparite, for each part color verticles with i.e. red and black and calculate number of red verticles. Then the result for each part is 2**red + 2**(part.size() — red) [you can put two's either in red verticles or black ones]. Multiply all numbers for final result, put modulo If m =0 , put 3**n % modulo. See my submission
•  » » » 3 years ago, # ^ |   +1 For a long time I thought graph was connected. After knowing that in hurry I used addition principle instead of multiplication :(.
 » 3 years ago, # |   0 how to solve D ?
•  » » 3 years ago, # ^ |   +10 If graph contain odd cycle, answer is zero as no valid assignment can exist.Otherwise, let us find 2-coloring of each connected component in graph. Say, x nodes are colored red while y nodes are colored black. There are exactly pow(2,x)+pow(2,y) ways to color this component. Take product of this for all components.Reason of pow(2,x)+pow(2,y). You need sum of edges to be odd. So, one of the value on edge is 2 and other value is either 1 or 3. pow(2,x) assume we assign all red colored nodes with either 1 or 3, giving pow(2,x) choices. Same for y.
•  » » 3 years ago, # ^ | ← Rev. 2 →   0 It can be easily solved with BFS. And I came up with it a long time later, but I couldn't solve it because of Memory Limit Exceed.
 » 3 years ago, # |   +11 It took me 4 wrong tries to actually realize that author has not mentioned that Graph will be connected in Problem D :'(
•  » » 3 years ago, # ^ |   0 i asked him . he said no !
•  » » 3 years ago, # ^ |   0 Graph doesn't have to be connected.
•  » » » 3 years ago, # ^ |   0 Yes, I know. I actually assumed from the beginning that it will be that was the problem.
 » 3 years ago, # | ← Rev. 2 →   +32 For those wondering about high submissions for G, You might find this problem interesting :)MDISTCan anyone share their idea for E and F?
•  » » 3 years ago, # ^ |   +3 let's say p2[x] is position of x in second permutation, then you need to find number of l2 <= p2[i] <= r2 and l <= i <= r. It's easy to solve it with bit and sqrt decomposition.
•  » » » 3 years ago, # ^ |   +3 Wouldn't the complexity be n*root(n)*log(n) as for each block we need to find out how many values are there lying between l1 and r1, Also, if we use merge sort tree, we can reduce the complexity to n*log^2(n) as the problem is effectively calculating the no. of numbers that are between l and r in a particular range.
•  » » 3 years ago, # ^ |   +3 In problem E you have to divide both permutations to blocks of length sqrt(n) and than make some calculations.
•  » » 3 years ago, # ^ |   0 My idea in E was creating sqrt(n) segment trees, so each of them contains a number of elements in the segment in the array b, that exist in according sqrt-bucket of the array a (t[s][l..r] — number of elements that exist both in in segment a[s*sqrt(n)...(s+1)*sqrt(n)] and b[l...r]). So it should have been some sort of sqrt-decomposition on segment trees.
•  » » 3 years ago, # ^ |   0 In the problem MDIST for 2-dim , we have to use 4 segment trees. But since in G there are more than 2 dimensions we have to use 2^k segment trees where k is dimension of the point. Is there any other way to do this problem?
•  » » » 3 years ago, # ^ |   0 You can optimize slightly by making only 2 ^ (k — 1) segment trees.
 » 3 years ago, # |   0 I got a couple of wrong answers on D because I had mod = 1e9+7 saved in my template and forgot to change it to 998244353, and when I finally realized the mistake I corrected it in the last 10 mins. For those who say what's the use of setting mod to such a weird value its for people like me :-p
 » 3 years ago, # |   0 How to solve C? I made a great effort to solve it by using greedy algorithm only to get a wrong answer on #9.
•  » » 3 years ago, # ^ | ← Rev. 3 →   +1 Yours approach looks correct. IssueYou are reading int instead of long long intscanf("%d",ori+i);
•  » » » 3 years ago, # ^ |   0 Yes,you are right. Thank you! Maybe last night I was too tired to stay calm. As a result, I dropped to green :(
•  » » 3 years ago, # ^ |   0 It's how you approached it.I did like this: split array a into halves, start filling from the middle of a (i.e. from right to left of array b).Denote the element b[n / 2] as x, the two middle elements of a will be x div 2 and x - x div 2 respectively.For the next elements, let's denote the ones we need to fill in the left half and the right half as L and R respectively. Also, we have MinL as the minimum of filled numbers in the left half, MaxR as the maximum of filled numbers in the right.Obviously L ≤ MinL and MaxR ≤ R. From there, you can easily split the element from b into two most optimal halves that satisfies both inequalities above.
•  » » 3 years ago, # ^ |   0 I did the same mistake :( So, now I have made a macro with int as long long.
 » 3 years ago, # | ← Rev. 2 →   -10 I liked D. So, for any edge (u, v) exactly one of the nodes will have value 2. If the graph has odd length cycle, then its impossible. Otherwise, simply do a black-white coloring of the graph. Now let # of black nodes be B. Then in one case you can write 2 in B nodes, and the rest N-B nodes will have 2 options (1,3). In second case you can write 2 in N-B nodes, and the rest B nodes will have 2 options (1,3). Ans = 2^B + 2^(N-B)
•  » » 3 years ago, # ^ |   0 Damn it!! I know understood how people solved this question in around 5 minutes. Nice one!
•  » » » 3 years ago, # ^ |   0 can u help my with my submission. I' getting TLE for test13
•  » » 3 years ago, # ^ |   +3 Technically i think this is incomplete, it never says that the graph is connected. So use this solution for every connected component, and then multiply the solution of each one.
•  » » » 3 years ago, # ^ |   0 Correct. I added that in the comments in my code. I was just highlighting the idea behind problem.
•  » » 3 years ago, # ^ | ← Rev. 4 →   0 Why this is giving TLE for a trivial case although I've implemented exactly this approach. code UPD: removedmemset() and it ACed :)
 » 3 years ago, # |   +3 Are there faster solutions than Nlog^2N in E and Q*(2^K)*logN in G? Got TLE on both.
•  » » 3 years ago, # ^ |   0 I see AC codes having a BIT of ordered_set which also runs in O(N.log^2N).
•  » » 3 years ago, # ^ |   +1 I coded a solution with segment trees in contest , it didnt worked for me. But It worked when i changed to BIT. Probably constant factor in segment tree increases its runtime
•  » » 3 years ago, # ^ |   0 See https://codeforces.com/blog/entry/63807?#comment-476888 See if the 2 ^ (k — 1) approach works for you.
 » 3 years ago, # |   +7 Problem D is pretty good ^^
 » 3 years ago, # |   0 https://codeforces.com/contest/1093/submission/47073053why did this time out?
•  » » 3 years ago, # ^ |   0 q.erase() runs in O(n) time. Use queue instead of vector
•  » » » 3 years ago, # ^ |   0 I am erasing only the 1st entry, that is constant time
•  » » » » 3 years ago, # ^ |   +7 I guess, erasing the 1st entry in a vector is O(N)
•  » » » » » 3 years ago, # ^ |   0 Damn you are right, queue gave AC :(
 » 3 years ago, # |   +37 For E, I couldn't pass a segtree of ordered_set in 6s. Is there any other better solution? Or it was just intended that we use BIT instead of segtree.
•  » » 3 years ago, # ^ |   +25 Same here. After writing all that and getting TLE:
•  » » » 3 years ago, # ^ |   +3 I was doing with the same approach but could not complete coding. I think i would also have got the same verdict. :-p
•  » » 3 years ago, # ^ |   0 solve problem in offline: ordered_set -> BIT
•  » » » 3 years ago, # ^ | ← Rev. 2 →   0 Can you share the idea for offline approach?
•  » » 3 years ago, # ^ |   0 You can pass all tests with naive solution if you want in 5 seconds
•  » » » 3 years ago, # ^ |   0 Why do you use alignas in your code? This is the first time that I'm seeing this.
•  » » » » 3 years ago, # ^ | ← Rev. 2 →   +8 With alignas(32) pointer to array beginning will by dividing by 32-byte, or 256-bits. It allows GCC to use assembler command vpmaskmovd with AVX2 extension. You can read about vpmaskmovd (_mm256_maskload_epi32) this. So it needed only for fast loading to 256-bit cpu registers from memory.
•  » » » » » 3 years ago, # ^ | ← Rev. 2 →   +5 This is super interesting (and impressive). I have some followups: So I assume that it always makes sense to use alignas(32) before every array declaration? (One side question, it doesn't help to add that before a vector declaration does it?) Do you know any other (hardware) tricks like this?
•  » » » » » » 3 years ago, # ^ |   +5 In case with vector you need to write own class aligned allocator and put it in vector template parameter. No, I know only about alignment. C++ has operator alignof(type) like sizeof(type).
•  » » 3 years ago, # ^ |   0 It's kind of unfair that the problem setters kept TL so tight that this is happening.
•  » » 3 years ago, # ^ |   0 Do you mean a merge sort tree?
 » 3 years ago, # |   0 Am i wrong or O(m * log^2) solution should get TL.
 » 3 years ago, # |   0 has anyone done E with Bitset ? I got TLE at testcase 13
 » 3 years ago, # |   +13
 » 3 years ago, # |   +1 What will be the Rating of problem D?
 » 3 years ago, # |   0 Why did this get TLE?
•  » » 3 years ago, # ^ | ← Rev. 2 →   -8 Never mind, just got accepted. Never thought memset would pose a problem though.
•  » » » 3 years ago, # ^ |   -8 Same problem tle due to memset. Would never use it again ;)
•  » » » » 3 years ago, # ^ |   +3 I think memset is still quite important sometimes. Just need to evaluate better next time!
•  » » » » » 3 years ago, # ^ |   0 memset() time complexity in your code is O(MAXN) and you do it every test cases giving total time complexity O(T * MAXN) with T = 3*10^5 and N = 1 for every cases, the code will definitely TLE.
•  » » » » » » 3 years ago, # ^ |   0 Thanks but I already figured it out before getting accepted lol
 » 3 years ago, # |   +10 Check my submissions if you are looking for challenging hacks. You have to complete 4 funny tasks. Good luck :)
•  » » 3 years ago, # ^ |   0 Actually your C is not hackable since the corresponding rand() sequence does not correspond to a valid input sequence (since you should be able to form some sequence a1, ..., an out of it per the problem statement).
•  » » » 3 years ago, # ^ |   0 The random sequence b is increasing therefore it is possible to make sequence a.
•  » » » » 3 years ago, # ^ | ← Rev. 5 →   0 That is not a sufficient condition. What is a sequence corresponding to n=4, b = [2, 100]?Here is the random sequence for your code. Validator doesn't accept it. 40 42 18468 26335 36501 49170 55725 61479 79359 86963 94465 105706 118146 123282 136828 149962 150492 162996 171943 184828 195437 
•  » » » » » 3 years ago, # ^ | ← Rev. 3 →   0 You are right. I should have made decreasing array. Sorry for it. I uploaded the correct code. 47077025 Thanks for noticing and congratulation for the hack. If anyone else wants to hack: 47077601
•  » » 3 years ago, # ^ |   0 I'm quite confident your C is impossible to hack because it must be possible to recover the array from the input, but having your array as input doesn't correspond to any array from the task.
 » 3 years ago, # |   0 I had the same sqrt(N) blocks idea for E but ended up with memory limit exceeded. Did I derp too hard or was there something I'm missing? I had a 450 x 200005 int matrix at most
 » 3 years ago, # |   0 What's the hack for problem D?
•  » » 3 years ago, # ^ | ← Rev. 2 →   0 300000 1 0 1 0 1 0 ... If someone is clearing the whole array of size 300000 for every test, then it'll TLE out.
•  » » » 3 years ago, # ^ |   0 No that's not a hack test, as it appears in the pretests (Test: #21)
•  » » » » 3 years ago, # ^ |   0 My bad, I missed a '0' for t. It should be 300000. Test #21 is shy of one '0'.
 » 3 years ago, # | ← Rev. 5 →   +43 My accepted solution for problem E in O(n * m) time works 5225 ms.Can anybody hack it? Maybe halyavin?
•  » » 3 years ago, # ^ |   0 My O(n*sqrt(n)) solution for E got TLE,and O(n*logn^2) one accepted but slower than yours. How amazing!Maybe you are too strong!
•  » » » 3 years ago, # ^ |   +5 My solution didn't get TLE (currently xd) . How are you solving in O(Nlog2N) ?
•  » » » » 3 years ago, # ^ |   0 Your idea is so nice! Why didn't I find it during the contest! Thanks a lot.
•  » » » » 3 years ago, # ^ |   0 Because the problem is offline，you can use Divide and Conquer and Binary Indexed Tree（or Segment tree）to solve it. https://codeforces.com/contest/1093/submission/47076127
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +23 In my solution I used information from A Guide to Auto-vectorization with Intel® C++ Compilers. You can try to read and apply in solutions If want picture
•  » » 3 years ago, # ^ |   0 I made a input file to hack your solution but Codeforces don't support such a big file. Here's the link on Dropbox: https://www.dropbox.com/s/rg3bp6crc05h94p/in.txt?dl=0 There isn't any swaps and all the queries ask you about two whole sequences.
•  » » » 3 years ago, # ^ |   0 Sorry, there is such a test case and you pass it.
 » 3 years ago, # | ← Rev. 4 →   0 Can anyone tell me, why i am getting compilation timeout???submission
 » 3 years ago, # |   0 Solution for F?
 » 3 years ago, # |   0 halyavin is coming!!!
 » 3 years ago, # |   +2 I've just started using CodeForces and this was my first contest (and I got 2 accepted solutions). Can someone tell me:why I still dont have a rating ? Will my profile be updated later (after few hours) ?
•  » » 3 years ago, # ^ |   +3 There is hacking phase after Educational rounds which lasts for 12 hours then the system testing will begin, it takes around an hour. after all of this your rating will be changed.
•  » » » 3 years ago, # ^ | ← Rev. 2 →   0 Wasn't System Testing done before the Hacking Phase? If System Testing has not started, the competition status will be displayed as 'Pending System Testing'. However, the current state of the competition is marked 'Finished'.
•  » » » » 3 years ago, # ^ | ← Rev. 3 →   +2 No, it was the judging of the late solutions that were submitted on the last seconds.after the hacking phase, all of the solutions will be rejudged with the complete testset not only the pretests (this is the system testing).
•  » » » » » 3 years ago, # ^ |   0 I See.
•  » » » 3 years ago, # ^ |   +3 Thanks @Khaled_Mohamed !
 » 3 years ago, # |   0 47050528 hey, this is the fisrt time i am competing. Can anyone explain me whats wrong with this code for first problem.
•  » » 3 years ago, # ^ |   +2 You were doing a wrong greedy.Since the constraints are pretty small, you can just brute force the answer: an answer i will be considered correct if 2i ≤ x ≤ 7i.
•  » » 3 years ago, # ^ | ← Rev. 3 →   +3 When input is n = 29, your code doesn't give any output!After this step: std::cin>>x; rolls=x/7; x=x%7; 'x' becomes equal to '1' and it can never become '0' in below mentioned conditions from your code: rolls=rolls+ x/6; x=x%6; rolls=rolls+ x/5; x=x%5; rolls=rolls+ x/4; x=x%4; rolls=rolls+ x/3; x=x%3; rolls=rolls+ x/2; x=x%2; So it doesn't print the output at this step: if(x==0){ printf("%d\n",rolls); } PS: Think easy :)
•  » » » 3 years ago, # ^ |   0 I've seen this code from other users, but I haven't thought of hacking. :(
•  » » » 3 years ago, # ^ |   0 47059050 Can you please check this submission also. Thanks for explaining!
•  » » » » 3 years ago, # ^ |   0 'rolls' is uninitialised! Change it to rolls = 0;
•  » » » » » 3 years ago, # ^ |   0 thanks man. It got accepted.
 » 3 years ago, # |   0 Can anyone please tell what is wrong in this solution for the problem D code
•  » » 3 years ago, # ^ |   +8 y in power function should be from type long long not long.
•  » » » 3 years ago, # ^ |   0 got it accepted. Thank you
 » 3 years ago, # |   0 Can anyone explain the solution for problem C? I can't understand why we r taking a max of b[i] and b-a[n-i].
•  » » 3 years ago, # ^ |   0 a[i]=max(a[i-1],b[i]-a[n-i]) would ensure that a[i]>=a[i-1] which means that sequence is increasing and also a[i]>=b[i]-a[n-i] which means a[n-i]>=a[n-i-1].
•  » » » 3 years ago, # ^ |   0 Got it. Thanks for explaining.
 » 3 years ago, # |   0 Can someone please point out why do I hit a time-limit-exceeded on test 2 with this submission? https://codeforces.com/contest/1093/submission/47082541
•  » » 3 years ago, # ^ | ← Rev. 6 →   0 Graph doesn't have to be connected. Here is example: n = 3 * 10^5, m = 0 Then this part: Spoilerfor (int v = 1; v <= n; v++) { if (visited[v] == false) { color_vertex(v, 0); long long red = 0, black = 0; for (int i = 1; i <= n; i++) { if (visited[i]) { if (colored[i] == 0) red++; else if (colored[i] == 1) black++; } } ans += (1 << red) % MOD + (1 << black) % MOD; ans %= MOD; } } will take n^2 time. Another bug in your code is in this line: ans += (1 << red) % MOD + (1 << black) % MOD; black and red can be bigger than 64. Better option is to just count every 2^k % MOD at the start of your program: POT[0] = 1; for (int i = 1; i < N; i++) POT[i] = (POT[i - 1] * 2) % mod; 
 » 3 years ago, # |   0 How to solve E?
•  » » 3 years ago, # ^ | ← Rev. 2 →   +6 My way to solve this problem (not very efficient, but it passed):Represent each number as a point , then the problem will become count the number of points in the rectangle with two opposite vertices (la, lb) and (ra, rb). You can easily solve this problem with compressed 2D BIT.
 » 3 years ago, # |   0 Hi! I did really enjoy solving these problems, thank you to all the authors! Can please someone explain, what does C# dislike in test 10 of D so much, that it gives memory access error? 47082830 I understand, that the best solution is to never use C# for contests, but anyway
 » 3 years ago, # |   0 Can anyone explain solution to E with ordered statistics set? I saw few codes that get AC but I don't understand them all. And what does this magic loop: for(int i = x; i <= n; i += i & -i) 
•  » » 3 years ago, # ^ |   +8 This loop is used in BIT, I guess.
•  » » 3 years ago, # ^ | ← Rev. 2 →   +10 i & -i gets the least significant bit out. This is good read.
 » 3 years ago, # |   +1 Can anyone figure out why my program will get many negative outputs in problem D? 47086094
•  » » 3 years ago, # ^ |   +12 a *= a % c means a = a * (a%c), which is not a = (a*a)%c, so it will overflow.
•  » » 3 years ago, # ^ |   0 I spent ages debugging this issue. From now on I have decided not to use shorthand [+-*/]= operator in C++ in such cases ....
 » 3 years ago, # | ← Rev. 2 →   -6 i missed this -_________-
 » 3 years ago, # |   0 anyone solved D with DP ??
•  » » 3 years ago, # ^ |   0 But why?
•  » » » 3 years ago, # ^ |   0 because i doesn't know the coloring in graphs
•  » » » » 3 years ago, # ^ |   0 It's pretty straightforward. You can use graph traversing algorithms of your preference (BFS or DFS) and just change used[] array to color[] array. You only need two colors for this problem. Then assign all children with a different color of its parent. Also, check that no neighbours have the same color (it is only possible if you have a cycle of an odd length).As for DP, I have no idea how such a solution would look like, but it probably would be an overhead.
•  » » » » » 3 years ago, # ^ | ← Rev. 3 →   0 okay this may be straight-forward but what if i take a look as every edge has two vertices and if they are not colored yet i will color each of them with diff colors and my state will be the edge and the color of the 2 vertices so 3D array 0 if not colored 1 if odd ,2 if even but to consideration that you can color 2 times the odd vertices. I know it is much harder this way but i like the way to transform graph to dp. here is my solution http://codeforces.com/contest/1093/submission/47076428
•  » » » » » » 3 years ago, # ^ |   0 I am right saying this, when it comes to graph DP can be applied only on DAG, am i not ?
•  » » » » » » » 3 years ago, # ^ |   0 i think yes
 » 3 years ago, # |   +11 Will there be an editorial?
 » 3 years ago, # |   0 How would we do problem E? I am getting TLE with my approach in test case 10
 » 3 years ago, # |   0 Can anyone help me with my code for D. I'm getting TLE for test13 My Submission
•  » » 3 years ago, # ^ |   0 I think the issue is in using cin/cout with scanf/printf.
•  » » » 3 years ago, # ^ |   +3 Guys in my neighbourhood always warned me to not to mix those.
•  » » » » 3 years ago, # ^ |   0 Yeah, they are right.
•  » » 3 years ago, # ^ |   +3 Declaring vector for graphs and color inside main function instead of globally doesn't seems to be a wise decision.Here you go Submission
•  » » » 3 years ago, # ^ |   0 thanks Aparichit_Vyavasthapak
 » 3 years ago, # | ← Rev. 2 →   0 please release the editorial of this contest??
 » 3 years ago, # |   +3 The idea behind E's solution is good. You have to choose such a block size such that n*(block_size+log(n)*n/block_size) is minimised. It is not necessary that optimal block_size is root(n), PS: E passes with block_size = 3000.
 » 3 years ago, # | ← Rev. 2 →   -10 I am pretty sure that problem F is the exact same problem as 204D - Little Elephant and Retro Strings. but instead of using only 2 values he uses k.
 » 3 years ago, # |   0 Auto comment: topic has been updated by awoo (previous revision, new revision, compare).
 » 3 years ago, # |   0 Does anyone know when the editorial will be released ?
 » 3 years ago, # |   0 Can anyone tell me what am I doing wrong in part D.