Merge pull request #55 from jaesharma/master

adding project euler problem solutions

Author: larissalages

Project Euler/112.cpp

@@ -0,0 +1,36 @@
+#include<iostream>
+#include<stdlib.h>
+
+using namespace std;
+
+bool isbouncy(long long int digit){
+  int flag,prev,curr;
+    prev=digit%10;
+    digit/=10;
+  while(digit!=0){
+     curr=digit%10;
+     digit/=10;
+     if(curr<prev){
+        if(flag==1) return true;
+       flag=0;
+    }
+    else if(curr>prev){
+        if(flag==0) return true;
+        flag=1;
+    }
+    prev=curr;
+  }
+   return false;
+}
+
+int main(){
+  long long int digit=100,count=0;
+  while(true){
+    if(isbouncy(digit)) count++;
+    if(((count*100)/digit)>=99){
+        cout<<digit;
+        exit(0);
+    }
+    digit++;
+  }
+}

Project Euler/18.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+using namespace std;
+
+int main(){
+  int rp,lp,i,j,rows=100,cols,sum,x;
+  vector<int> last,curr;
+  cin>>x;
+  last.push_back(x);
+  for(i=1;i<rows;i++){
+    cols=i+1;
+    curr.clear();
+    for(j=0;j<cols;j++){
+      cin>>x;
+      lp=0;   //left parent
+      if(j>0) lp=last[j-1];
+      rp=0;   //right parent
+      if(j<last.size()) rp=last[j];
+      sum=x+max(lp,rp);
+      curr.push_back(sum);
+    }
+    last=curr;
+  }
+  cout<<*max_element(last.begin(),last.end());
+}

Project Euler/26.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+int main(){
+  int ans=0,num,den,rem,count,max=0;
+  vector<int> v;
+  for(den=2;den<1000;den++){
+   num=1;
+   rem=0;
+   count=0;
+   v.clear();
+   v.assign(den,0);
+   while(v[num]==0){
+    v[num]=count;
+    num=(num*10)%den;
+    count++;
+   }
+   if(count-v[rem]>max){
+     max=count-v[rem];
+     ans=den;
+   }
+  }
+  cout<<max;
+}

Project Euler/27.cpp

@@ -0,0 +1,29 @@
+#include<iostream>
+#include<vector>
+#include<cmath>
+using namespace std;
+
+int main(){
+    vector<int> v;
+    long long int i,j,a,b,n,max=0,ans=0;
+    v.assign(1000000,0);
+    for(i=2;i<1000000;i++){
+      if(v[i]==0 || v[i]==1){
+        for(j=i;j<1000000;j+=i){
+            v[j]++;
+        }
+      }
+    }
+    for(a=-1000;a<1000;a++){
+      for(b=1;b<=1000;b++){
+       if(v[b]!=1) continue;
+        n=0;
+       while(v[abs(n*n+a*n+b)]==1) n++;
+        if(n+1>max){
+            max=n+1;
+            ans=a*b;
+        }
+      }
+    }
+   cout<<ans;
+}

Project Euler/40.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+#include<vector>
+
+using namespace std;
+
+int main(){
+  vector<int> v;
+  vector<int> v2;
+  v.assign(1000001,0);
+  long long int dig=1,i=1,j,digit;
+  while(i<=1000000){
+    //cout<<dig<<endl;
+    digit=dig;
+    v2.clear();
+    while(digit!=0){
+      v2.push_back(digit%10);
+      digit/=10;
+    }
+   for(j=v2.size()-1;j>=0;j--){
+     v[i]=v2[j];
+  //   cout<<v[i]<<endl;
+     i++;
+   }
+   dig++;
+  }
+  cout<<v[1]*v[10]*v[100]*v[1000]*v[10000]*v[100000]*v[1000000];
+}

Project Euler/62.cpp

@@ -0,0 +1,59 @@
+#include<vector>
+#include<iostream>
+#include<stdlib.h>
+#include<map>
+
+using namespace std;
+
+unsigned long long int fingerprint(vector<unsigned long long int> digit){
+  unsigned long long int i,k,dig,shift,fp=0;
+  for(k=0;k<digit.size();k++){
+    shift=1;
+    dig=digit[k];
+    for(i=0;i<dig;i++) shift*=10;
+    fp+=shift;
+  }
+  return fp;
+}
+
+int main(){
+   vector<unsigned long long int> cube,temp2,fp2;
+   map<unsigned long long int, vector<unsigned long long int> > mp;
+  map<unsigned long long int, int > mp2;
+  long long int temp,fp,j,k,carry;
+  int i;
+  for(i=10;i<=10000;i++){
+    temp=i;
+    cube.clear();
+    while(temp!=0){
+        cube.push_back(temp%10);
+        temp/=10;
+    }
+    for(j=1;j<=2;j++){
+        temp2.clear();
+        carry=0;
+        for(k=0;k<cube.size();k++){
+            temp=cube[k]*i+carry;
+            temp2.push_back(temp%10);
+            carry=temp/10;
+        }
+        while(carry!=0){
+             temp2.push_back(carry%10);
+             carry/=10;
+        }
+    cube=temp2;
+    }
+    fp=fingerprint(cube);
+    if(mp.find(fp)!=mp.end()){
+      mp2[fp]++;
+      if(mp2[fp]==5){
+        for(j=mp[fp].size()-1;j>=0;j--) 
+           cout<<mp[fp][j];
+        exit(0);
+      }
+    }else{
+       mp[fp]=cube;
+       mp2[fp]=1;
+    }
+  }
+}

Project Euler/67.cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+using namespace std;
+
+int main(){
+  int rp,lp,i,j,rows=100,cols,sum,x;
+  vector<int> last,curr;
+  cin>>x;
+  last.push_back(x);
+  for(i=1;i<rows;i++){
+    cols=i+1;
+    curr.clear();
+    for(j=0;j<cols;j++){
+      cin>>x;
+      lp=0;   //left parent
+      if(j>0) lp=last[j-1];
+      rp=0;   //right parent
+      if(j<last.size()) rp=last[j];
+      sum=x+max(lp,rp);
+      curr.push_back(sum);
+    }
+    last=curr;
+  }
+  cout<<*max_element(last.begin(),last.end());
+}

Project Euler/87.cpp

@@ -0,0 +1,38 @@
+#include<iostream>
+#include<vector>
+#include<cmath>
+#include<algorithm>
+#include<map>
+using namespace std;
+
+int main(){
+  vector<int> v;
+  v.assign(7100,0);
+  map<long long int,long long int> mp;
+  unsigned long long int i,j,k, max=50000000,temp,a1,a2,a3;
+  for(i=2;i<7100;i++){
+    if(v[i]==0 || v[i]==1){
+      for(j=i;j<7100;j+=i) v[j]++;
+    }
+  }
+  for(i=2;i<=7100;i++){
+    if(v[i]==1){
+      for(j=2;j<=370;j++){
+        if(v[j]==1){
+          if((i*i+j*j*j)>max) break;
+            for(k=2;k<=85;k++){
+              if(v[k]==1){
+                a1=i*i;
+                a2=(unsigned long long int)j*j*j;
+                a3=(unsigned long long int)k*k*k*k;
+                temp=a1+a2+a3;
+                if(temp>=max) break;
+                 mp[temp]=i;
+              }
+            }
+        }
+      }
+    }
+  }
+  cout<<mp.size();
+}

Project Euler/problem46.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+#include<stdlib.h>
+#include<cmath>
+#include<vector>
+
+using namespace std;
+
+int main(){
+  int flag;
+  vector<unsigned long long int> v;
+  v.assign(1000000,0);
+  unsigned long long int i,j,n2;
+  for(i=2;i<1000000;i++){
+    if(v[i]==0 || v[i]==1){
+      for(j=i;j<1000000;j+=i) v[j]++;
+    }
+  }
+  double n;
+  i=9;
+  while(true){
+   if(v[i]==1){
+        i+=2;
+        continue;
+    }
+    flag=0;
+    for(j=1;2*j*j<i;j++){
+      if(v[i-2*j*j]==1) flag=1;
+    }
+    if(flag==0) cout<<i<<endl;
+    i+=2;
+  }
+}

Project Euler/problem79.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+using namespace std;
+
+int main(){
+  vector<int> d,v;
+  vector<int>::iterator p1,p2;
+  int temp,digit,i,pos1,pos2;
+  while(true){
+    cin>>digit;
+    d.clear();
+    while(digit!=0){
+      d.push_back(digit%10);
+      digit/=10;
+    }
+    for(i=d.size()-1;i>=0;i--){
+      if(find(v.begin(),v.end(),d[i])==v.end())    v.push_back(d[i]);
+    }
+    for(i=d.size()-1;i>0;i--){
+      p1=find(v.begin(),v.end(),d[i]);
+      p2=find(v.begin(),v.end(),d[i-1]);
+      pos1=p1-v.begin();
+      pos2=p2-v.begin();
+      if(pos2<pos1){
+         temp=v[pos1];
+         v[pos1]=v[pos2];
+         v[pos2]=temp;
+      }
+    }
+    for(i=0;i<v.size();i++) cout<<v[i];
+    cout<<endl;
+  }
+}