알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.16
#include #include using namespace std; int score[80];int main(){ int n; cin >> n; while(n-->0){ string s; cin >> s; int ans=0; if(s[0]=='O') score[0]=1; else score[0]=0; ans=score[0]; for(int i=1; i
알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.14
//https://www.acmicpc.net/problem/2098 #include #define MAX 17000000using namespace std; int w[16][16];int dp[1N; for(int i=0; iw[i][j]; int ans = solve(0,0); cout
알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.12
#include using namespace std; int main(){ cin.tie(NULL); int N; cin >> N; for(int i=0; i> a>> b; cout
알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.11
#include using namespace std; int main(int argc, char** argv){int test_case;int T;cin>>T;for(test_case = 1; test_case > N; long long int S1, S2, S3; S1=N*(N+1)/2; S2=N*N; S3=S2+N; cout