Submission #953604
Source Code Expand
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <utility>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <fstream>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <ctime>
#include <stack>
#include <map>
#include <set>
#if __cplusplus > 199711L
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
// tree<key, mapped = null_type, cmp = less<key>, rb_tree_tag, tree_order_statistics_node_update> name;
// order_of_key
// find_by_order
#endif
using namespace std;
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fs first
#define sc second
#define abs(a) ((a) < 0 ? -(a) : (a))
#define sqr(a) ((a) * (a))
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
inline pair<pair<bool, bool>, pair<string, bool> > useinout();
void initialization() {
#ifdef SOL
if (useinout().fs.fs)
freopen("input.txt", "r", stdin);
if (useinout().fs.sc)
freopen("output.txt", "w", stdout);
#else
srand(time(0));
const string file = useinout().sc.fs;
if (!file.empty()) {
freopen((file + ".in").c_str(), "r", stdin);
freopen((file + ".out").c_str(), "w", stdout);
}
if(useinout().sc.sc) {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
#endif
}
int solve();
void finish(int exitval) {
fflush(stdout);
#ifdef SOL
fprintf(stderr, "\nexit value: %d\ntime: %.3lf ms\n", exitval, 1000. * clock() / CLOCKS_PER_SEC);
#endif
}
int main() {
initialization();
int exitval = solve();
finish(exitval);
return (0);
}
const double eps = 1e-9;
const int mod = (int) 1e+9 + 7;
const double pi = acos(-1.);
const int maxn = 100100;
int solve() {
int n;
scanf("%d\n", &n);
string s, t, r;
getline(cin, s);
getline(cin, t);
for (int i = 0; i <= n; i++) {
bool ok = 1;
for (int j = i; j < n; j++) {
if (s[j] != t[j - i]) {
ok = 0;
}
}
if (ok) {
for (int j = 0; j < i; j++) {
// printf("%c", s[j]);
r.pb(s[j]);
}
// printf("%s", t.c_str());
r.append(t);
printf("%d", (int) r.length());
return (0);
}
}
return (0);
}
inline pair<pair<bool, bool>, pair<string, bool> > useinout() {
return (mp(mp(0, 0), mp("", 0)));
}
// by Andrey Kim
Submission Info
Submission Time |
|
Task |
A - Prefix and Suffix |
User |
Akim |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
2493 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘void initialization()’:
./Main.cpp:57:46: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen((file + ".in").c_str(), "r", stdin);
^
./Main.cpp:58:48: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen((file + ".out").c_str(), "w", stdout);
^
./Main.cpp:61:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("input.txt", "r", stdin);
^
./Main.cpp:62:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("output.txt", "w", stdout);
...
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
3 ms |
256 KB |
0_01.txt |
AC |
3 ms |
256 KB |
0_02.txt |
AC |
3 ms |
256 KB |
1_00.txt |
AC |
3 ms |
256 KB |
1_01.txt |
AC |
3 ms |
256 KB |
1_02.txt |
AC |
3 ms |
256 KB |
1_03.txt |
AC |
3 ms |
256 KB |
1_04.txt |
AC |
3 ms |
256 KB |
1_05.txt |
AC |
3 ms |
256 KB |