1062D - Fun with Integers - CodeForces Solution


dfs and similar graphs implementation math *1800

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
long long n;
long long ans;
int main()
{
	cin>>n;
	for(int i=2;i<=n;i++)
		for(int j=i+i;j<=n;j+=i)
			ans+=j/i;
	cout<<ans*4;
	return 0;
}
	  			 						    			 			 					


Comments

Submit
0 Comments
More Questions

1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares