Submission #59855

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<string>
#include<string.h>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<list>
#include<stack>
#include<functional>

using namespace std;

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<n;i++)

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

typedef pair<int ,int > P;

//stdin
//stdout


int main()
{
	int n,m;
	cin>>n>>m;

	ull sum=0;

	for (int i = 1; i <= n; i++)
	{
		sum+=i*i;
	}
	cout<<sum%m<<endl;


	return 0;
}

Submission Info

Judge Result