블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/2526#include using namespace std;int N, P, tmp, cnt=1;int Arr[1001]; int main(){ cin >> N >> P; tmp = N; while(!Arr[tmp]){ Arr[tmp] = cnt++; tmp = tmp * N % P; } cout

[문제 링크] : https://www.acmicpc.net/problem/14935#include using namespace std;int main(){ cout

[문제 링크] : https://www.acmicpc.net/problem/5586#include #include using namespace std;int J, I;string S;int main(){ cin >> S; if(S.length() > 2){ for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/24078#include using namespace std;int main(){ int N; cin >> N; cout

[문제 링크] : https://www.acmicpc.net/problem/14659#include #include #include using namespace std;int N;int Arr[30001];vector V;int main(){ cin >> N; int inp; for(int i=0; i> inp; V.push_back(inp); } int Ans = -1; for(int i=0; iV[j]){ Arr[i]++; } else{ break; } } Ans = max(Arr[i], Ans); } cout

[문제 링크] : https://www.acmicpc.net/problem/27889#include using namespace std;int main(){ string S; cin >> S; if(S == "NLCS"){ cout

[문제 링크] : https://www.acmicpc.net/problem/11023#include #include using namespace std;int N;int Ans; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); while(cin >> N){ Ans += N; } cout

[문제 링크] : https://www.acmicpc.net/problem/11283#include #include using namespace std;int main(){ string S; cin >> S; int N = ((S[0] & 255) - 234) * 4096 + ((S[1] & 255) - 176) * 64 + (S[2] & 255) - 127; cout

[문제 링크] : https://www.acmicpc.net/problem/22193#include using namespace std;int N, M;char A[50000], B[50000];int Arr[100000];int main(){ cin >> N >> M >> A >> B; for(int i=0; i0; i--){ Arr[i-1] += Arr[i] / 10; Arr[i] %= 10; } bool flag = false; for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/11966#include using namespace std; int main(){ int N; cin >> N; if(N == 1){ cout