![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
3‘’入门模拟
青年小陈陈
这个作者很懒,什么都没留下…
展开
-
1082. Read Number in Chinese (25)
#include #include #include #include #include using namespace std;char mp[20][10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};char mp2[20][10]={"xxx","Shi","Bai","Qian"};char mp原创 2018-01-04 22:30:58 · 157 阅读 · 0 评论 -
1011. World Cup Betting (20)
#include #include #include #include using namespace std;char mp[3]={'W','T','L'};int main(){ //freopen("in.txt","r",stdin); double product=1.0; int k=3; while(k--) {原创 2018-01-02 20:09:26 · 128 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
#include #include #include #include using namespace std;const int MAXN = 1005;double p[MAXN];int main(){ // freopen("in.txt","r",stdin); int k,cou=0; scanf("%d",&k); for(int原创 2018-01-02 18:53:43 · 128 阅读 · 0 评论 -
1046. Shortest Distance (20)
1046. Shortest Distance (20)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the sho原创 2018-01-02 16:25:24 · 153 阅读 · 0 评论 -
1042. Shuffling Machine (20)
1042. Shuffling Machine (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueShuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen原创 2018-01-02 15:55:13 · 130 阅读 · 0 评论 -
1009. Product of Polynomials (25)
#include #include #include #include using namespace std;const int MAXN = 2010;//注意此处不能是1000,因为乘积的指数有可能比1000要大struct node{ double xi; int zhi;}poly[MAXN];//存放第一个多项式double p[MAXN];原创 2018-01-02 19:22:58 · 110 阅读 · 0 评论 -
1006. Sign In and Sign Out (25)
#include #include #include #include #include using namespace std;struct node//时间{ int hh; int mm; int ss;};bool later(node n1,node n2)//如果n1比n2晚,返回真,否则返回假{ if(n1.hh!=n2.h原创 2018-01-03 16:23:04 · 122 阅读 · 0 评论 -
1031. Hello World for U (20)
#include #include #include #include #include #include #include #include using namespace std;int main(){ //freopen("in.txt","r",stdin); char str[205]; int len,l,d; scanf(原创 2018-01-03 18:59:01 · 134 阅读 · 0 评论 -
1019. General Palindromic Number (20)
#include #include #include #include #include #include #include #include using namespace std;int n,b;int z[105],num=0;void change()//转换进制模板,其中num是转换之后的位数{ do { z[num++]=原创 2018-01-03 19:29:11 · 129 阅读 · 0 评论 -
1027. Colors in Mars (20)
#include #include #include #include #include #include #include #include using namespace std;char mp[13]={'0','1','2','3','4','5','6','7','8','9','A','B','C'};char z[50],num=0;void chang原创 2018-01-03 21:02:47 · 114 阅读 · 0 评论 -
1061. Dating (20)
#include #include #include #include #include using namespace std;char mp[7][5]={"MON","TUE","WED","THU","FRI","SAT","SUN"};bool isletter(char ch){ if( (ch>='a'&&ch='A'&&ch<='Z') )原创 2018-01-03 22:56:25 · 117 阅读 · 0 评论 -
1058. A+B in Hogwarts (20)
#include #include #include #include #include using namespace std;int main(){// freopen("in.txt","r",stdin); long long a[3],b[3],c[3],carry; scanf("%lld.%lld.%lld %lld.%lld.%lld原创 2018-01-03 21:19:59 · 175 阅读 · 0 评论 -
1073. Scientific Notation (20)
#include #include #include #include #include using namespace std;const int MAXN=20005;char str[MAXN];void pr(int l,int r)//打印str数组l-r,略过小数点{ for(int i=l;i<=r;i++) { if(str原创 2018-01-04 11:03:21 · 120 阅读 · 0 评论 -
1001. A+B Format (20)
#include #include #include #include #include using namespace std;int main(){ //freopen("in.txt","r",stdin); int a,b,c; scanf("%d %d",&a,&b); c=a+b; if(c<0) {原创 2018-01-04 11:32:20 · 142 阅读 · 0 评论 -
1005. Spell It Right (20)
#include #include #include #include #include using namespace std;char mp[15][10]={"zero","one","two","three","four","five","six","seven","eight","nine"};int flag=0;void dfs(int n){ if原创 2018-01-04 11:46:45 · 109 阅读 · 0 评论 -
1035. Password (20)
#include #include #include #include #include using namespace std;struct node{ char name[25],pwd[25]; bool ischange=false;//默认为没有被修改过}T[1005];int cou=0;void modify(node &T){原创 2018-01-04 19:08:27 · 132 阅读 · 0 评论 -
1077. Kuchiguse (20)
#include #include #include #include #include using namespace std;int N;char str[105][300];int m=300;bool compare(int pos)//比较所有的字符串的pos位置是否都相同{ int i; for(i=1;i<N;i++) {原创 2018-01-04 20:13:18 · 129 阅读 · 0 评论 -
1036. Boys vs Girls (25)
#include #include #include #include #include using namespace std;struct node{ char name[25]; char gender; char id[25]; int grade;}F,M,T;void init(){ M.grade=101;//MAN原创 2018-01-03 17:00:49 · 126 阅读 · 0 评论