What I am trying to do here is, I am taking a precision value (less than 1) and printing count of all the numbers of type 1/n (n is natural number) which are greater than or equal to the precision value (input).  #include &lt;stdio.h&gt;  int main(){     int i=1,terms=0;     float n;     printf("Enter precision value : ");     scanf("%f",&amp;n);      while(i&gt;0){         if ((1.0/i) &gt;= n){             printf("%f\n",1.0/i);             sum = sum + (1.0/i);             terms++;             i++;         }         else             break;     }     printf("number of terms : %d\n",terms);     return 0; }   But if I give input 0.1 than the count (output) is showing only 9. but it should show 10 (it is not including 1/10).  I was using a for loop before and I know that breaking a loop with an if-else statement is not the best thing.
Consider the following code:   0.1 + 0.2 == 0.3  -&gt;  false   0.1 + 0.2         -&gt;  0.30000000000000004   Why do these inaccuracies happen?
What happens with excess items if my bag is full, and what should I do to avoid losing items? There's a default limit of 350 items in the bag (even though you can expand it through the shop). I am currently level 6 and have already ~250 items in my bag. I haven't done any battles yet, as all the gyms in my area are too strong for my pokémon at the moment. So I have a lot of Pokéballs, Heals and Revives that I don't need right now.  What happens once my bag is full? Will additional items go into a temporary overflow bag? Will I just lose them? Will they replace older items?  I'm afraid I will lose the valuable items gained through a level-up. Should I throw away items to avoid that? If so, what should I throw out first? Heals and Revives, as I don't need them right now? Or will they become too valuable later on and I should rather throw out some Pokéballs as those are the most common items to receive from a Pokéstop?  TL;DR: What happens with items that exceed my bag size limit and what is the best strategy to avoid losing valuable items? What is the most elegant proof of the Pythagorean theorem? Increase resolution to 4K in VMware or Virtualbox I have a laptop with a 4K (3860×2160) display, but there are a lot of problems. A lot of virtualization programs aren't compatible with 4K resolution.  VMware Workstation and VirtualBox don't support 4K display in the list of the display's resolution. How I can set the resolution of the display in a virtual machine to 4K? Since I started learning  and  last year, I've read a huge number of articles which insist that design patterns (especially in Java) are workarounds for the missing features in imperative languages. One article I found :     Most people I've met have read     by the Gang of   Four (GoF). Any self respecting programmer   will tell you that the book is   language agnostic and the patterns   apply to software engineering in   general, regardless of which language   you use. This is a noble claim.   Unfortunately it is far removed from   the truth.      Functional languages are extremely   expressive. In a functional language   one does not need design patterns   because the language is likely so high   level, you end up programming in   concepts that eliminate design   patterns all together.   The main features of functional programming (FP) include functions as first-class values, currying, immutable values, etc. It doesn't seem obvious to me that OO design patterns are approximating any of those features.  Additionally, in functional languages which support OOP (such as F# and OCaml), it seems obvious to me that programmers using these languages would use the same design patterns found available to every other OOP language. In fact, right now I use F# and OCaml every day, and there are no striking differences between the patterns I use in these languages vs. the patterns I use when I write in Java.  Is there any truth to the claim that functional programming eliminates the need for OOP design patterns? If so, could you post or link to an example of a typical OOP design pattern and its functional equivalent? Injection from $\mathbb{N}\to\{0,1\}$ to the set of all monotonic decreasing functions from $\mathbb{N}\to\mathbb{Z}$ Can magnets rotate infinitely? There are many videos on youtube in which people arranged magnets in circle and rotated one placing in middle of that circle on a shaft, and the magnet (magnet motor) starts madly and continues its movement. Do they really rotate infinitely? If so, do they from where they get that extra energy to move so fast and infinitely?    EDIT: This question is about real world scenario  UPDATE: I am unable to find that particular video about which i talked about -- I added them to my favourites, but they are all now deleted :( -- there are hundreds of that that kind of videos. Some example videos links I'm moving all files to a new computer, via an external hard drive. I am certain that broken links will be a concern. What can I do to fix this? Is there a 'Best Practices' kind of way to prevent this problem beforehand? I have many hundreds of .blend files, and of course, I fear losing them. Generic List - moving an item within the list So I have a generic list, and an oldIndex and a newIndex value.  I want to move the item at oldIndex, to newIndex...as simply as possible.  Any suggestions?  Note  The item should be end up between the items at (newIndex - 1) and newIndex before it was removed. I ran into the "mysterious"  \pdfendlink ended up in different nesting level than \pdfstartlink   error.  According to , "this happens when hyperref is used under pdftex and a citation splits across a page boundary".  The given solution is to manual fix the citation to not split across the page boundary.  However, this workaround isn't feasible for me, as the documents are automatically generated on a server with no user interaction.  Is there any solution to the problem known, perhaps an experimental hyperref action or a patch to pdftex?  (Probably, one could use luatex to solve the problem, but for other reasons, luatex is not an option in this project.)  MWE:  \documentclass[%draft               ]{article} \usepackage{hyperref} \setlength{\textwidth}{3cm} \setlength{\textheight}{3cm}  \begin{document} Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna \href{http://www.tug.org/errors}{aliquyam erat, sed diam voluptua.} \end{document} Problem with patching babel package I am trying to use babel and biblatex package together but I am getting following error:    ! Package biblatex Error: Patching 'babel' package failed.    This is my code example:  \documentclass[12pt,a4paper,twoside,openright]{book} \usepackage{cmap} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[slovak]{babel} \usepackage{xpatch} \usepackage{csquotes} \usepackage{biblatex} \begin{document} \enquote{quote} \end{document}   I would need the result look like this:    Well, it seems like I could get rid of the error when using xpatch package, but it works only when I delete 'slovak' option for babel package. That way the result look like this:    Please, is there any workaround for this problem? I am really stuck in this. How to find the id of the last added feature using pyQGIS? Is it possible to programmatically (in python) access the attribute info of the last added feature in QGIS 2.0 before edits are saved? I'm failing to find a way to get the ID and subsequently other attributes of my feature of interest (the one most recently added).  idx = layer.fieldNameIndex('myField') myList = [] lastEdited = ID THAT I'D LIKE TO RETRIEVE for feature in layer.getFeatures():     if feature.id() == lastEdited:         print feature.attributes()[idx]   From this I'd like to get 'myField' of my most recent addition.   UPDATE: Following lead of this , I was able to achieve my goals via the Python console, but am failing to get it to work for my plugin.  def updateTableWidget(self, fid):     idx = layer.fieldNameIndex('myField')     myList = []     for feature in layer.getFeatures():         if feature.id() == fid:             myList.append(feature.attributes()[idx])   Via the python console, I was able to connect to my layer like so:  layer.featureAdded.connect(updateTableWidget)   After adding a QgsMessageLog to my function, the attributes were correctly identified. I now have a beginner python issue, however. Calling the function in my plugin as shown below gives me TypeError: updateTableWidget() takes exactly 2 arguments (1 given):  self.updateTableWidget()   The function was called from feature form python file. Last digits, numbers Can anyone please help me?  1) Find the last digit of $7^{12345}$   2) Find the last 2 digits of $3^{3^{2014}}$.  Attempt: 1)  By just setting the powers of $7$ we have $7^1 = 7$, $7^2=49$, $7^3=343$, $7^4 = 2401$, $7^5 = 16807$, $7^6 = 117649$, $\dots$  After the power of $4$, the last digits will repeat. Then by noticing the pattern the digits will end in $7,9,3$ and $1$.  Then we can divide the exponent $(12345)$ by $4$ since this is the cycle that makes it repeat. Then $12345 : 4$ has remainder $1$. So $7^1 = 7$ is the unit digit to $7^{12345}$.   So the last digit is $7$.   I know how to do it like this, the problem does not state how to find the last digit, but I know it has something do do with Euler's theorem.  for part $2$) I don't know how to start. Can anyone please help me?   Thank you for the help. How do I add reCaptcha to a custom form? I need to add a reCaptcha to my form; creating the form then adding the form ID to the reCaptcha settings did nothing. Error When Create Drupal Commerce Product Display If a sequence converges in a metric space, it is Cauchy, and in $\mathbb{R}^k$ every Cauchy sequence converges.   Therefore, in $\mathbb{R}^k$ a sequence converges iff it is Cauchy.  Let $\{s_n\}$ be a sequence in $\mathbb{R}$ where each $s_n=\sum_{k=1}^na_k$. Therefore, by the above, every series converges iff  $$\left | \sum_{k=m}^n a_k\right| &lt;\epsilon$$ For a given $\epsilon &gt;0$ and an integer $N$ such that $N\le m\le n$. If $n=m$ then the statement reduces to:  A series converges if and only if $$|a_n| &lt; \epsilon $$ For a given $\epsilon &gt;0$ and an integer $N$ such that $N\le n$.  This clearly cannot be (e.g Harmonic series). When does the equivalence become an implication. .NET offers a generic list container whose performance is almost identical (see Performance of Arrays vs. Lists question). However they are quite different in initialization.   Arrays are very easy to initialize with a default value, and by definition they already have certain size:  string[] Ar = new string[10];   Which allows one to safely assign random items, say:  Ar[5]="hello";   with list things are more tricky. I can see two ways of doing the same initialization, neither of which is what you would call elegant:  List&lt;string&gt; L = new List&lt;string&gt;(10); for (int i=0;i&lt;10;i++) L.Add(null);   or  string[] Ar = new string[10]; List&lt;string&gt; L = new List&lt;string&gt;(Ar);   What would be a cleaner way?  EDIT: The answers so far refer to capacity, which is something else than pre-populating a list. For example, on a list just created with a capacity of 10, one cannot do L[2]="somevalue"  EDIT 2: People wonder why I want to use lists this way, as it is not the way they are intended to be used. I can see two reasons:   One could quite convincingly argue that lists are the "next generation" arrays, adding flexibility with almost no penalty. Therefore one should use them by default. I'm pointing out they might not be as easy to initialize. What I'm currently writing is a base class offering default functionality as part of a bigger framework. In the default functionality I offer, the size of the List is known in advanced and therefore I could have used an array. However, I want to offer any base class the chance to dynamically extend it and therefore I opt for a list. In System Info in 11.10, the graphics driver wasn't detected. I use ACER Aspire 4750 with Intel Core i3-2340M and Intel HD Graphics 3000 graphic card  How to install the driver for my Ubuntu? Chrome: remove URL from autocomplete which doesn't show up in history? solaris ssh ctrl arrow keys do not work I've used recursion quite a lot on my many years of programming to solve simple problems, but I'm fully aware that sometimes you need iteration due to memory/speed problems.  So, sometime in the very far past I went to try and find if there existed any "pattern" or text-book way of transforming a common recursion approach to iteration and found nothing. Or at least nothing that I can remember it would help.   Are there general rules? Is there a "pattern"?