Submission #59865
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#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 <numeric>
#include <list>
#include <iomanip>
#include <fstream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
template <class T> void uniq(vector<T>& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
template <class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }
template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print(const T& c, const string& deli = " ", int br = 1) { foreach (it, c) { cout << *it; if (++it != c.end()) cout << deli;--it; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
void fix_precision(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
bool valid(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
typedef long long ll;
typedef pair<int, int> pint;
// y(v): v>^< y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
const double PI = acos(-1.0);
const int mod = ten(9) + 7;
int main()
{
ll n, m;
cin >> n >> m;
ll sum = 0;
for (int i = 1; i <= n; ++i)
sum += i * i;
ll res = sum % m;
cout << res << endl;
}
Submission Info
Submission Time |
|
Task |
A - 団子とうさぎ |
User |
takapt |
Language |
C++ (G++ 4.6.4) |
Score |
50 |
Code Size |
3247 Byte |
Status |
AC |
Exec Time |
22 ms |
Memory |
808 KB |
Judge Result
Set Name |
All |
Score / Max Score |
50 / 50 |
Status |
|
Set Name |
Test Cases |
All |
case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt |
Case Name |
Status |
Exec Time |
Memory |
case_000.txt |
AC |
18 ms |
792 KB |
case_001.txt |
AC |
20 ms |
696 KB |
case_002.txt |
AC |
19 ms |
792 KB |
case_003.txt |
AC |
20 ms |
792 KB |
case_004.txt |
AC |
22 ms |
808 KB |
case_005.txt |
AC |
20 ms |
696 KB |
case_006.txt |
AC |
20 ms |
792 KB |
case_007.txt |
AC |
19 ms |
796 KB |
case_008.txt |
AC |
20 ms |
784 KB |
case_009.txt |
AC |
19 ms |
792 KB |
case_010.txt |
AC |
18 ms |
684 KB |
case_011.txt |
AC |
19 ms |
796 KB |
case_012.txt |
AC |
19 ms |
700 KB |
case_013.txt |
AC |
20 ms |
792 KB |
case_014.txt |
AC |
19 ms |
792 KB |
case_015.txt |
AC |
19 ms |
796 KB |
case_016.txt |
AC |
20 ms |
796 KB |
case_017.txt |
AC |
20 ms |
800 KB |
case_018.txt |
AC |
19 ms |
788 KB |
case_019.txt |
AC |
19 ms |
780 KB |
case_020.txt |
AC |
19 ms |
796 KB |
case_021.txt |
AC |
19 ms |
788 KB |
case_022.txt |
AC |
20 ms |
692 KB |
case_023.txt |
AC |
19 ms |
788 KB |
case_024.txt |
AC |
19 ms |
788 KB |
case_025.txt |
AC |
19 ms |
788 KB |
case_026.txt |
AC |
19 ms |
792 KB |
case_027.txt |
AC |
19 ms |
796 KB |
case_028.txt |
AC |
19 ms |
792 KB |
case_029.txt |
AC |
19 ms |
792 KB |