Submission #19556701
Source Code Expand
Copy
#include <iostream> #include <vector> using namespace std; vector<int> Kamienie(100000); int main() { int ilosc, AktualnaPozycja, wynik = 1000000009; cin >> ilosc >> AktualnaPozycja; for(int i = 0; i < ilosc; ++i) { cin >> Kamienie[i]; Kamienie[i] -= AktualnaPozycja; Kamienie[i] = abs(Kamienie[i]); if(Kamienie[i] < wynik) { wynik = Kamienie[i]; } } for(int i = 0; i < ilosc; ++i) { while(Kamienie[i]%wynik != 0) { Kamienie[i] %= wynik; wynik = Kamienie[i]; } } cout << wynik << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Skip |
User | grzes |
Language | C++ (Clang 10.0.0) |
Score | 300 |
Code Size | 689 Byte |
Status | AC |
Exec Time | 82 ms |
Memory | 3180 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 300 / 300 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | hand_1, large_1, large_2, large_3, large_4, large_5, large_6, large_7, large_8, max_1, max_2, max_3, min_1, min_2, sample_01, sample_02, sample_03, small_1, small_2, small_3, small_4, small_5 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand_1 | AC | 6 ms | 3004 KB |
large_1 | AC | 24 ms | 3180 KB |
large_2 | AC | 24 ms | 3144 KB |
large_3 | AC | 24 ms | 2996 KB |
large_4 | AC | 3 ms | 2996 KB |
large_5 | AC | 2 ms | 3156 KB |
large_6 | AC | 2 ms | 3132 KB |
large_7 | AC | 2 ms | 3096 KB |
large_8 | AC | 2 ms | 3052 KB |
max_1 | AC | 82 ms | 3008 KB |
max_2 | AC | 81 ms | 3004 KB |
max_3 | AC | 82 ms | 3008 KB |
min_1 | AC | 3 ms | 3136 KB |
min_2 | AC | 1 ms | 3136 KB |
sample_01 | AC | 2 ms | 3000 KB |
sample_02 | AC | 1 ms | 3132 KB |
sample_03 | AC | 2 ms | 3100 KB |
small_1 | AC | 2 ms | 3004 KB |
small_2 | AC | 2 ms | 3096 KB |
small_3 | AC | 2 ms | 3096 KB |
small_4 | AC | 2 ms | 3040 KB |
small_5 | AC | 3 ms | 3092 KB |