oj.uz

Submission #645676

# Submission time Handle Problem Language Result Execution time Memory
645676 2022-09-27T16:04:26 Z ElnuR_007 Chessboard (IZhO18_chessboard) C++14
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll n,m,k,cnt=2;
void anomalous_solve()
{
	cin>>n>>k;
	vector<ll>v;
	ll i=2;
	while(n!=1)
	{
		if(n%i==0)
		{
			v.push_back(i);
			n/=i;
		}
		else
		{
			i++;
		}
	}
	sort(v.begin(),v.end());
	n=v[v.size()-1];
	v.pop_back();
	cnt=(n*n)/2;
	k=1;
	for(auto it:v)
	{
		k*=it;
	}
	k*=k;
	cout<<k*cnt<<"\n";	
}
int main()
{
	//	freopen("INPUT.txt","r",stdin);
	//  freopen("OUTPUT.txt","w",stdout);
	
	ios_base::sync_with_stdio();
    cin.tie(NULL);
    cout.tie(NULL);
    
    ll test=1;
    //cin>>test;
    for(int pos=1;pos<=test;pos++)
    	anomalous_solve();
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -