Editorial for !a002
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Author:
參考code
#include<bits/stdc++.h>
#define BigIanXD ios_base::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
#define int long long
using namespace std;
const int p = 1e9+7;
const int c = 1e6+10;
int pw(int a, int b) {
if(b == 0) return 1;
int tmp = pw(a, b>>1);
if(b&1) return (tmp*tmp%p)*a%p;
return tmp*tmp%p;
}
int f[c];
signed main()
{
BigIanXD
int k, n;cin >> k >> n;
cout << (100+n/10) << ' ' << (100+n/10) << ' ' << (8+n/10);
}
Comments