c**********e
发帖数: 2007 | 1 Can anybody look at this problem? The answer seems different from mine. 我觉
得答案不对。
Facebook Hacker Cup 2011 Round 1A
First or Last
As a top driver in European racing circles, you find yourself taking more
than your fair share of risks. You go into every race knowing it may be your
last, but generally with the suspicion it won't be. Today, however, may
turn out to be different. The Fédération Internationale de l'Automobile
has sanctioned a new track in the Bernese Alps that may prove to be death o... 阅读全帖 |
|
n*s
发帖数: 752 | 2 4. string transpose
import sys
def transpose(input,i):
mystr = list(input)
mystr[i],mystr[i+1] = mystr[i+1],mystr[i]
return ''.join(mystr)
def str_transpose():
print 'input two strings, separated by blank:'
a, b = sys.stdin.readline().split()
size = len(a)
if size != len(b) or sorted(a) != sorted(b):
return 'no way!'
next = [b]
parent = {b:None}
idx = size -1
notFound = True
while notFound:
newstr = []
for x in next:
... 阅读全帖 |
|
n*s
发帖数: 752 | 3 4. string transpose
import sys
def transpose(input,i):
mystr = list(input)
mystr[i],mystr[i+1] = mystr[i+1],mystr[i]
return ''.join(mystr)
def str_transpose():
print 'input two strings, separated by blank:'
a, b = sys.stdin.readline().split()
size = len(a)
if size != len(b) or sorted(a) != sorted(b):
return 'no way!'
next = [b]
parent = {b:None}
idx = size -1
notFound = True
while notFound:
newstr = []
for x in next:
... 阅读全帖 |
|
k*****y
发帖数: 744 | 4 Thanks, good point. How about
========================================
def Subset_m(v,b,l,m,output):
if l==m:
print output
return
for i in range(b,len(v)-(m-(l+1))):
output[l]=v[i]
Subset_m(v,i+1,l+1,m,output)
========================================
Add a variable b to indicate where to start for the current selection. |
|
p*****2
发帖数: 21240 | 5
Some engineers got tired of dealing with all the different ways of encoding
status messages, so they decided to invent their own. In their new scheme,
an encoded status message consists of a sequence of integers representing
the characters in the message, separated by spaces. Each integer is between
1 and M, inclusive. The integers do not have leading zeroes. Unfortunately
they decided to compress the encoded status messages by removing all the
spaces!
Your task is to figure out how many differ... 阅读全帖 |
|
p*****2
发帖数: 21240 | 6
Some engineers got tired of dealing with all the different ways of encoding
status messages, so they decided to invent their own. In their new scheme,
an encoded status message consists of a sequence of integers representing
the characters in the message, separated by spaces. Each integer is between
1 and M, inclusive. The integers do not have leading zeroes. Unfortunately
they decided to compress the encoded status messages by removing all the
spaces!
Your task is to figure out how many differ... 阅读全帖 |
|
p*****2
发帖数: 21240 | 7 我理解起来还挺费劲，可能做graph的题太少了。
n个city由one way road 相连。现在有问题就是有些城市不能连通，所以需要redirect
roads.
输入每条路redirect的cost，算出把所有城市连通所需要最小的cost。
比如
input
3
1 3 1
1 2 1
3 2 1
output
1
input
3
1 3 1
1 2 5
3 2 1
output
2
input
6
1 5 4
5 3 8
2 4 15
1 6 16
2 3 23
4 6 42
output
39
input
4
1 2 9
2 3 8
3 4 7
4 1 5
output
0 |
|
S**I
发帖数: 15689 | 8 ☆─────────────────────────────────────☆
yuhanlin (Yuhan) 于 (Mon Aug 29 00:18:17 2011, 美东) 提到:
周五面完最后一个onsite, 累的惨兮兮的, 好容易爬回家. 不管结果如何, 这段时间找
工作算是告一段落了.
下面把这段时间面试中被问到的题目整理一下, 供大家参考. 我也就不说具体是那些公
司了, 都是很典型的面试题, 到哪里都有可能会被问到.
* implement memcpy? How to improve? how to determine if a system is
32bit or 64bit?
* how is static keyword used in Java?
* a list of intervals, no overlapping and sorted, write a function to
insert an interval into the list and still keep the list sorted and no
overlapping.... 阅读全帖 |
|
s******n
发帖数: 3946 | 9 #define OUTPUT (x, y) \
if ( ++c == k) { \
printf("%d %d\n", x, y);\
return;\
}
void found(int[]a, int m, int[] b, int n, int k)
{
int i=0, j=0;
int c=0;
while(i
OUTPUT(a[i], b[j]);
if (i==m-1 && j
j++;
else if (j
i++;
else if (a[i]+ b[j+1] > a[i+1]+b[j]) {
int index = j+1;
while(index a[i+1]+b[j]) {
OUTPUT(a[i], b[index]);
index++;
}
i++;
} else { // a[i]+ b[j+1] <= a[i+1]+b[j]
int index = i+1;
while(index阅读全帖 |
|
D********g
发帖数: 650 | 10 面经回馈本版，只列出technical question.
P1:
A. Add next pointer to each node on a BTree to its next sibling on the same
level.
B. Boggle题，find all possible words from a 2D character array.
P2:
A. Given
interface Iterator {
T next();
boolean hasNext();
}
interface Predicate {
boolean accept(T t);
}
Implement a method that creates an "accept" iterator that returns items
accepted by the passedin pred variable.
Iterator conditionIterator(Iterator input, Predicate pred) {
}
B. Concurren... 阅读全帖 |
|
E*******0
发帖数: 465 | 11 int XY[][]; //coordinate points.
int numXY; //length of points in the set
bool IsInSet(Xin, Yin)
{
long Xlabel, Ylabel;//assume 64 bits long type.
//First, we segment the points set into several 64-bit sets and one
sit with smaller than 64 bits.
int iteNum = numXY / 64; // number of sets with 64 bits.
int remianNum = numXY % 64; // number of set with smaller 64 bits
//output the points in the set with smaller 64 bits.
Xlabel=0;
Ylabel=0
for (int j=1； j<=remainNum; j++... 阅读全帖 |
|
l****r
发帖数: 689 | 12 一个月前面的, 还算新鲜.感觉板上的V的面经不多. 虚拟机的
虽然最后拿到了offer, 但是很曲折. 猎头先把名字弄错了, 把我拒了, 后来HM发现后,
联系我的时候, 我已经签了其他的公司了, 错过了.
pp1:
1. print tree nodes by level (not bet)
2. given two sorted array, find kth smallest. (o(k) is not good enough)
pp2:
1. knowledge about lock, mutex, linux, kernel
2. threading related
3. write consumer and producer
4. some tasks like this:
a -> b (to do a, need to do b first)
b -> c,d,e
c - >
d -> a
e -> f
f -> e,a
Design a st... 阅读全帖 |
|
g**********t
发帖数: 475 | 13 Isn't it very slow to swap one array k times? Remember that k could be very
large! I attached my code using a different idea.Its complexity is O(n^2).
#include
#include
#include
#include
using namespace std;
int permutation(int n){
int p = 1;
for(int i = 1; i <= n; i ++){
p *= i;
}
return p;
}
string perSeq(int n, int k){
string output;
bool flag[10];
fill_n(flag, 10, false);
--k;
for (int i = 1; ... 阅读全帖 |
|
d****n
发帖数: 233 | 14 来自主题: JobHunting版 - 问一到题目 vector subsets(vector a) {
int n = a.size();
// minimum negative sum
int min = 0;
// max postive sum
int max = 0;
for(int i = 0; i < n; i++) {
if (a[i] < 0) {
min += a[i];
}
else {
max += a[i];
}
// mask[i] = 1 means there is a sub sum equals to i
int mask[] = new int[-min + max + 1];
// lookupTable[i, j] = 1 means there is a sub sum equals to j
// and a[i] is in the sub set
ve... 阅读全帖 |
|
i***0
发帖数: 8469 | 15 Please solve this problem in the form of a simple Android application. The
solution will be judged largely on quality of the Java code, not necessarily
the Android user interface. Please submit your codevia email in a zip
file and include your unit tests.
Basic sales tax is applicable at a rate of 10% on all goods, except books,
food, and medical products that are exempt. Import duty is an additional
sales tax applicable on all imported goods at a rate of 5%, with no
exemptions.
When I purch... 阅读全帖 |
|
I*****8
发帖数: 37 | 16 我记得这道题好像要用到一两个变量把,判断倒过来是否一样?
int remain= input;
int output=0;
while(remain!=0){
int number=remain%10;
remain/=10;
output=output*10+number;
}
return input==output; |
|
j********2
发帖数: 82 | 17 1. 如何设计一个 short link 生成器?
What are the keys and values in the hashtable?
2. Given an input string and an order string, e.g., "house" and "soup",
print out characters in input string according to character order in the
order string. For characters in input string but not in the order string,
output them in the end, their relative order doesn't matter. For example,
for input string "house", "souhe" and "soueh" are valid outputs.
我完全看懵了....... 这题想考什么呀? 因为我有一个很stupid的法子
Associate each char of the or... 阅读全帖 |
|
c**z
发帖数: 669 | 18 source code is as below,
vector twoSum(vector &numbers, int target) {
unordered_map m;
unordered_map::iterator it;
vector output;
int count = 1;
for ( int i = 0; i < numbers.size(); i++ )
{
if ( m.find( target - numbers[i] ) == m.end() )
m[numbers[i]];
else
{
for ( it = m.begin(); it != m.end(); it++ )
... 阅读全帖 |
|
b*******7
发帖数: 907 | 19 1. what's the output? why?
#include
#include
int main()
{
while(1)
{
fprintf(stdout,"hello-std-out");
fprintf(stderr,"hello-std-err");
sleep(1);
}
return 0;
}
2. what's the output?
#include
int main()
{
float a = 12.5;
printf("%d\n", a);
printf("%d\n", (int)a);
printf("%d\n", *(int *)&a);
return 0;
}
3. can it be built? if yes, what's the result?
file1.c:
int arr[80];
file2.c:
extern int *arr;
int main(... 阅读全帖 |
|
k***u
发帖数: 46 | 20 非热门小startup，题目可以拿来练练，前3题是online coding test，后3题是电面
1 Longest palindrome string of a given string
2 Find the smallest prime Fibonacci number X larger than n, output the
sum of the prime divisors of X+1
3 Given an array of integers, find the number of subsets where the largest
number is the sum of the remaining numbers.
4.Return the output as a string containing the first occurrence of each
character in a given string
5.Given an input string containing spaces and a width, return an output
string o... 阅读全帖 |
|
d******e
发帖数: 2265 | 21 given a string as integer.toString(), a conversion rules
1 -> a
26 -> z
output the total number of conversions.
e.g., 123 could be aw, abc, lc,
12222 could be abbbb, auu, abbu, aubb, abub, mbbb, mub, mbu
so for the 1st input, output 3,
second output 8
for 999 output 1
题目不是很难，但是没做过一遍过也不太容易，发上来攒人品吧。 |
|
w********g
发帖数: 106 | 22 来自主题: JobHunting版 - 小公司面经 knowledge题和coding都很常见，就不说了。
但是有个题我不知道考点是什么：
已给出全局变量
struct val {
char *s;
};
struct val input[100];//已事先存好100个val
struct val output[100];//已事先存好100个val，但都是任意赋值
char buffer[足够大];
要求写两个函数
InputToBuffer(void *buffer, struct val input)
BufferToOutput(struct val output, void *buffer)
第一个函数把input放到buffer里，第二个函数反之。
要求把两个函数依次执行完之后，input和output相等。
题目虽然稍微有些繁琐，但是其实意思很明确。
原题特意说过不必考虑内存不够用、字符串与结构体不valid的情况。
我不明白这题考点是什么，谁给我讲讲？
我的做法就是定义一个char *b = (char *)buffer，
然后两个函数里分别
memcpy(b, input[i], size+1)
memcpy(o... 阅读全帖 |
|
a******e
发帖数: 124 | 23 以前写程序test时候只是在main函数里简单输出一下看看对不对，最近想学一下unit
test，这个有什么格式要求吗(我看有些人用assert())？比如用c++语言想写一个
binary search的unit test该如何写，谢谢！
试着写了一个，不知道这样算不算unit test
#include
using namespace std;
int BinarySearch(int arr[], int size, int target){
int high=size-1;
int low=0;
int mid;
while(low<=high){
mid=low+(high-low)/2;
if(arr[mid]==target){
return mid;
}
else if(arr[mid]>target){
high=mid-1;
}
else{
low... 阅读全帖 |
|
b*********s
发帖数: 115 | 24 array hooper
给一个array，每个元素都是大于等于0的数字，每个数字代表可以向右跳的最大步数。
从第一个元素出发，要跳出数组。跟leetcode的jump gameII差不多，区别在于
1. 这里要求跳出数组，leetcode是要求跳到最后一个元素
2. 如果能跳出数组，给出其中一组最少步数的跳法，如不能跳出，输出failure。
leetcode是只要求给出答案能不能跳到最后
examples:
input: 1, 1 output: 0, 1, out
input: 2, 1, 3, 1, 1 output: 0, 2, out
input: 5, 6, 0, 4, 2, 4, 1, 0, 0, 4 output: 0, 5, 9, out
input: 1, 2, 1, 0, 2 output: failure
我的代码是
def hopper(a):
a.append(0)
path = []
cur = 0
maxCenter = 0
maxRange = 0
for i, n in enumerat... 阅读全帖 |
|
y*****u
发帖数: 29 | 25 Mastermind is a game of two players. In the beginning, first player decides
a secret key, which is a sequence (s1,s2,...sk) where 0 < si <= n, Then
second player makes guesses in rounds, where each guess is of form (g1,g2, .
..gk), and after each guess first player calculates the score for the guess.
Score for a guess is equal to number of i's for which we have gi = si.
For example if the secret key is (4,2,5,3,1) and the guess is (1,2,3,7,1),
then the score is 2, because g2 = s2 and g5 = s5.
Gi... 阅读全帖 |
|
s******d
发帖数: 424 | 26 想知道这属于什么难度的 是不是不同的组难度有差别？
Round 1 (Written)
1. Given an array, output an array where every index conains nearest
greatest element to that element on right side.
2. Program to convert sorted array to Binary Search Tree
3. Find first non-repeating character in String
ex: geeksforgeeks: f
geeksforgeeksFirst:o
Round 2 (F2F)
1. Given linked list as a-x-b-y-c-z
output it as a-b-c-z-y-x
that is reverse alternate element and append to end of list
2. Output nearest number greater than given number such t... 阅读全帖 |
|
c***z
发帖数: 6348 | 27 【 以下文字转载自 DataSciences 讨论区 】
发信人: chaoz (面朝大海，吃碗凉皮), 信区: DataSciences
标 题: T家在线题2道
发信站: BBS 未名空间站 (Thu Jun 19 21:00:22 2014, 美东)
已经悲剧
题1：anagram of a palindrome 要求O(N)
int isAnagrmaOfPalindrome(char *string){
unsigned int bitc = 0, i = 0;
int out = 0;
while(*string){
i = *(string++) - 'a';
bitc ^= (1 << i);
}
out = (int)(bitc & (bitc - 1));
return !out;
}
题2：重新排序整数的digits使其最大化 (e.g. 3515 -> 5531) 要求O(1)
int largestSibling(int N) {
int digit;
int temp = 0;
int output = 0;
for (digit=... 阅读全帖 |
|
k*******n
发帖数: 16 | 28 Output 1, Initial
L2 - 2
L3 - 3
L5 - 5
Output 2, generate 4, 6, 10
L2 - 4
L3 - 3 - 6
L5 - 5 - 10
Output 3, generate 6, 9, 15
L2 - 4 - 6
L3 - 6 - 9
L5 - 5 - 10 - 15
Output 4, generate 8, 12, 20
L2 - 6 - 8
L3 - 6 - 9 - 12
L5 - 5 - 10 - 15 - 20
以此类推 |
|
I*******x
发帖数: 20 | 29 去年我找工作的时候发现板上针对data scientist，machine learning engineer面试
题总结很少，所以尽量申请了很多公司面试相关职位，想看看行业里这个方向都在问什
么。有幸去过不少地方面试，现在把那些题目整理整理（全部来自Amazon, Microsoft,
Yelp, Pinterest,
Square, Google, Glassdoor, Groupon的电面和onsite)，希望能帮助在找相关工作的
同学们。
题目写的简略，请大家见谅
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
1. Given a coin you don’t know it’s fair or unfair. Throw it 6 times and
get 1 tail and 5 head. Determine whether it’s fair or not. What’s your
confidence value?
2. Given Amazon data, how to predict which users are going to be top
shoppers ... 阅读全帖 |
|
I*******x
发帖数: 20 | 30 去年我找工作的时候发现板上针对data scientist，machine learning engineer面试
题总结很少，所以尽量申请了很多公司面试相关职位，想看看行业里这个方向都在问什
么。有幸去过不少地方面试，现在把那些题目整理整理（全部来自Amazon, Microsoft,
Yelp, Pinterest,
Square, Google, Glassdoor, Groupon的电面和onsite)，希望能帮助在找相关工作的
同学们。
题目写的简略，请大家见谅
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
1. Given a coin you don’t know it’s fair or unfair. Throw it 6 times and
get 1 tail and 5 head. Determine whether it’s fair or not. What’s your
confidence value?
2. Given Amazon data, how to predict which users are going to be top
shoppers ... 阅读全帖 |
|
m***9
发帖数: 1671 | 31 被问到了这样一道题目，顿时慌了。。。有什么好的解法吗？谢谢！
在一个m X n的格子里（m，n都小于5000），每个格子都是X或者o，请找出（如果有的
话）最小size的正方形，使得所有的x都落在它的边上。
举例：
Input:
3 5
oxoxo
oxooo
oxoxo
Output:
3
Input:
3 5
oxooo
ooxoo
oooxo
Output:
-1
Input:
2 2
ox
oo
Output:
1
Input:
2 3
xxx
oxo
Output:
-1 |
|
t*********r
发帖数: 845 | 32 最近刚刚面了Apple HID group 的 sensor and algorithm组的algorithm engineer,
没有成功。记述一下面试经过，并给自己发广告求内推。
大致经过：
5月底网投。6月底recruiter电话联系。七月初hiring manager电面，就问了问简历
。接着发了三道题，让3天内做完。交上作业后，安排两周后onsite。onsite 9：30开
始，一直到4点。不包括最后的recruiter,共面了7个人，都是白板做题。一周后收到据
信。
onsite详述：
(1) Hiring manager.简单客套之后做题。(a) 两个单频信号，频率相同，如何计算
phase difference; (b)手机通话中，microphone如何cancel speaker sound;
(2) hardware engineer.先问了我做过的一个项目，然后做题。如何用rc电路设计
一个low-pass filter.如果input signal is u(t), what is the output.filter
stability, performan... 阅读全帖 |
|
R*****d
发帖数: 420 | 33 一个较难的python输出函数运行信息的project.
有一个 web service,类似这样
#!/usr/bin/env python
import web
import xml.etree.ElementTree as ET
tree = ET.parse('user_data.xml')
root = tree.getroot()
urls = (
'/users', 'list_users',
'/users/(.*)', 'get_user'
)
app = web.application(urls, globals())
class list_users:
def GET(self):
output = 'users:[';
for child in root:
print 'child', child.tag, child.attrib
output += str(child.attrib) + ','
output += ']';
... 阅读全帖 |
|
h*********g
发帖数: 51 | 34 本人fresh phd，明年毕业，有过两次大公司实习经历。最近面了FLAGT，比较幸运地拿
到了GF的offer，下面是面经
Twitter
1. 第一轮具体题目忘了
2. Design parking lot
3. Thesis discussion and high-level designs and tradeoffs
4. Translate an expression to tree. 就是把逆波兰表达式转化成树形结构。
5. Behavior.
T是第一个onsite的公司，面试的时候挺紧张的，感觉不太好。幸运地是碰到了两个国
人面试官，人真的很好，一直给我提示，给我鼓励说答得非常好，真的非常感谢！可惜
的是最终快到手的offer被烙印manager黑掉了，详情见前面发的帖子。总的感觉是
Twitter的5轮back-to-back 面试，中间没有休息，没有午餐，面完就被赶出来了，让
人很崩溃。可能裁员导致人心惶惶，recruiter也是一点不上心。
Airbnb
1. Given client server, code. Client... 阅读全帖 |
|
f*******r
发帖数: 976 | 35 恭喜，offer不错
本人fresh phd，明年毕业，有过两次大公司实习经历。最近面了FLAGT，比较幸运地拿
到了GF的offer，下面是面经
Twitter
1. 第一轮具体题目忘了
2. Design parking lot
3. Thesis discussion and high-level designs and tradeoffs
4. Translate an expression to tree. 就是把逆波兰表达式转化成树形结构。
5. Behavior.
T是第一个onsite的公司，面试的时候挺紧张的，感觉不太好。幸运地是碰到了两个国
人面试官，人真的很好，一直给我提示，给我鼓励说答得非常好，真的非常感谢！可惜
的是最终快到手的offer被烙印manager黑掉了，详情见前面发的帖子。总的感觉是
Twitter的5轮back-to-back 面试，中间没有休息，没有午餐，面完就被赶出来了，让
人很崩溃。可能裁员导致人心惶惶，recruiter也是一点不上心。
Airbnb
1. Given client server, ... 阅读全帖 |
|
c*****m
发帖数: 271 | 36 恭喜楼主，太牛逼！觉得题目大都是leetcode hard难度的啊。。。有如下几个问题问
下楼主
１、Coding flatten a list with left, right, up and down. Follow up, O(1)
space.
请问这题是不是http://www.geeksforgeeks.org/flattening-a-linked-list/的扩展呢？这里只有right和down，就是二维的情况。如果加上left，就是三维的情况了，二维解决了三维就能解决；同理加上up就是四维的，基于三维也能解决。不知道我的理解对不对
２、Given a board of characters and a dictionary, find the max number of
words on the board, each character can only be used once. 这里的character
can only be used once是对一个word还是所有的words呢？
３、Ｌ家的设计题看不懂，能不能指点下啊？二面中的output proced... 阅读全帖 |
|
|
发帖数: 1 | 38 题目如下，可以直接google "hackrank stock maximize",测试自己代码是否正确：
https://www.hackerrank.com/challenges/stockmax
Your algorithms have become so good at predicting the market that you now
know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for
the next N days.
Each day, you can either buy one share of WOT, sell any number of shares of
WOT that you own, or not make any transaction at all. What is the maximum
profit you can obtain with an optimum trading strategy?
Input
The first line con... 阅读全帖 |
|
发帖数: 1 | 39 You are given a list of tasks as an integer array, task_costs. Every i-th
element of task_costs represents a task and requires task_costs[i] seconds
to complete. All tasks listed in the array are independent of other tasks.
It is required to finish all the tasks independently and as soon as possible
. You are given a single worker robot to start taking the tasks and finish
them one at a time. However if you like, you can divide the worker robot in
two. Each resulting robot can then be further di... 阅读全帖 |
|
发帖数: 1 | 40 有机会再上其他题目.
Google:
题目大意如下,请注意输入输出的格式,这里有309 digits 的要求
https://en.wikipedia.org/wiki/Power_of_two
309 digits,相当于 2^1024
The fuel control mechanisms have three operations:
1) Add one fuel pellet
2) Remove one fuel pellet
3) Divide the entire group of fuel pellets by 2 (due to the destructive
energy released when a quantum antimatter pellet is cut in half, the safety
controls will only allow this to happen if there is an even number of
pellets)
Write a function called answer(n) which takes a posit... 阅读全帖 |
|
t*********r
发帖数: 845 | 41 最近刚刚面了Apple HID group 的 sensor and algorithm组的algorithm engineer,
没有成功。记述一下面试经过，并给自己发广告求内推。
大致经过：
5月底网投。6月底recruiter电话联系。七月初hiring manager电面，就问了问简历
。接着发了三道题，让3天内做完。交上作业后，安排两周后onsite。onsite 9：30开
始，一直到4点。不包括最后的recruiter,共面了7个人，都是白板做题。一周后收到据
信。
onsite详述：
(1) Hiring manager.简单客套之后做题。(a) 两个单频信号，频率相同，如何计算
phase difference; (b)手机通话中，microphone如何cancel speaker sound;
(2) hardware engineer.先问了我做过的一个项目，然后做题。如何用rc电路设计
一个low-pass filter.如果input signal is u(t), what is the output.filter
stability, performan... 阅读全帖 |
|
|
c*********7
发帖数: 7607 | 43 【 以下文字转载自 ebiz 讨论区 】
发信人: capricorn87 (老猫咪), 信区: ebiz
标 题: SONY Z21 release unofficial
发信站: BBS 未名空间站 (Sat Jun 4 13:05:16 2011, 美东)
I'll copy the specs here (for the case that the pages get deleted):
SONY VAIO Z21L9E/B 13,1" Nero Windows 7 Professional
Intel Core i5-2410M, 4GB DDR3, 128GB SSD Flash SATA, 13,1" LED 1600X900,
WLAN, Bluetooth, Slot 3G/HSDPA, HDMI, HD Webcam con funzione Exmor, 3D
Output, Sensore di riconoscimento impronte digitali, 1 porta USB 2.0 + 1
porta USB 3.0 SuperSpeed, ta... 阅读全帖 |
|
s*****o
发帖数: 1565 | 44 税后$625
这一代屏幕貌似不是ips的，不过也有95% gamut了吧
AC Adaptor : AC Adaptor
Processor : 2nd gen Intel® Core™ i5-2450M processor (2.50GHz / 3.
10GHz with Turbo Boost)
Chipset : Intel HM65
Color : Black
Display : 15.5" Full HD VAIO Premium Display (1920 x 1080)
Multimedia Software : No Adobe Bundle
Operating System : Genuine Windows® 7 Home Premium 64-bit
Office Software : Microsoft® Office 2010 Starter (Click More Info for
details.)
Optical Drive : Blu-ray Disc™ player
Wireless Local ... 阅读全帖 |
|
o**y
发帖数: 3065 | 45 Dull and dusty rhodium has its charms
martin mittelstaedt
From Thursday's Globe and Mail
Published Wednesday, Aug. 03, 2011 5:42PM EDT
Last updated Wednesday, Aug. 17, 2011 8:41AM EDT
4 comments
Email
Print/License
Decrease text size
Increase text size
While many investors clamour to buy gold and silver, there is a little-
known precious metal that may deserve a look: rhodium.
Widely used in automobile pollution-control devices, rhodium holds the
distinction of being the rarest and most expensiv... 阅读全帖 |
|
R*****d
发帖数: 420 | 46 一个较难的python输出函数运行信息的project.
有一个 web service,类似这样
#!/usr/bin/env python
import web
import xml.etree.ElementTree as ET
tree = ET.parse('user_data.xml')
root = tree.getroot()
urls = (
'/users', 'list_users',
'/users/(.*)', 'get_user'
)
app = web.application(urls, globals())
class list_users:
def GET(self):
output = 'users:[';
for child in root:
print 'child', child.tag, child.attrib
output += str(child.attrib) + ','
output += ']';
... 阅读全帖 |
|
o********r
发帖数: 775 | 47 2)
Stack input, stack output.
For element x entering queue:
input.push(x);
For element x leaving queue:
if (output.empty()) {
while (!input.empty()) output.push(input.pop());
}
output.pop(); |
|
a*o
发帖数: 25262 | 48 美国沦落第二。
It’s official: America is now No. 2
Hang on to your hats, America.
And throw away that big, fat styrofoam finger while you’re about it.
There’s no easy way to say this, so I’ll just say it. We’re no longer No.
1. Today we’re No. 2. Yes, it’s official. The Chinese economy just
overtook the United States economy to become the largest in the world. For
the first time since Ulysses S. Grant was president, America is no longer
the leading economic power on the planet.
It just happened — and a... 阅读全帖 |
|
t*********5
发帖数: 5404 | 49 我现在单独加了压缩器和独立话放，所以我的设备连接比较复杂，我用我曾经使用过的ART Tube MP Project Series Microphone Preamp 来解释一下吧：
这个是这个话放的背面，左边两个插口是input，就是mic in，右边两个是output，就是mic out。因为这个话放提供两种接口（XLR和1/4），所以我上面提到的两种话筒线都可以用。用一根话筒线把话筒跟input连接，然后用另一根线从output连接到电脑的声卡。（注意：我找的这个图上的话放是USB version，也就是说，可以不用output线连接，直接从左上角的USB接口和电脑上的USB slot连接，但是这样也就不经过声卡了，如果有一个非常好的声卡，就不要用USB的方法连接，用output连）
注意，左下角的9V电源插座不是话筒电源，是这个话放的电源，话筒电源在话放前面的控制面板上。见下面的图，有一个48V on/off的button。这个是给电容麦供电的作用。
如果楼主不想花大钱，这个话放其实还挺不错的（chemliu以前也推荐过），有USB和非USB两种，大概60-70刀。应该是最经济实... 阅读全帖 |
|
j*****n
发帖数: 3052 | 50 Manual上是这样写的：
The main output represents the end of the mixer chain, where your fully
mixed and enhanced stereo signal enters the real world. Connect these
outputs to the inputs of your amplifier, or powered speakers.
Tape output: Use these jacks to capture the entire performance to tape. The
signal at these jacks the main mix, and it is not affected by the position
of the MAIN MIX faders.
我现在只是把mixer唱K用，接的是Tape output到receiver的input，声音可以出来。这
样接没什么问题吧？ |
|
