W*****B
发帖数: 4796 | 1 Get your team's alerts, highlights, and stories first
GET THE B/R APP
Colin Kaepernick Offered Roster Spot on Rapper Jim Jones' Arena League
Team
Rapper Jim Jones is recruiting free-agent quarterback Colin Kaepernick to
join his team in the American Arena League.
According to TMZ Sports, Jones—a co-owner of the defending Arena Pro
Football champion Richmond Roughriders—would be willing to sign the former
San Francisco 49ers signal-caller if he was interested.
TMZ noted Jones also encourages knee... 阅读全帖 |
|
s*x
发帖数: 8041 | 2 The majority of the economic and demographic data used in the making of the
forecasts is widely available by institutions such as the CIA, IMF, UN, USG,
etc. You can see the most relevant data at every single country's page.
There is a tiny part of data coming from a variety of shadow sources such as
Internet gurus, unsigned reports and others. But all these sources are from
the internet and are of public domain for at least a minority. For example,
several years ago Dagong, the Chinese ratings ... 阅读全帖 |
|
|
a**u
发帖数: 59 | 4 #include
#include
#include
#pragma comment(lib, "wininet.lib")
/*
>bcc32 vote.c
*/
void vote(void);
int main(void)
{
unsigned int i = 0;
while (1) {
i++;
vote();
printf("搳昜偟傑偟偨 仐 %d 夞栚\n", i);
}
return 0;
}
void vote(void)
{
HINTERNET hSession;
HINTERNET hService;
HINTERNET hHttpRequest;
char sendquery[] = "poll_id=17143&question_1=2";
|
|
a**u
发帖数: 59 | 5 // Vote.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include
#include
#include
#pragma comment(lib, "wininet.lib")
int vote3(void);
void vall3(void *);
int v3;
int main(int argc, char* argv[])
{
unsigned int k,i;
if(argc==1) i=100;
else i = atoi(argv[1]);
printf("%d threads (for each vote) will be opened! \n", i);
for(k=0;k |
|
l****z
发帖数: 29846 | 6 Mexican Citizen Executed After Court Declines to Intervene
Texas executed a Mexican national whose prosecution violated U.S. treaty
obligations soon after the Supreme Court refused to intervene Thursday.
U.S. high court clears the way for Mexican man, convicted of rape, to be
executed in Texas. Video Courtesy of Reuters.
Humberto Leal Garcia, 38 years old, was convicted of the 1994 rape and
murder of a 16-year-old girl. He had asked the court to stay his execution
while Congress considered legis... 阅读全帖 |
|
l****z
发帖数: 29846 | 7 The Washington Post's Obama Deniers
March 25, 2015 - 7:27 AM
By L. Brent Bozell III & Tim Graham
It's as if they were waiting, breathlessly. The moment Ted Cruz announced
his presidential campaign, the national media proclaimed their horror. He
was "brash," a "hardliner," an "uncompromising conservative," they warned.
ABC anchor David Muir announced his agenda was the usual No list: "Promising
no abortion, no gay marriage, no gun control, no IRS."
Apparently, there's no room for hope and change ... 阅读全帖 |
|
b*****e
发帖数: 2511 | 8 就是msm失去信用之后，出来的一堆假网站和假新闻，专靠制造西坡的假新闻 挣广告钱
。
=========================================================
Domain Name: DENVERGUARDIAN.COM
Registry Domain ID: 1947577287_DOMAIN_COM-VRSN
Registrar WHOIS Server: whois.godaddy.com
Registrar URL: http://www.godaddy.com
Update Date: 2016-07-18T11:29:04Z
Creation Date: 2015-07-17T21:56:15Z
Registrar Registration Expiration Date: 2017-07-17T21:56:15Z
Registrar: GoDaddy.com, LLC
Registrar IANA ID: 146
Registrar Abuse Contact Email: [email protected]/* *... 阅读全帖 |
|
V**3
发帖数: 12756 | 9 已经怂逼了，说以后不再抗议了， 结果还是没人要他
呵呵
The originator of the national anthem protests, former San Francisco 49er
Colin Kaepernick, declared his free agency at the end of the 2016 season but
has thus far remained unsigned despite pledging to end his protest for 2017. |
|
a*****1
发帖数: 3817 | 10 哈哈
【 在 V123 (文成武德全能神教教主-正在301治脚气) 的大作中提到: 】 : 已经怂逼
了，说以后不再抗议了， 结果还是没人要他 : 呵呵 : The originator of the
national anthem protests, former San Francisco 49er : Colin Kaepernick,
declared his free agency at the end of the 2016 season but : has thus far
remained unsigned despite pledging to end his protest for 2017. |
|
W*****B
发帖数: 4796 | 11 【 以下文字转载自 Military 讨论区 】
发信人: WCNMLGB (CCC), 信区: Military
标 题: American Arena League是啥？跟NFL比咋样？
发信站: BBS 未名空间站 (Wed Dec 6 18:35:38 2017, 美东)
Get your team's alerts, highlights, and stories first
GET THE B/R APP
Colin Kaepernick Offered Roster Spot on Rapper Jim Jones' Arena League
Team
Rapper Jim Jones is recruiting free-agent quarterback Colin Kaepernick to
join his team in the American Arena League.
According to TMZ Sports, Jones—a co-owner of the defending Arena Pro
Football champion Richmo... 阅读全帖 |
|
j*********r
发帖数: 24733 | 12 FBI发的Statement没人sign？这么大的事情这是在搞笑吗？谁发的Statement？ |
|
s******s
发帖数: 3694 | 13 华邮自己造谣，两院都看过的轮得到FBI反对？
：这个可是左臂媒体WaPo的原话：
： |
|
|
|
t**********r
发帖数: 882 | 16 首先参院没有看过。
其次FBI代表一部分行政部门表示反对有什么奇怪的？这release不还得行政部门的总代
表川总点头吗？ |
|
发帖数: 1 | 17 绝经老毕又挂着假阳具装爷们出来指点江山，一个老freak整明白了office怎么用？
老毕绝了经说话都阳气十足 |
|
b*****d
发帖数: 61690 | 18 MN最高法院判了。Al Franken赢了。
(CNN) -- Minnesota's Supreme Court has dismissed former Sen. Norm Coleman's
challenge to the state's November election results and declared Democratic
challenger Al Franken the winner.
The court's unanimous, unsigned opinion declared that Franken "received the
highest number of votes legally cast" and is entitled "to receive the
certificate of election as United States senator from the state of Minnesota
."
If the ruling brings an end to seven months of challenges by Colem |
|
H**********f
发帖数: 2978 | 19 bool amIserious(unsigned yourIQ）
{
return (yourIQ >= 80)?0:1;
} |
|
h***g
发帖数: 246 | 20 二手交易风险自负！请自行验证是否合法和一手卡！:
Y
我想卖的物品:
Canadian National Park Pass(F/G)
单张面值:
CAN $136.40
可接受价格(必须明码标价！):
$60+YL
物品新旧要求:
Unsigned
邮寄方式要求:
YL
买卖双方谁承担邮寄损失(Required if not code only):
default
付款方式说明:
Paypal Only
其他补充说明:
Expire 4/30/2011
A Family/Group rate for a single day entry is $19.60 at Banff.
http://www.pc.gc.ca/eng/pn-np/ab/banff/visit/visit23.aspx
广告的有效期:
till gone
物品来源(Required for All Cards!):
Banff NP
我的联系方式:
mitbbs mail
Warranty期限:
n/a
能否证明是合法的一手卡?(Required for All Cards!):
n/a
state and zi |
|
a**********y
发帖数: 16 | 21 Entity Name: XIAOCHUN WU
Business Name: XIAOCHUN WU
License Type: Washington State Business
Entity Type: Sole Proprietor
UBI: 603229252 Business ID:001 Location ID:0001
Location Address:
TIANJIN
TIANJIN 300072
CHINA, FO, 00001
Mailing Address:
14224 73RD AVE NE APT A-208
KIRKLAND, WA, 98034-4016
Status Expires First Issued
Registered Trade Names:
EASYBUY Active N/A 08/10/2012
Governing People: XIAOCHUN WU
http://whois.doma... 阅读全帖 |
|
a**********s
发帖数: 588 | 22 If that answer is something like:
(k << A) | (((-1) << (B+1)) & N) | ((unsigned(-1) >> (32-A)) & N)
Then this is a crap 面试题... |
|
a*******y
发帖数: 1040 | 23 what do you mean ? why you say polymorphism here?
This auto_ptr class is not correct though. It has to maintain a ref and
refcount, it also need the assignment operator
I rewrote here:
template
class SmartPointer {
public:
SmartPointer(T * ptr) {
ref = ptr;
ref_count = malloc(sizeof(unsigned));
*ref_count = 1;
}
SmartPointer(SmartPointer & sptr) {
ref = sptr.ref;
ref_count = sptr.ref_count;
++*ref_count;
}
SmartPointer & operator=(SmartPointer & sptr) {
if (this != &sptr) {
re |
|
g*******y
发帖数: 1930 | 24 unsigned char BitSetCountTable256[256]
{
# define B2(n) n, n+1, n+1, n+2
# define B4(n) B2(n), B2(n+1), B2(n+1), B2(n+2)
# define B6(n) B4(n), B4(n+1), B4(n+1), B4(n+2)
B6(0), B6(1), B6(1), B6(2)
};
wow，这个太赞了！ |
|
H*M
发帖数: 1268 | 25 很简单，就是check 一个array里面有没有两个元素和为sum,
我用了两种方法，一个是sort之后，keep两个指针i,j一头一尾,相加如果小于sum就前移
，否则就后移。O(nlgn) time
另一种方法是hash table.其中一个trick就是要确信没有自己加自己。这个是唯一一个
主意点吧。O(n) with O(n) space
我写的代码如下。fail掉了。不知道为什么。
谁有什么很牛的算法更有效么？谢了。
bool checkIfTwoElementsSumToNum(vector v, int sum)
{
if(v.size() == 0)
return false;
sort(v.begin(), v.end());
unsigned i = 0,j = v.size() - 1;
while(i < j)
{
if(v[i] + v[j] == sum)
r |
|
H*M
发帖数: 1268 | 26 u guys 详细说说那个detect overflow的方法？link?
overflow一直是我一块心病，总想着什么时候搞一下，今天终于碰到关于这得题目了。
还有什么signed, unsigned, size_t之类的。我老是不知道什么时候该用什么（一般用
int）。compile的`时候总是有warning。
in
like:
,
guys |
|
t********e
发帖数: 25 | 27 Given n unsigned integer, output 2 integers which has the maximum result
after XOR. |
|
k***e
发帖数: 556 | 28 这道题有点复杂
1. are we focusing on unsigned integers now?
if so, then for (1)_2, (11)_2, (111)_2, we cannot find numbers smaller than
them with equal no of 1's.
2. are we focusing on signed integers?
if so, are we using the complementary representation, or we just count the
1's in abs(x)? how about overflow? anyway, it is messy. |
|
c****p
发帖数: 32 | 29 “找下一个要打印的数”？这又回到我开始问的问题：是否有算法可以直接算出“下一
个”，而无需比较该数已经被删除？
post一个我用linked list实现的土法:D
void RingDelete(int* values, unsigned int size, int M)
{
if (size==0) return;
printf("step: %d\n", M);
struct Node
{
int value;
Node* next;
};
Node head;
head.next = NULL;
Node* pLastNode = NULL;
// costruct a circular linked list
for(int i=0; i
{
Node* pNode = new Node();
pNode->value=values[i];
if (i==0)
{
|
|
c*****y
发帖数: 90 | 30 Given an unsigned integer 1345, the program constructs a linked list of
1->3->4->5.
有人先得出一个linked list: 5->4->3->1，然后reverse得到1->3->4->5. 我想直接得到
1->3->4->5，非递归很容易，用递归如何做？我迷惑在跳出递归的那步如何写？if(num
/10==0)
我的部分code如下，有疑问的地方用问号表示了。
Node * ConstructLinkedList(in num, Node *head)
{
if(num==0)
{
head=new Node(num, NULL);
return head;
}
if(num/10=0)
{
head->data=num;
head->next=????
}
else
{
head=new Node();
head->data=num%10;
head=ConstructLinkedL |
|
r**u
发帖数: 1567 | 31 如果是32 bit的integer，不管unsigned/signed，loop(2^32-1) {X++；｝，（X + 2^
32） % 2^32 = X, 再-1就对了吧。不知道这个解是不是很ugly，要loop 2^32-1次。 |
|
b****g
发帖数: 625 | 32 Suppose there is a C function to count and return thhe number of nodes in a
linked list.
What cases would you cover in unit tests of this function?
I can only think of two testing cases
(1): An empty list.
(2): An extrem long list with the length of the maximum value of unsigned
int.
Any other testing cases? |
|
r**u
发帖数: 1567 | 33 int compare(int A, int B) {
unsigned int k;
k = (A - B);
k = k >> 31;
return (1 - k) * A + k * B;
} |
|
k******d
发帖数: 76 | 34 一开始问了些数据库的问题，怎样设计amazon的数据库
写code删除链表中的一个元素
写code计算unsigned数中的二进制表示的1的个数
很多人排队买东西，用什么数据结构比较好，这个问题说了好久
总共面试时间36分钟 |
|
f*********e
发帖数: 97 | 35 Array elements are signed or unsigned? |
|
r**u
发帖数: 1567 | 36 You can easily get overflow.
Bitmap won't work either. Think about how much space you need for bitmap.
For unsigned int, 2^32 / 8bits/byte = 2^29 = 512MB and bitmap can't handle
duplicates. Even hash is better. |
|
h**6
发帖数: 4160 | 37 想了一个办法，勉强可以达到效果了。
unsigned __int64 erroru64;
double errret;
if(x<0)
{
errno = EDOM;
erroru64 = 0xFFF8000000000000;
errret = *(double*)&erroru64;
return errret;
} |
|
s******t
发帖数: 2374 | 38 谢谢！好像在java里面没有unsigned int。
这么说最好用c写了。 |
|
|
s********a
发帖数: 1447 | 40 不能用unsigned int 这个32bit了 |
|
r****o
发帖数: 1950 | 41 恩，好像用unsigned int占用空间更大。
问一下，怎么看一个struct 占用了多少bit啊？用sizeof()好像只能看byte。
多谢。 |
|
r****o
发帖数: 1950 | 42 假设一个结构
struct elem{
unsigned int k : 1;
};
怎么测量它的长度呢？ |
|
t******e
发帖数: 1293 | 43 我这个不会有溢出，都声明了是unsigned int
不是看作字符串的 |
|
m****n
发帖数: 589 | 44 int numberofones(unsigned int number)
{
if(number == 0)
return 0;
number = ((0xaaaaaaaa&number)>>1) + (0x55555555&number);
number = ((0xcccccccc&number)>>2) + (0x33333333&number);
number = ((0xf0f0f0f0&number)>>4) + (0x0f0f0f0f&number);
number = ((0xff00ff00&number)>>8) + (0x00ff00ff&number);
number = (number>>16) + (0x0000ffff&number);
return number;
} |
|
l******o
发帖数: 144 | 45 这个方法有意思。
int numberofones(unsigned int number)
{
if(number == 0)
return 0;
number = ((0xaaaaaaaa&number)>>1) + (0x55555555&number);
number = ((0xcccccccc&number)>>2) + (0x03333333&number);
number = ((0xf0f0f0f0&number)>>4) + (0x0f0f0f0f&number);
number = ((0xff00ff00&number)>>8) + (0x00ff00ff&number);
number = (number>>16) + (0x0000ffff&number);
return number;
} |
|
l******o
发帖数: 144 | 46
int numberofones(unsigned int number)
{
if(number == 0)
return 0;
number = ((0xaaaaaaaa&number)>>1) + (0x55555555&number);
number = ((0xcccccccc&number)>>2) + (0x03333333&number);
~~~~~~~
0x33333333吧
number = ((0xf0f0f0f0&number)>>4) + (0x0f0f0f0f&number);
number = ((0xff00ff00&number)>>8) + (0x00ff00ff&number);
number = (number>>16) + (0x00 |
|
x*****n
发帖数: 4 | 47 这里的 i 要定义成unsigned int吧，不然如果a是负数，会陷入死循环的。 |
|
s*****r
发帖数: 773 | 48 这里的2, 3, 4 种情况都不算边界情况吧, 都可以同时解决.
请看看我写的这个code如何, 我没有考虑溢出的问题, 请问溢出的情况如何考虑?
int reverseint(int value) {
unsigned sign = 1;
if( value < 0) {
value = -value;
sign = -1;
}
int newvalue = 0;
while(value > 0) {
newvalue= newvalue*10 + value%10;
value = value/10;
}
newvalue *= sign;
return newvalue;
} |
|
b******v
发帖数: 1493 | 49 #include
#include
#include
#include
using namespace std;
string findbin(unsigned int x)
{
string result;
char tmp[2];
tmp[1]='\0';
if(x==0)
return string("0");
while(x!=0) {
int r = x%2;
tmp[0] = r+48;
result = string(tmp) + result;
x = (x-r)/2;
}
return result;
}
int find012(string& s, set& result)
{
|
|
b******v
发帖数: 1493 | 50 改进了一下，不用queue，全用set，减少了重复运算
#include
#include
#include
using namespace std;
string findbin(unsigned int x)
{
string result;
char tmp[2];
tmp[1]='\0';
if(x==0)
return string("0");
while(x!=0) {
int r = x%2;
tmp[0] = r+48;
result = string(tmp) + result;
x = (x-r)/2;
}
return result;
}
int find012(string& s, set& re |
|
