Submission #1697459
Source Code Expand
#include <iostream> #include <iomanip> #include <vector> #include <valarray> #include <map> #include <set> #include <list> #include <queue> #include <stack> #include <bitset> #include <utility> #include <numeric> #include <algorithm> #include <functional> #include <complex> #include <string> #include <sstream> #include <cstdio> #include <cstdlib> #include <cctype> #include <cstring> #include <cmath> using namespace std; #define all(c) c.begin(),c.end() #define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++) #define debug(x) #x << "=" << (x) #define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl typedef long long ll; typedef vector<int> vi; template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec){ os << "["; for(int i = 0; i < vec.size(); i++){ os << vec[i] << ","; } os << "]"; return os; } template<typename T> T input(){ T t; cin >> t; return t; } template<typename T> vector<T> input(const int N){ vector<T> v(N); repeat(i,N) cin >> v[i]; return v; } long long gcd(long long a, long long b){ if(b == 0){ return a; } return gcd(b, a % b); } long long lcm(long long a, long long b){ return (a / gcd(a, b)) * b; } int main(){ int p1, p2, p3; vi points(3); vi rank(3); cin >> p1 >> p2 >> p3; points[0] = p1; points[1] = p2; points[2] = p3; rank[0] = p1; rank[1] = p2; rank[2] = p3; sort(rank.begin(), rank.end(), greater<int>()); repeat (i, 3) { repeat(j, 3) { if (rank[j] == points[i]) { cout << j + 1 << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 豆まき |
User | xeonics |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1677 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt |
All | subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 1 ms | 256 KB |
subtask0-sample02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |