Codeforces Round #404. Editorial. This is an editorial for the problems of the today's contest. I tried my best to describe the solutions for the problems as detailed as possible, but if something is not understandable for you, you can write in comments! :) [problem:785A] <spoiler summary="Hint"> 404 Not Found </spoiler> <spoiler summary="Tutorial"> [tutorial:785A] </spoiler> <spoiler summary="C++ code"> ~~~~~ #include <iostream> #include <map> using namespace std; int main() { ios_base::sync_with_stdio(false); map<string, int> vals; vals["Tetrahedron"] = 4; vals["Cube"] = 6; vals["Octahedron"] = 8; vals["Dodecahedron"] = 12; vals["Icosahedron"] = 20; int n; cin >> n; int res = 0; for (int i = 0; i < n; i++) { string s; cin >> s; res += vals[s]; } cout << res << endl; return 0; } ~~~~~ </spoiler> <spoiler summary="Java code"> ~~~~~ import java.io.*; import java.util.*; public class PolyhedronSums { public static void main(String[] args) ...

Full text and comments »

Undefined behaviour for C (785C-Anton and Fairy Tale) in Contest #404 Div.2 I apologise in advance for a long post. I will include the essential part of multiple codes which I tried submitting for 785C once the contest got over. (In all my solutions I have defined int for long long beforehand so that's not an error) NOTE: If you haven't read the question, this is the link: [QUESTION LINK](http://codeforces.me/problemset/problem/785/C) This is the code for the problem C which I submitted during the contest in GNU C++ 14 which got "Accepted". [submission:25515250] ~~~~~ int f(int x) { int d=8*x+1; int x1=sqrt(d); x1=(x1-1)/2; if(x1*(x1+1)/2 == x) return x1; else return x1+1; } int main() { int n,m; cin>>n>>m; if(n<=m) { cout<<n<<endl; return 0; } int x=n-m; cout<<m+f(x); return 0; } ~~~~~ Once the contest got over looking at the number of solutions which failed System Tests, I tried submitting different variations in different co...

Full text and comments »