Submission #59923

---

Source Code Expand

// include {{{
#include <cstdio>
#include <iostream>
//#include <sstream>
#include <string>
#include <vector>
//#include <deque>
#include <stack>
#include <queue>
//#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <numeric>
//#include <complex>
// }}}
using namespace std;
// macro {{{
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define REP(i,j,k) for(int i=j;i<(k);++i)
//#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();++it)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define priority_queue_greater(T) priority_queue< T, vector<T>, greater<T> >
#define F first
#define S second
//test define...
#define D(x) #x<<"="<<(x)
#define CC <<" "<<
#define CE <<endl;
// }}}

int n,m;
int main(){
  while( cin >> n >> m ){
    int sum = 0;
    for(int i=1; i<=n; i++){ sum += i*i; }
    cout << ( sum % m ) << endl;
  }
  return 0;
}

Submission Info

Judge Result