Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Vishruth-S/CompetitiveCode
/ read
Function
read
Codeforces_problems/RockPaperScissors/solution.cpp:30–36 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
28
vector<int> a, b;
29
30
inline void read() {
31
cin >> n;
32
a.resize(3);
33
b.resize(3);
34
for (int i = 0; i < 3; i++) cin >> a[i];
35
for (int i = 0; i < 3; i++) cin >> b[i];
36
}
37
38
inline void solve() {
39
int ans1 = INT_MAX;
Callers
1
main
Function · 0.85
Calls
no outgoing calls
Tested by
no test coverage detected