- 博客(17)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 poj1273
http://www.cnblogs.com/jackge/archive/2013/04/10/3012182.htmlEK:#include#include#include#includeusing namespace std;const int VM=220;const int INF=0x3f3f3f3f;int n,m,max_flow
2016-02-03 00:44:59
365
原创 poj2992
#include#include#include#include#includetypedef long long LL;using namespace std;const int maxn=435;bool isprime[maxn];int prime[maxn],cnt=0;int cal(int n,int p){ if
2016-02-02 19:30:42
232
原创 poj3358
#include#include#includeusing namespace std;typedef long long LL;LL pow(LL a,LL p,LL m){ LL d=1,t=a; while(p>0){ if(p&1==1){ d=(d*t)%m; } t=(t*t)%m; p=p>>1; }
2016-02-02 10:08:21
317
原创 poj1995
#include#include#includetypedef long long LL;using namespace std; LL pow(LL a,LL p,LL m){ LL d=1,t=a; while(p>0){ if(p&1==1){ d=(d*t)%m; } t=(t*t)%m;
2016-02-01 15:16:19
351
原创 poj3090
#include#include#include#include//#define LL long longtypedef long long LL;using namespace std;int phi[1005];void enlerPhi(){ memset(phi,0,sizeof(phi)); for (int i = 2 ; i 1003 ; i ++
2016-02-01 15:15:50
476
转载 datalab学习
http://blog.csdn.net/lwfcgz/article/details/8515188#/* * CS:APP Data Lab * * * * bits.c - Source file with your solutions to the Lab. * This is the file you will hand in to
2016-02-01 11:18:00
1623
原创 poj2478
#include#include//#define LL long longtypedef long long LL;using namespace std;int phi[1000005];int enlerFun(int n) { int count = n; for(int i=2;in;i++) if(n % i ==
2016-02-01 11:03:53
501
原创 poj2773
#include#include//#define LL long longtypedef long long LL;using namespace std;int pri[2000000];int gcd(int a,int b){ return b==0 ? a : gcd(b , a%b); }int main(){ int m,k,t; while(~
2016-02-01 11:03:08
352
原创 poj1284
#include#include//#define LL long longtypedef long long LL;using namespace std;LL enlerFun(int n) { LL count = n; int i = 2; for(; in; i++) if(n % i == 0
2016-02-01 11:00:59
313
原创 poj2407
#include#include//#define LL long longtypedef long long LL;using namespace std;int enlerFun(int n) { int count = n; int i = 2; for(; in; i++) if(n % i ==
2016-02-01 11:00:24
253
原创 POJ【数论/组合/博弈论】题目列表
POJ【数论/组合/博弈论】题目列表原来的列表比较水，今天换了一个难一些的列表，重新开始做~红色的代表已经AC过，蓝色的代表做了但是还没过。这句话貌似在我空间里的每份列表里都有额。博弈论POJ 2234 Matches GamePOJ 2975 NimPOJ 2505 A multiplication gamePOJ 1067 取石子游戏 威佐夫博弈，
2016-01-31 19:55:55
417
原创 poj3641
Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8075 Accepted: 3364DescriptionFermat's theorem states that for any prime number p and
2016-01-31 15:20:26
290
原创 Poj1845
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17258 Accepted: 4335DescriptionConsider two natural numbers A and B. Let S be the sum of all natural
2016-01-31 15:19:44
288
原创 silverlight 页面切换
app.xmal.cs：private void OnStartup(object sender, StartupEventArgs e) { // 此处加载主控件 this.RootVisual = new PageSwitcher(); } page.xmal: xmlns="http://schemas.microsoft.com/winfx/
2009-05-20 09:26:00
643
转载 ASP.NET AJAX Control Toolkit 新扩展特性：AutoCompleteExtender
http://blog.csdn.net/langcai1981/archive/2008/11/10/3270033.aspx
2009-04-20 23:25:00
233
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人