![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm
邱新磊
这个作者很懒,什么都没留下…
展开
-
HDU-FatMouse's Speed
#include #include#include#includeusing namespace std;const int MAX = 1001; struct S{ int a,b,t;}s[MAX];int dp[MAX],path[MAX],over[MAX];bool cmp(struct S a,struct S b){ if(a.a!=b.a) return原创 2017-04-13 18:05:23 · 229 阅读 · 0 评论 -
汉诺塔IV
汉诺塔IV#includeint main(void){ long long a[21]={0,2}; for(int i=2;i<21;i++) a[i]=a[i-1]*3+2; //汉诺塔问题 int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); printf("%lld\n",a[n-1]原创 2016-08-16 10:06:18 · 373 阅读 · 0 评论 -
HDU-Tian Ji -- The Horse Racing
田忌赛马#include#includeusing namespace std;const int M = 1000; int main(void){ int n; while(~scanf("%d",&n)&&n) { int t=0,a[M]={0},b[M]={0}; for(int i=0;i<n;i++) scanf("%d",&a[i]); sor原创 2016-08-16 09:16:48 · 284 阅读 · 0 评论 -
HDU-“红色病毒”问题
#include#includeint a[]={0,2,6,20,72,72,56,60,12,92,56,0,52,12,56,40,92,32,56,80,32,52,56,20,72,72,56,60,12,92,56,0,52,12,56,40,92,32,56,80,32,52,56};int main(){// freopen("C:\\Users\\5201\\Deskt原创 2016-08-15 15:30:46 · 507 阅读 · 0 评论 -
小兔的棋盘--卡特兰数
#include int main(){// freopen("C:\\Users\\5201\\Desktop\\IN.txt","r",stdin);// freopen("C:\\Users\\5201\\Desktop\\OUT.txt","w",stdout); long long a[36]; int i, j; a[0] = 1; for(i原创 2016-08-15 12:29:35 · 377 阅读 · 0 评论 -
HUD-2117-Just a Numble
#include#define M 100000int main(void){ int n,m; while(~scanf("%d%d",&n,&m)) { int a[M]={1},i; for(i=1;a[i-1]&&i<=m;i++) //如果a[i-1]==0那么后面都是0,可以结束循环 a[i]=(a[i-1]%n)*10; if(i<m) m=i;原创 2016-08-12 09:49:55 · 237 阅读 · 0 评论 -
Ignatius and the Princess III
#include#include#include#include#includeusing namespace std;const int M = 125;int main(void){//打表法求/*1 = 1; 2 = 2; 2 = 1 + 1; 3 = 3; 3 = 2 + 1; 3 = 1 + 1 + 1; 4 = 4; 4 = 3原创 2016-08-10 11:03:28 · 272 阅读 · 0 评论 -
A1 = ?
A1 = ?#include#include#include#include#includeconst int M = 10000;using namespace std;int main(){ int n; while(~scanf("%d",&n)) { double a,b,c[M]={0},sum=0; scanf("%lf%lf",&a,&b);原创 2016-08-08 08:29:45 · 335 阅读 · 4 评论 -
RAID 技术
RAID 技术特别注意:本题是垂直读的,不是横着读的!#includechar str1[]="0123456789ABCDEF";int main(void){// freopen("C:\\Users\\5201\\Desktop\\IN.txt","r",stdin);// freopen("C:\\Users\\5201\\Desktop\\OUT.txt","w",stdout原创 2016-08-07 19:51:49 · 218 阅读 · 3 评论 -
HUV黑白翻转棋
#include#include#include#includeusing namespace std;int clockwise[][2]={-1,0,-1,1,0,1,1,1,1,0,1,-1,0,-1,-1,-1}; //顺时针方向 void stamp(char chess[][10]){ for(int i=1;i<9;i++) { for(int j=1;j原创 2016-08-05 09:45:07 · 729 阅读 · 0 评论 -
师兄帮帮我
#include#includedouble EPS = 1e-5;int Add_n=0; //记录学生人数 struct student{ //学生信息数据结构 * char SID[15]; //学生编号 int CID,T,Total; //班级编号,年级排名,总分 char Name[15]; //原创 2016-08-02 17:51:39 · 451 阅读 · 0 评论 -
正方形
#includeint main(void){// freopen("C:\\Users\\5201\\Desktop\\IN.txt","r",stdin);// freopen("C:\\Users\\5201\\Desktop\\IOUT.txt","w",stdout); int n,p=0; while(~scanf("%d",&n)) { int sum,x,y,m,原创 2016-08-01 14:08:35 · 283 阅读 · 0 评论 -
信息解码
#include#include#define M 1000char codes[8][256]; char readchar(){ while(1) { char ch; ch=getchar(); if(ch!='\n'&&ch!='\r') return ch; }}int readcodes(){ memset(codes,0,sizeof(cod原创 2016-07-31 21:45:24 · 339 阅读 · 0 评论 -
特别困的学生 (特困生)
特别困的学生 (特困生)#includeint main(void){ int n,p=0; while(~scanf("%d",&n)&&n) { int i,j,t=0,s,s1,x1,x,a[12]={0},b[12]={0},c[12]={0}; for(i=1;i<=n;i++) scanf("%d%d%d",&a[i],&b[i],&c[i]);原创 2016-07-29 14:59:06 · 929 阅读 · 0 评论 -
洪水
洪水http://7xjob4.com1.z0.glb.clouddn.com/49d1e788ae9a89a2877aba30b18d4e1b#include#define M 1000void sort(int a[],int n){ int i,j,t,f; for(i=0;i<n-1;i++){ f=1; for(j=0;j<n-i-1;j++){ if(a[j原创 2016-07-29 09:45:01 · 309 阅读 · 0 评论 -
救济金发放
相当于死亡游戏#include#include#include#define M 100void F(int n,int k,int m){int i,j,i1,j1,n1,t1,t2,t=0,a[M]={0};for(i=0;ia[i]=i+1;n1=n;i=j=j1=0;i1=n-1;while(n>0){if(t)printf(原创 2016-07-28 20:41:37 · 269 阅读 · 0 评论 -
汉诺塔III之解题
汉诺塔III本人代码:#includeint main(){int i,n;long long int a[35]={0,2};for(i=2;ia[i]=a[i-1]*3+2; while(~scanf("%d",&n))printf("%lld\n",a[n]);return 0;}题解:本题是原创 2016-07-27 19:43:12 · 502 阅读 · 0 评论 -
HDU2054---A==B?
#include #include const int MAX = 100010;//取太小过不了 int main(){ char a[MAX]={},b[MAX]={}; while(~scanf("%s %s",a,b)){ int i=0,j=0,f=1; int p=strlen(a),q=strlen(b); int flag = 0;//标记是否含有小数点原创 2017-02-05 08:07:34 · 287 阅读 · 0 评论 -
刽子手游戏
刽子手游戏:#include<stdio.h>#include<string.h>#define M 100int main(void){ int n; while(~scanf("%d",&n)&&n!=-1) { int i,j,t=0,f,a[26]={0}; char s1[M]={0},s2[M]={0}; scanf("%s%s",s1,s2); for(i=0;s1[i]!='\0';i++) a[s1[i]-'a']++; for(i=0;s2[i]原创 2016-07-27 14:29:25 · 338 阅读 · 0 评论