zoukankan      html  css  js  c++  java
  • poj1493

    简单题

    View Code
    #include <iostream>
    #include
    <cstdio>
    #include
    <cstdlib>
    #include
    <cstring>
    using namespace std;

    #define maxn 20

    int f[maxn];
    int n, ans;

    void input()
    {
    ans
    = 0;
    getchar();
    for (int i = 0; i < n; i++)
    {
    f[i]
    = 0;
    for (int j = 0; j < 25; j++)
    {
    char ch = getchar();
    if (ch == 'X')
    f[i]
    ++;
    }
    ans
    = max(ans, f[i]);
    getchar();
    }
    }

    int main()
    {
    //freopen("t.txt", "r", stdin);
    while (scanf("%d", &n), n)
    {
    input();
    int d = 0;
    for (int i = 0; i < n; i++)
    d
    += ans - f[i];
    printf(
    "%d\n", d);
    }
    return 0;
    }
  • 相关阅读:
    Friends ZOJ
    2^x mod n = 1 HDU
    Paint the Grid Reloaded ZOJ
    Treap 模板
    bzoj进度条
    。。。
    bzoj
    。。。
    bzoj
    题解continue
  • 原文地址:https://www.cnblogs.com/rainydays/p/2115035.html
Copyright © 2011-2022 走看看