結果
| 問題 | No.313 π |
| ユーザー |
 uenoku
|
| 提出日時 | 2016-08-25 00:48:58 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 6 ms / 5,000 ms |
| コード長 | 3,659 bytes |
| コンパイル時間 | 1,169 ms |
| コンパイル使用メモリ | 100,848 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-08 02:11:56 |
| 合計ジャッジ時間 | 2,365 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 32 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:198:21: warning: ‘t’ may be used uninitialized in this function [-Wmaybe-uninitialized]
198 | cout << f<<' ' << t<<endl;
| ^
main.cpp:198:14: warning: ‘f’ may be used uninitialized in this function [-Wmaybe-uninitialized]
198 | cout << f<<' ' << t<<endl;
| ^~~
ソースコード
#include <iostream>#include <string>#include <vector>#include <algorithm>#include <cstdio>#include <queue>#include "math.h"#include <complex>#include <iomanip>#include <map>#define ifor(i,a,b) for (int i=(a);i<(b);i++)#define rfor(i,a,b) for (int i=(b)-1;i>=(a);i--)#define rep(i,n) for (int i=0;i<(n);i++)#define rrep(i,n) for (int i=(n)-1;i>=0;i--)using namespace std;typedef long double ld;typedef long long int lli;typedef complex <double> P;const double eps = 1e-11;int vex[4]={1,0,-1,0};int vey[4]={0,1,0,-1};typedef vector<double> Vec;typedef vector<int> vec;typedef vector<Vec> MAT;typedef vector<vec> mat;lli MOD=1000000007;//Ax=bをとくAは正方行列//rankA<=min(m,n)ならば配列０のvecが帰るVec gauss_jordan(const MAT& A,const Vec&b){int n = A.size();MAT B (n,Vec(n+1));rep(i,n)rep(j,n)B[i][j]=A[i][j];rep(i,n)B[i][n]=b[i];rep(i,n){int pivot = i;for(int j= i;j<n;j++){if(abs(B[j][i])>abs(B[pivot][i]))pivot = j;}swap(B[i],B[pivot]);if(abs(B[i][i])<eps)return Vec();//B_i_i成分が0であるつまり階数がfor(int j =i +1 ;j<=n;j++)B[i][j]/=B[i][i];rep(j,n){if(i!=j)for(int k = i+1;k<=n;k++){B[j][k] -=B[j][i]*B[i][k];}}}Vec x(n);for(int i =0;i<n;i++){x[i]= B[i][n];}return x;}double det(const MAT& A){int n = A.size();MAT B (n,Vec(n));rep(i,n)rep(j,n)B[i][j]=A[i][j];double ans = 1;rep(i,n){int pivot = i;for(int j=i;j<n;j++){if(abs(B[j][i])>abs(B[pivot][i]))pivot = j;}if(i!=pivot)ans *= -1;swap(B[i],B[pivot]);if(abs(B[i][i])<eps)return 0;ans *= B[i][i];for(int j =i +1 ;j<n;j++)B[i][j]/=B[i][i];rep(j,n){if(i!=j)for(int k = i+1;k<n;k++){B[j][k] -=B[j][i]*B[i][k];}}}return ans;}int rank(const MAT& A){int n = A.size();MAT B (n,Vec(n));rep(i,n)rep(j,n)B[i][j]=A[i][j];rep(i,n){int pivot = i;for(int j=i;j<n;j++){if(abs(B[j][i])>abs(B[pivot][i]))pivot = j;}swap(B[i],B[pivot]);if(abs(B[i][i])<eps)return i;for(int j =i +1 ;j<n;j++)B[i][j]/=B[i][i];rep(j,n){if(i!=j)for(int k = i+1;k<n;k++){B[j][k] -=B[j][i]*B[i][k];}}}return n;}lli euler(lli m){vector<int> p;lli M = m;for(int i = 2;i<=m;i++){if(m%i==0){p.push_back(i);while(m%i==0)m/=i;}if(M<i*i&&p.size()==0){p.push_back(M);break;}}lli ans = M;rep(i,p.size()){//cout << p[i]<<endl;ans = ans * (p[i]-1)/p[i];}return ans;}lli powm(lli a,lli p,lli mod){lli ans =1;while(p>0){if(p&1)ans=(ans*a) % mod;a=(a*a)%mod;p >>=1;}return ans%mod;}lli inv(lli a,lli mod){return powm(a,euler(mod)-1,mod);}lli inv(lli a){return powm(a,MOD-2,MOD);}lli gcd(lli A,lli B){if(A%B==0)return B;else return gcd(B,A%B);}mat mul_mat_mod(mat A,mat B,lli m){int n = A.size();mat C (n,vec(n));rep(i,n)rep(j,n)rep(k,n){C[i][j]+=A[i][k]*B[k][j] %m;C[i][j]%=m;}return C;}mat pow_mat(mat A,lli p,lli mod){int n= A.size();mat B = mat(n,vec(n));while(p>0){if(p&1){B=mul_mat_mod(A,B,mod);}A = mul_mat_mod(A,A,mod);p>>=1;}return B;}lli comb(lli a,lli b ){lli ans =1;rep(i,b){ans = ans %MOD* (a-i)%MOD*inv(b-i)%MOD;}return ans ;}int xs[10] = {20104, 20063, 19892, 20011, 19874, 20199, 19898, 20163, 19956, 19841 };int main(){int ys[10];string s ;cin >> s;int n;rep(i,s.size()){if(s[i]=='.')continue;else{n = s[i]-'0';ys[n]++;}}int f ,t;rep(i,10){if(xs[i]<ys[i]){f =i;}else if(xs[i]>ys[i]){t =i;}}cout << f<<' ' << t<<endl;}