Submission #4022347
Source Code Expand
#include <stdio.h> #include <cmath> #include <string> #include <vector> #include <algorithm> #include <string.h> using namespace std; typedef vector<int> VI; typedef vector<string> VS; //container util #define SORT(c) sort((c).begin(),(c).end()) //repetition #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) int main(void){ char s[6]; scanf("%s", s); int len = strlen(s); int n; scanf("%d", &n); int cnt = 0; REP(i,len){ REP(j,len){ if(cnt == n-1) printf("%c%c\n",s[i],s[j]); cnt++; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 25個の文字列 |
User | hntk03 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 606 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", s); ^ ./Main.cpp:31:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int n; scanf("%d", &n); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 1 ms | 128 KB |
sample-02.txt | AC | 1 ms | 128 KB |
sample-03.txt | AC | 1 ms | 128 KB |
test-01.txt | AC | 1 ms | 128 KB |
test-02.txt | AC | 1 ms | 128 KB |
test-03.txt | AC | 1 ms | 128 KB |
test-04.txt | AC | 1 ms | 128 KB |
test-05.txt | AC | 1 ms | 128 KB |
test-06.txt | AC | 1 ms | 128 KB |
test-07.txt | AC | 1 ms | 128 KB |
test-08.txt | AC | 1 ms | 128 KB |
test-09.txt | AC | 1 ms | 128 KB |
test-10.txt | AC | 1 ms | 128 KB |
test-11.txt | AC | 1 ms | 128 KB |
test-12.txt | AC | 1 ms | 128 KB |
test-13.txt | AC | 1 ms | 128 KB |
test-14.txt | AC | 1 ms | 128 KB |
test-15.txt | AC | 1 ms | 128 KB |
test-16.txt | AC | 1 ms | 128 KB |
test-17.txt | AC | 1 ms | 128 KB |
test-18.txt | AC | 1 ms | 128 KB |
test-19.txt | AC | 1 ms | 128 KB |
test-20.txt | AC | 1 ms | 128 KB |
test-21.txt | AC | 1 ms | 128 KB |
test-22.txt | AC | 1 ms | 128 KB |
test-23.txt | AC | 1 ms | 128 KB |
test-24.txt | AC | 1 ms | 128 KB |
test-25.txt | AC | 1 ms | 128 KB |
test-26.txt | AC | 1 ms | 128 KB |
test-27.txt | AC | 1 ms | 128 KB |
test-28.txt | AC | 1 ms | 128 KB |
test-29.txt | AC | 1 ms | 128 KB |
test-30.txt | AC | 1 ms | 128 KB |