Submission #59903
Source Code Expand
#include <bitset> #include <deque> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #include <algorithm> #include <functional> #include <iterator> #include <locale> #include <memory> #include <stdexcept> #include <utility> #include <string> #include <fstream> #include <ios> #include <iostream> #include <iosfwd> #include <iomanip> #include <istream> #include <ostream> #include <sstream> #include <streambuf> #include <complex> #include <numeric> #include <valarray> #include <exception> #include <limits> #include <new> #include <typeinfo> #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <climits> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdlib> #include <cstddef> #include <cstdarg> #include <ctime> #include <cstdio> #include <cstring> #include <cwchar> #include <cwctype> using namespace std; static const double EPS = 1e-8; static const double PI = 4.0 * atan(1.0); static const double PI2 = 8.0 * atan(1.0); typedef long long ll; typedef unsigned long long ull; #define ALL(c) (c).begin(), (c).end() #define CLEAR(v) memset(v,0,sizeof(v)) #define MP(a,b) make_pair((a),(b)) #define REP(i,n) for(int i=0;i<(int)n;++i) #define ABS(a) ((a)>0?(a):-(a)) template<class T> T MIN(const T& a, const T& b) { return a < b ? a : b; } template<class T> T MAX(const T& a, const T& b) { return a > b ? a : b; } template<class T> void MIN_UPDATE(T& a, const T& b) { if (a > b) a = b; } template<class T> void MAX_UPDATE(T& a, const T& b) { if (a < b) a = b; } int main() { std::ios::sync_with_stdio(false); int N, M; cin >> N >> M; int dango = 0; for (int n = 1; n <= N; ++n) { dango += n * n; } cout << dango % M << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 団子とうさぎ |
User | nodchip |
Language | C++ (GCC 4.4.7) |
Score | 50 |
Code Size | 1814 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 820 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 | 21 ms | 784 KB |
case_001.txt | AC | 20 ms | 784 KB |
case_002.txt | AC | 21 ms | 820 KB |
case_003.txt | AC | 21 ms | 792 KB |
case_004.txt | AC | 21 ms | 688 KB |
case_005.txt | AC | 22 ms | 704 KB |
case_006.txt | AC | 21 ms | 696 KB |
case_007.txt | AC | 20 ms | 796 KB |
case_008.txt | AC | 20 ms | 780 KB |
case_009.txt | AC | 20 ms | 788 KB |
case_010.txt | AC | 19 ms | 784 KB |
case_011.txt | AC | 20 ms | 684 KB |
case_012.txt | AC | 20 ms | 792 KB |
case_013.txt | AC | 21 ms | 796 KB |
case_014.txt | AC | 19 ms | 788 KB |
case_015.txt | AC | 21 ms | 788 KB |
case_016.txt | AC | 21 ms | 696 KB |
case_017.txt | AC | 20 ms | 780 KB |
case_018.txt | AC | 21 ms | 788 KB |
case_019.txt | AC | 19 ms | 788 KB |
case_020.txt | AC | 19 ms | 764 KB |
case_021.txt | AC | 19 ms | 788 KB |
case_022.txt | AC | 20 ms | 788 KB |
case_023.txt | AC | 20 ms | 780 KB |
case_024.txt | AC | 20 ms | 792 KB |
case_025.txt | AC | 20 ms | 660 KB |
case_026.txt | AC | 21 ms | 696 KB |
case_027.txt | AC | 20 ms | 796 KB |
case_028.txt | AC | 20 ms | 788 KB |
case_029.txt | AC | 20 ms | 688 KB |