#include<stdio.h> struct node {     int year,month,day,x; }p; int s[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; ...

#include <stdio.h> struct node {     int year,month,day; }p; int f[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int main(){ ...

#include //核心： // s[i][j]==b[i][j]  0 // s[i][j]==b[j][n-i-1]  90 // s[i][j]==b[n-i-1][n-j-1]  180 // s[i][j]==b[n-j-...

核心就是转圈圈，不能多也不能少，草稿纸上多画画   #include <stdio.h> int s[25][25]; int main(){     int n;     scanf("...