Specialties: Expertise in web development using django, flask and the related tools and technologies in the python ecosystem (git, heroku, celery, gunicorn, postgres, redis).
On the client side, I develop for iOS.
Delivering full stack technology solutions from backend web services to iPad apps.
Consult for the Global Market Research Technology division of Bank of America Merrill Lynch in developing the platform for the next generation cross-asset (equities, bonds, derivatives, foreign-exchange, ...) Risk/Trade capturing systems that is replacing all the incumbent trading systems of the bank and it's acquisitions.
The platform is developed primarily in Python and leverages several popular open source applications such as Flask, Mongrel2, ØMQ, Celery. The trading systems are developed entirely in Python to an extent that the database stores only pickled python objects!
I lead the Python efforts at InMobi Engineering to build complex systems, including but not limited to web applications.
My job also includes inculcating agile web development culture and imbibe process for automated unit testing, continuous integration, proper version controlling and other software development best practices.
Movement into Python from incumbent technology platform - Java, is the company's strategic initiative with foresight to enable better maintainability of software, faster turn around time for new requirements and most of all, to keep developers happy.
We bootstrapped and built one of the most sought after consulting firm for web development using django, python across the world, by offering best in class services in software development, albeit on a small scale with a small team. - You can see for yourself, in the recommendations here, client testimonials on the website and open source code on github.
As of today, I am not involved in the day to day activities of Agiliq. It continues to deliver best in class software development and design services with awesome people leading and on board.
Developed as a client project, significant part of the backend
SD2
The science of government it is my duty to study, more than all other sciences; the arts of legislation and administration and negotiation ought to take the place of, indeed exclude, in a manner, all other arts. I must study politics and war, that our sons may have liberty to study mathematics and philosophy. Our sons ought to study mathematics and philosophy, geography, natural history and naval architecture, navigation, commerce and agriculture in order to give their children a right to study painting, poetry, music, architecture, statuary, tapestry and porcelain.
The world is in loss of so many potential sonnets!
Answer by Saniya Bhutta:
To correctly answer this question, you need to understand what women want.View Answer on Quora
And then, what “smart” women want.
The general perception is women respond better to words than men do, the same way men prefer visuals. A “smart*” woman would perhaps be moved by these lines more:
Shall I compare thee to a summer’s day?
Thou art more lovely and more temperate:
Rough winds do shake the darling buds of May,
And summer’s lease hath all too short a date:
Sometime too hot the eye of heaven shines,
And often is his gold complexion dimm’d;
And every fair from fair sometime declines,
By chance or nature’s changing course untrimm’d;
But thy eternal summer shall not fade
Nor lose possession of that fair thou owest;
Nor shall Death brag thou wander’st in his shade,
When in eternal lines to time thou growest:
So long as men can breathe or eyes can see,
So long lives this, and this gives life to thee.
compared to a ‘not-so-smart’ woman, who’d be equally happy with:
She’s nothing like a girl you’ve ever seen before
Nothing you can compare to your neighborhood hoe
I’m tryna find the words to describe this girl
Without being disrespectful
The way that booty movin’, I can’t take no more
Have to stop what I’m doin’ so I can pull up close
I’m tryna find the words to describe this girl
Without being disrespectful
Damn, girl
Damn, you’s a sexy bitch, a sexy bitch
Damn, you’s a sexy bitch, damn, girl
Coming back to the Rubik’s Cube you have on your hands, one that can only be solved using advanced vocabulary, all women want to be wooed. The flowers, the chocolates, the works. “Smart” women, may also want a coherent string of words. Or maybe a sonnet or two.
In order to get someone to write you sonnets, you need to find someone who *can* write sonnets. But if that sonnet writer is busy with someone who neither understands nor appreciates sonnets, a lot of sonnets will go unwritten.
Here’s a normal distribution chart for IQ scores
.
As you can see, “smarts” unfortunately account for 2.1% of the world population, and at a 50:50 (male to female) ratio - assuming world population of 6.9 billion people[1] - you’re left with 73.224 million males in the pool where IQs are above 2 standard deviations.[2]
Subtracting children (26%) and senior citizens (8%), you’re left with 47.609 million males, of whom only 7% have college degrees = 3.333 million.
So basically, what we have here, is a situation where there are only 3.33 million men out there who are smart, and educated. This does not exclude men already married or in relationships.
Then, limitations of religion, language and culture further shrink an already extremely small fishing pool.
You get where this is going, right?
Every time a smart guy somewhere hooks up with a “not-so-smart” girl, a kitten gets adopted by a “smart” girl.
But coming back to your original question about why smart girls are offended when smart guys date not-so-smart girls, it’s because these women are lamenting the world’s literary decline, and grieving over sonnets that are not being written.
1 Current world population - Google Search
2 A World Portrait
Mohandas Gandhi is my choice for the Person of the Century because he showed us the way out of the destructive side of our human nature. Gandhi demonstrated that we can force change and justice through moral acts of aggression instead of physical acts of aggression. Never has our species needed this wisdom more.
Microsoft Surface is not fundamentally about Microsoft needing to control the entire integrated product in order to compete with the iPad on design. It’s about Microsoft needing to sell the whole thing to sustain its current profitability.
5 days before the WWDC keynote where Apple will boot Google Maps from the iPhone and unveil their own cool new 3D mapping technology, Google Maps is holding an event to discuss “the next dimension of Google Maps”. Coincidence, I’m sure.
Note that Google is saying they will “provide a sneak peek at upcoming features” — in other words, they aren’t done yet, but they wanted to get them out there before the blowback from WWDC.
Also worth noting, I have June 6 marked down as the day of Eric Schmidt’s “six months from now” prediction. That is, on this day, Schmidt promised that more developers would be working on Android apps first instead of iOS ones. Obviously, this event isn’t related, but a nice distraction from the complete and utter lack of reality.
It’s less of someone being a jerk, and more of them being direct and to the point, coupled with a large degree of cynicism.
People are embarrassed by Siri,” says one former insider. “Steve would have lost his mind over Siri.
2,153 Apple employees reference the term “MBA” in their LinkedIn profiles out of a nonretail workforce of nearly 28,000. More than half the employees who reference “MBA” have been at Apple less than two years.
#Instantiation:
from twitter import Twitter
t = Twitter()
#Public Timeline?
t.statuses.public_timeline()
URL = http://twitter.com/friends/ids.format
t.friends.ids(screen_name='becomingguru')
import wrapper
ts = wrapper.Twitter()
user = 'scorpion032'
diff= set(ts.friends.ids(screen_name=user)) - set(ts.followers.ids(screen_name=user))
for i in diff:
try: non_fol1 = ts.users.show(id=i)
except: continue
print "%s with %d followers and %d following" %(non_fol1['name'],non_fol1['followers_count'],non_fol1['friends_count'])
Image via CrunchBase
What are the Hidden features of Python, a stackoverflow question asks. Thats a very nice thread in Stackoverflow, as of this writing has 94 answers, many very nice ones. With the kind of community on SO, how could it be any way else. Here are the 2 submissions I made to the the question.#Simulating the tertiary operator using and and or.
#and and or operators in python return the objects themselves rather than Booleans. #Thus:
In [18]: a = True
In [19]: a and 3 or 4
Out[19]: 3
In [20]: a = False
In [21]: a and 3 or 4
Out[21]: 4
#However, Py 2.5 seems to have added an explicit tertiary operator
In [22]: a = 5 if True else '6'
In [23]: a
Out[23]: 5
#Creating dictionary of two sequences that have related data
In [15]: t1 = (1, 2, 3)
In [16]: t2 = (4, 5, 6)
In [17]: dict (zip(t1,t2))
Out[17]: {1: 4, 2: 5, 3: 6}
I absolutely love this program I wrote to solve the Project Euler 2 nd problem
fib=[] def fibo(a=-1,b=1,upto=4000000): if a+b>=upto: return else: a,b=b,a+b fib.append(b) fibo(a,b) fibo() even=[i for i in fib if not i%2] print sum(even)
With my earlier experience of Project Euler (I used to solve in Java), after being quite well conversant in Python, I just had a re-look. I was simply pleased by the compactness, doing it in the pythonic way achieved. The question is to find the sum of all numbers between 1 and 1000 that are divisible by either 3 or 5. Here is how simply, we can do it in python:
a=[i for i in xrange(1000) if not (i%3 and i%5)] print sum(a)
Problem Statement
Subway trains can move people quickly from one station to the next. It is known that the distance between two consecutive stations is length meters. For safety, the train can't move faster than maxVelocity meters/sec. For comfort, the absolute acceleration can't be larger than maxAcceleration meters/sec^2. The train starts with velocity 0 meters/sec, and it must stop at the next station (i.e., arrive there with a velocity of 0 meters/sec). Return the minimal possible time to get to the next station.
Definition
Class:
Subway2
Method:
minTime
Parameters:
int, int, int
Returns:
double
Method signature:
double minTime(int length, int maxAcceleration, int maxVelocity)
(be sure your method is public)
Notes
-
Your return value must be accurate to within an absolute or relative tolerance of 1E-9.
-
If the train's speed at time 0 is v0 and the acceleration is always a, then at time t the speed will be (v0 + t * a) and the train will be (v0 * t + 0.5 * a * t^2) away.
Constraints
-
length, maxAcceleration and maxVelocity will each be between 1 and 1000, inclusive.
Examples
0)
1
2
10
Returns: 1.4142135623730951
maxVelocity is very large. So the train can keep speeding up until it reaches position 0.5.
1)
1
1
1
Returns: 2.0
2)
10
1
1
Returns: 11.0
The train reaches its maximum velocity after 1 second, while traveling 0.5 meters. It then travels the next 9 meters in 9 seconds, and takes 1 second to decelerate to 0 m/s while covering the final 0.5 meters.
3)
1
10
1
Returns: 1.1
4)
778
887
384
Returns: 2.458961621570838
5)
336
794
916
Returns: 1.301036207838119
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
public class Subway2{
public double minTime(int l,int a,int vMax){
double t,t1,t2,v,s;
v=Math.sqrt(2*a*l);
v=Math.min(v,vMax);
t1=v/a;
s=a*t1*t1/2;
t2=(l-2*s)/v;
if(l>=2*s) return 2*t1+t2;
return 2*Math.sqrt((double)l/a);
}
}
I took a couple of hours last night the to solve the problems of Google Code Jam preliminary(qualifying) round. Both are correct. And are "beautiful", or so I think.
The detailed problem statements are here: http://code.google.com/codejam/contest/dashboard?c=agdjb2RlamFtcg8LEghjb250ZXN0cxjqOQw
All the solutions are also downloadable. But many are solutions in C++ with Vectors and some nifty solutions in python. At least the top solutions are so. Any way, here I have what I think are good solutions in Java. Let me know if U think otherwise and why so. If you are looking for alternative Java solution, head over to this page: http://code.google.com/codejam/contest/scoreboard?c=agdjb2RlamFtcg8LEghjb250ZXN0cxjqOQw&show_type=all&start_pos=161&views_time=1&views_number=1&views_file=0&csrfmiddlewaretoken= to check out the solution of Tsubosaka, rank 168.
For executing, place the files a1.txt (b3.txt for the second program) in the same folder as the Java files are placed.
Problem 1: Search Engines
import java.io.*;
import java.util.*;
public class A2 {
int seMax,inMax;
String[] se,in;
int i,count;
boolean b[];
A2(int seMax,String[] se,int inMax,String[] in){
this.seMax=seMax;
this.inMax=inMax;
this.se=se;
this.in=in;
boolean bol[]= new boolean [seMax];
Arrays.fill(bol,true);
b=bol;
//System.out.println("seMax="+seMax+" inMax= "+inMax);
}
int findStrPosi(String[] sa, String str, int sMax){
int posi;
for(posi=0;posi<sMax && !str.equals(sa[posi]);posi++);
return posi;
}
int findCount(){
//System.out.println(in[]);
for(i=0;i<inMax;i++){
//System.out.println(findStrPosi(se,in[i],seMax));
int curSea=findStrPosi(se,in[i],seMax);
b[curSea]=false;
boolean isChange=false;
for(int j=0;j<seMax;isChange=isChange||b[j],j++);
isChange=!isChange;
if(isChange){
count++;
Arrays.fill(b, true);
b[curSea]=false;
}
}
return count;
}
public static void main(String[] x)throws IOException{
File file=new File("./a1.txt");
String[] se=new String[100];
String[] in=new String[1000];
BufferedReader fileIn = new BufferedReader(new FileReader(file));
String fileLine=fileIn.readLine();
int pMax=Integer.parseInt(fileLine);
for(int p=0;p<pMax;p++){
int seMax=Integer.parseInt(fileIn.readLine());
for(int q=0;q<seMax;q++){
se[q]=fileIn.readLine().toString();
}
int inMax=Integer.parseInt(fileIn.readLine());
int delcount=0;
for(int q=0;q<inMax;q++){
String inpStr=fileIn.readLine().toString();
int r=0;
for(r=0;r<seMax && !inpStr.equals(se[r]);r++);
if(r<seMax){
in[q-delcount]=inpStr;
}else delcount++;
//System.out.println("in["+(q-delcount)+"]="+in[q-delcount]);
}
System.out.println("Case #"+(p+1)+": "+new A2(seMax,se,inMax-delcount,in).findCount());
}
}
}
Problem 2: Train Schedules
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.*;
public class B {
int[] aWant,aAvail,bWant,bAvail;
int aTrains,bTrains;
B(int wt, int[] aLeave, int[] bArrive, int[] bLeave, int[] aArrive){
Arrays.sort(aLeave);
Arrays.sort(bArrive);
Arrays.sort(bLeave);
Arrays.sort(aArrive);
aWant=aLeave;
bWant=bLeave;
for(int i=0;i<bArrive.length;bArrive[i]+=wt,i++);
for(int i=0;i<aArrive.length;aArrive[i]+=wt,i++);
bAvail=bArrive;
aAvail=aArrive;
}
String findTrains(){
int aExists=0;
for(int i=aExists;i<aWant.length && aAvail.length>0;i++){
if(aAvail[0]<=aWant[i]){
aAvail[0]=2000;
Arrays.sort(aAvail);
aExists++;
}
}
int bExists=0;
for(int i=bExists;i<bWant.length && bAvail.length>0;i++){
if (bAvail[0]<=bWant[i]){
bAvail[0]=2000;
Arrays.sort(bAvail);
bExists++;
}
}
return (aWant.length-aExists)+" "+(bWant.length-bExists);
}
public static void main(String[] in)throws IOException{
File file=new File("./b3.txt");
BufferedReader fileIn = new BufferedReader(new FileReader(file));
String fileLine=fileIn.readLine(),inputs[];
int pMax=Integer.parseInt(fileLine);
for(int p=0;p<pMax;p++){
int wt=Integer.parseInt(fileIn.readLine());
fileLine=fileIn.readLine();
inputs=fileLine.split(" ",2);
int a2b=Integer.parseInt(inputs[0]);
int b2a=Integer.parseInt(inputs[1]);
int[] aLeave=new int[a2b];
int[] bArrive=new int[a2b];
int[] bLeave=new int[b2a];
int[] aArrive=new int[b2a];
for(int i=0;i<a2b;i++){
fileLine=fileIn.readLine();
aLeave[i]=Integer.parseInt(fileLine.split(" ",2)[0].split(":",2)[0])*60+Integer.parseInt(fileLine.split(" ",2)[0].split(":",2)[1]);
//System.out.println(aLeave[i]);
bArrive[i]=Integer.parseInt(fileLine.split(" ",2)[1].split(":",2)[0])*60+Integer.parseInt(fileLine.split(" ",2)[1].split(":",2)[1]);
//System.out.println(bArrive[i]);
}
for(int i=0;i<b2a;i++){
fileLine=fileIn.readLine();
bLeave[i]=Integer.parseInt(fileLine.split(" ",2)[0].split(":",2)[0])*60+Integer.parseInt(fileLine.split(" ",2)[0].split(":",2)[1]);
aArrive[i]=Integer.parseInt(fileLine.split(" ",2)[1].split(":",2)[0])*60+Integer.parseInt(fileLine.split(" ",2)[1].split(":",2)[1]);
}
System.out.println("Case #"+(p+1)+": "+new B(wt,aLeave,bArrive,bLeave,aArrive).findTrains());
}
}
}
Yes, these solutions are also available from GCJ site in this page: http://code.google.com/codejam/contest/scoreboard?c=agdjb2RlamFtcg8LEghjb250ZXN0cxjqOQw&show_type=all&start_pos=3741&views_time=1&views_number=1&views_file=0&csrfmiddlewaretoken=, My name in rank 3755- I submitted it late in the night and rank depends on at what time one submitted it.
Now I am keen on the next rounds, the earliest one on next Sunday.
Code:
import java.io.*;
public class Triangle {
double s1,s2,s3,area;
Triangle(int x1,int y1,int x2,int y2,int x3,int y3){
area=x1*(y3-y2)+x2*(y1-y3)+x3*(y2-y1);
s1=distBetween(x1,y1,x2,y2);
s2=distBetween(x1,y1,x3,y3);
s3=distBetween(x2,y2,x3,y3);
}
double distBetween(int x1,int y1, int x2, int y2){
double dist=Math.sqrt(Math.pow((x2-x1),2)+Math.pow((y2-y1),2));
return dist;
}
void triType(){
if(area==0) {
System.out.println("not a triangle");
return;
}
if(s1==s2 || s2==s3 || s1==s3){
System.out.print("isosceles ");
}else System.out.print("scalene ");
if(Math.pow(s1, 2)== (Math.pow(s2, 2)+Math.pow(s3, 2)) ||
Math.pow(s2, 2)==Math.pow(s1, 2)+Math.pow(s3, 2) ||
Math.pow(s3, 2)==Math.pow(s1, 2)+Math.pow(s2, 2))
System.out.println("right triangle");
else if(Math.pow(s1, 2)>Math.pow(s2, 2)+Math.pow(s3, 2) ||
Math.pow(s2, 2)>Math.pow(s1, 2)+Math.pow(s3, 2) ||
Math.pow(s3, 2)>Math.pow(s1, 2)+Math.pow(s2, 2))
System.out.println("obtuse triangle");
else System.out.println("acute triangle");;
}
public static void main(String[] in)throws IOException{
File file=new File("./a2.txt");
BufferedReader fileIn = new BufferedReader(new FileReader(file));
String fileLine=fileIn.readLine(),inputs[];
int iMax=Integer.parseInt(fileLine);
for(int i=1;i<iMax+1;i++){
fileLine=fileIn.readLine();
inputs=fileLine.split(" ",6);
int x1=Integer.parseInt(inputs[0]);
int y1=Integer.parseInt(inputs[1]);
int x2=Integer.parseInt(inputs[2]);
int y2=Integer.parseInt(inputs[3]);
int x3=Integer.parseInt(inputs[4]);
int y3=Integer.parseInt(inputs[5]);
System.out.print("Case #"+i+": ");
new Triangle(x1,y1,x2,y2,x3,y3).triType();
}
}
}
Input:
100
0 0 0 4 1 2
1 1 1 4 3 2
2 2 2 4 4 3
3 3 3 4 5 3
4 4 4 5 5 6
5 5 5 6 6 5
6 6 6 7 6 8
7 7 7 7 7 7
0 1 0 1 2 4
0 1 2 4 0 1
2 4 0 1 0 1
0 0 1 1 2 0
0 0 2 2 3 1
0 0 1 2 3 1
0 0 1 2 5 0
1 0 2 3 4 9
0 0 4 1 6 7
2 0 5 7 4 8
7 4 1 8 3 1
5 6 8 7 3 7
8 1 4 6 5 2
4 3 7 3 0 5
2 5 8 7 6 7
7 6 0 1 2 9
9 3 5 6 2 6
8 2 2 0 0 9
8 0 3 5 2 7
5 0 5 1 2 0
1 5 2 7 1 9
9 0 4 3 2 1
2 9 9 8 1 1
7 6 7 0 0 2
3 8 5 4 1 3
3 2 7 4 7 1
1 3 4 1 5 5
3 1 9 7 0 1
3 3 7 2 4 5
5 3 8 1 4 2
3 7 9 8 4 0
2 7 0 7 8 6
2 1 0 8 1 2
1 6 5 9 3 6
3 0 6 8 3 0
1 4 8 6 1 2
2 4 4 8 0 1
8 9 5 4 1 5
4 9 9 6 2 4
9 3 5 7 3 5
2 3 3 9 7 6
2 1 2 2 0 8
2 0 2 2 9 7
2 7 3 3 1 6
1 2 4 1 6 2
8 0 6 3 4 5
8 7 2 5 2 2
7 2 4 7 7 3
6 9 1 5 0 5
8 9 1 4 9 4
0 6 9 1 4 0
7 9 3 3 0 4
6 1 0 0 6 3
6 8 4 6 3 4
3 9 5 7 9 2
1 0 5 9 7 0
8 8 7 8 1 4
4 9 2 9 1 3
2 0 0 0 9 0
0 4 3 5 4 4
6 8 6 7 4 4
4 4 4 5 1 8
6 1 9 1 6 4
0 4 3 0 5 2
5 9 8 5 9 2
4 6 6 8 9 6
9 5 9 1 7 6
0 7 3 8 3 5
6 4 4 4 4 3
2 8 8 7 5 8
4 0 5 1 5 1
9 2 1 2 2 5
0 3 2 2 4 5
1 4 8 9 8 0
0 8 9 6 5 3
3 3 7 0 6 4
3 5 6 2 9 8
9 0 1 9 4 8
9 9 1 5 7 7
4 9 0 7 1 1
3 6 7 2 2 0
7 7 6 0 1 7
5 7 5 3 1 2
3 8 1 3 0 0
6 3 1 1 3 5
9 0 9 7 3 6
9 9 4 2 7 4
0 4 7 0 7 8
9 6 9 5 6 9
4 7 8 1 3 3
0 3 0 4 7 0
5 8 8 3 8 5
Output:
Case #1: isosceles obtuse triangle
Case #2: scalene acute triangle
Case #3: isosceles acute triangle
Case #4: scalene obtuse triangle
Case #5: scalene obtuse triangle
Case #6: isosceles obtuse triangle
Case #7: not a triangle
Case #8: not a triangle
Case #9: not a triangle
Case #10: not a triangle
Case #11: not a triangle
Case #12: isosceles acute triangle
Case #13: scalene right triangle
Case #14: isosceles right triangle
Case #15: scalene acute triangle
Case #16: not a triangle
Case #17: scalene obtuse triangle
Case #18: scalene obtuse triangle
Case #19: scalene acute triangle
Case #20: scalene obtuse triangle
Case #21: scalene obtuse triangle
Case #22: scalene obtuse triangle
Case #23: scalene obtuse triangle
Case #24: scalene acute triangle
Case #25: scalene obtuse triangle
Case #26: scalene acute triangle
Case #27: scalene obtuse triangle
Case #28: scalene obtuse triangle
Case #29: isosceles obtuse triangle
Case #30: scalene obtuse triangle
Case #31: scalene acute triangle
Case #32: scalene acute triangle
Case #33: scalene acute triangle
Case #34: scalene acute triangle
Case #35: scalene acute triangle
Case #36: scalene obtuse triangle
Case #37: scalene acute triangle
Case #38: scalene obtuse triangle
Case #39: scalene obtuse triangle
Case #40: scalene obtuse triangle
Case #41: scalene obtuse triangle
Case #42: scalene obtuse triangle
Case #43: not a triangle
Case #44: scalene obtuse triangle
Case #45: scalene obtuse triangle
Case #46: scalene obtuse triangle
Case #47: scalene acute triangle
Case #48: scalene right triangle
Case #49: scalene acute triangle
Case #50: scalene obtuse triangle
Case #51: scalene obtuse triangle
Case #52: scalene obtuse triangle
Case #53: scalene obtuse triangle
Case #54: scalene obtuse triangle
Case #55: scalene obtuse triangle
Case #56: scalene obtuse triangle
Case #57: scalene obtuse triangle
Case #58: scalene acute triangle
Case #59: scalene obtuse triangle
Case #60: scalene obtuse triangle
Case #61: scalene obtuse triangle
Case #62: scalene obtuse triangle
Case #63: scalene obtuse triangle
Case #64: scalene acute triangle
Case #65: scalene obtuse triangle
Case #66: scalene obtuse triangle
Case #67: not a triangle
Case #68: scalene obtuse triangle
Case #69: scalene obtuse triangle
Case #70: scalene obtuse triangle
Case #71: isosceles acute triangle
Case #72: scalene acute triangle
Case #73: scalene obtuse triangle
Case #74: scalene obtuse triangle
Case #75: scalene obtuse triangle
Case #76: scalene acute triangle
Case #77: scalene obtuse triangle
Case #78: scalene obtuse triangle
Case #79: not a triangle
Case #80: scalene acute triangle
Case #81: scalene obtuse triangle
Case #82: scalene acute triangle
Case #83: scalene obtuse triangle
Case #84: scalene acute triangle
Case #85: isosceles acute triangle
Case #86: scalene obtuse triangle
Case #87: scalene obtuse triangle
Case #88: scalene obtuse triangle
Case #89: scalene acute triangle
Case #90: scalene acute triangle
Case #91: scalene obtuse triangle
Case #92: scalene obtuse triangle
Case #93: scalene acute triangle
Case #94: scalene acute triangle
Case #95: scalene obtuse triangle
Case #96: isosceles acute triangle
Case #97: scalene obtuse triangle
Case #98: scalene obtuse triangle
Case #99: scalene obtuse triangle
Case #100: scalene obtuse triangle
Problem Statement
There are several empty containers lined up in a row, and you want to put packages into them. You start with the first container and the first package. Do the following until all the packages are inside containers:
If the current package cannot fit into the current container, skip to step 3. Otherwise, go to the next step.
Put the current package into the current container. Grab the next package, and go back to step 1.
Put the current container aside (you will not put any more packages into that container). Move on to the next container in line, and go back to step 1.
You are given a int[] containers, the i-th element of which is the capacity of the i-th container in line, and a int[] packages, the i-th element of which is the size of the i-th package. The constraints will guarantee that you will be able to put all the packages into containers using the above procedure. Return the sum of the wasted space in all the containers. The wasted space in a container is its capacity minus the total size of its contents.
Definition
Class:
Containers
Method:
wastedSpace
Parameters:
int[], int[]
Returns:
int
Method signature:
int wastedSpace(int[] containers, int[] packages)
(be sure your method is public)
Notes
-
A set of packages fits into a container if the total size of all the packages in the set does not exceed the capacity of the container.
-
You must use the containers and the packages in the order that they are given. You may not reorder them.
Constraints
-
containers will contain between 1 and 50 elements, inclusive.
-
Each element of containers will be between 1 and 1000, inclusive.
-
packages will contain between 1 and 50 elements, inclusive.
-
Each element of packages will be between 1 and 1000, inclusive.
-
It will be possible to put all the packages inside containers using the method described in the statement.
Examples
{ 3, 4, 5, 6 }
{ 3, 3, 3, 3, 3 }
Returns: 3
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
public class Containers {
public int wastedSpace(int[] a, int[] b){
int w=0,i,j;
for(i=0,j=0;j<b.length;){
if(a[i]>=b[j]){
a[i]-=b[j];
j++;
}else {
w+=(i==0?0:a[i]);
i++;
}
}
return w;
}
}
1: public class SpiralWalking{
2: public int totalPoints(String[] levelMap){
3: int[] pos={0,0};
4: int dim=0;
5: int ymax=levelMap.length;
6: int xmax=levelMap[0].length();
7: int cells=(ymax)*(xmax);
8: int[] size={xmax,ymax};
9: boolean isForward=true;
10: boolean[][] isDone=new boolean[xmax][ymax];
11: int score=0;
12: isDone[0][0]=true;
13: int modCounter=0;
14: for(int count=1;count<cells;count++){
15: if(pos[dim]==size[dim]-1 || (pos[dim]==0 && count!=1)
16: || ((isForward && dim==0 && isDone[pos[0]+1][pos[1]])
17: || (isForward && dim==1 && isDone[pos[0]][pos[1]+1]))
18: || ((!isForward && dim==0 && isDone[pos[0]-1][pos[1]])
19: || (!isForward && dim==1 && isDone[pos[0]][pos[1]-1]))) {
20: if(++modCounter%2==0) isForward=!isForward;
21: dim=++dim%2;
22: if(isForward)pos[dim]++; else pos[dim]--;
23: isDone[pos[0]][pos[1]]=true;
24: }else {
25: score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
26: if(isForward)pos[dim]++; else pos[dim]--;
27: isDone[pos[0]][pos[1]]=true;
28: }
29: }
30: score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
31: return score;
32: }
33:
34: public static void main(String z[]){
35: String[] inp={"86850","76439",
36: "15863",
37: "24568",
38: "45679",
39: "71452",
40: "05483"
41: };
42: System.out.println(new SpiralWalking().totalPoints(inp));
43: }
44: }
public class SpiralWalking{
public int totalPoints(String[] levelMap){
int[] pos={0,0};
int dim=0;
int ymax=levelMap.length;
int xmax=levelMap[0].length();
int cells=(ymax)*(xmax);
int[] size={xmax,ymax};
boolean isForward=true;
boolean[][] isDone=new boolean[xmax][ymax];
int score=0;
isDone[0][0]=true;
int modCounter=0;
for(int count=1;count<cells;count++){
if(pos[dim]==size[dim]-1 || (pos[dim]==0 && count!=1)
|| ((isForward && dim==0 && isDone[pos[0]+1][pos[1]])
|| (isForward && dim==1 && isDone[pos[0]][pos[1]+1]))
|| ((!isForward && dim==0 && isDone[pos[0]-1][pos[1]])
|| (!isForward && dim==1 && isDone[pos[0]][pos[1]-1]))) {
if(++modCounter%2==0) isForward=!isForward;
dim=++dim%2;
if(isForward)pos[dim]++; else pos[dim]--;
isDone[pos[0]][pos[1]]=true;
}else {
score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
if(isForward)pos[dim]++; else pos[dim]--;
isDone[pos[0]][pos[1]]=true;
}
}
score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
return score;
}
public static void main(String z[]){
String[] inp={"86850","76439",
"15863",
"24568",
"45679",
"71452",
"05483"
};
System.out.println(new SpiralWalking().totalPoints(inp));
}
}
Problem Statement
You are playing a game where you must traverse a rectangular grid of cells using a spiral path. The map is given in a String[] levelMap, where the j-th character of the i-th element is the number of points associated with the cell in row i, column j. Rows are numbered from top to bottom, starting at 0, and columns are numbered from left to right, starting at 0. All coordinates in this problem will be given as (row, column). You start at cell (0,0), the top left corner of the grid. You are facing right. You move by repeating the following strategy until you have visited every single cell on the grid exactly once. If there is an adjacent cell in front of you that you haven't visited yet, move forward to that cell. Otherwise, if there are still unvisited cells on the grid, turn 90 degrees clockwise. To calculate your final score, add up all the points for the cells that you visited, but don't include the cells in which you changed direction. The first and last cells in your path will always be included in your final score. See examples for further clarification.
Definition
Class:
SpiralWalking
Method:
totalPoints
Parameters:
String[]
Returns:
int
Method signature:
int totalPoints(String[] levelMap)
(be sure your method is public)
Constraints
-
levelMap will contain between 2 and 50 elements, inclusive.
-
All elements of levelMap will contain the same number of characters.
-
Each element of levelMap will contain between 2 and 50 digits ('0'-'9'), inclusive.
Examples
0)
{"111",
"111",
"111"}
Returns: 5
This is the spiral path you must follow: (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (2,1) -> (2,0) -> (1,0) -> (1,1).
1)
{"101",
"110"}
Returns: 3
The grid is not always a square.
2)
{"00",
"10"}
Returns: 1
3)
{"86850",
1: public class SpiralWalking{
2: public int totalPoints(String[] levelMap){
3: int[] pos={0,0};
4: int dim=0;
5: int ymax=levelMap.length;
6: int xmax=levelMap[0].length();
7: int cells=(ymax)*(xmax);
8: int[] size={xmax,ymax};
9: boolean isForward=true;
10: boolean[][] isDone=new boolean[xmax][ymax];
11: int score=0;
12: isDone[0][0]=true;
13: int modCounter=0;
14: for(int count=1;count<cells;count++){
15: if(pos[dim]==size[dim]-1 || (pos[dim]==0 && count!=1)
16: || ((isForward && dim==0 && isDone[pos[0]+1][pos[1]])
17: || (isForward && dim==1 && isDone[pos[0]][pos[1]+1]))
18: || ((!isForward && dim==0 && isDone[pos[0]-1][pos[1]])
19: || (!isForward && dim==1 && isDone[pos[0]][pos[1]-1]))) {
20: if(++modCounter%2==0) isForward=!isForward;
21: dim=++dim%2;
22: if(isForward)pos[dim]++; else pos[dim]--;
23: isDone[pos[0]][pos[1]]=true;
24: }else {
25: score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
26: if(isForward)pos[dim]++; else pos[dim]--;
27: isDone[pos[0]][pos[1]]=true;
28: }
29: }
30: score+=Integer.parseInt(String.valueOf(levelMap[pos[1]].charAt(pos[0])));
31: return score;
32: }
33:
34: public static void main(String z[]){
35: String[] inp={"86850","76439",
36: "15863",
37: "24568",
38: "45679",
39: "71452",
40: "05483"
41: };
42: System.out.println(new SpiralWalking().totalPoints(inp));
43: }
44: }
"76439",
"15863",
"24568",
"45679",
"71452",
"05483"}
Returns: 142
The following image shows your path. The yellow cell is the last cell you visit. You receive points for all the cells except the red ones.
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
Ayurveda based method of phenotypic classification of extreme constitutional types allows us to uncover genes that may contribute to system level differences in normal individuals which could lead to differential disease predisposition. This is a first attempt towards unraveling the clinical phenotyping principle of a traditional system of medicine in terms of modern biology. An integration of Ayurveda with genomics holds potential and promise for future predictive medicine.
It may linger over the curves of a woman's body, for instance. The woman is usually displayed on two different levels: as an erotic object for the characters within the film as well as the spectators watching the film. The man emerges as the dominant power within the created film fantasy. The woman is passive to the active gaze from the man.
Ayurveda based method of phenotypic classification of extreme constitutional types allows us to uncover genes that may contribute to system level differences in normal individuals which could lead to differential disease predisposition. This is a first attempt towards unraveling the clinical phenotyping principle of a traditional system of medicine in terms of modern biology. An integration of Ayurveda with genomics holds potential and promise for future predictive medicine.
"The secret of getting ahead is getting started. The secret of getting started is breaking your complex overwhelming tasks into small manageable tasks, and then starting on the first one."
-- Mark Twain
Tired of all the posts on atheism in your feed? (Endless Atheist vs. Theist questions by Coleman Foley on Rage against Quora)
No clue what all those Indians are going on and on about when they're talking about IITs and Bollywood? (Quora's "India Problem")
Is your newsfeed getting cluttered with things that you don't understand and dont care about?
There is hope. Finally, Quora has implemented "topic hiding", also known as "mute topic".
There are two ways to do this - If you are on your home page (i.e. your newsfeed) and you hover above any question/answer, a little 'x' appears to the right of the question. Clicking on the 'x' allows you to "mute" the primary topic of that question.
If you want to be more fine-grained about which topics to unfollow (i.e. you want to unfollow one of the secondary topics of the question), you'll need to go through this process:
Here is what you do:
In 2003, Portman graduated from Harvard College with an A.B. degree in psychology. "I don't care if [college] ruins my career," she told the New York Post. "I'd rather be smart than a movie star." At Harvard, Portman was Alan Dershowitz's research assistant. While attending Harvard, she was a resident of Lowell House and wrote a letter to the Harvard Crimson in response to an essay critical of Israeli actions toward Palestinians.
Portman took graduate courses at the Hebrew University of Jerusalem in the spring of 2004. In March 2006, she was a guest lecturer at a Columbia University course in terrorism and counterterrorism, where she spoke about her film V for Vendetta.
Portman has professed an interest in foreign languages since childhood and has studied French, Japanese, German, and Arabic.
As a student, Portman co-authored two research papers that were published in scientific journals. Her 1998 high school paper, "A Simple Method to Demonstrate the Enzymatic Production of Hydrogen from Sugar," co-authored with scientists Ian Hurley and Jonathan Woodward, was entered in the Intel Science Talent Search. In 2002, she contributed to a study on memory called "Frontal Lobe Activation during Object Permanence: Data from Near-Infrared Spectroscopy" during her psychology studies at Harvard. This publication placed Portman among a very small number of professional actors with a defined Erdős–Bacon number.
The apple shape changed slightly from my original design in the early 80's. The design firm Landor & Associates made the changes. They brightened the colors, they made the shapes much more symmetrical, much more geometric. When I designed it I pretty much did it freehand.
I came across this rare photograph where Zuckerberg and Adam D'Angelo (Facebook CTO at the time) are visiting Delhi for a friend's marriage. This photograph is priceless! (especially love the kid there!)
Speaking at the NASSCOM Product Conclave 2011, Vivek Wadhwa’s message to Indian entrepreneurs was simple: Silicon Valley’s model has holes. So, stop following them, stop making silly social networking applications and innovate for India.
My first reaction was, “What is he talking? Vinod Khosla has got off the stage not even a couple of minutes back. Vinod predicted that India is going to produce a plethora of billion-dollar-global product companies and also that social is still the next big thing. How could he know more than Vinod?”
There were many who were getting uncomfortable of his speech because Silicon Valley has been an inspiration for most of us. Many of them are building social apps. And they are in for the same kind of success and fame that is found in Silicon Valley. Wadhwa’s speech was even worse for me because I was to pitch him about my social media venture later. And there he was on the podium questioning the pillars of everything my start up and many other start ups stand for. Yet, I was interested in his speech because there was a germ of a feeling inside me that he may be right. A few days later I was convinced that he was.
As I spent the next few days thinking deeply about what he said I remembered an argument that once I had with a relative on the Nandigram trouble. I had argued that neither Mamata Banerjee nor the West Bengal Govt. was right. My argument was that it is utterly stupid to give up fertile land to industrialisation when a state has non-arable land. A few years later more people would agree with me since India’s agro production in 2010-11 was 2% less than the previous year – one of the contributing factors in the inflation in food prices that we faced.
If the government had anticipated that there was going to be a sudden boom in FDI in manufacturing and other sectors, it would have been wise on the part of the government to have the infrastructure built in non-arable locations. The income levels of persons dependent on agriculture in West Bengal is low and is likely to get worse with the increase in population dependent on the same quantum of land. Robbing farmers of little of fertile land they have make the farmers poorer. And if you thought it won’t affect you, if you thought it’s a reason for you to celebrate a rising India, who are you kidding? You are the one who will pay for such mistakes when the food prices go up. Growth, if not inclusive is a trouble. Wouldn’t it have been great if Tata Nano factory could be built in a piece of non arable land that West Bengal has in tens of thousands of hectares and the Nandigram farmers could be the first ones to buy those cute looking colourful Nanos?
There is a great lesson to learn from what happened in Nandigram. If USA is ahead of India, then you can’t reach where USA is unless you have traversed the path USA has to reach where it is now. So you can’t build silicon-valley-build-user base-first-monetize-later start-ups in India, unless the e-commerce eco-system is healthy and earning profits for the latter would buy your ad space. You need a ‘Pay for Online Services’ culture should you opt for a freemium business model for which you need a strong Indian user base online who have the money to splurge. India won’t have a healthy population that is adequately financially strong unless there is good and affordable education. Unless there is a healthy population that is financially strong not many would buy 4G/3G services? If no one buys 4G/3G services or fast broadband connections, there won’t be a strong communication infrastructure. If the communication infrastructure is not healthy and Indians don’t have money, how will anyone buy iPhones and why would Apple sell them? If you don’t have iPhones how will you build the next Instagram?
Hence I agree with Wadhwa’s point. We will build Instagrams, but not now. Right now, our priorities are different. Our challenges are different from the ones faced in Silicon Valley. Hence, the innovations also need to be in a different direction. Like how do eradicate child labour completely so that we can get our children into the school programs? How do we make electricity cheaper and bring it to every home in India? How do we make more people start businesses in rural areas, so that the rural economy gets vibrant?
We need a special education system in India for the rural areas- ones that ensure placements into nice paying jobs. The challenge is to build these special programs that can create a strong skilled workforce. A combination of skilled workforce and infrastructure is surely going to get the manufacturing industries set up facilities in the remotest areas of India if well connected by roads. This is how you are going to productively use the whole vastness of the land that is available to us. Folks say that India is a 1 billion strong market. Well it is sure not, not yet. Not until 1 billion of India’s people are educated and well empowered. Once they are, you will have your Silicon Valley. Not one, but many. Yes, within India.
<Cthon98> hey, if you type in your pw, it will show as stars
<Cthon98> ********* see!
<AzureDiamond> hunter2
<AzureDiamond> doesnt look like stars to me
<Cthon98> <AzureDiamond> *******
<Cthon98> thats what I see
<AzureDiamond> oh, really?
<Cthon98> Absolutely
<AzureDiamond> you can go hunter2 my hunter2-ing hunter2
<AzureDiamond> haha, does that look funny to you?
<Cthon98> lol, yes. See, when YOU type hunter2, it shows to us as *******
<AzureDiamond> thats neat, I didnt know IRC did that
<Cthon98> yep, no matter how many times you type hunter2, it will show to us as *******
<AzureDiamond> awesome!
<AzureDiamond> wait, how do you know my pw?
<Cthon98> er, I just copy pasted YOUR ******'s and it appears to YOU as hunter2 cause its your pw
<AzureDiamond> oh, ok.
"Physics Works, and I'm still alive!"
We succeeded in taking that picture [from deep space], and, if you look at it, you see a dot. That's here. That's home. That's us. On it, everyone you ever heard of, every human being who ever lived, lived out their lives. The aggregate of all our joys and sufferings, thousands of confident religions, ideologies and economic doctrines, every hunter and forager, every hero and coward, every creator and destroyer of civilizations, every king and peasant, every young couple in love, every hopeful child, every mother and father, every inventor and explorer, every teacher of morals, every corrupt politician, every superstar, every supreme leader, every saint and sinner in the history of our species, lived there on a mote of dust, suspended in a sunbeam.
The earth is a very small stage in a vast cosmic arena. Think of the rivers of blood spilled by all those generals and emperors so that in glory and in triumph they could become the momentary masters of a fraction of a dot. Think of the endless cruelties visited by the inhabitants of one corner of the dot on scarcely distinguishable inhabitants of some other corner of the dot. How frequent their misunderstandings, how eager they are to kill one another, how fervent their hatreds. Our posturings, our imagined self-importance, the delusion that we have some privileged position in the universe, are challenged by this point of pale light. Our planet is a lonely speck in the great enveloping cosmic dark. In our obscurity -- in all this vastness -- there is no hint that help will come from elsewhere to save us from ourselves. It is up to us. It's been said that astronomy is a humbling, and I might add, a character-building experience. To my mind, there is perhaps no better demonstration of the folly of human conceits than this distant image of our tiny world. To me, it underscores our responsibility to deal more kindly and compassionately with one another and to preserve and cherish that pale blue dot, the only home we've ever known.
What do you people get out of foolish comparisons like this one?
Superiority complex is a psychological defense mechanism in which a person's feelings of superiority counter or conceal his or her feelings of inferiority.
It was the first day of a school in USA and a new Indian student named Chandrasekhar Subramanian entered the fourth grade.
The teacher said, "Let's begin by reviewing some American History. Who said 'Give me Liberty, or give me Death'?"
She saw a sea of blank faces except for Chandrasekhar, who had his hand up: 'Patrick Henry, 1775,' he said.
'Very good! Who said 'Government of the People, by the People, for the People, shall not perish from the Earth?''
Again, no response except from Chandrasekhar. 'Abraham Lincoln, 1863' said Chandrasekhar.
The teacher snapped at the class, 'Class, you should be ashamed. Chandrasekhar, who is new to our country, knows more about our history than you do.'
She heard a loud whisper: 'F ___ the Indians'
'Who said that?' she demanded. Chandrasekhar put his hand up. 'General Custer, 1862.'
At that point, a student in the back said, 'I'm gonna puke.'
The teacher glares around and asks 'All right! Now, who said that?' Again, Chandrasekhar says, 'George H. W. Bush to the Japanese Prime Minister, 1991.'
Now furious, another student yells, 'Oh yeah? Suck this!'
Chandrasekhar jumps out of his chair waving his hand and shouts to the teacher, 'Bill Clinton, to Monica Lewinsky, 1997.'
Now with almost mob hysteria someone said 'You little shit. If you say anything else, I'll kill you.' Chandrasekhar frantically yells at the top of his voice, 'Michael Jackson to the child witnesses testifying against him, 2004.'
The teacher fainted. And as the class gathered around the teacher on the floor, someone said, 'Oh shit, we're screwed!' And Chandrasekhar said quietly, 'I think it was Lehman Brothers, September 15th, 2008'.
A hero is no braver than an ordinary man, but he is braver five minutes longer.
- Ralph Waldo Emerson
I'd like to share a revelation that I've had during my time here. It came to me when I tried to classify your species and I realized that you're not actually mammals. Every mammal on this planet instinctively develops a natural equilibrium with the surrounding environment but you humans do not. You move to an area and you multiply and multiply until every natural resource is consumed and the only way you can survive is to spread to another area. There is another organism on this planet that follows the same pattern. Do you know what it is? A virus. Human beings are a disease, a cancer of this planet. You're a plague and we are the cure.
Friends, Romans and countrymen... I have the same dagger for myself,
when it shall please my country to need my death.
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Joe just gave me:
25,000 credits.
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
He said, "You can't eat it. Why keep it."
OMG!!!!!!!!!!!!!!!!!!!
THANK YOU!!
THANK YOU!!
THANK YOU!!
:DDDDDDDDDDDDD
Very nice. I saw this late today. What ya got for Saturday? I'm here: https://www.facebook.com/lakshman.prasad And I am new and visiting NYC for a month or so.
And here you guys were at sprint last year: http://www.reddit.com/r/redditdev/comments/qx651/i_am_across_the_table_from_the_guys_working_on/
Bill Gates doesn't mix philanthropy and business.
pocket computers ;)
Yay! Welcome to Reddit. http://i.imgur.com/LIKIwlK.gif
Has microsoft ever considered making the cafeterias in Redmond free like their neighbours in mountain view?
How do you see the mean spiritedness and monopolistic high handedness with which Microsoft crushed Netscape? Shouldn't everyone be allowed to do their best?
If you were to do Microsoft all over again, in hindsight, what would you do differently? Also, welcome to your *first* AMA. (So glad you already seem to have plans for more.)
At what point did you move from being a businessman to a philanthropy? What were the influential factors in such a decision? Who (if any) was the primary motivator?
I just completed reading it. I haven't been working with django recently and having completely read the book, I am now up to date. * The book has a lot of practical advice having developed using django for years. For example, the book recommends, whenever you have a custom manager, always explicitly define `objects` as the default manager, before the custom manager. * The book makes a recommendation; but also mentions alternatives where applicable. The authors prefer a 3 tier project layout but also suggest that a lot of people prefer the 2 tier layout where the `manage.py` is in the root of the repository. Similarly in the chapter on the Class Based Views. The book suggests an approach and also includes other ones. * Includes the latest and the new changes in the django 1.5 wrt the User model and how to inherit. * Recommends and suggests many good third party applications. More books need to do this. * Provides good review material (if you already know) about Security, Deployment, performance etc. All of this, just over the top of my head. Real world advice is often hard to come by. Whether you are a professional or a novice or just checking out django, you should buy this book.
Have you seen the admin interface of twitter? It's a page with a list of links. [No kidding](http://www.whatsmypass.com/wp-content/uploads/2009/05/twitter.png). Developers and the entire company is there to build the user facing portal; not the front end for the 6 employees of the company. Admin has to be a easily developed with little effort. Buying a template is the right thing to do for this case. $25 would be easily spent by every company for a standard admin template; Pretty obvious such a thing should have a lot of market indeed.
s/thinking/smoking
We are the only part of it, that can even comprehend it. Which underscores our responsibility to ... *carl sagan quote*
Did Jonny call you yet?
Where do you stay? It seems fine or better, in California. Rest of the world probably has a reason to complain.
About Facebook: * IPOed at a $100 billion * Gets a significant amount of traffic from iOS devices. * Has some of the brightest minds in computer science and programming. * Cant get a half decent app for iPhone and iPad that loads (until today)
Thanks. Very helpful. I knew that the planets are in the same plain; but did not remember it now and couldn't visualize that it would translate into a line on the sky.
Forget the clouds, sand, dust. Atleast I hope the apparent brightness, distance and the size is properly simulated?
Here is the image I am referring to: https://fbcdn-sphotos-d-a.akamaihd.net/hphotos-ak-ash4/391307_479958905348033_295694373_n.jpg
It must be really hot there in his head.
submitted by scorpion032 to firstworldproblems
[link] [comment]
Just use WingIDE. I have been, for years, and am quite happy.
Each of these, people dying for the lack of food and rodent infected food is a shame in itself to such a large degree; one whilst the other is a humiliation to the entire country.