Submission #1216709

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

#define FOR(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 RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

const int MOD = 1000000007;
const char ENDL = '\n';

inline int toInt(string s) {
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}

template <class T> inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}

#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \
       << " " << __FILE__ << endl;


int main(int argc, const char * argv[]) {
    ios::sync_with_stdio(false);
    std::cin.tie(0);
    int n,m,c=0;
    cin >> n >> m;
    FOR(i, 1, n+1){
        c+=i*i;
    }
    cout << c%m << ENDL;
    return 0;
}

Submission Info

Judge Result