結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー |
![]() |
提出日時 | 2017-06-09 23:23:37 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 27 ms / 1,000 ms |
コード長 | 2,131 bytes |
コンパイル時間 | 1,931 ms |
コンパイル使用メモリ | 168,408 KB |
実行使用メモリ | 19,840 KB |
最終ジャッジ日時 | 2024-07-23 18:28:40 |
合計ジャッジ時間 | 2,790 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
コンパイルメッセージ
main.cpp: In function ‘ll gogo(std::deque<int>&, int)’: main.cpp:34:48: warning: ‘__builtin___sprintf_chk’ may write a terminating nul past the end of the destination [-Wformat-overflow=] 34 | sprintf(buf,"%d",i); | ^ In file included from /usr/include/stdio.h:894, from /usr/include/c++/11/cstdio:42, from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:46, from main.cpp:1: /usr/include/x86_64-linux-gnu/bits/stdio2.h:38:34: note: ‘__builtin___sprintf_chk’ output between 2 and 11 bytes into a destination of size 10 38 | return __builtin___sprintf_chk (__s, __USE_FORTIFY_LEVEL - 1, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 39 | __glibc_objsize (__s), __fmt, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 40 | __va_arg_pack ()); | ~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;typedef signed long long ll;#undef _P#define _P(...) (void)printf(__VA_ARGS__)#define FOR(x,to) for(x=0;x<(to);x++)#define FORR(x,arr) for(auto& x:arr)#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)#define ALL(a) (a.begin()),(a.end())#define ZERO(a) memset(a,0,sizeof(a))#define MINUS(a) memset(a,0xff,sizeof(a))//-------------------------------------------------------int N;string S;ll p10[101010];ll num[101010];ll sum[101010];ll mo;ll gogo(deque<int>& D,int first=0) {int i,j,k,l,r,x,y; string s;if(D.size()<=4) {int v=0,x=0;if(first) {FORR(c,D) v=v*10+c;for(i=1;i<=v;i++) {char buf[10];sprintf(buf,"%d",i);string s=buf;x++;FOR(j,s.size()) if(s[j]!=s[s.size()-1-j]) {x--;break;}}}else {string s;FORR(c,D) s+=(char)(c+'0');FOR(i,10000) {char buf[10];sprintf(buf,"%06d",i);string t=buf;t=t.substr(t.size()-s.size());x++;FOR(j,t.size()) if(t[j]!=t[t.size()-1-j]) {x--;break;}if(t==s) break;}}return x;}ll ret=0;if(first) {ret += 9*sum[D.size()-1];(ret += (D[0]-1)*10*num[D.size()-2])%=mo;}else {(ret += D[0]*10*num[D.size()-2])%=mo;}int del=D[0]>D.back();D.pop_front();D.pop_back();for(i=D.size()-1;i>=0&&del;i--) {D[i]--;if(D[i]>=0) del=0;else D[i]=9;}if(del==0) ret += gogo(D);return ret%mo;}ll hoge() {int i,j,k,l,r,x,y; string s;p10[0]=1;FOR(i,100001) {p10[i+1]=p10[i]*10%mo;if(i==0) num[i]=0;if(i==1) num[i]=1;if(i>=2) num[i]=1*p10[(i-1)/2]%mo;sum[i]=((i==0)?0:sum[i-1])+num[i];}deque<int> T;FORR(c,S) T.push_back(c-'0');return gogo(T,1);}void solve() {int i,j,k,l,r,x,y; string s;cin>>S;N=S.size();mo=1000000000;cout<<hoge()<<endl;mo=1000000007;cout<<hoge()<<endl;}int main(int argc,char** argv){string s;int i;if(argc==1) ios::sync_with_stdio(false), cin.tie(0);FOR(i,argc-1) s+=argv[i+1],s+='\n';FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);solve(); return 0;}