当前位置：首页 > news >正文

打表小技巧

news 2026/5/12 0:34:04

打表技巧

~~希望大家支持一下蒟蒻~~

感谢左程云大神讲解

简介

我们今天以左神课上的前三道题为例子，给出cpp打表代码，~~毕竟左神以java为主~~，以及具体表格和实际程序代码，大家重心放在打表代码和表格的观察上，毕竟我们最终的程序代码很简单，是看菜吃饭。~~面向答案编程~~

知识介绍和题目展示

题目一打表代码及最终程序

#include<iostream>#include<algorithm>#include<cstring>usingnamespacestd;constintM=0x3f3f3f3f;intcnt;intdfs(intx){if(x<0)returnM;if(x==0)return0;intp1=dfs(x-8);intp2=dfs(x-6);if(p1!=M)p1++;if(p2!=M)p2++;returnmin(p1,p2);}intmain(){FILE*fp;freopen_s(&fp,"biao.txt","w",stdout);for(inti=1;i<=100;i++){cnt=dfs(i);if(cnt==M)cout<<i<<" "<<cnt<<endl;elsecout<<i<<" "<<cnt<<endl;}return0;}******#include<iostream>usingnamespacestd;intmain(){intn;cin>>n;if(n%2!=0)cout<<-1<<endl;else{if(n<=16){if(n==6||n==8)cout<<1<<endl;if(n==12||n==14||n==16)cout<<2<<endl;}else{intx=n/8,y=n%8;if(y!=0)cout<<x+1<<endl;elsecout<<x<<endl;}}return0;}

题目一表格

110611095672106110956731061109567410611095675106110956761710611095678191061109567101061109567111061109567122131061109567142151061109567162171061109567183191061109567203211061109567223231061109567243251061109567264271061109567284291061109567304311061109567324331061109567345351061109567365371061109567385391061109567405411061109567426431061109567446451061109567466471061109567486491061109567507511061109567527531061109567547551061109567567571061109567588591061109567608611061109567628631061109567648651061109567669671061109567689691061109567709711061109567729731061109567741075106110956776107710611095677810791061109567801081106110956782118310611095678411851061109567861187106110956788118910611095679012911061109567921293106110956794129510611095679612971061109567981399106110956710013

题目二打表代码及最终程序

#include<iostream>#include<algorithm>#include<cstring>usingnamespacestd;charwinner;chardfs(intrest,charcur){//返回当前还剩rest份草，且当前做出选择的是cur这个情况下，获胜者是谁，即返回值是获胜者charrival;if(cur=='A')rival='B';elserival='A';if(rest<5){//为什么递归的底部是rest<5，其实只写0，1这两个最基础的情况也是可以的，多写几个无妨if(rest==0||rest==2)returnrival;elsereturncur;}intop=1;while(op<=rest){if(dfs(rest-op,rival)==cur)returncur;op*=4;}returnrival;}intmain(){FILE*fp;freopen_s(&fp,"biao.txt","w",stdout);for(inti=1;i<=100;i++){winner=dfs(i,'A');cout<<i<<" "<<winner<<endl;}return0;}******#include<iostream>usingnamespacestd;intmain(){intn;if(n<5){if(n==2)cout<<'B'<<endl;elsecout<<'A'<<endl;}else{intremain=n%5;if(n==0||n==2)cout<<'B'<<endl;elsecout<<'A'<<endl;}}

题目二表格

1A2B3A4A5B6A7B8A9A10B11A12B13A14A15B16A17B18A19A20B21A22B23A24A25B26A27B28A29A30B31A32B33A34A35B36A37B38A39A40B41A42B43A44A45B46A47B48A49A50B51A52B53A54A55B56A57B58A59A60B61A62B63A64A65B66A67B68A69A70B

题目三打表代码及最终程序

#include<iostream>#include<algorithm>#include<cstring>usingnamespacestd;boolis_com(intnum){for(inti=1;i<=num;i++){intsum=i;for(intj=i+1;j<=num;j++){if(sum+j>num)break;elseif(sum+j==num)returntrue;elsesum+=j;}}returnfalse;}intmain(){FILE*fp;freopen_s(&fp,"biao.txt","w",stdout);for(inti=1;i<=100;i++){if(is_com(i))cout<<i<<" "<<"YES"<<endl;elsecout<<i<<" "<<"NO"<<endl;}return0;}******#include<iostream>usingnamespacestd;intmain(){intn;if(n&(n-1)==0)cout<<"NO"<<endl;//直接用位运算的方式判断是否是2的几次幂elsecout<<"YES"<<endl;}

题目三表格

1NO2NO3YES4NO5YES6YES7YES8NO9YES10YES11YES12YES13YES14YES15YES16NO17YES18YES19YES20YES21YES22YES23YES24YES25YES26YES27YES28YES29YES30YES31YES32NO33YES34YES35YES36YES37YES38YES39YES40YES41YES42YES43YES44YES45YES46YES47YES48YES49YES50YES51YES52YES53YES54YES55YES56YES57YES58YES59YES60YES61YES62YES63YES64NO65YES66YES67YES68YES69YES70YES71YES72YES73YES74YES75YES76YES77YES78YES79YES80YES81YES82YES83YES84YES85YES86YES87YES88YES89YES90YES91YES92YES93YES94YES95YES96YES97YES98YES99YES100YES