精华内容
参与话题
问答
  • career

    千次阅读 2012-10-03 14:55:53
    每遇到一次因为自己一下子蠢了或者经典猥琐问题所导致的奇葩错误,都要贴到这里来,每周看一遍: 1.二维数组时少写了一维 2.看错题目 3.在交卷前突然想到一个自以为很好的优化写上去,也不和原来的程序对拍就交...

    每遇到一次因为自己一下子蠢了或者经典猥琐问题所导致的奇葩错误,都要贴到这里来,每周看一遍:

    1.二维数组时少写了一维

    2.看错题目

    3.在交卷前突然想到一个自以为很好的优化写上去,也不和原来的程序对拍就交上去,结果 wa。。。

    4.把数据范围看少了一个 0 或写错字母

    6.乱用 unsigned long long,导致减不出负数

    7.高精度写挂了,进位一定要写 +=

    8.忘记取模

    9.遍历一个有向图不能只取入度为 0 的点,因为可能正好存在一个强连通分量

    10.printf 输出实型是四舍五入的

    11.树形背包第二维应 ++ j,因为要避免有 0 的状态导致重复计算

    12.线段树下放标记应分清正负

    13.sig(a, b) && c 被写成了 sig(a, b && c) 

    14.单调队列退队忘判队空

    15.lct 求前驱后继时应 push_down;splay 第一步应为 push_down

    16.双顺序表在离散化的时候用错了;少用set或者map删除;for 完之后循环变量会比limit值大1

    17.用中国剩余定理的时候弄错了模

    18.写(-1)^k时define写成了(k ? -1 : 1);注意分类讨论要清晰,不要纠结常数

    19.判断圆包含的时候判了a含于b却没判b含于a,导致直接开了负数的根号

    20.后缀数组后面的基数排序应该等于y[i];cmp之所以带y是因为已经交换过了

    21.以后写点双一定先出割点在暴力,不要搞那个边栈

    23.vector的下标从0开始,size为开区间;离散化用map

    24.math.h里面的abs会爆int!而且不会报错。

    25.sam的len可信的只有parent的,因为当前点到parent的路径长度是连续递减的。

    26.少用临时变量,若有和全局变量重名将不堪设想。


    一些数学题:

    tips:

    莫比乌斯函数是偏续集上的容斥简化,gcd为积性函数,逆元为完全积性函数。

    pólya定理中的置换是当前所有能够发生的置换。


    1.hdu1695:求满足 a in[1, n], b in [1, m] gcd(a, b) = k 的数对 (a, b) 的对数。

    将 k 约去,即 n /= k, m /= k, 然后求互质对数。

    然后对于较小的区间[1, n]欧拉函数求解。对于[n+1, m]容斥原理求解。

    其实都可以用容斥原理做的,但是欧拉函数看起来会快一些。


    2.sdoi2010古代猪文:求 G^(Σd|n C(n, d)) % M。

    见题解。


    3.poj2480:求Σi=1 to n gcd(i, n)。

    稍微推一下即可得:ans = Σi = 1 to n Σd|i && d|n φ(d),然后就直接枚举约数求和了。


    4.poj2917:求对于给定的n,方程1/a + 1/b = 1/n 的解的个数。

    貌似考过。。。将方程变形:(a - n) * (b - n) = n * n, 这就相当于裸枚约数了。


    5.poj3421:求满足a0 = 1, an = m, ai|ai+1的数列的长度和方案数。

    长度就是质因子数目吧。。。方案数不是无重有序分组么。。。就这样。。。


    6.bzoj1876:高精度gcd。

    用java,python水过了。自己写的按位竟然超时。。。


    7.bzoj2818:给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.

    预处理欧拉函数前缀和+枚举质数水过。。。


    8.bzoj2820:7的超级加强版。

    见题解。


    9.spoj GCDEX:求Σi=1 to n Σj=1 to n gcd(i, n)。

    一开始用jzp的方法写了个O(sqrt(n)) per query的,但是T了。。。因为有改过时限。。。

    然后忽然发现两个都是到n。。。于是可以简化问题:

    ans(n) = gcd(1, 2) + gcd(1, 3) + gcd(2, 3) + 。。。

    有没有发现只要可以预处理Σi=1 to n gcd(i, n) - n 就可以了?

    然后用了一种复杂度不好估计但是应该不超过O(nlogn) 的方法预处理,O(1) 回答。


    10.hnoi2008 cards

    题目分析可得:有m+1个置换,求给定数量的三种颜色染色的不动方案数。

    此题貌似不能直接pólya做,所以考虑burnside。

    由于不动类一定是每一个循环节被染为同色,所以可以dp算出每一种置换的不动类数。

    然后由于模为质数,所以直接费马小定理求逆元算出平均数即可。


    11.scoi2009游戏:求给定长度序列很以任意置换回到原状态所需步数的方案数。

    分析可得对于一个置换,步数就是所有循环节长度的lcm。

    于是有一个结论:

    若 m = p1^k1 * p2^k2 * ect, n = a1 + a2 + ect, lcm(a1, a2, ect) = m,则

    n 取到最小值当且仅当 a1 = p1^k1, a2 = p2^k2, ect。

    其中p1, p2, ect为质数。

    然后以f[i][j]表示枚举到第i个质数,和为n的方案数,dp即可。


    12.hnoi2009图的同构:见题解。


    13.bzoj1042: 一共有4种硬币,面值分别为c1,c2,c3,c4。买东西去了tot次, 每次带di枚ci硬币,买si的价值的东西。请问每次有多少种付款方法。

    首先容易想到把物品二进制分解暴力dp,但是肯定会TLE,因为复杂度为O(totslogc),而tot*s为10^8级别。

    首先考虑无限制的背包。对于给定的s以及f[s](f为方案数),对于d转移时有f[s] += f[s - d * c], 可以理解为从状态s-d*s起再用d枚硬币转移到状态s,而其他种类的硬币任意分配。故f[s - (d+1)*c]的意义为用d+1枚硬币。

    考虑当前的限制,就可以用容斥原理解了。想得还是不很清楚,希望可以问到更好的证明。


    14.bzoj1045平分糖果:环形均分纸牌变种。

    一直都不怎么很理解环形均分纸牌,希望可以提高数学推导能力。

    首先考虑不是环的情况。

    首先全部减去平均数,由于给负数相当于被给整数,那么只用考虑一种给的方向,很显然可以贪心选取。

    令p[i]为i要给后面的个数,则易得p[i] = p[i-1] + a[i] = Σi=1 to i a[i] 。答案即为p数组的和。

    在考虑有环的情况。不能像原来那样贪心选取了,因为第n个可能给第1个。

    设第n个给第一个k个,则 ans = Σi=1 to n abs(p[i]+k),等价于数轴上-k到p[1], p[2], ..., p[n]的距离和。

    易知当-k为其中位数时ans最小化,即为答案。


    15.一个拉格朗日四平方和的题。

    纯粹打表找规律,拿来练手miller_rabin和pollard_rho。


    16.解方程:x^n = A (mod P),P is a prime and below 2*10^9.

    毫无头绪是么。

    首先考虑P的原根q,有q的1..p-1次方构成P的完全剩余系。

    令x = q^a, A = q^b, 首先有q^b =A (modP),用baby-step-giant-step可以在O(sqrt(P) * lg(P))的时间内解决。

    然后有q^(a * n) = q^b,因为构成完全剩余系,故a*n = b (modP),等价于解一元模方程。于是问题解决了。


    17.求通过m次取反任意三个位置将长度为n的01序列A变成01序列B的方案数。

    一道神奇的容斥dp。

    题目等价于取奇数次不等的位。f[i][j]表示前i次操作使j个特定的位为奇数次。


    hnoi2012:
    1.双十字:二分+暴力树状数组。
    2.排队:公式+高精。
    3.nand:不会。
    4.mine:割点。
    5.triangle:用平衡树乱搞。
    6.射箭:转半平面交。
    7.永无乡:启发式合并平衡树。
    8.集合选数:转状压dp。


    网络流24题:

    1.一些显然可以通过流量平衡表示来做。

    2.最大权闭合图:源连正负连汇,答案为正点权和减去最大流。

    3.二分图最小边覆盖或最大独立集:源连左汇连右流量为点权,答案为总点权减去最大流。

    4.有向图最小路径覆盖:拆点后最大匹配,答案为匹配数。

    5.不相交路径或限制点的选取:拆点流量为一的边之类即可。

    6.最小割:转最大流或平面图转最短路。

    7.矩阵行列限制:考虑每行分别向每列连边,容量限制当前点的权。


    听课:

    1.莫队算法:对于无修改的询问的通用O(n*sqrt(n))的算法。考虑暴力回答询问,每两个区间的代价是|l1-l2| + |r1-r2|。考虑最小化Σ|li-li-1| + |ri-ri-1|,可以计算曼哈顿距离最小生成树,也可以按(|r-l| div sqrt(n), l)双关键字排序得到回答序列,可以保证复杂度是O(n*sqrt(n))。

    展开全文
  • Career

    2012-04-12 11:07:50
    06/8/31 入Foxconn NE(硬网工程师) 06/11/ SFC工程师 系统运维 08/5/24考数据库系统工程师 08/11 考OCP 09/3/10 leave Foxconn 09/4/7 入Gemalto OTA 11/7/31 leave Gemalto ...12/4/12 Today
    06/8/31 入Foxconn NE(硬网工程师)
    06/11/ SFC工程师 系统运维
    08/5/24考数据库系统工程师
    08/11 考OCP
    09/3/10 leave Foxconn


    09/4/7 入Gemalto OTA
    11/7/31 leave Gemalto


    11/8/8 入Axxis DBA
    12/4/12 Today
    展开全文
  • <p>I have been rewriting parts of DMP over the past few days which would allow people to share career/science mode rewards over the network. <p>This was something that a friend and I were thinking ...
  • Insider Advice on Landing a Job at Google, Microsoft, Apple, or any Top Tech CompanyBecome the applicant Google can't turn downCracking the Tech Career is the job seeker's guide to landing a coveted ...
  • Career Classification – Possible Career Options

    Career Classification – Possible Career Options

    In the previous article, I talked about self-assessment and hopefully at this point, you are already well aware of your skills, interests, and personality. Also, mentioned last time was a very important point: you need to find a career that will match your skills, interests, and personality otherwise you could end up with a job in which you will not be able to excel. In this article, I will guide you in being able to list possible occupations that will fit you. Understand that there is no such thing as a “universal job” and people would differ in what they perceive as the best job for them.

    Now that you have completed your self-assessment, it is time for you to go over these career classifications, and determine which of these would fit you better than the rest.

    Technical Jobs : This type of occupation would be suitable for a person who prefers a career involving technical or functional tasks, such as the use of computers, computer hardware, machines, equipment, and others. If you like math and codes, and you enjoy analyzing and solving problems, and then a job as a programmer, engineer, or an accountant could be something that you would do well in.

    Creative Jobs : This type of occupation involves using your creativity to be able to produce something, whether tangible or not. Developing new products and services, as well as coming up with innovative strategies will provide a sense of fulfillment to some people and if you belong to this group, you could excel in a job involving arts, media, and design such as being a graphic artist, fashion designer, or an interior designer.

    Management Jobs : This type of occupation is best suited for people who have good managerial and organizational skills. If you are able to work well with other people, can work with minimum supervision, have initiative, confidence, and leadership qualities, you should build your career towards a management position. You could be a product or brand manager, project manager, or a retail manager.

    Independent Jobs/Freelance Jobs : This type of occupation is recommended for people who prefer to work in their own pace. If you are the type of person who would like to work from home or simply be your own boss, then an independent or freelance job could be something you should consider. Independent jobs include contractors, consultants, doctors, and lawyers. Freelance jobs can be of any kind but the most in-demand occupations nowadays are those in the fields of IT, Communication, and Education.

    Manual Labor Jobs : This type of occupation is for people who prefer to make use of their body, specifically their hands to perform their work. This is classified as an unskilled type of occupation, which are best suited for people who do not have a college degree but still want to land a well-paying job. Examples are: construction workers, plumbers, and carpenters.

    Security-Related Jobs : This type of occupation is for individuals who have the desire to work in a job that is filled with risks and thrills. Generally, these risky jobs involve keeping people, property, and society safe and secure. If you are someone who has a passion to look after others, and is physically robust and strong, then you could do well in jobs such as a police officer, bodyguard, a private investigator, and even work in the Armed Forces.  There are other types of occupations not mentioned here, such as those in sales, marketing, and health care.

    In order to take a step further to be able to land a job that is best suited for you, it is necessary to list down all possible occupations that you would like to go into. From there, evaluate your options by familiarizing yourself with the nature of the job, and consider the outcome of your self-assessment as one of the major deciding factors. In the next topic, I will talk about goal setting so that you can be on your way to carving out a successful career for yourself.

    展开全文
  • Career-

    2019-06-12 15:59:44
    1*,绝技网;网站、小程序; www.72jjw.com www.hearface.com (187) www.aenjon.com (aenjon) [导航] 2*,App 自由相亲网;www.123521.cn 6*, earout: hearface自媒体:耳...

    1*,绝技网;网站、小程序; 

             www.72jjw.com 

            www.hearface.com      (187) 

             www.aenjon.com      (aenjon)

     [导航]
    2*,App 自由相亲网;www.123521.cn                      
    6*, earout:  hearface自媒体:耳外:把耳朵放在外面,广听天下;  www.earout.com 

    7*,个人

    3,App 家教在线预约;                  
    4,App 线上配眼镜;                      
    5,  App 测试未来的自己;             

     

     

    ?mid=&wid=51824&sid=&tid=8357&rid=LOADED&custom1=mp.csdn.net&custom2=%2Fpostedit%2F90340105&t=1560135997883?mid=&wid=51824&sid=&tid=8357&rid=BEFORE_OPTOUT_REQ&t=1560135997884?mid=&wid=51824&sid=&tid=8357&rid=FINISHED&custom1=mp.csdn.net&t=1560135997885?mid=&wid=51824&sid=&tid=8298&rid=LOADED&custom1=mp.csdn.net&custom2=%2Fpostedit%2F90340105&t=1560135997890

     

     

    展开全文
  • Career management

    2016-10-26 20:18:04
    Career management is the combination of structured planning and the active management choice of one’s own professional career.
  • New Career

    2014-10-31 23:21:00
    Today I received the official confirmation letter with very good grade for the probation, it means that I will start my new career with Application Development Manager with effect from today....
  • Career Fair

    2014-02-01 05:37:21
    2.4: AllianceBernstein Amazon Lab126 AMAZON.COM Andreessen Horowitz ANSYS, Inc. Aspera Inc. Bank of America Bloomberg LP Cisco Systems, Inc. facebook ... RES
  • Career Coach

    2008-11-21 22:08:00
    A career or job coach is someone who specializes in helping people to find a nd achieve their career dreams. 在国外,Career Coach--职业教练,是一个相当盛行的职业。 无论是工作的还是还没有工作的...
  • Career Opportunities

    2005-02-14 22:46:00
    Career OpportunitiesCareer Corner is a beginning to help you start the journey of finding your career. In it we offer links to sites, which will help you identify your key skills, write a resume, and ...
  • career english

    2007-12-31 08:36:00
    本文介绍一些常见的英语描述,非常实用的句型,很适合背诵哦! Mature, dynamic and honest,excellent ability of systematical management.... Ability to work independently, mature and resourceful....
  • Career Path

    千次阅读 2010-08-11 22:32:00
    http://www.developerdotstar.com/mag/articles/programmer_career.html<br />    I recently interviewed for a Business Analyst position with the CIO of a large multi-national software ...
  • HCI Career

    2011-01-10 09:49:00
    HCI Career
  • career复习

    2009-05-30 15:21:00
    复习计划: 算法值得单独拿出来说一说,这倒也不是说在工作中能有多大的作用,只是很多公司都拿这个来作为区分标准。毕竟其他可能大家都学过,可能区分度并不大。经常听说某人成绩一般,实验室项目一般,实习一般,...
  • abaper career

    2008-02-22 12:49:00
    Hi. Ive been working on SAP ABAP for ten years, mostly in a consulting environment, from which I recently moved to a permanent role close to home. I made the move because I was sick of being on-site,
  • programming career

    2020-06-11 11:17:28
    学底层,无论什么新技术,都是对底层的封装。 项目关键源码写成技术文档,写过的脚本,用过的工具归类保存。(时间长不用会忘) 保持好奇心,坚持学习。
  • Programming career

    2020-06-12 08:13:44
    学底层,无论什么新技术,都是对底层的封装。 项目关键源码写成技术文档,写过的脚本,用过的工具归类保存。(时间长不用会忘) 保持好奇心,坚持学习。
  • <div><p>Windows career portal not showing i still have a same issue like this issue : https://github.com/opencats/OpenCATS/issues/216, still blank page, i re-install until five times. please tell me ...
  • Joan Vaughn >LearningExpress | ISBN 1-57685-374-8 | 2001 | 202 Pages | PDF | “ This book is ideal for anyone looking to enter into the computer fiel
  • CAREER鲜红立体字母PPT素材.pptx,CAREER鲜红立体字母PPT,适用于分析与职业有关的内容或者职业计划等情况,可以用在合作签约PPT中,职业规划PPT中,就业安排PPT中,CAREER鲜红立体字母,非常的醒目吸引
  • <div><p>Hi,i have a raspeberry pi 3b with latest version RETROPIE plus AMIBERRY put rom .LHA all versions Sensible World Of Soccer 95/96 96/97 97/98 when play in career mode and select (example Serie ...
  • 咨询业圣经级书籍,非常适合咨询入门级小白使用~
  • My ideal career

    2008-11-24 22:03:00
    我一直梦想着我以后能有以后这样的状态:拿着我最新的研究成果,用ppt给人家演示,或是给人家一起讨论。总觉得,这是一种特别好的生活,做自己喜欢的事,学会分享。这真的很不错哟。我一直也会为这种状态的获得而...
  • Personal career schedule

    2017-06-29 16:24:45
    It's been almost one year since I started to work. Currently, I think that I can handle most of the problems which I meet during my daily work. Today, I just talked with HR in my company and actually,
  • My career aspirations

    2015-06-15 14:20:00
    Mydream I have a dream, Iwant to be a teacher to teach computer science, in the future, In order tocomplete my dream. I need  to do these things to exercise myself. First of all, Ineed to have a st

空空如也

1 2 3 4 5 ... 20
收藏数 2,298
精华内容 919
关键字:

career