2014年10月_流年冲淡时光

#include#include#include#include#include#includeusing namespace std;char s1[27]="A 3 HIL JM O 2TUVWXY5";char s2[10]="1SE Z 8 ";int is_pali(char* a){int len=strlen(a);for(

2014-10-05 20:56:16 479

翻译 UVA457水题

#include#include#include#include#include#includeusing namespace std;int main(){int cas;scanf("%d",&cas);while(cas--){int a[10];for(int i=0;iscanf("%d",&a[i]);int neww[5

2014-10-05 19:09:42 709

翻译 UVA694

#include#include#include#include#include#includeusing namespace std;int main(){int a,limit,cas=0;while(scanf("%d%d",&a,&limit)!=EOF){cas++;if(along long sum=1;long long b

2014-10-05 16:51:23 503

翻译 UVA489水题

#include#include#include#include#include#includeusing namespace std;int main(){int round;char s[1000],s1[1000];while(scanf("%d",&round)!=EOF&&round!=-1){scanf("%s%s",s,s1);

2014-10-05 15:47:12 475

翻译小白书84页100！的素因子个数

#include#include#include#include#include#includeusing namespace std;int is_prime(int n){for(int i=2;i*iif(n%i==0) return 0;return 1;}int prime[100],ccount=0;int main(){

2014-10-05 08:13:25 516

翻译 ZOJ1115

#include#include#include#include#includeusing namespace std;int main(){char ch;while(1){int sum=0;while(scanf("%c",&ch)&&ch!='\n'){sum+=ch-'0';}if(sum==0) break;if(s

2014-10-05 08:12:41 390

翻译 zoj1105

#include#include#include#include#includeusing namespace std;double distance(double x1,double y1,double x2,double y2){return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}int main(){do

2014-10-05 08:12:28 492

翻译 N！小白书72页

#include#includeconst int maxn=3000;int f[maxn];int main(){int i,j,n;scanf("%d",&n);memset(f,0,sizeof(f));f[0]=1;for(i=2;i{int c=0;for(j=0;j{int s=f[j]*i+c;f[j]=s%10;

2014-10-05 08:12:13 320

翻译小白书79页对字符串和字符的排序

#include#include#include#include#include#includeusing namespace std;int n;char word[2000][10],sorted[2000][10];int cmp_char(const void* _a,const void* _b){char* a=(char*)_a;ch

2014-10-05 08:11:44 463

翻译小白书77页

//#include#include#include//#include//#include//using namespace std;int get_next(int x){int a,b,n;char s[10];sprintf(s,"%d",x);n=strlen(s);for(int i=0;ifor(int j=i+1;jif(s[

2014-10-05 08:11:29 485

翻译小白书55页水题的小技巧

#include#include#include#include#includeusing namespace std;int is_prime(int x){int i,m;assert(x>=0);if(x==1) return 0;m=floor(sqrt(x)+0.5);for(i=2;iif(x%i==0) return 0;re

2014-10-04 21:49:17 364

转载 ZOJ1099字符串水题

#include#include#include#include#includeusing namespace std;int main(){int count=0;char word[81];while(scanf("%s",word)!=EOF){if(strcmp(word,"")==0){if(count!=0)printf("\

2014-10-04 21:48:56 440

翻译小白书70页水题

#includechar *s="`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./";int main(){int i,c;while((c=getchar())!=EOF){for(i=1;s[i]&&s[i]!=c;i++);if(s[i]) putchar(s[i-1]);elseputchar(c);

2014-10-04 21:48:35 362

翻译小白书21页阶乘之和

#include#include#include#include#include#includeusing namespace std;int main(){const int MOD=1000000;int i,j,n,s=0;scanf("%d",&n);if(n>25) n=25;for(i=1;i{int factorial=1;

2014-10-04 21:48:10 395

翻译 ZOJ1095计数器的应用

#include#include#include#include#include#include#includeusing namespace std;int a[5850];int main(){//int a[5850];int n=1;int p2,p3,p5,p7;p2=p3=p5=p7=1;a[1]=1;while(n{

2014-10-04 21:47:41 430

转载 ZOJ1090求外接圆面积

#include#include#include#include#include#include#include#define PI 3.141592653589793using namespace std;double square(double x){return x*x;}int main(){double x1,y1,x2,y2,

2014-10-04 21:47:19 688

翻译小白书41页最长回文字串

#include#include#include#include#include#include#include#define MAXN 5000+10using namespace std;char buf[MAXN],s[MAXN];int p[MAXN];int main(){int n,m=0,max=0,x,y;int i,j;

2014-10-04 21:46:59 296

翻译小白书39页sprintf与格式控制

#include#include#include#include#include#include#includeusing namespace std;int main(){int i,ok,abc,de,x,y,z,count=0;char s[20],buf[99];scanf("%s",s);for(abc=111;abcfor(de=

2014-10-04 21:46:33 425

转载 HDU1028关于母函数以及递推

本题可以使用俩种方法即递推和母函数。首先贴上递推的代码：

2014-10-04 21:46:02 462

翻译 ZOJ1089精度除法

#include#include#include#include#include#define MaxN 100using namespace std;int main(){char src[MaxN];int i,j;while(~scanf("%s",src)){char dest[MaxN]={'0'};int index=0;fo

2014-10-04 21:45:23 473

转载 HDU4920矩阵乘法优化之转置

首先说一下关于CPU cache对程序性能的

2014-10-04 21:45:19 590

翻译 ZOJ1089枚举

#include#include#include#include#include#define MaxN 100using namespace std;int main(){int line=0;int n;while(scanf("%d",&n)!=EOF&&n){if(line) printf("\n");int num[14];f

2014-10-04 21:45:03 461

转载模拟之双队列HDU4884

#include#include#include using namespace std;const int N=1010;const int lim=24*60;int T,n,t,k,m;int cnt[N],last[N];void print(int time){if(time>=lim) time%=lim;printf("%02d:%02d\

2014-10-04 21:43:29 488

转载 next_permutation的简单应用HDU1207

#include#include#include#includeusing namespace std;int num[10];//据标记从后往前比较相邻两数据，若前者小于（默认为小于）后者，标志前者为X1（位置PX）表示将被替换int f(int x)//，再次重后往前搜索第一个不小于X1的数据，标记为X2。交换X1，X2，然后把[PX+1，last)标记范围置逆。完成。

2014-10-04 21:42:59 402

转载 hash表的应用HDU4886

#include#includeconst int N=2100005;int t,mi[10];bool hash[N];char str[N];void bui(int len){int n=strlen(str);int pre=0,s=0;for(int i=0;i{s=s*8+str[i]-'A';if(i-pre==len){

2014-10-04 21:41:11 480

转载 HDU4801DP，异或运算，与运算，hash的应用

这题用了两次DP，先从前往后求一次异或的，再从后往前求一次与运算的。分别是1：求异或的时候，定义二维数组huo[1000][1024]，前者指第几位，后者是哈希的思想，若huo[x][y]=2则表示最右边的数为第x位时，异或值为y的出现了两次，需要再定义一个hash数组，来保存前面出现的所有情况，再找有多少位的时候，用hash数组中出现的所有的值与当前的第x位的数字进行异或。2：求

2014-10-04 21:40:53 760

转载 HDU4902巧妙分析避开线段树的使用

#include#include#include#includeusing namespace std;const int ms=1e5+5;struct unit{int t,l,r,x;}a[ms];int vis[ms],ege[ms];int gcd(int a,int b){return b?gcd(b,a%b):a;}int

2014-10-04 21:40:13 392

翻译 UVA445水题

#include#include#include#include#include#includeusing namespace std;int main(){char s[140];while(gets(s)!=NULL){if(s[0]==' '){puts("");continue;}int beg=0;for(int

2014-10-04 21:37:46 433

空空如也

空空如也