Grit_ICPC的博客

Tautology Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10425   Accepted: 3956 Description WFF 'N PROOF is a logic game played with dice. Each die has six

#include #include #include #include #include #include #include #include #define L1 long long #define L2 __int64 #define inf 0x3f3f3f3f using namespace std; const int m1=1001000; const int m2=1010; int

与之前做过的螺旋矩阵不同之处在于，n*m的矩阵，并且是在A-Z之间不停循环的问题。注意控制好边界如递归条件一直在l #include #include #include #include using namespace std; int cnt; int a[1100][1100]; int n,m; void so(int up,int down,int l,int r,int s,i

#include #include #include #include using namespace std; int arr[50],num[50]; char str[10]; int main(){ int n,m,i,j,k,ans; k = 1; ans = 0 ; for(i = 1;i <= 50;++ i){ arr[i] = k;