杂项

1. #include<stdio.h>
2. #include<string.h>
3. #include<map>
4. #include<string>
5. #include<iostream>
7. #define weeks 5*8+2*4
8. usingnamespace std;
10. map<string,int>list;
11. map<int, string>list1;
14. int main()
15. {
16. list["Monday"]=1;
17. list["Tuesday"]=2;
18. list["Wednesday"]=3;
19. list["Thursday"]=4;
20. list["Friday"]=5;
21. list["Saturday"]=6;
22. list["Sunday"]=7;
24. list1[1]="Monday";
25. list1[2]="Tuesday";
26. list1[3]="Wednesday";
27. list1[4]="Thursday";
28. list1[5]="Friday";
29. list1[6]="Saturday";
30. list1[7]="Sunday";
32. char str[1000];
33. int length;
34. double speed;
35. while(~scanf("%s%d%lf", str,&length,&speed))
36. {
37. string tp = str;
38. double tep = length/speed;
39. int weekday =0, weekend =0;
40. if(list[tp]<=5) weekday =(5-list[tp]+1)*8+2*4;
41. else weekday =(7-list[tp]+1)*4;
42. if(tep > weekday+weekend)
43. {
44. tep-=weekday+weekend;
45. tep =((tep/weeks)-int(tep)/weeks);
46. tep *= weeks;
47. tep =int(tep);
48. cout << list1[tep]<< endl;
49. }
50. else
51. {
52. if(weekend ==0)
53. cout << list1[list[tp]-int(weekday/]
54. }
55. }
56. return0;
57. }

1. #include<stdio.h>
2. #include<iostream>
3. #include<string.h>
4. #include<queue>
5. usingnamespace std;
6. int s[11000];
7. int top;
8. int main()
9. {
10. int t,n,m;
11. scanf("%d",&t);
12. while(t--)
13. {
14. top=1;
15. s[top]=1;
16. scanf("%d%d",&n,&m);
17. for(int i=0;i<m;i++)
18. {
19. char tmp[10];
20. scanf("%s",tmp);
21. if(strcmp(tmp,"PRE")==0)
22. {
23. top--;
24. if(top==0)
25. {
26. s[++top]=1;
27. printf("%d ",s[top]);
28. }
29. else
30. {
31. printf("%d ",s[top]);
32. }
33. }
34. else
35. {
36. if(strcmp(tmp,"NEXT")==0)
37. {
38. if(s[top]==n)// shi zuihou
39. printf("%d ",n);
40. else
41. {
42. int tt=s[top];
43. printf("%d ",s[top]+1);
44. s[++top]= tt+1;
45. }
46. }
47. else
48. {
49. int key;
50. scanf("%d",&key);
51. if(key!=s[top])
52. s[++top]=key;
53. printf("%d ",key);
54. }
55. }
56. }
57. }
58. return0;
59. }

 

来自为知笔记(Wiz)

附件列表