답안 #282708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282708	2020-08-24T19:05:23 Z	leaked	Lutrija (COCI19_lutrija)	C++14	0 / 70	1 ms	384 KB

lutrija

#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//    #pragma GCC target("avx,avx2,fma")
//    #pragma GCC optimization ("unroll-loops")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll RR=1e4;
const ll tx[8]={1,-1,2,-2,-1,-2};
const ll ty[8]={-2,-2,-1,-1,2,1};
const char rev_to[4]={'E','W','N','S'};
const int M=1e9+3;
const int N=3e5+9;
const int ppp=73;
const int pr=3;
const int block=600;
const int OPEN=0;
const int CLOSE=1;
typedef pair<long long,int> pli;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<ll>(1,69596969),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}
vector<int>a{2, 5, 7, 11, 19, 23, 31};
signed main(){
    fast_io;
    ll b,c;
    cin>>b>>c;
    if(is_prime(abs(c-b))){
        cout<<2<<endl;
        cout<<b<<' '<<c;
        exit(0);
    }
    if(is_prime(c+b)){
        cout<<3<<endl;
        cout<<b<<' '<<c+b<<' '<<c;
        exit(0);
    }
    cout<<-1;
    return 0;
}
/*

*/

Subtask #1
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	메모리	Grader output
1	Correct	384 KB	Output is correct
2	Incorrect	384 KB	Output isn't correct
3	Halted	0 KB	-

Subtask #3
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	288 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

답안 #282708

Compilation message