結果
問題 | No.446 ゆきこーだーの雨と雪 (1) |
ユーザー |
![]() |
提出日時 | 2018-06-06 22:33:15 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,581 bytes |
コンパイル時間 | 1,250 ms |
コンパイル使用メモリ | 159,544 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-30 10:22:51 |
合計ジャッジ時間 | 2,020 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 13 |
ソースコード
#include <bits/stdc++.h>#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)#define all(v) (v).begin(), (v).end()#define pb(q) push_back(q)#define Abs(a,b) max(a,b)-min(a,b)#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}#define Cout(x) cout<<(x)<<endl#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}#define Size(n) (n).size()typedef long long ll;using namespace std;const int INF = 1e9,MOD = 1e9 + 7,ohara = 1e6;const ll LINF = 1e18;/*---------------------------------------------------------------long long int kaizyo(long long int hh){cmp=1;while(hh>1){cmp=(cmp*hh)%MOD;hh--;}return cmp;}long long int ruizyo(long long int aa, long long int bb){if(aa==0){return 1;}else if(aa%2==0){long long int tt=ruizyo(aa/2,bb);return (tt*tt)%MOD;}else{return (ruizyo(aa-1,bb)*bb)%MOD;}}フェルマ-のア---------------------------------------------------------------while(x!=0){sum+=x%10;/ x/=10;}各桁の和---------------------------------------------------------------pair<int,int> p[100000];cin >> tmp;p[i]=make_pair(tmp,i);cout << p[i].second+1 << endl;//ペアの右側つまりiを出力---------------------------------------------------------------bool f[100001];//1000000以下の素数を調べよう!rrep(i,2,100001){f[i]=false;}rrep(i,2,100001){if(!f[i]){for(int j=i+i;j<=100000;j+=i){f[j]=true;}}}for(int i=3;i<=100000;i+=2){if(!f[i]){c[i]++;}}---------------------------------------------------------------long long gcd(long long aaa,long long bbb){if(bbb==0){return aaa;}return gcd(bbb,aaa%bbb);}long long lcm(long long aaa,long long bbb){long long g = gcd(aaa,bbb);return aaa/g * bbb;}左から最大公約数と最小公倍数---------------------------------------------------------------long long int prime_cnt[10000];for(int i=2;i*i<=n;i++){while(n%i==0){n/=i;prime_cnt[i]+=1;}if(n>1){prime_cnt[n]+=1;break;}}ある数nを素因数分解しましょう---------------------------------------------------------------debug:cout<<"i: "<<i<<" j: "<<j<<" cnt: "<<cnt<<"\n";---------------------------------------------------------------*/long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;int dy[]={1,0,-1,0};int dx[]={0,1,0,-1};string alph("abcdefghijklmnopqrstuvwxyz"),s,ss;bool fl=true;struct edge{int to,cost;};//-------------------------↓↓↓↓↓↓------------------------int main(void){cin.tie(0);ios::sync_with_stdio(false);cin>>s>>ss;rep(i,Size(s)){for(char c='a';c<='z';c++){if(c==s[i]){Cout("NG");return 0;}}for(char c='A';c<='Z';c++){if(c==s[i]){Cout("NG");return 0;}}if((s[i]-'0')==0&&fl&&Size(s)!=1){Cout("NG");return 0;}else{fl=false;}}fl=true;rep(i,Size(ss)){for(char c='a';c<='z';c++){if(c==ss[i]){Cout("NG");return 0;}}for(char c='A';c<='Z';c++){if(c==ss[i]){Cout("NG");return 0;}}if((ss[i]-'0')==0&&fl&&Size(ss)!=1){Cout("NG");return 0;}else{fl=false;}}cmp=atoi(s.c_str());cmpp=atoi(ss.c_str());if(cmp>12345||cmpp>12345){Cout("NG");return 0;}Cout("OK");return 0;}