cry_admin的博客

1107. Social Clusters (30)时间限制1000 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueWhen register on a social network, you ar

1118. Birds in Forest (25)时间限制150 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSome scientists took pictures of thousands

1104. Sum of Number Segments (20)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CAO, PengGiven a sequence of positive number

1023. Have Fun with Numbers (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueNotice that the number 123456789 is

1106. Lowest Price in Supply Chain (25)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA supply chain is a network o

1117. Eddington Number(25)时间限制250 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueBritish astronomer Eddington liked to ride

1128. N Queens Puzzle (20)时间限制300 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe "eight queens puzzle" is the problem o

1100. Mars Numbers (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YuePeople on Mars count their numbers with base

1121. Damn Single (25)时间限制300 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, Yue"Damn Single (单身狗)" is the Chinese nickname fo

1005. Spell It Right (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a non-negative integer N, your task i

1050. String Subtraction (20)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven two strings S1 and S2, S = S1 - S

1051. Pop Sequence (25)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a stack which can keep M numbers at mos

1058. A+B in Hogwarts (20)时间限制50 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIf you are a fan of Harry Potter, you would

1064. Complete Binary Search Tree (30)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA Binary Search Tree (BST) is

1073. Scientific Notation (20)时间限制100 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者HOU, QimingScientific notation is the way that

1084. Broken Keyboard (20)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueOn a broken keyboard, some of the keys are

#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],pwd[25]; bool ischange=false;//默认为没有被修改过}T[1005];int cou=0;void modify(node &T){

#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;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;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); long long a[3],b[3],c[3],carry; scanf("%lld.%lld.%lld %lld.%lld.%lld

#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 #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 #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;int main(){ //freopen("in.txt","r",stdin); char str[205]; int len,l,d; scanf(

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

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

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

#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

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

#include #include #include #include #include using namespace std;struct node{ char id[20]; int loc_num; int score; int final_rank; int local_rank;}T[30005];bool cmp(no

#include #include #include #include #include using namespace std;struct node{ int id; int virtue; int talent; int sum; int flag;}T[100005];bool cmp(node a,node b){

#include #include #include #include #include using namespace std;char mp[10]={'A','C','M','E'};struct node{ int id; int score[4];//分别是ACME int rankk[4];//分别是ACME的排名}T[2005];

#include #include #include #include #include using namespace std;int mp[30];struct node{ char id[50]; int month,dd,hh,mm; bool flag;//0表示on 1表示off}T[1005];bool cmp(node a,no

#include #include #include #include #include using namespace std;struct node{ int id; char name[20]; int grade;}T[100005];bool cmp1(node a,node b){ return a.id < b.id;}

#include #include #include #include #include using namespace std;struct node{ char id[20]; int age; int worth;}T[100005];bool cmp(node a,node b){ if(a.worth!=b.worth)

#include #include #include #include #include using namespace std;int N,K,M;int mp[10];//每题的分值struct node{ int id; int score[10]; int perfect; int sum; int rankk;}T[10