diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-25 16:03:32 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-25 16:03:32 +0200 |
| commit | 3728c124ca1488a113cf76c8efcd5d815327a437 (patch) | |
| tree | 47938b3c31980eb891be90c00f313a360b2ab333 /codeforces/DimaAndFriends | |
| parent | 66d5d77247012cbcd65ef6e8294bdb042198a5c2 (diff) | |
| download | competitive-programming-3728c124ca1488a113cf76c8efcd5d815327a437.tar.xz competitive-programming-3728c124ca1488a113cf76c8efcd5d815327a437.zip | |
Added some new problems
Diffstat (limited to 'codeforces/DimaAndFriends')
| -rwxr-xr-x | codeforces/DimaAndFriends/main | bin | 0 -> 22704 bytes | |||
| -rw-r--r-- | codeforces/DimaAndFriends/main.cpp | 50 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_input0.txt | 2 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_input1.txt | 2 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_input2.txt | 2 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_output0.txt | 1 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_output1.txt | 1 | ||||
| -rw-r--r-- | codeforces/DimaAndFriends/main_output2.txt | 1 |
8 files changed, 59 insertions, 0 deletions
diff --git a/codeforces/DimaAndFriends/main b/codeforces/DimaAndFriends/main Binary files differnew file mode 100755 index 0000000..28ffdf7 --- /dev/null +++ b/codeforces/DimaAndFriends/main diff --git a/codeforces/DimaAndFriends/main.cpp b/codeforces/DimaAndFriends/main.cpp new file mode 100644 index 0000000..245da01 --- /dev/null +++ b/codeforces/DimaAndFriends/main.cpp @@ -0,0 +1,50 @@ +#include<bits/stdc++.h> + +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define push_back pb +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +void solve() { + int n, sum = 0; + cin >> n; + for (int i = 0; i < n; i++) { + int x; + cin >> x; + sum += x; + } + cout << (sum % (n + 1)) % 5 << '\n'; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + solve(); +} + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ diff --git a/codeforces/DimaAndFriends/main_input0.txt b/codeforces/DimaAndFriends/main_input0.txt new file mode 100644 index 0000000..6ed281c --- /dev/null +++ b/codeforces/DimaAndFriends/main_input0.txt @@ -0,0 +1,2 @@ +1 +1 diff --git a/codeforces/DimaAndFriends/main_input1.txt b/codeforces/DimaAndFriends/main_input1.txt new file mode 100644 index 0000000..1191247 --- /dev/null +++ b/codeforces/DimaAndFriends/main_input1.txt @@ -0,0 +1,2 @@ +1 +2 diff --git a/codeforces/DimaAndFriends/main_input2.txt b/codeforces/DimaAndFriends/main_input2.txt new file mode 100644 index 0000000..a7189af --- /dev/null +++ b/codeforces/DimaAndFriends/main_input2.txt @@ -0,0 +1,2 @@ +2 +3 5 diff --git a/codeforces/DimaAndFriends/main_output0.txt b/codeforces/DimaAndFriends/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/DimaAndFriends/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/DimaAndFriends/main_output1.txt b/codeforces/DimaAndFriends/main_output1.txt new file mode 100644 index 0000000..0cfbf08 --- /dev/null +++ b/codeforces/DimaAndFriends/main_output1.txt @@ -0,0 +1 @@ +2 diff --git a/codeforces/DimaAndFriends/main_output2.txt b/codeforces/DimaAndFriends/main_output2.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/DimaAndFriends/main_output2.txt @@ -0,0 +1 @@ +3 |
