結果
問題 | No.3030 ミラー・ラビン素数判定法のテスト |
ユーザー | 小指が強い人 |
提出日時 | 2017-10-22 00:10:31 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,144 bytes |
コンパイル時間 | 1,625 ms |
コンパイル使用メモリ | 163,340 KB |
最終ジャッジ日時 | 2024-11-15 04:46:05 |
合計ジャッジ時間 | 2,603 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void write(T, Args ...) [with char c = ' '; T = __int128; Args = {int}]': main.cpp:128:36: required from here main.cpp:23:101: error: ambiguous overload for 'operator<<' (operand types are 'std::basic_ostream<char>' and '__int128') 23 | template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << c; write<c>(args...);} | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:166:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long int) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]' 166 | operator<<(long __n) | ^~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:170:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long unsigned int) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]' 170 | operator<<(unsigned long __n) | ^~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:174:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::opera
ソースコード
#include "bits/stdc++.h" #include <gmp.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> veci; typedef vector<ll> vecll; typedef vector<string> vecs; template<class T,class U> using Hash=unordered_map<T,U>; #define REP(i, a, n) for(ll i = a; i < (ll)n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template<class T> T read(){T a;cin >> a;return a;} template<class T> void read(T& a){cin >> a;} template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template<char c = ' ',class T> void write(T a){cout << setprecision(12) << a << endl;} template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << c; write<c>(args...);} template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;} template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} inline ll gcd(ll a, ll b){while(true) {ll k = a % b;if(k == 0)return b;a = b;b = k;}} inline ll lcm(ll a, ll b){return a*b/gcd(a,b);} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} vector<int> v; vector<bool> b; template<class T> T power( const T& a, T k, const T& n ) { if ( a == 0 || n == 0 ) return( 0 ); if ( k == 0 ) return( 1 % n ); T currentMod = a % n; T currentValue = ( ( k & 1 ) > 0 ) ? currentMod : 1; for ( k >>= 1 ; k > 0 ; k >>= 1 ) { currentMod = ( currentMod * currentMod ) % n; if ( ( k & 1 ) > 0 ) currentValue = ( currentValue * currentMod ) % n; } return( currentValue ); } template<class T> bool MillerRabinTest( const T p ) { if ( p == 1 ) return( false ); if ( p == 2 ) return( true ); if ( ( p & 1 ) == 0 ) return( false ); T q( p - 1 ); T k = 0; while ( ( q & 1 ) == 0 ) { q >>= 1; k += 1; } T a( 2UL ); // a = 2 T gap( p ); gap /= 100; if ( gap == 0 ) gap += 1; T pm( p - 1 ); // p - 1 while ( a < p ) { T pow( power<T>( a, q, p ) ); a += gap; if ( pow == 1 ) continue; // a^q _ 1 ( mod p ) if ( pow == pm ) continue; // a^q _ -1 ( mod p ) T i( 1UL ); while ( i < k ) { pow = power<T>( pow, 2, p ); if ( pow == pm ) break; // a^(2^i)q _ -1 ( mod p ) i += 1; } if ( i == k ) return( false ); } return( true ); } std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } __int128 parse(string &s) { __int128 ret = 0; for (int i = 0; i < (int)s.length(); i++) if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0'; return ret; } int main(void) { int n; read(n); rep(i,n){ string str; read(str); __int128 p=parse(str); if(MillerRabinTest(p))write(p,1); else write(p,0); } return 0; }