RCC 2014 Warmup (Div. 2)_html/css_WEB-ITnose

#include <stdio.h>#include <string.h>#include <math.h>2 #define min(a,b) ((a)  <br> B：  <p></p>  <p></p>  <pre name="code" class="sycode">#include <stdio.h>#include <string.h>const int N = 100005;int n, vis[N];struct Solu {    int x, k;} s[N];bool judge() {    memset(vis, 0, sizeof(vis));    for (int i = 0; i  vis[k])            return false;    }    return true;}int main() {    scanf("%d", &n);    for (int i = 0; i   <br> C：  <p></p>  <p></p>  <pre name="code" class="sycode">#include <stdio.h>#include <string.h>int n, k;int main() {    scanf("%d%d", &n, &k);    if ((n - k)  n) b -= n;                printf("%d %d\n", a, b);            }        }    }    return 0;}</string.h></stdio.h>

#include <stdio.h>#include <string.h>#include <algorithm>#define min(a,b) ((a)  <br> E：  <p></p>  <p></p>  <pre name="code" class="sycode">#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>int n, m;bool check(int num) {    int m = (int)sqrt(num);    return m * m == num;}int main() {    scanf("%d%d", &n, &m);    int a, b, c, d, i, j;    while (1) {        a = rand() % 100 + 1;        b = rand() % 100 + 1;        c = rand() % 100 + 1;        d = rand() % 100 + 1;        if (check((m - 1) * a * a + b * b) &&             check((m - 1) * c * c + d * d) &&             check((n - 1) * a * a + c * c) &&             check((n - 1) * b * b + d * d))            break;    }    for (i = 0; i   <br>  <br>  <p></p>  <p><br> </p> </cstdlib></cmath></cstring></cstdio>