welcome_z的专栏

#include #include using namespace std; struct time { int st, ed; }a[100]; int cmp(const void *a, const void *b) { return (*(time *)a).ed - (*(time *)b).ed; } int main() { int n; while (~scanf(

#include #define M 100000 // [1..M] #define clr(x, k) memset((x), (k), sizeof(x)) bool f[M]; int d[M], p=0; void Getprime() { int i, j; p = 0; clr(f, 0); for (i=2;i<M;++i) { if (!f[i]) d[p++]

#include using namespace std; int arr[]={2,3,5,7,11,101,131,151,181,191, 313,353,373,383,727,757,787,797,919,929, 10301,10501,10601,11311,11411,12421,12721,12821,13331,13831, 13931,14341,14741,15451

1 hdu 1032 #include using namespace std; int len(int n) { int s = 1; while (n!=1) { if (n&1) n = 3*n +1; else n /= 2; s++; } return s; } int main() { int i, j, n, l, m; while (~scanf

#include #include using namespace std; string b1, b2, a1, a2; int main() { int t, h; char c; scanf("%d", &t); while (t--) { getchar(); scanf("%c %d", &c, &h); int i = h/6 + 1; a1 = "";

//题目没给范围，wa了一把。。。 #include int main() { int a,c; for (;scanf("%1d",&a),a>0;printf("%d\n",--a%9u+1)) { while ((c=getchar())-48u<10) a+=c-48; } return 0; }

找公式。 #include #include #define s sqrt(2.0) using namespace std; double dis(int x, int y) { double d = 0; int a = x + y; d += a * (a-1) * s / 2; for (int i=a;i>0;--i) d += sqrt(i*i + (i-1)*(i-

#include #include #define p acos(-1) #define e exp(1) #define f(n) ((0.5 * log(2 * p * n) + n * log(n) - n)/log(10)) using namespace std; int main() { int t, n; scanf("%d", &t); while (t--) {

#include #include #include #include using namespace std; int main() { set s1; set s2; int n; char a[101], b[101]; while (~scanf("%d", &n), n) { while (n--) { scanf("%s %s",a, b);

被水题虐了！！！ WA了5+ ，重敲2遍，就少一句话！！！ 0 0 给yes！！！草！！！ #include #define clr(x, k) memset((x), (k), sizeof(x)) using namespace std; const int N = 100020; int f[N]; bool v[N]; int n, m, e; FILE *stream; int

Safecracker Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4398    Accepted Submission(s): 2221 Problem Description === Op tech brie

#include using namespace std; int main() { int n, m, i; while (~scanf("%d", &n)) { n <<= (i = m = 1); do { i = 2*i % (n+1); m++; }while (i!=1); printf("%d\n", --m); } return 0;