Submission #59921

---

Source Code Expand

#include<iostream>
#include<string>
#include<iomanip>
#include<cctype>
#include<vector>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<complex>
#include<deque>
#include<cmath>
#include<set>
using namespace std;
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define FORD(i,a,b) for(int i=(a); i>=(b); i--)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(), (a).end()
#define mp make_pair
#define pb push_back
#define pf push_front
typedef long long int ll;
typedef pair<int, int> pii;

int main(){

	int n,m;
	cin >> n >> m;
	int sum = 0;
	REP(i,n+1){
		sum += i*i;
	}
	int ans = sum%m;
	cout << ans <<endl;
}

Submission Info

Judge Result