标签:des style blog http color strong
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 6443 | Accepted: 4229 |
Description
Input
Output
Sample Input
2 0 1 1 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 0 1 1 0 0 0 1 0 1 0 0
Sample Output
PUZZLE #1 1 0 1 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 0 0 1 0 0 0 1 0 0 0 0 PUZZLE #2 1 0 0 1 1 1 1 1 0 0 0 0 0 0 0 1 0 0 1 1 0 1 0 1 1 0 1 1 0 1
1 #include <iostream> 2 #include <stdio.h> 3 #include <algorithm> 4 #include <math.h> 5 #include <string.h> 6 #include <set> 7 using namespace std; 8 int a[40][40]; 9 void gauss() 10 { 11 int i,j,k; 12 for(i=0; i<30; i++) 13 { 14 for(k=i; k<30; k++) 15 if(a[k][i])break; 16 if(k!=i) 17 for(j=0; j<31; j++)swap(a[i][j],a[k][j]); 18 for(j=0; j<30; j++) 19 { 20 if(i!=j&&a[j][i]) 21 for(k=0; k<31; k++) 22 a[j][k]^=a[i][k]; 23 } 24 } 25 } 26 int main() 27 { 28 int n,i,cas=1; 29 cin>>n; 30 while(n--) 31 { 32 memset(a,0,sizeof(a)); 33 for(i=0; i<30; i++) 34 scanf("%d",&a[i][30]); 35 for(i=0; i<30; i++) 36 { 37 a[i][i]=1; 38 if(i>=6) 39 a[i][i-6]=1; 40 if(i<24) 41 a[i][i+6]=1; 42 if(i%6) 43 a[i][i-1]=1; 44 if((i+1)%6) 45 a[i][i+1]=1; 46 } 47 gauss(); 48 printf("PUZZLE #%d\n",cas++); 49 for(i=0; i<30; i++) 50 { 51 printf("%d",a[i][30]); 52 if((i+1)%6==0)printf("\n"); 53 else printf(" "); 54 } 55 } 56 }
EXTENDED LIGHTS OUT poj1222 高斯消元法,布布扣,bubuko.com
EXTENDED LIGHTS OUT poj1222 高斯消元法
标签:des style blog http color strong
原文地址:http://www.cnblogs.com/ERKE/p/3835193.html