結果

問題 No.313 π
ユーザー omu
提出日時 2015-12-07 03:14:58
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 11 ms / 5,000 ms
コード長 2,857 bytes
コンパイル時間 799 ms
コンパイル使用メモリ 102,068 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-14 17:53:27
合計ジャッジ時間 2,221 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:99:32: warning: ‘ans1’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |         cout << ans0 << " " << ans1 << endl;
      |                                ^~~~
main.cpp:99:25: warning: ‘ans0’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |         cout << ans0 << " " << ans1 << endl;
      |                         ^~~

ソースコード

diff #
プレゼンテーションモードにする

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class _RanIt> inline string tostring(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << 
    *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }
template<class _RanIt> inline string tostring(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream 
    sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all
    (*_First), sep); }return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x; x = x * x;  n >>= 1; }return res; }
inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }
#define For(i,a,b)  for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)    For(i,0,n)
#define rFor(i,a,b) for(int (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)   rFor(i,n,0)
#define clr(a)      memset((a), 0 ,sizeof(a))
#define mclr(a)     memset((a), -1 ,sizeof(a))
#define all(a)      (a).begin(),(a).end()
#define sz(a)       (sizeof(a))
const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = 1e9 + 9;
int table[10] = {
    20104,
    20063,
    19892,
    20011,
    19874,
    20199,
    19898,
    20163,
    19956,
    19841,
};
int main(){
    /*
    fstream fs("sample_01.txt", ios::in);
    string s;
    fs >> s;
    map<int, int> mp;
    rep(i, s.size()){
        mp[s[i] - '0']++;
    }
    fstream out("out.txt", ios::out);
    mp[2]--;mp[3]++;
    for (auto i : mp){
        out << i.first << " " << i.second << endl;
    }
    */
    string s;
    cin >> s;
    map<int, int> mp;
    rep(i, s.size()){
        mp[s[i] - '0']++;
    }
    int ans0, ans1;
    for (auto i : mp){
        if (table[i.first] < i.second){
            ans0 = i.first;
        }
        if (table[i.first] > i.second){
            ans1 = i.first;
        }
    }
    cout << ans0 << " " << ans1 << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0