Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int isPrime(int n)
- {
- if(n<2) return 0;
- for(int i=2; i*i<n; i++){
- if(n%i==0) return 0;
- }
- return 1;
- }
- void sieve(int n)
- {
- int arr[n] = {0};
- arr[1] = 1;
- for(int i=2; i<n; i++){
- if(arr[i]==0){
- for(int j=i+i; j<n; j=j+i){
- arr[j] = 1;
- }
- }
- }
- for (int i=1; i<n; i++){
- cout << i << " " << arr[i] << "\n";
- }
- }
- void sieveDivCount(int n)
- {
- int arr[n] = {0};
- for(int i=1; i<=n; i++){
- for(int j=i; j<n; j=j+i){
- arr[j]++;
- }
- }
- for (int i=1; i<n; i++){
- cout << i << " " << arr[i] << "\n";
- }
- }
- void sieveDivSum(int n)
- {
- int arr[n] = {0};
- for(int i=1; i<=n; i++){
- for(int j=i; j<n; j=j+i){
- arr[j]+=i;
- }
- }
- for (int i=1; i<n; i++){
- cout << i << " " << arr[i] << "\n";
- }
- }
- int main()
- {
- int a;
- cin>>a;
- sieveDivSum(a);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement