oj.uz

답안 #9175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9175 2014-09-28T04:21:15 Z kcm1700 Veni, vidi, vici (kriii2_V) C++14
1 / 4
 0 ms 1088 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

char line[1024];

int main(){
  int n;
  fgets(line, sizeof(line), stdin);
  sscanf(line,"%d",&n);
  fgets(line, sizeof(line), stdin);

  int sm = 0, cn = 0;
  for(int i = 0; line[i] != '\0'; i++) {
    if (line[i] == ' ' || line[i] == '\n' || line[i] == '\r') {
      if (line[i] == '\n' || line[i] == '\r') break;
      sm = 0;
      cn = 0;
      printf("%c", line[i]);
    } else {
      sm += line[i]-'a';
      cn++;
      if (cn == 2) {
        printf("%c", (sm+26-n)%26+'a');
        cn = sm = 0;
      }
    }
  }
  puts("");
  return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct
21 Correct 0 ms 1088 KB Output is correct
22 Correct 0 ms 1088 KB Output is correct
23 Correct 0 ms 1088 KB Output is correct
24 Correct 0 ms 1088 KB Output is correct
25 Correct 0 ms 1088 KB Output is correct
26 Correct 0 ms 1088 KB Output is correct

Subtask #2
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -