제출 #463484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
463484		Khizri	Toys (CEOI18_toy)	C++17	59 / 100	5022 ms	948 KiB

toy

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n;
set<ll>ans;
vector<ll>vt;
void funk(ll n,ll res){
	ans.insert((n-1)+(res));
	ll q=sqrt(n);
	for(ll i=0;i<vt.size()&&vt[i]<=q;i++){
		if(n%vt[i]==0){
			funk(n/vt[i],res+vt[i]-1);
		}
	}
}
void solve(){
	cin>>n;
	for(ll i=2;i<=sqrt(n);i++){
		if(n%i==0){
			vt.pb(i);
		}
	}
	funk(n,0);
	cout<<ans.size()<<endl;
	for(ll v:ans){
		cout<<v<<' ';
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

toy.cpp: In function 'void funk(long long int, long long int)':
toy.cpp:49:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for(ll i=0;i<vt.size()&&vt[i]<=q;i++){
      |             ~^~~~~~~~~~

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21