| Task: | Conjecture |
| Sender: | Pietari Kaskela |
| Submission time: | 2015-10-07 17:04:23 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | details |
| #2 | WRONG ANSWER | 0.06 s | details |
| #3 | WRONG ANSWER | 0.06 s | details |
| #4 | WRONG ANSWER | 0.06 s | details |
| #5 | WRONG ANSWER | 0.06 s | details |
| #6 | ACCEPTED | 0.05 s | details |
| #7 | ACCEPTED | 0.06 s | details |
| #8 | ACCEPTED | 0.05 s | details |
| #9 | ACCEPTED | 0.06 s | details |
| #10 | ACCEPTED | 0.05 s | details |
| #11 | ACCEPTED | 0.06 s | details |
| #12 | ACCEPTED | 0.05 s | details |
| #13 | ACCEPTED | 0.06 s | details |
| #14 | ACCEPTED | 0.05 s | details |
| #15 | ACCEPTED | 0.06 s | details |
| #16 | ACCEPTED | 0.06 s | details |
Code
#include <bits/stdc++.h>
#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int
#define pii pair<int, int>
#define pll pair<long long, long long>
#define defmod 1000000007
using namespace std;
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
if(n < 4){
cout << 4 << endl;
return 0;
}
for(int i = n+1;; i++){
if(i%3 != 0){
cout << i << endl;
return 0;
}
}
return 0;
}Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 0 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 4 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 1 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 4 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 2 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 4 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 3 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 4 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 4 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 5 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 7 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 7 |
| user output |
|---|
| 7 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 7 |
| correct output |
|---|
| 8 |
| user output |
|---|
| 8 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| 11 |
| user output |
|---|
| 11 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 4470203 |
| correct output |
|---|
| 4470205 |
| user output |
|---|
| 4470205 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 7015800 |
| correct output |
|---|
| 7015801 |
| user output |
|---|
| 7015801 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 1861609 |
| correct output |
|---|
| 1861610 |
| user output |
|---|
| 1861610 |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 4808744 |
| correct output |
|---|
| 4808746 |
| user output |
|---|
| 4808746 |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 10000000 |
| correct output |
|---|
| 10000001 |
| user output |
|---|
| 10000001 |
