Submission #59896

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define INF 1000000000 //10^9
#define MOD 1000000007 //10^9+7
#define REP(i,a,b) for(int i=a;i<b;i++)
#define QSORT(a) sort(a.begin(),a.end());

int main(){
    
    int N,M;
    cin>>N>>M;
    
    int k=0;
    
    for (int i=1; i<=N; i++) {
        k+=i*i;
    }
    
    cout<<k%M<<endl;
    return 0;
}

Submission Info

Judge Result