結果
問題 | No.908 うしたぷにきあくん文字列 |
ユーザー |
![]() |
提出日時 | 2019-12-27 15:12:43 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,319 bytes |
コンパイル時間 | 1,662 ms |
コンパイル使用メモリ | 167,576 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-08 05:56:05 |
合計ジャッジ時間 | 2,802 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <cassert>#include <cctype>#include <cerrno>#include <cfloat>#include <ciso646>#include <climits>#include <clocale>#include <cmath>#include <csetjmp>#include <csignal>#include <cstdarg>#include <cstddef>#include <cstdio>#include <cstdlib>#include <cstring>#include <ctime>#include <ccomplex>#include <cfenv>#include <cinttypes>#include <cstdbool>#include <cstdint>#include <ctgmath>#include <cwchar>#include <cwctype>// C++#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <list>#include <locale>#include <map>#include <memory>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <typeinfo>#include <utility>#include <valarray>#include <vector>#include <array>#include <atomic>#include <chrono>#include <condition_variable>#include <forward_list>#include <future>#include <initializer_list>#include <mutex>#include <random>#include <ratio>#include <regex>#include <scoped_allocator>#include <system_error>#include <thread>#include <tuple>#include <typeindex>#include <type_traits>#include <unordered_map>#include <unordered_set>//#include <boost/foreach.hpp>//#include <boost/range/algorithm.hpp>//#include <boost/multiprecision/cpp_int.hpp>#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 0using 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<int,int> 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<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}bool isnumber(char c){return ('0'<=c&&c<='9');}bool isalpha(char c){return (isupper(c)||islower(c));}template<typename T>void print(vector<T> v){for(int i=0;i<v.size();i++){if(i)cout<<" ";cout<<v[i];}cout<<endl;}int INF=1e18;template<typename T>void printendl(vector<T> v){for(auto date:v)cout<<date<<endl;}template<typename T>void printvv(vector<vector<T>> v){for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++){if(j)cout<<" ";cout<<v[i][j];}cout<<endl;}}struct P{int x,y;};int gcd(int a,int b){if(b==0)return a;else return gcd(b,a%b);}signed main(){string s;getline(cin,s);rep(i,0,s.size()){if(i%2==1 and s[i]!=' '){cout<<"No"<<endl;re0;}else if(i%2==0 and !isalpha(s[i])){cout<<"No"<<endl;re0;}}cout<<"Yes"<<endl;}/**/