Submission #59861
Source Code Expand
//include //------------------------------------------ #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> #include <queue> #include <climits> using namespace std; //conversion //------------------------------------------ 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();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> P; typedef long long ll; //container util //------------------------------------------ #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()) #define fi first #define se second //定数 const int dx[] = {-1,1,0,0}; const int dy[] = {0,0,1,-1}; //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) FOR(i,0,n) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); //clear memory #define CLR(a) memset((a), 0 ,sizeof(a)) //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int n, m; int ans; int main(){ cin >> n >> m; for(int i = 1; i <= n; i++){ ans = (ans + (i * i)) % m; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 団子とうさぎ |
User | satashun |
Language | C++ (G++ 4.6.4) |
Score | 50 |
Code Size | 2198 Byte |
Status | AC |
Exec Time | 23 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 | 19 ms | 768 KB |
case_001.txt | AC | 23 ms | 692 KB |
case_002.txt | AC | 20 ms | 788 KB |
case_003.txt | AC | 21 ms | 788 KB |
case_004.txt | AC | 21 ms | 652 KB |
case_005.txt | AC | 21 ms | 816 KB |
case_006.txt | AC | 21 ms | 780 KB |
case_007.txt | AC | 18 ms | 788 KB |
case_008.txt | AC | 20 ms | 792 KB |
case_009.txt | AC | 19 ms | 792 KB |
case_010.txt | AC | 20 ms | 804 KB |
case_011.txt | AC | 19 ms | 784 KB |
case_012.txt | AC | 20 ms | 792 KB |
case_013.txt | AC | 21 ms | 788 KB |
case_014.txt | AC | 20 ms | 656 KB |
case_015.txt | AC | 18 ms | 788 KB |
case_016.txt | AC | 20 ms | 780 KB |
case_017.txt | AC | 21 ms | 788 KB |
case_018.txt | AC | 19 ms | 788 KB |
case_019.txt | AC | 18 ms | 820 KB |
case_020.txt | AC | 18 ms | 792 KB |
case_021.txt | AC | 20 ms | 788 KB |
case_022.txt | AC | 19 ms | 792 KB |
case_023.txt | AC | 20 ms | 696 KB |
case_024.txt | AC | 20 ms | 780 KB |
case_025.txt | AC | 18 ms | 784 KB |
case_026.txt | AC | 19 ms | 796 KB |
case_027.txt | AC | 19 ms | 808 KB |
case_028.txt | AC | 19 ms | 660 KB |
case_029.txt | AC | 19 ms | 788 KB |