自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

静心潜心 解题王道

让您贱笑了。

  • 博客(28)
  • 收藏
  • 关注

原创 USACO 2.2 Subset Sums

<br />/*ID: zhangzz4PROG: subsetLANG: C++*/#include<stdio.h>const int N=40;int f[N*N/2][N];int main(){ freopen("subset.in","r",stdin); freopen("subset.out","w",stdout); int n; scanf("%d",&n); int sum=n*(n+1)/2;

2010-09-13 07:29:00 285

原创 SECTION 2.2 Preface Numbering

<br />/*ID: zhangzz4PROG: prefaceLANG: C++*/#include<stdio.h>#include<string.h>const char L[]={"IVXLCDM"};int f[8];void add(int x){ int ten=1,b=0; for(int i=0;i<4;i++,b+=2) { int d=x/ten%10; ten*=

2010-09-12 07:33:00 231

原创 2.1.6 Hamming Codes

<br />/*ID: zhangzz4PROG: hammingLANG: C++*/#include<stdio.h>int hamming(int a,int b){ int ans=0; for(int i=0;i<8;i++) if((a&(1<<i))!=(b&(1<<i))) ans++; return ans;}int main(){ freopen("hammin

2010-08-20 10:00:00 261

原创 USACO 2.1.5 Healthy Holsteins

<br />/*ID: zhangzz4PROG: holsteinLANG: C++*/#include<stdio.h>int main(){ freopen("holstein.in","r",stdin); freopen("holstein.out","w",stdout); int v,g; int d[26],f[16][26]; scanf("%d",&v); for(int i=0;i<v;i++)

2010-08-20 08:59:00 244

原创 2.1.4 Sorting A Three-Valued Sequence

<br />/*ID: zhangzz4PROG: sort3LANG: C++*/#include<stdio.h>const int N=1001;int _min(int a,int b){return a>b?b:a;}int a[N];int main(){ freopen("sort3.in","r",stdin); freopen("sort3.out","w",stdout); int n,n1=0,n2=0;

2010-08-20 07:47:00 253

原创 usaco 2.1.3 Ordered Fractions

<br />/*ID: zhangzz4PROG: frac1LANG: C++*/#include<stdio.h>#include<stdlib.h>const int N=161;int v[N][N];struct Frac{ int d1,d2; double f;}f[N*N];int n;int gcd(int a,int b){return b?gcd(b,a%b):a;}int cmp(const vo

2010-08-20 06:37:00 220

原创 2.1.2 The Castle

<br />/*ID: zhangzz4PROG: castleLANG: C++*/#include<stdio.h>#include<string.h>const int N=55*2;int sz[N*N],nn;int map[N][N];void dfs(int x,int y){ if(map[x][y]) return ; map[x][y]=nn; sz[nn]++; if(!map[x-1][y])

2010-08-19 22:57:00 193

原创 There are 常数s 和 常数s! Usaco 1.5.4 Checker Challenge

<br />/*ID: zhangzz4PROG: checkerLANG: C++*/#include<stdio.h>#include<time.h>const int N=13;int v[N],cnt,n;int _abs(int a){return a>0?a:-a;}int vv[N],vv2[2*N],vv3[2*N];void put(int x){ if(!x) return; put(x/10); put

2010-08-19 20:18:00 225

原创 1.5.3 SuperPrime Rib

/*ID: zhangzz4PROG: pprimeLANG: C++*/#include#includeint a,b;int ok(int x){ if(xb) return 0; if(x

2010-08-19 11:09:00 240

原创 1.5.2 Prime Palindromes

<br />/*ID: zhangzz4PROG: pprimeLANG: C++*/#include<stdio.h>#include<stdlib.h>int a,b;int ok(int x){ if(x<a||x>b) return 0; if(x<2) return 0; for(int i=2;i*i<=x;i++) if(x%i==0) return 0; return 1;}int cmp(c

2010-08-19 10:53:00 245

原创 1.5.1 Number Triangles

<br />/*ID: zhangzz4PROG: numtriLANG: C++*/#include<stdio.h>const int N=1001;int f[N][N];int max(int a,int b){return a>b?a:b;}int main(){ freopen("numtri.in","r",stdin); freopen("numtri.out","w",stdout); int n; scanf

2010-08-19 09:45:00 186

原创 1.4.4 Mother's Milk

<br />/*ID: zhangzz4PROG: milk3LANG: C++*/#include<stdio.h>const int N=21;int v[N][N][N];int g[N];int min(int a,int b){return a<b?a:b;}int A,B,C;void dfs(int a,int b,int c){ if(v[a][b][c]) return; v[a][b][c]=1; if(

2010-08-19 09:25:00 256

原创 1.4.3 Arithmetic Progressions

<br />/*ID: zhangzz4PROG: ariprogLANG: C++*/#include<stdio.h>const int N=251*251*2;int n,m;int v[N],b[N],cnt;int ok(int a,int b){ for(int i=0;i<n;i++) if(!v[a+b*i]) return 0; return 1;}int main(){ freopen("

2010-08-19 07:56:00 399

原创 1.4.2 Clocks

<br />/*ID: zhangzz4PROG: clocksLANG: C++*/#include<stdio.h>#include<string.h>const int N=9;char effect[N+1][N+1]={ "110110000", "111000000", "011011000", "100100100", "010111010", "001001001",

2010-08-18 11:28:00 287

原创 1.4.1 Packing Rectangles

<br />/*ID: zhangzz4PROG: packrecLANG: C++*/#include<stdio.h>#include<stdlib.h>const int N=4;struct Rec{int x,y;}rec[N],res[100*100];int cnt,ans=200*200;int cmp(const void *a,const void *b){ Rec *p1=(Rec *)a; Rec *p2=(Rec *)

2010-08-18 10:27:00 290

原创 1.3.5 Prime Cryptarithm

<br />/*ID: zhangzz4PROG: crypt1LANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>const int N=11;int main(){ freopen("crypt1.in","r",stdin); freopen("crypt1.out","w",stdout); int n; int dig[N]; int

2010-08-14 11:05:00 225

原创 1.3.4 calfflac

<br />/*ID: zhangzz4PROG: calfflacLANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>const int N=21011;char str[N],s[N];int idx[N];int ok(int i,int j){ for(;i<j;i++,j--) if(s[i]!=s[j]) return 0; retu

2010-08-13 11:44:00 251

原创 1.3.2 Barn Repair

<br />/*ID: zhangzz4PROG: barn1LANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>int cmp(const void *a,const void *b){ return *(int *)b - *(int *)a;}int main(){ freopen("barn1.in","r",stdin); freopen("ba

2010-08-12 07:47:00 266

原创 1.3.1 Mixing Milk

<br />/*ID: zhangzz4PROG: milkLANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>struct Node{ int p,a;}d[5001];int cmp(const void *a,const void *b){ return ((Node *)a)->p - ((Node *)b)->p;}int main(){

2010-08-12 07:18:00 187

原创 1.2.5 Dual Palindromes

/*ID: zhangzz4PROG: dualpalLANG: C++*/#include#include#includechar bc[]={"0123456789ABCDEFGHIJKL"};void changB(char *s,int n,int b){ int cnt=0; while(n) { s[cnt++]=bc[n%b]; n/=b; } s[c

2010-08-11 07:43:00 213

原创 1.2.4 Palindromic Squares

/*ID: zhangzz4PROG: palsquareLANG: C++*/#include#include#includechar bc[]={"0123456789ABCDEFGHIJKL"};void changB(char *s,int n,int b){ int cnt=0; while(n) { s[cnt++]=bc[n%b]; n/=b; } s

2010-08-11 07:33:00 237

原创 1.2.3 Name That Number

<br />/*ID: zhangzz4PROG: namenumLANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>char ta[]={"22233344455566677778889999"};int main(){ freopen("namenum.in","r",stdin); char d[14]; scanf("%s",d); freope

2010-08-10 22:24:00 203

原创 1.2.2 transform

<br />/*ID: zhangzz4PROG: transformLANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>int main(){ freopen("transform.in","r",stdin); freopen("transform.out","w",stdout); int n; scanf("%d",&n); char s[

2010-08-10 22:04:00 189

原创 1.2.1 Milking Cows

<br />/*ID: zhangzz4LANG: C++TASK: milk2*/#include<stdio.h>#include<string.h>#include<stdlib.h>const int N=1000001;int n;int d[N];int main(){ freopen("milk2.in","r",stdin); freopen("milk2.out","w",stdout); int st=N,ed

2010-08-09 10:14:00 182

原创 1.1.6 Broken Necklace

/*ID: zhangzz4LANG: C++TASK: beads*/#include#include#includeint main(){ freopen("beads.in","r",stdin); freopen("beads.out","w",stdout); int n; char s[365]; scanf("%d%s",&n,&s); int fb=0,fr=0; for(int i=0

2010-08-09 09:41:00 197

原创 1.1.5 Friday the Thirteenth

<br />/*ID: zhangzz4LANG: C++TASK: friday*/#include<stdio.h>#include<string.h>#include<stdlib.h>int mon[2][14]={ {31,31,28,31,30,31,30,31,31,30,31,30,31}, {31,31,29,31,30,31,30,31,31,30,31,30,31}};int main(){ freopen(

2010-08-09 09:02:00 238

原创 1.1.4

<br />/*ID: zhangzz4PROG: gift1LANG: C++*/#include<stdio.h>#include<string.h>#include<stdlib.h>int cur[11];char name[11][16];int num(char *s){ int i=0; for(;strcmp(name[i],s);i++) ; return i;}int main(){ freo

2010-08-08 22:19:00 332

原创 1.1.1

/*ID: zhangzz4PROG: rideLANG: C++*/#include#include#includeint main(){    freopen("ride.in","r",stdin);    freopen("ride.out","w",stdout);    char s1[7],s2[7];    int n1=1,n2=1;    scanf("%s%s",s1,s2);    for(int i=0;s1[i];i++

2010-08-08 22:11:00 232

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除