Submission

Score: 0

User: APNICHANAN

Problemset: A.Circle Area

Language: c

Time: 0.003 second

Submitted On: 2025-10-02 21:37:51

#include <stdio.h>
int main()
{
    int n, m, k;
    scanf("%d %d", &n, &m);
    char a[n][m];
    int num[n], max = 0, last, first;
    for (int i = 0; i < n; i++)
    {
        scanf("%s", a[i]);
        num[i] = 0;
        for (int j = 0; j < m; j++)
        {
            if (a[i][j] == '#')
            {
                num[i]++;
                if (num[i] == 1)
                {
                    first = j;
                }
                else
                {
                    last = j;
                }
            }
        }
        if (num[i] > max)
        {
            max = num[i];
            k = i;
        }
    }
    printf("%d %d \n", k + 1, (last + first) / 2 + 1);
    printf("%.2f", 3.14159 * (max / 2) * (max / 2));
}