学步园

Chinese Zodiac

Gaussian Prime

Judge Internal Error

只贴代码，不解释。。T T 。。。

I题木有搞出来。。。哎。。。

Final Rank 99 T T 。。

C

#include <queue><br /> #include <stack><br /> #include <math.h><br /> #include <stdio.h><br /> #include <stdlib.h><br /> #include <iostream><br /> #include <limits.h><br /> #include <string.h><br /> #include <algorithm><br /> using namespace std;<br /> char str[13][15] = {"","Rat", "Ox", "Tiger", "Rabbit", "Dragon", "Snake", "Horse", "Ram", "Monkey", "Rooster", "Dog","Pig"};<br /> int main()<br /> {<br /> int ncases,n;<br /> scanf("%d",&ncases);<br /> while( ncases-- )<br /> {<br /> scanf("%d",&n);<br /> printf("%s/n",str[12-(n+7)%12]);<br /> }<br /> return 0;<br /> }<br />  

G

#include <queue><br /> #include <stack><br /> #include <math.h><br /> #include <stdio.h><br /> #include <stdlib.h><br /> #include <iostream><br /> #include <limits.h><br /> #include <string.h><br /> #include <algorithm><br /> using namespace std;<br /> const int MAX = 50000;<br /> int prim[MAX];<br /> void init()<br /> {<br /> fill(prim,prim+MAX,1);<br /> prim[0] = prim[1] = 0;<br /> for(int i=2; i<MAX; i++)<br /> for(int k=2; k*i<MAX; k++)<br /> if( prim[i] == 1 )<br /> prim[k*i] = 0;<br /> for(int n=0; 4*n+3<MAX; n++)<br /> if( prim[4*n+3] == 1 )<br /> prim[4*n+3] = 2;<br /> for(int i=1; i*i<MAX; i++)<br /> for(int k=1; k*k+i*i<MAX; k++)<br /> if( prim[i*i+k*k] == 1 )<br /> prim[i*i+k*k] = 3;<br /> }<br /> int gcd(int n,int m)<br /> {<br /> return m == 0 ? n : gcd(m,n%m);<br /> }<br /> int main()<br /> {<br /> int ncases;<br /> int x1,x2,y1,y2;<br /> init();<br /> scanf("%d",&ncases);<br /> while( ncases-- )<br /> {<br /> scanf("%d %d %d %d",&x1,&x2,&y1,&y2);<br /> int num = ((x2-x1)+1)*((y2-y1)+1);<br /> int count = 0;<br /> for(int i=x1; i<=x2; i++)<br /> for(int k=y1; k<=y2; k++)<br /> {<br /> if( i == 0 && k != 0 )<br /> if( k > 0 && prim[k] == 2 || k < 0 && prim[-k] == 2 )<br /> count++;<br /> if( k == 0 && i != 0 )<br /> if( i > 0 && prim[i] == 2 || i < 0 && prim[-i] == 2 )<br /> count++;<br /> if( i != 0 && k != 0 && prim[i*i+k*k] == 3)<br /> count++;<br /> }<br /> int wuyu = gcd(count,num);<br /> printf("%d/%d/n",count/wuyu,num/wuyu);<br /> }<br /> return 0;<br /> }<br />  

J

#include <queue><br /> #include <stack><br /> #include <math.h><br /> #include <stdio.h><br /> #include <stdlib.h><br /> #include <iostream><br /> #include <limits.h><br /> #include <string.h><br /> #include <algorithm><br /> using namespace std;<br /> int a[5000];<br /> int main()<br /> {<br /> int ncases,n;<br /> scanf("%d",&ncases);<br /> while( ncases-- )<br /> {<br /> scanf("%d",&n);<br /> for(int i=0; i<n; i++)<br /> scanf("%d",&a[i]);<br /> sort(a,a+n);<br /> int max = 0,count = 0;<br /> int tmp = a[0],now = a[0];<br /> a[n] = -1;<br /> for(int i=1; i<=n; i++)<br /> {<br /> if( a[i] == tmp )<br /> count++;<br /> else<br /> {<br /> if( count >= max )<br /> {<br /> max = count;<br /> now = tmp;<br /> }<br /> count = 0;<br /> tmp = a[i];<br /> }<br /> }<br /> printf("%d/n",now);<br /> }<br /> return 0;<br /> }<br />