cry_admin的博客

#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

#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--) {

#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

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

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

#include #include #include #include using namespace std; const int MAXN = 2010;//注意此处不能是1000，因为乘积的指数有可能比1000要大 struct node { double xi; int zhi; }poly[MAXN];//存放第一个多项式 double p[MAXN];

#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

#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(

#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++]=

#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

#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') )

#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

#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

#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) {

#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

#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) {

#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++) {

#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