Submission #1365957
Source Code Expand
//------------- //include //------------- #include <map> #include <set> #include <list> #include <cmath> #include <vector> #include <string> #include <cctype> #include <random> #include <cstdlib> #include <iostream> #include <algorithm> using namespace std; //------------- //typedef //------------- typedef long long LL; typedef vector<int> VI; typedef vector<string> VS; typedef pair<int, int> PII; typedef vector<int, int> VII; typedef map<string, int> MSI; //------------- //utillty //------------- #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define MK make_pair #define PB push_back #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()) //------------- //repetition //------------- #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //------------- //debug //------------- #define dump(x) cerr << #x << " = " << (x) << endl; #define dumpl(x) REP(i,SZ(x))cerr<<i<<x<<"="<<x[i]<<endl; #define SIZE(x) cout<<sizeof(x)<<endl; const int MOD = 1000000007; //------------- //cout //------------- #define COUTL(x) cout<<x<<endl #define COUT(x) cout<<x //------------- //宣言省略 //------------- #define INTIN(x) int x; cin>>x; #define INTINTIN(x,y) int x,y; cin>>x>>y; int main() { INTIN(S); COUTL(S%12+1); #ifdef _DEBUG while(1); #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 来月は何月? |
User | ayatakamaru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1524 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | test_1.txt, test_10.txt, test_11.txt, test_12.txt, test_2.txt, test_3.txt, test_4.txt, test_5.txt, test_6.txt, test_7.txt, test_8.txt, test_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
test_1.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_2.txt | AC | 1 ms | 256 KB |
test_3.txt | AC | 1 ms | 256 KB |
test_4.txt | AC | 1 ms | 256 KB |
test_5.txt | AC | 1 ms | 256 KB |
test_6.txt | AC | 1 ms | 256 KB |
test_7.txt | AC | 1 ms | 256 KB |
test_8.txt | AC | 1 ms | 256 KB |
test_9.txt | AC | 1 ms | 256 KB |