Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:0ms飘过!贴代码。。

Posted by MJU_LGR at 2019-10-04 20:26:13 on Problem 1426
In Reply To:0ms飘过!贴代码。。 Posted by:xuzhiyuan at 2018-04-07 09:48:50
> #include<cstdio>
> using namespace std;
> int n;unsigned long long ans[205]={0,1,10,1000000000000000011,100,10,1000000000000000110,1001,1000,1000000000011111111,10,11,1000000000000001100,1001,10000000000000010,1000000000000000110,10000,100000001,1000000000111111110,1000000001,100,10000000000000101,1000000000000000010,100000000001,1000000000000011000,100,10000000000000010,1000000000101111111,100000000000000100,100000000000001,1000000000000000110,1000000000000110011,100000,1000000000000101111,100000000000001010,10000000000000010,1000000001111111100,100000000000000011,10000000000000110,10000000000000101,1000,1000000000000010111,100000000000001010,1000000000000010101,100000000000000100,1000000000111111110,100000000000001110,1000000000000101,1000000000000110000,1000000000000011101,100,10000000000000101,100000000000000100,1000000000000000011,1000000001101111110,1000000000000000010,1000000000000001000,1000000000000011,1000000000000001010,10000000000000011,1000000000000001100,1000000000000011,100000000001110010,1000000001011101111,1000000,10000000000000010,1000000000000111110,100000000000011,1000000000000010100,100000000000011,10000000000000010,1000000000000100101,1000000011111111000,10001,1000000000000000110,1000000000000001100,100000000000001100,1001,100000000000001010,100000000000110001,10000,1000000000111111101,1000000000000110110,100000000000001101,1000000000000010100,100000000000001010,100000000000010010,100000000000000101,1000000000000001000,10000000000000111,1000000000111111110,1001,1000000000000011100,1000000000001111001,10000000000001010,10000000000000110,1000000000001100000,100000000001111,1000000000000111110,1101111111111111111,100,101,100000000000001010,100000000000000001,1000000000000001000,100000000000001010,100000000010000110,10000000000001001,1000000001111111100,1000000000001000011,1000000000000000010,100000000000000011,100000000000110000,1000000000000111101,10000000000000110,100000000000001110,10000000000000100,1000000001101111101,100000000000000110,10000000000000101,1000000000000011000,100000000001,10000000000000110,1000000001100011001,1000000000011100100,1000,1000000001111011110,1000000000000110101,10000000,10000000000001001,10000000000000010,10000000001101,1000000000010111100,1000000001,1000000000000110,1000000001101111110,100000000000111000,10001,1000000000000110,1000000000001001111,100000000000000100,1000000000000101,1000000000011110,1001,1000000111111110000,1000000000000001010,10000000000010,100000000000011111,1000000000000010100,10000000000001111,1000000000000001100,1000000000010111001,1000000000000011000,1000000000111111101,10000000000000010,100000000001110010,1000000000000010100,1000000000000101,1000000000001100010,1000000000000000011,100000,1000000000001101001,100000000111111110,1000000000011011101,1000000000001110100,1000000000000111110,1000000000000011010,1000000000001001101,10000000000011000,1000000000001100111,100000000000001010,1000000000111111011,1000000000000100100,1000000000000010111,1000000000000001010,100000000000000100,100000000000010000,10000000000000011,100000000000001110,1000000000000100111,1000000001111111100,10000000000000111,10000000000000010,1000000000000011,100000000000011000,1000000000000000110,10000000001101110,100000000001001001,100000000000010100,1000000010111010111,10000000000000110,1000000000011111101,1000000000011000000,1000000010000100001,1000000000011110,100000000000001010,100000000010010100,100000000000111001,1111111111111111110,1000000000101111001,1000};
> int main()
> {
> 	while(scanf("%d",&n),n)
> 		printf("%llu\n",ans[n]);
> 	return 0;
> }

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator