#include <iostream> #include <string> #include <vector> #include <string.h> using namespace std; int fib[600][1000]; vector <int> fibo[600]; int iSBig(int i,string s) { if(fibo[i].size()>s.size()) return 1; if(fibo[i].size()<s.size()) return 0; for(int j=0;j<s.size();j++) { if((s[j]-'0')<fibo[i][j]) { return 1; } if((s[j]-'0')>fibo[i][j]) { return 0; } } return 1; } int iSSmall(string s,int i) { if(fibo[i].size()>s.size()) return 0; if(fibo[i].size()<s.size()) return 1;
Month: August 2014
10088
[highlight]Theory[/highlight] Picks formulae ::: ans=area of polygon-B/2+1; Given a polygon whose vertices are of integer coordinates (lattice points), count the number of lattice points within that polygon.Pick’s theoreom states that where; is the area of the polygon. is the number of lattice points on the exterior Area of a polygon: First, number the vertices in