#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // C++ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include //#include #define rep(i,j,k) for(int i=(int)j;i<(int)k;i++) #define ll long long #define Sort(v) sort(all(v)) //#define INF 1e9 #define LINF (1LL<<40) #define END return 0 #define pb push_back #define se second #define fi first #define pb push_back #define all(v) (v).begin() , (v).end() #define MP make_pair #define int long long #define umap unordered_map #define re0 return 0 using namespace std; int day[12]={31,28,31,30,31,30,31,31,30,31,30,31}; int dx[]={0,1,0,-1}; int dy[]={1,0,-1,0}; //typedef pair P; const long long MOD=1000000007LL; bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;} bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;} bool iskaibun(string s){for(int i=0;i void print(vector v){ for(int i=0;i void printendl(vector v){ for(auto date:v)cout< void printvv(vector> v){ for(int i=0;i>s; sort(s.rbegin(),s.rend()); for(int i=s.size()-1;i>=1;i--){ if(s[i]!=s[i-1] && s[i]!='0'){ swap(s[i],s[i-1]); cout<