Submission #6042108
Source Code Expand
program palindrome_phobia implicit none character(100) :: s integer :: h, w, n(26), i, j, g(3) logical :: f read(*,*) h, w n = 0 do i = 1, h read(*,*) s s = trim(adjustl(s)) do j = 1, w n(ichar(s(j:j))-96) = n(ichar(s(j:j))-96)+1 end do end do g(1) = mod(h,2)*mod(w,2) g(2) = mod(w,2)*(h/2)+mod(h,2)*(w/2) g(3) = (h/2)*(w/2) do while (g(1).gt.0) do i = 1, 26 if (mod(n(i),2).eq.1) then n(i) = n(i)-1 exit end if end do g(1) = g(1)-1 end do do while (g(2).gt.0) f = .false. do i = 1, 26 if (mod(n(i),4).eq.2) then n(i) = n(i)-2 f = .true. exit end if end do if (f) then g(2) = g(2)-1 cycle end if if (g(1).eq.1) exit do i = 1, 26 if (n(i).eq.0) cycle if (mod(n(i),4).eq.0) then n(i) = n(i)-4 exit end if end do g(2) = g(2)-2 end do do while (g(3).gt.0) do i = 1, 26 if (n(i).eq.0) cycle if (mod(n(i),4).eq.0) then n(i) = n(i)-4 exit end if end do g(3) = g(3)-1 end do if (sum(n).eq.0) then write(*,'(a)') "Yes" else write(*,'(a)') "No" end if stop end program palindrome_phobia
Submission Info
Submission Time | |
---|---|
Task | C - Palindromic Matrix |
User | ue1221 |
Language | Fortran (gfortran v4.8.4) |
Score | 400 |
Code Size | 1317 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 1 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 1 ms | 256 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 1 ms | 256 KB |
1_18.txt | AC | 1 ms | 256 KB |
1_19.txt | AC | 1 ms | 256 KB |
1_20.txt | AC | 1 ms | 256 KB |
1_21.txt | AC | 1 ms | 256 KB |
1_22.txt | AC | 1 ms | 256 KB |
1_23.txt | AC | 1 ms | 256 KB |
1_24.txt | AC | 1 ms | 256 KB |
1_25.txt | AC | 1 ms | 256 KB |
1_26.txt | AC | 1 ms | 256 KB |