榪欐槸涓閬撶粡鍏哥殑綰挎鏍戦鐩紝鍙﹀鍔犱笂紱繪暎鍖栫殑鏂規硶銆?/div>
]]>POJ grids 1664 http://www.shnenglu.com/Johnnx/archive/2009/07/20/90639.htmlJohnnx Johnnx Mon, 20 Jul 2009 08:56:00 GMT http://www.shnenglu.com/Johnnx/archive/2009/07/20/90639.html http://www.shnenglu.com/Johnnx/comments/90639.html http://www.shnenglu.com/Johnnx/archive/2009/07/20/90639.html#Feedback 0 http://www.shnenglu.com/Johnnx/comments/commentRss/90639.html http://www.shnenglu.com/Johnnx/services/trackbacks/90639.html 浠庤繖閬撻鐩垜璁よ瘑鍒伴掑綊鎬濇兂鐨勫己澶с?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; ">#include<stdio.h>
int t;
int pro(int m,int n){
if(m == 0||n == 1)return 1;
if(m < n)return pro(m,m);
return pro(m,n-1)+pro(m-n,n);
}
int main()
{
scanf("%d",&t);
int m,n;
while(t--){
scanf("%d%d",&m,&n);
printf("%d\n",pro(m,n));
}
return 0;
}
紱繪暎鍖栵細鐢變簬棰樼洰涓瓀all鏈?0000000bytes long錛岀洿鎺ョ嚎孌墊爲鏃犵枒浼歁LE銆傛墍浠ヨ瀵瑰叾紱繪暎鍖栵紝鍩烘湰鍋氭硶鏄細鍏堝鎵鏈夌鐐瑰潗鏍囪繘琛屾帓搴忥紝鐢?span style="COLOR:red">鐩稿簲搴忓彿浠ｆ浛绔偣鍧愭爣鏋勯犵嚎孌墊爲榪涜璁＄畻銆傝繖鏍鋒渶澶х殑搴忓彿涔熷彧鏄?*n銆?/div>
]]>NKOJ 1007,1249 http://www.shnenglu.com/Johnnx/archive/2009/07/24/91063.htmlJohnnx Johnnx Fri, 24 Jul 2009 10:18:00 GMT http://www.shnenglu.com/Johnnx/archive/2009/07/24/91063.html http://www.shnenglu.com/Johnnx/comments/91063.html http://www.shnenglu.com/Johnnx/archive/2009/07/24/91063.html#Feedback 0 http://www.shnenglu.com/Johnnx/comments/commentRss/91063.html http://www.shnenglu.com/Johnnx/services/trackbacks/91063.html http://acm.nankai.edu.cn/p1007.html,http://acm.nankai.edu.cn/p1249.html
鍦ㄦ瀯閫犵嚎孌墊爲鐨勮妭鐐圭粨鏋勪綋鏃訛紝娣誨姞鍙橀噺c銆俢=0鏃惰〃紺篶綰挎娌℃湁璐存搗鎶ワ紝鎴栬呰創浜嗕笉姝竴寮犳搗鎶ワ紱c>0鏃惰〃紺鴻創浜嗕竴寮犳搗鎶ワ紝騫朵笖c鐨勫艱〃紺鴻創鐨勬槸絎嚑寮犳搗鎶ャ?/div>
綰挎鏍戞洿鏂扮殑鍩烘湰鍘熺悊灝辨槸錛屽綋鎴戜滑璐存搗鎶鏃訛紝濡傛灉閬囧埌鏌愪竴綰挎鍖洪棿鑳藉琚綋鍓嶆搗鎶ュ畬鍏ㄨ鐩栵紝閭ｄ箞鎴戜滑鏇存柊鍒版鍖洪棿鍗沖彲錛屽嵆璁╁畠鐨勫彉閲廲鏇存柊涓烘搗鎶錛岃褰曚笅i鐨勫箋傚鏋滀笉鑳借嫻鋒姤瀹屽叏瑕嗙洊錛屽垯鍙槸榪欎竴綰挎鍖洪棿鐨勯儴鍒嗗尯闂撮渶瑕佷慨鏀癸紝鍒欐洿鏀硅繖涓鍖洪棿鐨勫瓙鍖洪棿鍗沖彲銆?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "> 1 #include<iostream>
2 #include<cstdio>
3 #include<algorithm>
4 #include<string.h>
5 #define MAX 20001
6
7 using namespace std;
8
9 int c,n,ls[MAX];
10 struct node{
11 int l,r;
12 int c;
13 }tree[MAX*4];
14 struct ln{
15 int li,num;//num琛ㄧず絎嚑寮犳搗鎶?br> 16 }line[MAX];
17 int set[MAX][2];
18 bool visit[MAX];
19 int ans;
20
21 bool cmp(struct ln a,struct ln b){
22 return a.li<b.li;
23 }
24
25 void Inittree(int pos,int ll,int rr){
26 tree[pos].l = ll;
27 tree[pos].r = rr;
28 tree[pos].c = 0;
29 if(ll!=rr){
30 int mid = (ll+rr)>>1;
31 Inittree(pos*2,ll,mid);
32 Inittree(pos*2+1,mid+1,rr);
33 }
34 }
35
36 void Insert(int pos,int ll,int rr,int color){
37 if(tree[pos].l == ll && tree[pos].r == rr){
38 tree[pos].c = color;
39 return;
40 }
41 if(tree[pos].c > 0 && tree[pos].c != color){
42 tree[pos*2].c = tree[pos].c;
43 tree[pos*2+1].c = tree[pos].c;
44 tree[pos].c = 0;
45 }
46 int mid = (tree[pos].l + tree[pos].r)>>1;
47 if(rr<=mid){
48 Insert(pos*2,ll,rr,color);
49 }
50 else if(ll>mid){
51 Insert(pos*2+1,ll,rr,color);
52 }
53 else{
54 Insert(pos*2,ll,mid,color);
55 Insert(pos*2+1,mid+1,rr,color);
56 }
57 }
58
59 void Search(int pos){
60 if(tree[pos].c!=0){
61 if(!visit[tree[pos].c]){//tree[pos].c
62 visit[tree[pos].c] = true;
63 ans++;
64 }
65 return ;
66 }
67 Search(2*pos);
68 Search(2*pos+1);
69 }
70
71 int main()
72 {
73 int i;
74 while(scanf("%d",&c)!=EOF){
75 while(c--){
76 scanf("%d",&n);
77 for(i = 0;i < n;++i){//紱繪暎鍖?/span>
78 scanf("%d%d",&set[i][0],&set[i][1]);
79 line[2*i].li = set[i][0];
80 line[2*i].num = -(i+1);//鐢ㄨ礋鏁拌〃紺?綰挎璧風偣
81 line[2*i+1].li = set[i][1];
82 line[2*i+1].num = i+1;
83 }
84 sort(line,line+2*n,cmp);
85 int temp = line[0].li,tp = 1;
86 for(i = 0;i < 2*n;++i){
87 if(line[i].li != temp){
88 tp++;
89 temp = line[i].li;
90 }
91 if(line[i].num < 0){
92 set[-line[i].num-1][0] = tp;
93 }
94 else{
95 set[line[i].num-1][1] = tp;
96 }
97 }//紱繪暎鍖?/span>
98
99 Inittree(1,1,tp);
100 for(i = 0;i < n;++i){
101 Insert(1,set[i][0],set[i][1],i+1);
102 }
103 memset(visit,0,sizeof(visit));
104 ans = 0;
105 Search(1);
106 printf("%d\n",ans);
107 }
108 }
109 return 0;
110 }
111
2 #include<cstdio>
3 #include<algorithm>
4 #include<string.h>
5 #define MAX 20001
6
7 using namespace std;
8
9 int c,n,ls[MAX];
10 struct node{
11 int l,r;
12 int c;
13 }tree[MAX*4];
14 struct ln{
15 int li,num;//num琛ㄧず絎嚑寮犳搗鎶?br> 16 }line[MAX];
17 int set[MAX][2];
18 bool visit[MAX];
19 int ans;
20
21 bool cmp(struct ln a,struct ln b){
22 return a.li<b.li;
23 }
24
25 void Inittree(int pos,int ll,int rr){
26 tree[pos].l = ll;
27 tree[pos].r = rr;
28 tree[pos].c = 0;
29 if(ll!=rr){
30 int mid = (ll+rr)>>1;
31 Inittree(pos*2,ll,mid);
32 Inittree(pos*2+1,mid+1,rr);
33 }
34 }
35
36 void Insert(int pos,int ll,int rr,int color){
37 if(tree[pos].l == ll && tree[pos].r == rr){
38 tree[pos].c = color;
39 return;
40 }
41 if(tree[pos].c > 0 && tree[pos].c != color){
42 tree[pos*2].c = tree[pos].c;
43 tree[pos*2+1].c = tree[pos].c;
44 tree[pos].c = 0;
45 }
46 int mid = (tree[pos].l + tree[pos].r)>>1;
47 if(rr<=mid){
48 Insert(pos*2,ll,rr,color);
49 }
50 else if(ll>mid){
51 Insert(pos*2+1,ll,rr,color);
52 }
53 else{
54 Insert(pos*2,ll,mid,color);
55 Insert(pos*2+1,mid+1,rr,color);
56 }
57 }
58
59 void Search(int pos){
60 if(tree[pos].c!=0){
61 if(!visit[tree[pos].c]){//tree[pos].c
62 visit[tree[pos].c] = true;
63 ans++;
64 }
65 return ;
66 }
67 Search(2*pos);
68 Search(2*pos+1);
69 }
70
71 int main()
72 {
73 int i;
74 while(scanf("%d",&c)!=EOF){
75 while(c--){
76 scanf("%d",&n);
77 for(i = 0;i < n;++i){//紱繪暎鍖?/span>
78 scanf("%d%d",&set[i][0],&set[i][1]);
79 line[2*i].li = set[i][0];
80 line[2*i].num = -(i+1);//鐢ㄨ礋鏁拌〃紺?綰挎璧風偣
81 line[2*i+1].li = set[i][1];
82 line[2*i+1].num = i+1;
83 }
84 sort(line,line+2*n,cmp);
85 int temp = line[0].li,tp = 1;
86 for(i = 0;i < 2*n;++i){
87 if(line[i].li != temp){
88 tp++;
89 temp = line[i].li;
90 }
91 if(line[i].num < 0){
92 set[-line[i].num-1][0] = tp;
93 }
94 else{
95 set[line[i].num-1][1] = tp;
96 }
97 }//紱繪暎鍖?/span>
98
99 Inittree(1,1,tp);
100 for(i = 0;i < n;++i){
101 Insert(1,set[i][0],set[i][1],i+1);
102 }
103 memset(visit,0,sizeof(visit));
104 ans = 0;
105 Search(1);
106 printf("%d\n",ans);
107 }
108 }
109 return 0;
110 }
111
]]>
榪欐槸涓や釜鍏充簬鍒嗚В绱犳暟鐨勯棶棰橈紝涓涓槸鍒嗚В涓虹礌鏁頒箣鍜岋紝涓涓槸鍒嗚В涓虹礌鏁頒箣縐傝嚜宸卞啓鐨勬籘LE錛屼簬鏄弬鑰冧簡鍒漢鐨勪唬鐮侊紝鎰熻鏂規硶鏋滅劧宸у銆傚浜庣礌鏁頒箣鍜屾槸鎵懼埌绱犳暟瑙勫緥浜嗐?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; ">nkoj 1007
#include<stdio.h>
#include<stdlib.h>
int n;
int main()
{
scanf("%d",&n);
if(n%3){
switch(n%3){
case 1:printf("2 2 ");n-=4;break;
case 2:printf("2 ");n-=2;break;
}
}
while(n){
printf("3 ");
n-=3;
}
system("pause");
return 0;
}
code#include<stdlib.h>
int n;
int main()
{
scanf("%d",&n);
if(n%3){
switch(n%3){
case 1:printf("2 2 ");n-=4;break;
case 2:printf("2 ");n-=2;break;
}
}
while(n){
printf("3 ");
n-=3;
}
system("pause");
return 0;
}
nkoj 1249
#include<stdio.h>
#include<math.h>
int n,a;
int main()
{
scanf("%d",&n);
while(n--){
scanf("%d",&a);
int i,flag = 0;
int b=a;
for(i = 2;i <= b/2;i++){
if(a%i==0 && flag==0){
flag = 1;
a/=i;
printf("%d",i);
}
while(a%i==0){
a/=i;
printf("*%d",i);
}
}
if(flag == 0)printf("%d",a);
printf("\n");
}
return 0;
}
#include<math.h>
int n,a;
int main()
{
scanf("%d",&n);
while(n--){
scanf("%d",&a);
int i,flag = 0;
int b=a;
for(i = 2;i <= b/2;i++){
if(a%i==0 && flag==0){
flag = 1;
a/=i;
printf("%d",i);
}
while(a%i==0){
a/=i;
printf("*%d",i);
}
}
if(flag == 0)printf("%d",a);
printf("\n");
}
return 0;
}
]]>
int t;
int pro(int m,int n){
if(m == 0||n == 1)return 1;
if(m < n)return pro(m,m);
return pro(m,n-1)+pro(m-n,n);
}
int main()
{
scanf("%d",&t);
int m,n;
while(t--){
scanf("%d%d",&m,&n);
printf("%d\n",pro(m,n));
}
return 0;
}
]]>
澶ф暟鐩稿姞錛屽埄鐢ㄦ暟緇勫瓨鍌紝鍐嶅姞涓婇傚綋澶勭悊銆?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "> 1 #include<stdio.h>
2 #include<string.h>
3 char a[101],b[101];
4 int c[101];
5 int main()
6 {
7 while(scanf("%s%s",a,b) != EOF){
8 memset(c,0,sizeof(c));
9 int i,j,k;
10 for(i = strlen(a)-1,j = strlen(b)-1,k = 0;i>=0 || j>=0;k++){
11 c[k] = (i>=0?(a[i--]-'0'):0) + (j>=0?(b[j--]-'0'):0);
12 }
13 for(i = 0;i < k;++i){
14 if(c[i] > 9){
15 c[i+1] += c[i]/10;
16 c[i] = c[i]%10;
17 }
18 }
19 while(!c[k]){
20 k--;
21 }
22 for(i = k;i>=0;--i){
23 printf("%d",c[i]);
24 }
25 printf("\n");
26 }
27 return 0;
28 }
2 #include<string.h>
3 char a[101],b[101];
4 int c[101];
5 int main()
6 {
7 while(scanf("%s%s",a,b) != EOF){
8 memset(c,0,sizeof(c));
9 int i,j,k;
10 for(i = strlen(a)-1,j = strlen(b)-1,k = 0;i>=0 || j>=0;k++){
11 c[k] = (i>=0?(a[i--]-'0'):0) + (j>=0?(b[j--]-'0'):0);
12 }
13 for(i = 0;i < k;++i){
14 if(c[i] > 9){
15 c[i+1] += c[i]/10;
16 c[i] = c[i]%10;
17 }
18 }
19 while(!c[k]){
20 k--;
21 }
22 for(i = k;i>=0;--i){
23 printf("%d",c[i]);
24 }
25 printf("\n");
26 }
27 return 0;
28 }
]]>
涔嶇湅涓嶉毦錛屽叾瀹炰篃涓嶉毦銆傚氨鏄笉鑳界敤閫掑綊鏉ュ仛銆傚閥濡欏湴鍒╃敤鍙橀噺l鏉ュ鐞嗭紝浣撲細錛?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "> 1 #include<stdio.h>
2 #include<stdlib.h>
3 long n;
4 int main()
5 {
6 while(scanf("%d",&n) != EOF){
7 long l = 1;
8 while(l>0){
9 if(n >= 50025002){
10 n -= 5;
11 l--;
12 }
13 else{
14 n += 2005;
15 l++;
16 }
17 }
18 printf("%d\n",n);
19 }
20 system("pause");
21 return 0;
22 }
23
2 #include<stdlib.h>
3 long n;
4 int main()
5 {
6 while(scanf("%d",&n) != EOF){
7 long l = 1;
8 while(l>0){
9 if(n >= 50025002){
10 n -= 5;
11 l--;
12 }
13 else{
14 n += 2005;
15 l++;
16 }
17 }
18 printf("%d\n",n);
19 }
20 system("pause");
21 return 0;
22 }
23
]]>
2 #include<string.h>
3 #include<stdlib.h>
4 char left[3][7],right[3][7],result[3][5];
5 bool isLight(char c);
6 bool isheavy(char c);
7 int main()
8 {
9 int n;
10 while(scanf("%d",&n) != EOF){
11 while(n--){
12 for(int i = 0;i < 3;i++)
13 scanf("%s%s%s",left[i],right[i],result[i]);
14 char x;
15 for(x = 'A';x <= 'L';x++){
16 if(isLight(x)){
17 printf("%c is the counterfeit coin and it is light.\n",x);
18 break;
19 }
20 if(isheavy(x)){
21 printf("%c is the counterfeit coin and it is heavy.\n",x);
22 break;
23 }
24 }
25 }
26 }
27 system("pause");
28 return 0;
29 }
30
31 bool isLight(char c)
32 {
33 for(int i = 0;i < 3;i++){
34 if(!strcmp(result[i],"even"))
35 if(strchr(left[i],c) != NULL || strchr(right[i],c) != NULL)return false;
36 if(!strcmp(result[i],"up"))
37 if(strchr(right[i],c) == NULL)return false;
38 if(!strcmp(result[i],"down"))
39 if(strchr(left[i],c) == NULL)return false;
40 }
41 return true;
42 }
43
44 bool isheavy(char c)
45 {
46 for(int i = 0;i < 3;i++){
47 if(!strcmp(result[i],"even"))
48 if(strchr(left[i],c) != NULL || strchr(right[i],c) != NULL)return false;
49 if(!strcmp(result[i],"up"))
50 if(strchr(left[i],c) == NULL)return false;
51 if(!strcmp(result[i],"down"))
52 if(strchr(right[i],c) == NULL)return false;
53 }
54 return true;
55 }
56
]]>
2 int p,e,j,d;
3 int main()
4 {
5 int k = 1;
6 int i;
7 while(scanf("%d%d%d%d",&p,&e,&j,&d) != EOF && p != -1){
8 for(i = d+1;i < 21252;++i)
9 if((i-p)%23 == 0)break;
10 for(;i < 21252;i+=23)
11 if((i-e)%28 == 0)break;
12 for(;i < 21252;i+=23*28)
13 if((i-j)%33 == 0)break;
14 printf("Case %d: the next triple peak occurs in %d days.\n",k++,i-d);
15 }
16 return 0;
17 }
18
]]>
榪欓亾棰樼洰鏄竴閬撴ā鎷熼銆侾-sequence琛ㄧず絎琲涓?#8216;)’涔嬪墠鏈夊嚑涓?#8216;(’錛學-sequence琛ㄧず絎琲涓?#8216;()’鍖呭惈鍑犲‘()’錛岃姹傚搴擯鐨刉銆傞鐩腑娌℃湁瑕佽緭鍑篠錛屾晠‘(’‘)’鍙互鍒嗗埆鐢?錛?鏉ヤ唬鏇褲傛牴鎹甈鍙互杞繪槗鐭ラ亾‘)’鐨勪綅緗細location = p[i] + i銆傜敤value璁板綍w[i]鐨勫鹼紝鐢╢lag璁板綍鎷彿鏄惁鎴愬銆?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "> 1 #include<stdio.h>
2 #include<string.h>
3 #include<stdlib.h>
4 int t,n;
5 int s[41],p[21],w[21];
6 int main()
7 {
8 scanf("%d",&t);
9 while(t--){
10 scanf("%d",&n);
11 int temp,flag,value;
12 memset(s,0,sizeof(s));
13 for(int i = 0;i < n;++i){
14 scanf("%d",&p[i]);
15 temp = p[i] + i;
16 s[temp] = 1;
17 for(int k = temp-1,value = 1,flag = 0;k >= 0;--k){
18 if(s[k] == 0 && flag == 0){
19 w[i] = value;
20 break;
21 }
22 else if(s[k] == 1){
23 value++;
24 flag++;
25 }
26 else if(s[k] == 0)flag--;
27 }
28 }
29 for(int i = 0;i < n;++i)printf("%d ",w[i]);
30 printf("\n");
31 }
32 system("pause");
33 return 0;
34 }
35
code2 #include<string.h>
3 #include<stdlib.h>
4 int t,n;
5 int s[41],p[21],w[21];
6 int main()
7 {
8 scanf("%d",&t);
9 while(t--){
10 scanf("%d",&n);
11 int temp,flag,value;
12 memset(s,0,sizeof(s));
13 for(int i = 0;i < n;++i){
14 scanf("%d",&p[i]);
15 temp = p[i] + i;
16 s[temp] = 1;
17 for(int k = temp-1,value = 1,flag = 0;k >= 0;--k){
18 if(s[k] == 0 && flag == 0){
19 w[i] = value;
20 break;
21 }
22 else if(s[k] == 1){
23 value++;
24 flag++;
25 }
26 else if(s[k] == 0)flag--;
27 }
28 }
29 for(int i = 0;i < n;++i)printf("%d ",w[i]);
30 printf("\n");
31 }
32 system("pause");
33 return 0;
34 }
35
]]>
榪欐槸涓閬撳叧浜庡巻娉曡漿鎹㈢殑闂銆備粠榪欓亾棰樻垜寰楀埌2鐐規敹鑾鳳細涓銆侀鐩腑鏈堜喚鎴栬呮棩鏈熸槸鐢ㄥ瓧絎︿覆鏉ヨ〃紺虹殑錛岃繖鏃跺埄鐢ㄤ簩浣嶆暟緇勫彲浠ヨ交鏉懼疄鐜頒粠瀛楃涓插埌鏁板瓧鐨勮漿鎹紱浜屻乀zolkin涓殑鏃ユ湡鍜屾湀鏁版槸鐩鎬簰鐙珛鐨勶紝鍙垎鍒彇浣欍?/div>
鍙﹀錛屾垜瑙夊緱寰堥噸瑕佺殑涓鐐瑰氨鏄紝涓瀹氳娓呮棰樼洰鏄粠0錛岃繕鏄粠1寮濮嬫暟鐨勶紝騫朵笖鍦ㄥ彇浣欐椂鍊欏叧浜庤繖鏂歸潰涓瀹氳淇濇寔澶磋剳娓呴啋銆傚緢瀹規槗鍑洪敊銆?div style="background-color: rgb(238, 238, 238); font-size: 13px; border-left-color: rgb(204, 204, 204); padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "> 1 #include<stdio.h>
2 #include<string.h>
3 #include<stdlib.h>
4 int n;
5 char haabmonth[19][10] = {"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
6 char tzolkinday[20][10] = {"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
7 int day;
8 char month[10];
9 int year;
10 int main()
11 {
12 scanf("%d",&n);
13 printf("%d\n",n);
14 for(int i = 0;i < n;++i){
15 scanf("%d. %s %d",&day,month,&year);
16 int days;
17 for(int k = 0;k < 19;++k){
18 if(!strcmp(haabmonth[k],month)){
19 days = year * 365 + k * 20 + day;
20 break;
21 }
22 }
23 int m = days % 260;
24 printf("%d %s %d\n",m%13+1,tzolkinday[m%20],days/260);
25 }
26 system("pause");
27 return 0;
28 }
29
code2 #include<string.h>
3 #include<stdlib.h>
4 int n;
5 char haabmonth[19][10] = {"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
6 char tzolkinday[20][10] = {"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
7 int day;
8 char month[10];
9 int year;
10 int main()
11 {
12 scanf("%d",&n);
13 printf("%d\n",n);
14 for(int i = 0;i < n;++i){
15 scanf("%d. %s %d",&day,month,&year);
16 int days;
17 for(int k = 0;k < 19;++k){
18 if(!strcmp(haabmonth[k],month)){
19 days = year * 365 + k * 20 + day;
20 break;
21 }
22 }
23 int m = days % 260;
24 printf("%d %s %d\n",m%13+1,tzolkinday[m%20],days/260);
25 }
26 system("pause");
27 return 0;
28 }
29
]]>