Solution to 25 and 16

CPP/25. 1000-digit Fibonacci number/17-Vishal.cpp

@@ -0,0 +1,18 @@
+#include <iostream>  
+using namespace std;  
+int main() {  
+  int n1=0,n2=1,n3,i=1;    
+while(1)   
+ {    
+  n3=n1+n2;    
+  if(1000-n3<=0)
+  {
+      break;
+  }
+  i++;
+  n1=n2;    
+  n2=n3;    
+ }   
+ cout << i+1;
+   return 0;  
+   }  

Python/16. Power digit sum/17-Vishal.py

@@ -0,0 +1,12 @@
+def getSum(n): 
+
+    sum = 0
+
+    while(n > 0): 
+        sum += int(n%10) 
+        n = int(n/10) 
+
+    return sum
+
+
+print(getSum(2**1000)) 

Python/25. 1000-digit Fibonacci number/17-Vishal.py

@@ -0,0 +1,11 @@
+n1=0
+n2=1
+i=1;    
+while(1):   
+  n3=n1+n2    
+  if(1000-n3<=0):
+     break
+  i+=1
+  n1=n2
+  n2=n3    
+print(i+1)

README.md

@@ -52,7 +52,9 @@ Happy Contributing! 😃
 |22	|[Names scores](https://projecteuler.net/problem=22)|     |      |    |        |        |      |   |    |         |   |      |       |
 |23|	[Non-abundant sums](https://projecteuler.net/problem=23)|     |      |    |        |        |      |   |    |         |   |      |       |
 |24|	[Lexicographic permutations](https://projecteuler.net/problem=24)|     |      |    |        |        |      |   |    |         |   |      |       |
-|25|	[1000-digit Fibonacci number](https://projecteuler.net/problem=25)|     |      |    |        |        |      |   |    |         |   |      |       |
+
+|25|	[1000-digit Fibonacci number](https://projecteuler.net/problem=25)| :white_check_mark:    |      |    |  :white_check_mark:      |        |      |   |    |         |   |      |       |
+
 |26|	[Reciprocal cycles](https://projecteuler.net/problem=26)|     |      |    |        |        |      |   |    |         |   |      |       |
 |27|	[Quadratic primes](https://projecteuler.net/problem=27)|     |      |    |        |        |      |   |    |         |   |      |       |
 |28	|[Number spiral diagonals](https://projecteuler.net/problem=28)|     |      |    |        |        |      |   |    |         |   |      |       |