QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#767424#9271. Easy MoneyN_z_WA 41ms3856kbC++236.4kb2024-11-20 20:55:362024-11-20 20:55:37

Judging History

你现在查看的是最新测评结果

  • [2024-11-20 20:55:37]
  • 评测
  • 测评结果:WA
  • 用时:41ms
  • 内存:3856kb
  • [2024-11-20 20:55:36]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void init();void solve(int tc);
main()
{
	init();int t=1;
	// cin>>t;
	for(int tc=1;tc<=t;tc++)solve(tc);
}
void init()
{
}
bool chk(string s)
{
	int res=0;
	for(auto q:s)res=(res*10+q-'0')%7;
	return res==0;
}
void solve([[maybe_unused]]int tc)
{
	string s;
	cin>>s;
	sort(s.begin(),s.end());
	reverse(s.begin(),s.end());
	int T=10000;
	do
	{
		if(chk(s)){cout<<s<<endl;return;}
	}
	while(prev_permutation(s.begin(),s.end())&&T--);
	cout<<-1<<endl;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3616kb

input:

14

output:

14

result:

ok answer is '14'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

11

output:

-1

result:

ok answer is '-1'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3776kb

input:

2020

output:

2002

result:

ok answer is '2002'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

1

output:

-1

result:

ok answer is '-1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3492kb

input:

4

output:

-1

result:

ok answer is '-1'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3856kb

input:

2

output:

-1

result:

ok answer is '-1'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3544kb

input:

7

output:

7

result:

ok answer is '7'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

12

output:

21

result:

ok answer is '21'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

150

output:

105

result:

ok answer is '105'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

294

output:

924

result:

ok answer is '924'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

70107

output:

-1

result:

ok answer is '-1'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3496kb

input:

7907

output:

-1

result:

ok answer is '-1'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

10001

output:

10010

result:

ok answer is '10010'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3852kb

input:

222221

output:

-1

result:

ok answer is '-1'

Test #15:

score: 0
Accepted
time: 1ms
memory: 3808kb

input:

999999222221

output:

-1

result:

ok answer is '-1'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

818181818181

output:

888888111111

result:

ok answer is '888888111111'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

299292999222999292292999229222299299292999222999999299999222229929292929292299222992292999922299229992292922992999999292292922299992929292999992222929922292929999929292299299992299922922222299922999999292929299922299999929999992222929222929292929292229222922929292992222992299299922999999292992992922...

output:

999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999...

result:

ok answer is '999999999999999999999999999999...2222222222222222222222222122222'

Test #18:

score: 0
Accepted
time: 41ms
memory: 3556kb

input:

992299299299222929922999999929999299229222299992922229229229292229929222292922229922922922229929999292229929292922222922299229999299999299929922999999929999229999222999999229999229999292229222229999299292222299229999929222229222922999229999299222929222999999299222292999992222922922292929229929922999...

output:

-1

result:

ok answer is '-1'

Test #19:

score: -100
Wrong Answer
time: 41ms
memory: 3552kb

input:

818181888118888111811888188888888118181181111181181818111881881818181811811118881111181118181111188188118188118111111188181188181881881111111111111818811888818118881181811181888111888118188188181111111111888181881818818118181811888818888811188188118118118881818818118118111811881818881818118881811111...

output:

-1

result:

wrong answer expected '889888888888888888888888888888...1111111111111111111111111111111', found '-1'