明天你好

class Solution { public:     /**      * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可      * 求二叉树的右视图      * @param xianxu int整型vector 先序遍历      *&nb...

夏令营加油

/**  * struct ListNode {  * int val;  * struct ListNode *next;  * };  */ class Solution { public:     /**      *       * @param head ListNo...

夏令营，冲冲冲

法一：硬算 暴力 #include <bits/stdc++.h> using namespace std; int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; string mmon[13]={"","January","Febrary","March","April","May","June","July","August","September","October","November","December"}; string dd[7]={"Sunday","Monday","Tuesday","Wednesday",...

#include <bits/stdc++.h> using namespace std; int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int leap(int year){ if((year%4==0 && year%100!=0) || year%400==0) return 1; return 0; } int main(){ int day1,day2,mon1,mon2,year1,year2; scanf("%4d%2d%2d",&year1,&mon1,&d...

#include <bits/stdc++.h> using namespace std; int main(){ int n,x,y,z,sum,flag=0; while(cin>>n){ cin>>x>>y>>z; flag=0; for(int i=9;i>0;i--){ for(int j=9;j>=0;j--){ sum=i*10000+x*1000+y*100+z*10+j; if(sum%n==0){ printf("%d %d %d\n",i,j,sum/...

加油