codepad
[
create a new paste
]
login
|
about
Language:
C
C++
D
Haskell
Lua
OCaml
PHP
Perl
Plain Text
Python
Ruby
Scheme
Tcl
#include<stdio.h> #include<string.h> #include<stdlib.h> #define search(a, n) bsearch(a, n, sizeof(int), compare); #define sort(a, n) qsort(a, n, sizeof(int), compare); #define FOR(i, a, n) for(i = a; i < n; i++) #define loop(i, n) FOR(i, 0, n) int compare (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int main() { char a[110][2][2], p, q, r, s; int n, i, j, k, count = 0; scanf(" %d", &n); loop(i, n) { int flag = 0; scanf(" %c%c\n%c%c", &p, &q, &r, &s); if(i != n-1) scanf(" **"); loop(j, count) { if(a[j][0][0] == p && a[j][0][1] == q && a[j][1][0] == r && a[j][1][1] == s) { flag = 1; break; } else if(a[j][1][0] == p && a[j][0][0] == q && a[j][1][1] == r && a[j][0][1] == s) { flag = 1; break; } if(a[j][1][1] == p && a[j][1][0] == q && a[j][0][1] == r && a[j][0][0] == s) { flag = 1; break; } if(a[j][0][1] == p && a[j][1][1] == q && a[j][0][0] == r && a[j][1][0] == s) { flag = 1; break; } } if(flag == 0) { a[count][0][0] = p; a[count][0][1] = q; a[count][1][0] = r; a[count][1][1] = s; count ++; } } printf("%d", count); return 0; }
Private
[
?
]
Run code
Submit